Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Designing mobility models based on social network theory
ACM SIGMOBILE Mobile Computing and Communications Review
The diameter of opportunistic mobile networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Characterizing pairwise inter-contact patterns in delay tolerant networks
Proceedings of the 1st international conference on Autonomic computing and communication systems
Routing in socially selfish delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Characterising aggregate inter-contact times in heterogeneous opportunistic networks
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
IEEE Transactions on Mobile Computing
Density-Aware Routing in Highly Dynamic DTNs: The RollerNet Case
IEEE Transactions on Mobile Computing
Fine-grained intercontact characterization in disruption-tolerant networks
ISCC '11 Proceedings of the 2011 IEEE Symposium on Computers and Communications
Examining vicinity dynamics in opportunistic networks
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
| Hi-index | 0.00 |
We relax the traditional definition of contact and intercontact times by bringing the notion of vicinity into the game. We propose to analyze disruption-tolerant networks (DTN) under the assumption that nodes are in k-contact when they remain within a few hops from each other and in k-intercontact otherwise (where k is the maximum number of hops characterizing the vicinity). We make interesting observations when analyzing several real-world and synthetic mobility traces. We detect a number of unexpected behaviors when analyzing k-contact distributions; in particular, we observe that in some datasets the average k-contact time decreases as we increase k. In fact, we observe that many nodes spend a non-negligible amount of time in each other's vicinity without coming into direct contact. We also show that a small k (typically between 3 and 4) is sufficient to capture most communication opportunities.