Abstract
DTNs (Delay Tolerant Networks)refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay, improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor nodes) routing algorithm to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in the network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be achieved. In order to verify the proposed algorithm, DTN simulator is designed by using ONE simulator. According to the result of the simulation, the suggested algorithm can reduce average delay and unnecessary message generation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chang, D., Shim, Y., Kim, G., Choi, N., Ryu, J., Kwon, T., Choi, Y.: Mobility Information based Routing for Delay and Disruption Tolerant Network. Journal of Information Science, Telecommunications 36(2) (April 2009)
Park, Y., Lee, C., Lee, M., Chang, D., Cho, K., Kwon, T., Choi, Y.: BBR: Bearing Based Routing for Delay and Disruption Tolerant Nwtwork. In: Korea Institute of Communication Proceedings (November 2008)
So, S.H., Park, M.K., Park, S.C., Lee, J.Y., Kim, B.C., Kim, D.Y., Shin, M.S., Chang, D.I., Lee, H.J.: Delay Tolerant Network Routing Algorithm based on the Mobility Pattern of Mobile Nodes. Journal of Electronic Engineering 46, TC No. 4 (April 2009)
DTNRG. A Delay-Tolerant Networking Research Group, http://www.dtnrg.org/
Harras, K., Almeroth, K.: Transport Layer Issues in Delay Tolerant Mobile Networks. In: IFIP Networking Conference, Coimbra, PORTUGAL (May 2006)
Vahdat, A., Becker, D.: Epidemic Routing for Paritally-Connected Ad Hoc Networks. Technical Report CS-2000-06, Duke University (July 2000)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. In: SIGCOMM 2005 (2005)
The ONE, The Opportunistic Network Enviornment simulator, http://www.netlab.tkk.fi/tutkimus/dtn/theone
Keränen, A., Ott, J., Kärkkäinen, T.: The ONE Simulator for DTN Protocol Evaluation. In: 2nd International Conference on Simulation Tools and Techniques, SIMUTools 2009, Rome (March 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seo, DO., Kim, GH., Lee, DH. (2011). LCN: Largest Common Neighbor Nodes Based Routing for Delay and Disruption Tolerant Mobile Networks. In: Kim, Th., Adeli, H., Robles, R.J., Balitanas, M. (eds) Advanced Communication and Networking. ACN 2011. Communications in Computer and Information Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23312-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-23312-8_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23311-1
Online ISBN: 978-3-642-23312-8
eBook Packages: Computer ScienceComputer Science (R0)