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
Access and mobility of wireless PDA users
ACM SIGMOBILE Mobile Computing and Communications Review
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
MANET Protocol for Information Gathering from Disaster Victims
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Prioritized epidemic routing for opportunistic networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Utility-Based Distributed Routing in Intermittently Connected Networks
ICPP '08 Proceedings of the 2008 37th International Conference on Parallel Processing
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Military inter-vehicle communication with message priority using IEEE 802.11e
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
IEEE Communications Magazine
SEDUM: Exploiting Social Networks in Utility--Based Distributed Routing for DTNs
IEEE Transactions on Computers
| Hi-index | 0.00 |
Delay Tolerant Networks (DTNs) use the "Store-Carry-then-Forward" approach to deliver the message to the destinations. It relies on the intermittent link that occurs when two nodes contact with each other due to mobility. In this paper, we propose a three-phase algorithm (SFMS: Spray and Forwarding scheme with Message Scheduling) that integrates the concepts of flooding-based and forwarding-based protocols, and considers message priority. The idea of SFMS is to periodically predict the contact popularity and contact association among nodes, such that we can determine the fast message spraying and efficient forwarding strategy. Furthermore, we propose a message scheduling mechanism to enhance the resource allocation. Simulation results show that our scheme has a better performance for delivering message. Besides, it also achieves a differential delivery performance for different priorities of message while maintaining a better resource allocation.