Spread and Erase: Efficient Routing Algorithm Based on Anti-Message Info Relay Hubs for Delay Tolerant Networks

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 131)

Abstract

Absence of end-to-end connectivity of nodes in Delay Tolerant Networks (DTNs) posses a challenge towards designing an efficient routing protocol for these networks. In DTNs with nodes having unlimited buffer sizes, Epidemic routing [16] provides an optimal solution in terms of message delivery ratio and message latency but it suffers with disadvantage of large message overhead ratio. Epidemic routing with Vaccination system (EVS) proposed by [18] improves the problem of message overhead ratio in epidemic routing by immunizing the system from duplicate message copies. We compared EVS with other routing techniques in terms of message overhead where multiple sources communicating with a single destination and observed that it performs better. In this paper we propose a routing algorithm that further minimizes the message overhead ratio of EVS and improves in both message delivery ratio and message latency. In DTNs, special nodes called Message Ferry and Data Mule have been proposed to carry data from a source node to a destination node. We propose in this paper special node called anti-message Info relay hub to erase duplicate message copies instead of routing. We compare our algorithm with EVS and social grouping based algorithm [2] for social as well as non-social scenarios and show using simulation results that our routing algorithm ‘Spread and Erase with anti-message Info relay hubs’ outperforms in both scenarios.

Keywords

Padma 

References

  1. 1.
    Anantraman VKV, Mikkelsen T, Ohno L (2002) Handheld computers for rural healthcare, experiences in a large scale implementation. In: Proceedings of development by designGoogle Scholar
  2. 2.
    Cabaniss R, Madria S, Rush G, Trotta A, Vulli SS (2010) Dynamic social grouping based routing in a mobile ad-hoc network. In: IEEE international conference on mobile data managementGoogle Scholar
  3. 3.
    Daly EM, Haahr M (2007) Social network analysis for routing in disconnected delay-tolerant manets. In: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, MobiHoc ’07, pp 32–40Google Scholar
  4. 4.
    Gu Y, Bozdag D, Ekici E, Ozguner F, Lee CG (2005) Partitioning based mobile element scheduling in wireless sensor networks. In: Proceedings of the 2nd annual IEEE conference on sensor and ad hoc communications and networksGoogle Scholar
  5. 5.
    Hui P, Crowcroft J, Yoneki E (2008) Bubble rap: socialbased forwarding in delay tolerant networks. In: Proceedings of MobiHocGoogle Scholar
  6. 6.
    Jain S, Fall K, Patra R (2004) Routing in a delay tolerant network. SIGCOMM Comput Commun 34:145–158CrossRefGoogle Scholar
  7. 7.
    Lindgren A, Doria A, Schelen O (2003) Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Comput Commun Rev 7:19–20Google Scholar
  8. 8.
    Mundur P, Seligman M, Lee G (2008) Epidemic routing with immunity in delay tolerant networks. In: Military communications conference, pp 1–7Google Scholar
  9. 9.
    Pentland AS, Fletcher R, Hasson A (2004) Daknet: rethinking connectivity in developing nations. Computer 37:78–83Google Scholar
  10. 10.
    Scott J, Gass R, Crowcroft J, Hui P, Diot C, Chaintreau A (2006) CRAWDAD trace http://www.cambridge/haggle/imote/infocom (v. 2006–01-31)
  11. 11.
    Shah RC, Roy S, Jain S, Brunette W (2003) Data mules: modeling a three-tier architecture for sparse sensor networks. In: Proceedings of the first IEEE international workshop on sensor network protocols and applicationsGoogle Scholar
  12. 12.
    Small T, Haas Z (2003) The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way). In: Proceedings of the 4th ACM international symposium on mobile ad hoc networking & computing, MobiHoc ’03Google Scholar
  13. 13.
    Spyropoulos T, Psounis K, Raghavendra CS (2004) Single-copy routing in intermittently connected mobile network. In: Proceedings of IEEE SeconGoogle Scholar
  14. 14.
    Spyropoulos T, Psounis K, Raghavendra CS (2005) Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking, WDTN ’05, pp 252–259Google Scholar
  15. 15.
    Tariq MMB, Ammar M, Zegura E (2006) Message ferry route design for sparse ad hoc networks with mobile nodes. In: ACM MobiHoc 06Google Scholar
  16. 16.
    Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks. In: Technical report CS-200006 Duke UniversityGoogle Scholar
  17. 17.
    Wang Y, Wu H (2007) Delay/fault-tolerant mobile sensor network (dftmsn): a new paradigm for pervasive information gathering. IEEE Trans Mobile Comput 6:1021–1034Google Scholar
  18. 18.
    Zhang X, Neglia G, Kurose J, Towsley D (2007) Performance modeling of epidemic routing. Comput Netw 51:2867–2891 (Elsevier)Google Scholar
  19. 19.
    Zhao W, Ammar, M, Zegura, E (2004) A message ferrying approach for data delivery in sparse mobile ad hoc networks. In: Proceedings of the 5th ACM international symposium on mobile ad hoc networking and computing, MobiHoc ’04 (2004)Google Scholar
  20. 20.
    Zhao W, Ammar M, Zegura E (2005) Controlling the mobility of multiple data transport ferries in a delay-tolerant network. In: INFOCOMGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Institute of Informatics and CommunicationUniversity of Delhi South CampusDelhiIndia

Personalised recommendations