Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Analysis of Creido Enhanced Chord Overlay Protocol Under Different Movement Models in Delay Tolerant Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Delay Tolerant Network (DTN) is an enlivening area to delve in owing to its rudimentary characteristics like intermittent links, variable delays etc. and its physiognomies of applications wherever traditional networks like sparse and emergency mobile ad-hoc networks fails. These applications are aided extensively if the performance metrics are recuperated. In this article a novel plot to increase the end to end bundle delivery ratio by assimilating CREIDO bundles in chord overlay network. This periodic bundle invokes the stabilize function of chord overlay protocol to make the overlay topology robust during node join and exits. In this article, OverSim framework of OMNeT++ is used under different mobility models to analyse the performance metrics of CREIDO bundles. Thus the results obtained were encouraging and outsourced the existing protocol in aspects of Bundle Delivery Ratio and throughput.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Raj, V. S., & Chezhian, R. M. (2013). Delay-disruption tolerant networks, its network characteristics and core applications. International Journal of Computer Science and Mobile Computing, 2(9), 256–262.

    Google Scholar 

  2. Xian, Y., Huang, C. T., & Cobb, J. (October 2010). Look-ahead routing and message scheduling in delay-tolerant networks. In IEEE 35th conference local computer networks (LCN), pp. 40–47.

  3. Zhang, Z. (2006). Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challenges. IEEE Communications Surveys and Tutorials, 8(1), 24–37.

    Article  Google Scholar 

  4. Pelusi, L., Passarella, A., & Conti, M. (2006). Opportunistic networking: Data forwarding in disconnected mobile ad hoc networks. IEEE Communications Magazine, 44(11), 134–141.

    Article  Google Scholar 

  5. Nichols, K., Lee Pitts, R., Gifford, K. K., Jenkins, A., & Kuzminsky, S. (April 2010). DTN implementation and utilization options on the international space station. In SpaceOps conference, Alabama, 25–30 Apr 2010. doi: 10.2514/6.2010-2173.

  6. Fall, Kevin, & Farrell, Stephen. (2008). DTN: An architectural retrospective. IEEE Journal on Selected Areas in Communication, 26(5), 826–836.

    Article  Google Scholar 

  7. Lua, E. K., Crowcroft, J., Pias, M., Sharma, R., & Lim, S. (2005). A survey and comparison of peer-to-peer overlay network and schemes. IEEE Communications Surveys and Tutorials, 7(2), 72–93.

    Article  Google Scholar 

  8. Bernhard, I., & Heep, B. (June 2010). dCBR: A global view on network coordinates for more efficient peer-to-peer systems. In International conference on ubiquitous and future networks (ICUFN), Jeju Island, South Korea, pp. 372–377.

  9. Klemm, F., Ecole polytech Fed. de Lausanne, Girdzijauskas, S., Le Boudec, J. Y., & Aberer, K. (September 2007). On routing in distributed hash tables. In Seventh IEEE international conference peer-to-peer computing, Ireland, 2–5 Sep 2007, pp. 113–122.

  10. Akyildiz, I., Su, Y. S. W., & Cayirci, E. (2002). Wireless sensor networks: A survey. Computer Networks, 38, 393–422.

    Article  Google Scholar 

  11. Mayer, C. P. (2011). Hybrid routing in delay tolerant networks. Karlsruhe: KIT Scientific Publishing.

    Google Scholar 

  12. Maenpaa, E., & Camarillo, G. (May 2009). Study on maintenance operations in a chord-based peer-to-peer session initiation protocol overlay network. In IEEE international symposium on parallel & distributed processing, Rome, 23–29 May 2009, pp. 1–9.

  13. Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., Balakrishnan, H. (August 2001). Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM conference on applications, technologies, architectures, and protocols for computer communications (sig- comm), San Diego, CA, pp. 149–160.

  14. Zhang, S., Wang, B., Wei, G., & Zhou, Y. (October 2011). AF-Chord: An improved Chord model based adjusted finger table. In 4th IEEE international conference on broadband network and multimedia technology (IC-BNMT), Shenzhen, 28–30 Oct 2011, pp. 335–338.

  15. Dabek, F., Brunskill, E., Kaashoek, M. F., Karger, D., Morris, R., Stoica, I., & Balakrishnan, H. (May 2001). Building peer-to-peer systems with chord, a distributed lookup service. In Proceedings of the eighth workshop on hot topics in operating systems, 20–22 May 2001, pp. 81–86.

  16. Ktari, S., Zoubert, M., Hecker, A., & Labiod, H. (2007). Performance evaluation of replication strategies in DHTs under churn. In Proceedings of the 6th international conference on mobile and ubiquitous multimedia, ACM, pp. 90–97.

  17. Knežević, P., Wombacher, A., & Risse, T. (2009). DHT-based self-adapting replication protocol for achieving high data availability. In E. Damiani, K. Yetongnon, R. Chbeir & A. Dipanda (Eds.), Advanced internet based systems and applications (pp. 201–210). Berlin: Springer.

    Google Scholar 

  18. Chen, D., Tan, Z., Chang, G., & Wang, X. (2009). An improvement to the Chord-based P2P routing algorithm. In Semantics, knowledge and grid, 2009. SKG 2009. Fifth international conference on, IEEE, pp. 266–269.

  19. Chunling, C., Xu, Y., & Xiaolong, X. (2010). Advanced chord routing algorithm based on redundant information replaced and objective resource table. In Computer science and information technology (ICCSIT), 2010 3rd IEEE international conference on, IEEE, Vol. 6, pp. 247–250.

  20. Yan, H., Jiang, Y., & Zhou, X. (2008). A bidirectional chord system based on Base-k finger table. In Computer science and computational technology, 2008. ISCSCT’08. international symposium on, IEEE, Vol. 1, pp. 384–388.

  21. Wu, D., Tian, Y., & Ng, K. W. (2007). An analytical study on optimizing the lookup performance of distributed hash table systems under churn. Concurrency and Computation: Practice and Experience, 19(4), 543–569.

    Article  Google Scholar 

  22. Dijkstra, E. W. (1982). Self-stabilization in spite of distributed control. In Selected writings on computing: A personal perspective (pp. 41–46). New York: Springer.

  23. Clouser, T., Nesterenko, M., & Scheideler, C. (2008). Tiara: A self-stabilizing deterministic skip list. In S. Kulkarni & A. Schiper (Eds.), Stabilization, safety, and security of distributed systems (pp. 124–140). Berlin: Springer.

    Chapter  Google Scholar 

  24. Alima, L. O., Haridi, S., Ghodsi, A., El-Ansary, S., & Brand, P. (2004). Position paper: Self-properties in distributed k-ary structured overlay networks. In Proceedings of SELF-STAR: International workshop on self-properties in complex information systems, Vol. 3460.

  25. Janson, T., Mahlmann, P., & Schindelhauer, C. (2010). A self-stabilizing locality-aware peer-to-peer network combining random networks, search trees, and dhts. In Parallel and distributed systems (ICPADS), 2010 IEEE 16th international conference on, IEEE, pp. 123–130.

  26. Onus, M., Richa, A. W., & Scheideler, C. (2007). Linearization: Locally self-stabilizing sorting in graphs. ALENEX, 7, 99–108.

    Google Scholar 

  27. Richa, A., Scheideler, C., & Stevens, P. (2011). Self-stabilizing de Bruijn networks. In X. Défago, F. Petit & V. Villain (Eds.), Stabilization, safety, and security of distributed systems (pp. 416–430). Berlin: Springer.

    Chapter  Google Scholar 

  28. Kniesburges, S., Koutsopoulos, A., & Scheideler C. (2011). Re-chord: A self-stabilizing chord overlay network. In Proceedings of the twenty-third annual ACM symposium on parallelism in algorithms and architectures, ACM, pp. 235–244.

  29. Hong, F., Li, M., Lu, X., Yu, J., Wang, Y., & Li, Y. (2004). HP-Chord: A peer-to-peer overlay to achieve better routing efficiency by exploiting heterogeneity and proximity. In H. Jin, Y. Pan, N. Xiao & J. Sun (Eds.), Grid and cooperative computing-GCC 2004 (pp. 626–633). Berlin: Springer.

    Chapter  Google Scholar 

  30. Liben-Nowell, D. Balakrishnan, H. & Karger, D. R. (July 2002). Analysis of the evolution of peer-to-peer systems. In Proceedings of the twenty-first annual symposium on principles of distributed computing, Monterey, CA, pp. 233–242.

  31. Zhuge, H., Chen, X., Sun, X., & Yao, E. & HRing, E. (February 2008). A structured P2P overlay based on harmonic series. IEEE Transactions on Parallel and Distributed Systems, 19(2), 145–158.

  32. Adam, C., & Stadler, R. (April 2004). Patterns and routing for self stabilization. In 9th IEEE/IFIP network operations and management symposium, pp. 61–74.

  33. Balasubramanian, A. Levine, B. N., & Venkataramani, A. (April 2010). Replication routing in DTNs: A resource allocation approach. IEEE/ACM Transactions on Networking, 18(2), 596–609.

  34. Karger, D., Lehman, E., Leighton, F., Levine, M., Lewin, D., & Panigrahy, R. (May 1997). Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In 29th annual ACM symposium on theory of computing, El Paso, TX, USA, May 4–6 1997, pp. 654–663.

  35. Baumgart, I., Heep, B., & Krause, S. (May 2007). OverSim: A flexible overlay network simulation framework. In Proceedings of 10th IEEE global internet symposium (GI ‘07) in conjunction with IEEE INFOCOM 2007, USA, pp. 79–84.

  36. Varga, A., Hornig, R. (2008). An overview of the OMNeT ++ simulation environment. In Proceedings of the 1st international conference on simulation tools and techniques for communications, networks and systems & workshops, Belgium, 2008, pp. 1–10.

  37. Abdel-Kader, T. Design and performance analysis of opportunistic routing protocols for delay tolerant networks. https://uwspace.uwaterloo.ca/bitstream/handle/10012/6864/Abdel-Kader_tamer.pdf.

  38. Grossglauser, M., & Tse, D. N. C. (2002 August). Mobility increases the capacity of ad hoc wireless networks. In IEEE/ACM transactions on networking, Vol. 10, No. 4.

  39. Sanchez, M., & Manzoni, P. (2001). Anejos: A java based simulator for ad-hoc networks. Future Generation Computer Systems, 17(5), 573–583.

    Article  Google Scholar 

  40. Davies, V. (2000). Evaluating mobility models within an ad hoc network. Master’s thesis, Colorado School of Mines.

  41. Bai, F., & Helmy, A. A survey of mobility models in wireless ad hoc networks. http://www.cise.ufl.edu/~helmy/papers/Survey-Mobility-Chapter-1.pdf.

  42. Camp, T., Boleng, J., Davies, V. (2002 August). A survey of mobility models for ad hoc network research. Wireless Communications and Mobile Computing, 2(5), 483–502.

  43. Haas, Z. (1997 October). A new routing protocol for reconfigurable wireless networks. In Proceedings of the IEEE international conference on universal personal communications (ICUPC), pp. 562–565.

Download references

Author information

Authors and Affiliations

  1. Department of ECE, RVS College of Engineering and Technology, Coimbatore, India

    M. Umaparvathi

  2. Department of Information Technology, SSN College of Engineering, Chennai, Tamil Nadu, 603 110, India

    N. Bhalaji

  3. Department of Computer Science and Engineering, SRM University, Chennai, 603203, India

    S. Jothi Prasanna

  4. VIT University, Chennai, 600 127, India

    N. Parthiban

Authors
  1. M. Umaparvathi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Bhalaji
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Jothi Prasanna
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. N. Parthiban
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Umaparvathi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Umaparvathi, M., Bhalaji, N., Jothi Prasanna, S. et al. Analysis of Creido Enhanced Chord Overlay Protocol Under Different Movement Models in Delay Tolerant Networks. Wireless Pers Commun 90, 985–1001 (2016). https://doi.org/10.1007/s11277-016-3277-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-016-3277-x

Keywords

Search

Navigation