Shaochang Chen
School of Electronic Engineering, Naval University of Engineering, Wuhan, 430033, China
Ming Yin
School of Electronic Engineering, Naval University of Engineering, Wuhan, 430033, China
ABSTRACT
A delay-tolerant network is a network designed so that temporary or intermittent communication problems and limitations have the least possible adverse impact. One major issue should be considered to enhance the performance of data delivery in such challenging networking environments: A routing strategy for the network. The routing strategy determines which message should be forwarded when nodes meet. This study proposes an enhanced routing scheme which is using the technique of History of Encounters Probabilistic Routing Novel Scheme: HEPRNS. The experimental results show that HEPRNS have better results over the history of encounters probabilistic routing novel schemes such overhead and latency in terms of increasing the number of nodes and shortest the path map based movement, which is compared with the other schemes such as Epidemic, PRoPHET, Spray and Wait, MaxProp.
PDF References Citation
How to cite this article
Shaochang Chen and Ming Yin, 2013. A History of Encounters Probabilistic Routing Novel Scheme in Delay Tolerant
Networking. Information Technology Journal, 12: 6980-6985.
DOI: 10.3923/itj.2013.6980.6985
URL: https://scialert.net/abstract/?doi=itj.2013.6980.6985
DOI: 10.3923/itj.2013.6980.6985
URL: https://scialert.net/abstract/?doi=itj.2013.6980.6985
REFERENCES
- Balasubramanian, A., B.N. Levine and A. Venkataramani, 2007. DTN routing as a resource allocation problem. Proceedings of the Conference on Applications Technologies Architectures and Protocols for Computer Communications, October 4, 2007, NY., USA., pp: 373-384.
CrossRef - Haas, Z.J. and M.R. Pearlman, 2001. The performance of query control schemes for the zone routing protocol. IEEE/ACM Trans. Network, 9: 427-438.
CrossRefDirect Link - Burgess, J., B. Gallagher, D. Jensen and B.N. Levine, 2006. Maxprop: Routing for vehicle-based disruption-tolerant networks. Proceedings of the International Conference on Computer Communications, April 23-29, 2006, Barcelona, Spain, pp: 1-11.
CrossRefDirect Link - Spyropoulos, T., K. Psounis and C.S. Raghavendra, 2007. Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. Proceedings of the 5th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, March 19-23, 2007, White Plains, New York, pp: 79-85.
CrossRef - Spyropoulos, T., K. Psounis and C.S. Ragavendra, 2008. Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Trans. Network, 16: 77-90.
CrossRefDirect Link - Spyropoulos, T., K. Psounis and C.S. Raghavendra, 2005. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, August 22-26, 2005, Philadelphia, PA., USA., pp: 252-259.
Direct Link - Zheng, Q., X. Hong, P. Wang, L. Tang and J. Liu, 2008. Delay management in delay-tolerant networks. Int. J. Network Manage., 18: 521-537.
CrossRefDirect Link