Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Graph Theory With Applications
Graph Theory With Applications
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
A tutorial on spectral clustering
Statistics and Computing
Distributed community detection in delay tolerant networks
Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
CPMC: an efficient proximity malware coping scheme in smartphone-based mobile networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Social-aware forwarding improves routing performance in pocket switched networks
ESA'11 Proceedings of the 19th European conference on Algorithms
FAN: friendship based anonymous routing in wireless social mobile networks of malicious communities
Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition
An Improved Routing Algorithm Based on Social Link Awareness in Delay Tolerant Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
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 intercommunity packet forwarding. Extensive real-trace-driven simulation results are presented to support the effectiveness of our scheme.