Distributed community detection in delay tolerant networks

Hui, Pan; Yoneki, Eiko; Chan, Shu Yan; Crowcroft, Jon

doi:10.1145/1366919.1366929

Cited by 301 publications

(241 citation statements)

References 26 publications

Supporting

Mentioning

239

Contrasting

Unclassified

Order By: Relevance

“…Several social network metrics, which are measured based on nodes' direct or indirect observed encounters, are used to guide the packet forwarding in [4]. In [5], [13], Hui et al analyze the community structure from mobility traces and use them for forwarding algorithms, showing a significant improvement in forwarding efficiency. However, with a limited number of hops of local information, neither the community detection nor the weighted network analysis presented in [5], [13] can be used, which restricts the practicality of the methods.…”

Section: A Social Network Analysis In Dtnsmentioning

confidence: 99%

“…In [5], [13], Hui et al analyze the community structure from mobility traces and use them for forwarding algorithms, showing a significant improvement in forwarding efficiency. However, with a limited number of hops of local information, neither the community detection nor the weighted network analysis presented in [5], [13] can be used, which restricts the practicality of the methods. In this paper, the LocalCom scheme only needs limited local information to form communities, and achieves comparable forwarding efficiency.…”

Section: A Social Network Analysis In Dtnsmentioning

confidence: 99%

See 1 more Smart Citation

LocalCom: A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks

2009

2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

142

104

View full text Add to dashboard Cite

Abstract-In disruption-tolerant networks (DTNs), network topology constantly changes and end-to-end paths can hardly be sustained. However, social network properties are observed in many DTNs and tend to be stable over time. To utilize the social network properties to facilitate packet forwarding, we present LocalCom, a community-based epidemic forwarding scheme that efficiently detects the community structure using limited local information and improves the forwarding efficiency based on the community structure. We define similarity metrics according to nodes' encounter history to depict the neighboring relationship between each pair of nodes. A distributed algorithm, which only utilizes local information, is then applied to detect communities and the formed communities have strong intra-community connections. We also present two schemes to first select and then prune gateways that connect communities to control redundancy and facilitate efficient inter-community packet forwarding. Extensive real-trace-driven simulation results are presented to support the effectiveness of our scheme.

show abstract

Section: A Social Network Analysis In Dtnsmentioning

confidence: 99%

Section: A Social Network Analysis In Dtnsmentioning

confidence: 99%

LocalCom: A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks

2009

2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

142

104

View full text Add to dashboard Cite

show abstract

“…A new member is added to the local community of a node as soon as its total contact duration with that node exceeds a familiarity threshold [33]. Centrality estimation is done by counting the number of unique encounters a node has within a time window [33].…”

Section: Bubble Routingmentioning

confidence: 99%

Routing in Opportunistic Networks

Woungang¹,

Dhurandher²,

Anpalagan³

et al. 2013

View full text Add to dashboard Cite

Opportunistic networking is employed in scenarios where end-to-end communication paths between nodes cannot be assumed due to continuously changing network topology. In these networks, data is routed in a "store-carry-forward" fashion by exploiting the transient communication opportunities that arise when mobile nodes equipped with short-range wireless interfaces come within each other's transmission range. Designing efficient routing schemes for opportunistic networks is challenging as they face a trade-off between delivery performance and resource consumption. In this thesis, we propose a novel opportunistic routing algorithm that addresses this trade-off by incorporating information about the node contact pattern in the network. Aggregating contact events into a weighted graph enables us to detect communities and learn about the neighbourhoods of nodes. This information is utilized by our algorithm to assess the usefulness of every forwarding opportunity that arises. Performance evaluation of the proposed algorithm shows that it is capable of achieving good delivery performance while consuming significantly fewer resources in comparison to the existing opportunistic routing algorithms.ii Sommaire Le réseautage opportuniste est utilisé dans les scénarios où l'existence de routes de communication entre agents ne peut pasêtre présumé dûà l'altération constante de la topologie du réseau. Dans ces réseaux, l'information est acheminée grâceà une procédure de "sauvegarde-report" qui exploite les opportunités de communication transitoires qui ont lieu lorsque des agentséquippés d'interface sans-filà petite portée entrent dans leurs périmètres de portée respectifs.Établir des plans de communication efficaces dans le contexte de réseaux opportunistes est un défi puisque ceux-ci font faceà un compromis entre performance de livraison et consommation de ressources. Dans cette thèse, nous proposons un algorithme de routage opportuniste original qui addresse ce compromis en incorporant l'information liée aux contacts entre noeuds du réseau. Assembler lesévènements de contacts dans un graphe pondéré nous permet de détecter les communautés et d'apprendre le voisinage de chaque noeud. Cette information est utilisée par notre algorithme afin d'évaluer l'utilité de chaque opportunité de communication qui se présente. Une analyse de la performance de l'algorithme proposé montre qu'il est capable d'atteindre une bonne performance de livraison tout en consommant significativement moins de ressources lorsque comparé aux algorithmes de routage opportuniste actuels.iii

show abstract

“…According to [5], [17], the nodes within the MIT trace form different communities. Thus, we select two scenarios to study the impact of having publishers/subscribers coming from the same or different communities.…”

Section: Performance Comparison 1) Effectiveness Of Murismentioning

confidence: 99%

Incentive driven information sharing in delay tolerant mobile networks

Wang

Chuah

Chen

2012

2012 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Abstract-Mobile wireless devices (e.g., smartphones, PDAs, and notebooks) play important roles in our daily life, e.g., users often use such devices for bank transactions, keep in touch with friends. Users can also store such information and share with one another via opportunistic peer to peer links. However, peer to peer links are opportunistic links which are intermittent in nature and hence require the store-and-forward feature proposed in Delay Tolerant Networks to provide useful data sharing opportunities. Moreover, due to the limited resources, e.g., communication bandwidth and battery consumption, mobile devices can be selfish and may not be willing to forward data items to other devices that are interested in such items. Hence, effective data dissemination schemes need to be designed to encourage nodes to collaboratively share data. In this paper, we propose a Multi-Receiver IncentiveBased Dissemination (MuRIS) scheme that allows nodes to cooperatively deliver information of interest to one another via chosen delivery paths that utilize few transmissions. Our MuRIS scheme utilizes local historical path and tracks users' interests information maintained by each node. In addition, the charge and reward functions incorporated within our MuRIS scheme stimulate cooperation among nodes such that the nodes have no incentive to launch edge insertion attacks. Furthermore, our charge and reward functions are designed such that the chosen delivery paths mimic efficient multicast tree that results in fewest delivery hops. Extensive simulation studies using real human contact-based mobility traces show that our MuRIS scheme outperforms existing methods in terms of delivery ratio and transmission efficiency.

show abstract

Distributed community detection in delay tolerant networks

Cited by 301 publications

References 26 publications

LocalCom: A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks

LocalCom: A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks

Routing in Opportunistic Networks

Incentive driven information sharing in delay tolerant mobile networks

Contact Info

Product

Resources

About