Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
A community based mobility model for ad hoc network research
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Opportunistic content distribution in an urban setting
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
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
Designing mobility models based on social network theory
ACM SIGMOBILE Mobile Computing and Communications Review
Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model
WIMOB '06 Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
The diameter of opportunistic mobile networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Power Law and Exponential Decay of Intercontact Times between Mobile Devices
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
One of the main challenges in social-aware disconnected mobile networks is how to effectively forward messages in the highly dynamic evolving topology. Most of the previous work rarely considers real traces of the mobile users, and consequently their proposed forwarding schemes cannot work efficiently in real scenarios. In this paper, we systematically analyze the node contact pattern based on the datasets collected from real experiments to study how the messages are delivered from end to end. We find that both the global encounter occurrence and the contact frequency exhibit unique power-law distributions, which implies apparent spatial dependencies among nodes, and the network connectivity greatly depends on some rarely occurring contacts. Using Time Evolving Graph, we analyze the Minimum Delay Paths (MDPs) for each node pair and find that the average length of a MDP is relatively small, even with a large number of nodes in the networks, which indicates that node cliques are inherently organized into a hierarchy structure as our human society is, and some rare encounters have a significant impact on the average length of the MDP and the message delivery delay.