Transient Community Detection and Its Application to Data Forwarding in Delay Tolerant Networks

Community detection has received considerable attention because of its applications to many practical problems in mobile networks. However, when considering temporal information associated with a community (i.e., transient community), most existing community detection methods fail due to their aggre...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE/ACM transactions on networking 2017-10, Vol.25 (5), p.2829-2843
Hauptverfasser: Zhang, Xiaomei, Cao, Guohong
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Community detection has received considerable attention because of its applications to many practical problems in mobile networks. However, when considering temporal information associated with a community (i.e., transient community), most existing community detection methods fail due to their aggregation of contact information into a single weighted or unweighted network. In this paper, we propose a contact-burst-based clustering method to detect transient communities by exploiting pairwise contact processes. In this method, we formulate each pairwise contact process as a regular appearance of contact bursts, during which most contacts between the pair of nodes happen. Based on this formulation, we detect transient communities by clustering the pairs of nodes with similar contact bursts. Since it is difficult to collect global contact information at individual nodes, we further propose a distributed method to detect transient communities. In addition to transient community detection, we also propose a new data forwarding strategy for delay tolerant networks, in which transient communities serve as the data forwarding unit. Evaluation results show that our strategy can achieve a much higher data delivery ratio than traditional community-based strategies with comparable network overhead.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2017.2708090