Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
Evaluating MobySpace-based routing strategies in delay-tolerant networks: Research Articles
Wireless Communications & Mobile Computing - Wireless Ad Hoc and Sensor Networks
Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
RENA: region-based routing in intermittently connected mobile network
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Storage-enabled access points for improved mobile performance: an evaluation study
WWIC'11 Proceedings of the 9th IFIP TC 6 international conference on Wired/wireless internet communications
The evolution of a DTN routing protocol - PRoPHETv2
CHANTS '11 Proceedings of the 6th ACM workshop on Challenged networks
An analysis of evaluation practices for DTN routing protocols
Proceedings of the seventh ACM international workshop on Challenged networks
Twitter in disaster mode: opportunistic communication and distribution of sensor data in emergencies
Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition
| Hi-index | 0.00 |
Numerous routing protocols have been proposed for Delay Tolerant Networking. One class of routing protocols aims at optimizing the delivery performance by using knowledge of previous encounters for forecasting the future contacts to determine suitable next hops for a given packet. Protocols pursuing such an approach face a fundamental challenge of choosing the right protocol parameters and the right time scale for estimation. These, in turn, depend on the mobility characteristics of the mobile nodes which are likely to vary within one scenario and across different ones. We characterise this issue, which has been overlooked in this field so far, using PROPHET and MaxPROP as two representative routing protocols and derive mechanisms to dynamically and independently determine routing parameters in mobile nodes.