International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 4, No. 12, 8 Nov. 2012
Cover page and Table of Contents: PDF (size: 264KB)
Need of Removing Delivered Message Replica from Delay Tolerant Network - A Problem Definition
Full Text (PDF, 264KB), PP.59-64
Views: 0 Downloads: 0
Author(s)
Index Terms
Delay Tolerant Network, MaxProp, Epidemic, Spray and Wait, Prophet, Delay
Abstract
Recent wireless networks observe number of deployments in various conditions where they come across different intensities of link disconnection. On the basis of extent of the operating circumstances these networks are termed as Intermittently Connected Networks (ICNs). The prevailing TCP/IP protocol cannot be operational in ICNs thus providing number of new stimulating problems that are appealing the focus of the researchers. The multi-copy routing schemes achieve higher delivery probability as compared to the single copy routing scheme. This improvement is achieved at the cost of higher resource utilization i.e. multi-copy routing protocols requires more buffer space, more bandwidth, incur more overheads and consume other vital network resources. Contribution of this work is the deletion of useless replicas of the messages which are already delivered to the intended destination. We evaluate our proposed method by simulation, on four major DTNs routing algorithms: Epidemic, Spray and Wait, ProPHET and MaxProp.
Cite This Paper
Harminder Singh Bindra, A L Sangal, "Need of Removing Delivered Message Replica from Delay Tolerant Network - A Problem Definition", International Journal of Computer Network and Information Security(IJCNIS), vol.4, no.12, pp.59-64, 2012. DOI:10.5815/ijcnis.2012.12.06
Reference
[1]M. Khabbaz, C. Assi, and W. Fawaz, "Disruption-Tolerant Networking: A Comprehensive Survey on Recent Developments and Persisting Challenges," Communications Surveys & Tutorials, IEEE, vol. PP, no. 99, pp. 1-34, 2011.
[2]E. Bulut, "OPPORTUNISTIC ROUTING ALGORITHMS IN DELAY TOLERANT NETWORKS," COMPUTER SCIENCE, Rensselaer Polytechnic Institute, New York, 2011.
[3]T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and wait: an efficient routing scheme for intermittently connected mobile networks," in Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, Philadelphia, Pennsylvania, USA, 2005, pp. 252-259.
[4]H. Ochiai, and H. Esaki, "Mobility entropy and message routing in community-structured delay tolerant networks," in Proceedings of the 4th Asian Conference on Internet Engineering, Pratunam, Bangkok, Thailand, 2008.
[5]A. Krifa, C. Baraka, and T. Spyropoulos, "Optimal Buffer Management Policies for Delay Tolerant Networks." pp. 260-268.
[6]A. Vahdat, and D. Becker, "Epidemic Routing for Partially Connected Ad Hoc Networks," 2000.
[7]A. Lindgren, A. Doria, and O. Schel, "Probabilistic routing in intermittently connected networks," SIGMOBILE Mob. Comput. Commun. Rev., vol. 7, no. 3, pp. 19-20, 2003.
[8]J. Burgess, B. Gallagher, D. Jensen et al., "MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks." pp. 1-11.
[9]Q. Li, and D. Rus, "Sending messages to mobile users in disconnected ad-hoc wireless networks," in Proceedings of the 6th annual international conference on Mobile computing and networking, Boston, Massachusetts, United States, 2000.
[10]A. Kernen, J. Ott, and T. Kinen, "The ONE simulator for DTN protocol evaluation," in Proceedings of the 2nd International Conference on Simulation Tools and Techniques, Rome, Italy, 2009, pp. 1-10.