Communication in disconnected ad hoc networks using message relay
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Using redundancy to cope with failures in a delay tolerant network
Proceedings of the 2005 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
DTN routing in a mobility pattern space
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Delay Tolerant Networking - Bundle Protocol Simulation
SMC-IT '06 Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology
Integrating DTN and MANET routing
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
DTLSR: delay tolerant routing for developing regions
Proceedings of the 2007 workshop on Networked systems for developing regions
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In the last few years research activity in delay/disruption tolerant networks (DTN) is growing and researchers have proposed various types of routing protocols. Those efforts formulate DTN to become the adequate solution for the challenged network environment. DTN architecture provides good performance in the intermittently connected Mobile ad hoc networks (MANET). Routing in DTN architecture is the key challenge because of the nature of MANET environment where the network is an opportunistic connected and topology is changing rapidly. In this article we analyze the performance of DTN-based routing protocols including our routing approach, History of Encounters Probabilistic Routing Algorithm (HEPRA) in terms of different aspects. We select well-known DTN routing protocols in our evaluation to demonstrate how those protocols act comparing to our approach, HEPRA. We continue developing our algorithm, HEPRA, to provide a detailed analytical as well as simulation-based study. Using simulation we considered in our analysis various factors such as number of nodes, buffer size, speed of nodes, time to live (TTL), movement models and transmission range.