A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Embedded systems in the wild: ZebraNet software, hardware, and deployment experiences
Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Weak state routing for large scale dynamic networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Combining power management and power control in multihop IEEE 802.11 ad hoc networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
Performance modeling of DTN routing with heterogeneous and selfish nodes
Wireless Networks
| Hi-index | 0.00 |
Delay-Tolerant Network (DTN) nodes are mostly energy-limited devices that run on battery power. DTN routing strategies on such resource-constrained nodes therefore need to be energy efficient. Contemporary routing protocols such as Two-Hop Routing (2HR) and Epidemic Routing (ER) due to their conservative nature, use same forwarding strategy for all types of messages irrespective of their lifetime and delivery probability requirements. This inherently impacts the energy consumption via unwanted forwards. We propose a message-driven based algorithm add-on to the existing routing protocols, that enables intelligent forwards based on individual message lifetime and delivery requirements, thereby improving energy efficiency. Further we analytically model the performance of these protocols in a realistic DTN setting that comprises of nodes with different transmission radii. The results show that the routing protocols with the proposed energy-efficient add-on improves the energy efficiency up to 60% and 75% for the respective 2HR and ER protocols. The analysis is validated by extensive simulation results.