A density-aware routing scheme in delay tolerant networks

Authors:
Chih-Lin Hu;Bing-Jung Hsieh
Affiliations:
National Central University, Taoyuan, Taiwan, R.O.C.;National Central University, Taoyuan, Taiwan, R.O.C.
Venue:
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Year:
2012

Citing 9
Cited 0

The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
Probabilistic routing in intermittently connected networks

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
Performance analysis of mobility-assisted routing

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
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
The ONE simulator for DTN protocol evaluation

Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Adaptive Randomized Epidemic Routing for Disruption Tolerant Networks

MSN '09 Proceedings of the 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks
Replication routing in DTNs: a resource allocation approach

IEEE/ACM Transactions on Networking (TON)
Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper designs a density-aware routing scheme for message delivery services in delay-tolerant networks that are characterized by tight constrains on intermittent connectivity, available storage and internode throughput in mobile ad hoc networks. This scheme includes inter-meeting time measure, node density estimation in proximity, boundary area detection, and message forwarding mechanisms. Mobile nodes can sense node density in their vicinities, and decide how to exchange messages with any encountered nodes during their movements. This scheme is scalable regardless of node population and need no extra localization facility. Simulation results show that the proposed scheme is simple and of less complexity, achieving comparable effects in terms of message delivery ratio and communication costs under nonuniform node distributions in delay-tolerant networks.