A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
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
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Performance analysis of mobility-assisted routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
Utility-Based Distributed Routing in Intermittently Connected Networks
ICPP '08 Proceedings of the 2008 37th International Conference on Parallel Processing
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
This paper introduces a multi-copy routing protocol, called Self Adaptive Routing Protocol (SARP), for intermittently connected mobile networks. SARP aims to exploring the possibility of taking nodes as carriers of messages to be delivered among network partitions. The choice of the best carrier for a message is made according to the prediction based on the history of nodal encounters. The paper will argue that the movement of the nodes and their possible future collocation with the recipient of the messages can be used to make intelligent message forwarding decisions. The proposed protocol has been implemented and compared to a number of existing encounter-based routing approaches, where a near-realistic mobility model is used for testing. The performance of the proposed technique is evaluated in terms of delivery delay and the number of transmissions performed. The results of the simulation show that the proposed technique outperforms all existing multi-copy encounter-based routing protocols.