Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A new networking model for biological applications of ad hoc sensor networks
IEEE/ACM Transactions on Networking (TON)
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
Characterizing pairwise inter-contact patterns in delay tolerant networks
Proceedings of the 1st international conference on Autonomic computing and communication systems
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Mobile call graphs: beyond power-law and lognormal distributions
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Multicasting in delay tolerant networks: a social network perspective
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Power Law and Exponential Decay of Intercontact Times between Mobile Devices
IEEE Transactions on Mobile Computing
On the levy-walk nature of human mobility
IEEE/ACM Transactions on Networking (TON)
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
Ego network models for Future Internet social networking environments
Computer Communications
| Hi-index | 0.00 |
Message delivery in opportunistic networks is substantially affected by the way nodes move. Given that messages are handed over from node to node upon encounter, the intermeeting time, i.e., the time between two consecutive contacts between the same pair of nodes, plays a fundamental role in the overall delay of messages. A desirable property of message delay is that its expectation is finite, so that the performance of the system can be predicted. Unfortunately, when intermeeting times feature a Pareto distribution, this property does not always hold. In this paper, assuming heterogeneous mobility and Pareto intermeeting times, we provide a detailed study of the conditions for the expectation of message delay to converge when social-oblivious forwarding schemes are used. More specifically, we consider different classes of social-oblivious schemes, based on the number of hops allowed, the number of copies generated, and whether the source and relay nodes keep track of the evolution of the forwarding process or not. Our main finding is that, as long as the convergence of the expected delay is concerned, allowing more than two hops does not provide any advantage. At the same time, we show that using a multi-copy scheme can, in some cases, improve the convergence of the expected delay.