Advertisement

LCN: Largest Common Neighbor Nodes Based Routing for Delay and Disruption Tolerant Mobile Networks

  • Doo-Ok Seo
  • Gwang-Hyun Kim
  • Dong-Ho Lee
Part of the Communications in Computer and Information Science book series (CCIS, volume 199)

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.

Keywords

Delay Tolerant Networks DTMNs Mobility Routing Protocol ONE simulator 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    DTNRG. A Delay-Tolerant Networking Research Group, http://www.dtnrg.org/
  5. 5.
    Harras, K., Almeroth, K.: Transport Layer Issues in Delay Tolerant Mobile Networks. In: IFIP Networking Conference, Coimbra, PORTUGAL (May 2006)Google Scholar
  6. 6.
    Vahdat, A., Becker, D.: Epidemic Routing for Paritally-Connected Ad Hoc Networks. Technical Report CS-2000-06, Duke University (July 2000)Google Scholar
  7. 7.
    Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. In: SIGCOMM 2005 (2005)Google Scholar
  8. 8.
    The ONE, The Opportunistic Network Enviornment simulator, http://www.netlab.tkk.fi/tutkimus/dtn/theone
  9. 9.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Doo-Ok Seo
    • 1
  • Gwang-Hyun Kim
    • 2
  • Dong-Ho Lee
    • 1
  1. 1.Dept. of Computer ScienceKwangwoon UniversitySeoulKorea
  2. 2.Dept. of Information CommunicationsGwangju UniversityGwangjuKorea

Personalised recommendations