The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Connectivity and inference problems for temporal networks
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
The changing usage of a mature campus-wide wireless network
Proceedings of the 10th annual international conference on Mobile computing and networking
Message ferry route design for sparse ad hoc networks with mobile nodes
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A framework for community identification in dynamic social networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Diversity of forwarding paths in pocket switched networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
The diameter of opportunistic mobile networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Are you moved by your social network application?
Proceedings of the first workshop on Online social networks
Comparison of MANET routing protocols using a scaled indoor wireless grid
Mobile Networks and Applications
MobiClique: middleware for mobile social networking
Proceedings of the 2nd ACM workshop on Online social networks
A prsimonious model of mobile partitioned networks with clustering
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Peoplerank: social opportunistic forwarding
INFOCOM'10 Proceedings of the 29th conference on Information communications
Know thy neighbor: towards optimal mapping of contacts to social graphs for DTN routing
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the Relevance of Social Information to Opportunistic Forwarding
MASCOTS '10 Proceedings of the 2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
IEEE Transactions on Mobile Computing
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.24 |
The fundamental challenge in opportunistic networking is when and how to forward a message. Rank-based forwarding, one of the most promising methods for addressing this challenge, ranks nodes based on their social profiles or contact history in order to identify the most suitable forwarders. While these forwarding techniques have demonstrated great performance trends, we observe that they fail to efficiently forward messages in large scale networks. In this paper, we demonstrate using real mobility traces, the weakness of existing rank-based forwarding algorithms in large scale communities. We propose strategies for partitioning large communities into sub-communities based on geographic locality or social interests. We also propose exploiting particular nodes, named MultiHomed nodes, in order to disseminate messages across these sub-communities. We introduce CAF, a Community Aware Forwarding framework, which is designed to be integrated with state-of-the-art rank-based forwarding algorithms, in order to improve their performance in large scale networks. We use real mobility traces to evaluate our proposed techniques. Our results empirically show a delivery success rate increase of up to 40%, along with 5% to 30% improved success delivery rates compared to state-of-the-art rank-based forwarding algorithms; these results are obtained while incurring a marginal increase in cost which is less than 10%. We finally propose an extension of the original framework called Community Destination Aware Framework (CDAF). Assuming that the source node can determine the destination's community, CDAF further reduces the cost of CAF by a factor of 2 while maintaining similar success rates.