Indian Journal of Science and Technology

Open Access Open Access  Restricted Access Subscription Access

A Novel Forwarding Scheme for Adaptive Anycasting in Delay/Disruption-Tolerant Networks


Affiliations
1 Bahria University, Islamabad, Pakistan
2 Beihang University of Aeronautics and Astronautics, Beijing, China
3 COMSATS Institute of Information Technology, Islamabad, Pakistan
 

Delay/disruption-tolerant networks (DTNs) are characterized by frequent and long duration partitions and end-to-end connectivity may never be present between the source and the destination at the message origination time. Anycast is an important service used for many applications in DTNs such as information exchange in hazards/crisis situation, resource discovery etc. In this paper, we propose classification of DTNs into three subcategories, namely: networks utilizing message ferries (MFN), interplanetary networks (IPN) and intermittently connected mobile Ad hoc networks (ICMAN). Further, we propose a novel anycasting scheme for ICMANs called receivers based forwarding (RBF), which considers the number of anycast receivers available through a link as well as the path length to the nearest receiver through that link in deciding the next hop while forwarding an anycast bundle. Simulation results with respect to link availability, group size and buffer size show that the RBF performs better than the shortest path forwarding (SPF) in term of data delivery ratio, average end-to-end delay and overall data efficiency.

Keywords

Delay-Tolerant Networks, Anycast, Routing
User

  • Burleigh S, Hooke A, Torgerson L, Fall K, Cerf V, Durst B, Scott K and Weiss H (2003) Delay-tolerant networking: An approach to interplanetary internet. IEEE Commun. Magazine. 41(6), 128-136.

  • Burns B, Brock O and Neil Levine B (2008) MORA routing and capacity building in disruption-tolerant networks. Ad hoc networks. 6(4), 600-620.

  • Chen Z, Kung H and Vlah D (2001) Ad hoc relay wireless networks over moving vehicles on highways. Proc. of the 2nd ACM int. symp. on mobile ad hoc networking & computing. pp:247-250.

  • Choudhury RR and Vaidya NH (2004) MAC layer anycasting in ad hoc networks. ACM SIGCOMM Computer Commun. Rev. 34(1), 75-80.

  • Davis J, Fagg A and Levine B (2001) Wearable computers and packet transport mechanisms in highly partitioned ad hoc networks. Proc. of the IEEE Int. Symp. on wearable computers (ISWC). pp:141-148.

  • Fall K (2003) A delay-tolerant network architecture for challenged internets. Proc. of the 2003 conference on applications, technologies, architectures and protocols for computer communications. pp:27-34.

  • Fall K (2004) Messaging in difficult environments, Intel research Berkeley, IRB-TR-04-019.

  • Gong Y, Xiong Y, Zhang Q, Zhang Z, Wang W and Xu Z (2006) Anycast routing in delay tolerant networks. Proc. IEEE Globecom. pp:1-5.

  • Hadi F, Shah N, Syed AH and Yasin M (2007) Adaptive anycast: A new anycast protocol for performance improvement in delay tolerant networks. Proc. IEEE ICIT. pp185-189.

  • Hadi F, Shah N, Syed AH and Yasin M (2007) Effect of group size on anycasting with receiver based forwarding in delay tolerant networks. Proc. IEEE ICEE. pp:1-4.

  • Hanna KM, Levine B and Manmatha R (2003) Mobile distributed information retrieval for highly-partitioned networks. Proc. of the 11th IEEE Int. Conf. on Network Protocols. pp:233-244.

  • Harras K and Almeroth K (2006) Transport layer issues in delay tolerant mobile networks. Proc. of the 5th Int. IFIPTC6 Networking Conf., Coimbra, Portugal, pp:463–475

  • Harras K, Wittie M, Almeroth K and Belding E (2007) A parallel network architecture for challenged networks. Proc. of the IEEE Workshop on Mobile Computing Systems & Applications. pp: 73-78

  • Jain S, K. Fall and Patra R (2004) Routing in a delay tolerant network. Proc. ACM Sigcomm. pp:252-259.

  • Johnson DB and Maltz DA (1996) Dynamic source routing in ad hoc wireless networks, mobile computing, Kluwer Academic Publ.

  • Juang H, Oki Y, Wang M, Martonosi L Peh and Rubenstei D (2002) Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. ACM SIGARCH Computer Arch. News. 39(5), 96-107.

  • Katabi D and Wroclawski J (2001) A framework for scalable global IP anycast (GIA). Proc. of the workshop on data communication in Latin America and the Caribbean, San Jose, Costa Rica. ACM SIGCOMM. pp:186-219.

  • Lindgren A (2006) Routing and quality of service in wireless and disruption tolerant networks. Ph.D Thesis, Lulea University of Technology.

  • Ming-Jun CCF, Liu-Sheng, Qun-Feng Dong, An Liu and Zhen-Guo Yang (2009) Leapfrog: Optimal opportunistic routing in probabilistically contacted delay-tolerant networks. J. Computer Sci. Technol. 24(5), 975-986.

  • Ogier RG, Fred L Templin and Mark G Lewis (2004) Topology dissemination based on reverse path forwarding, IETF RFC3684-Experimental Standard.

  • Park V and Macker J (1999) Anycast routing for mobile networking. Proc. IEEE MILCOM. pp:104-109.

  • Pelusi L, Passarella A and Conti M (2006) Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun. Magazine. 44, 11.

  • Peng G, Yang J and Gao C (2004) ARDSR: An anycast routing protocol for mobile ad hoc network. Proc. IEEE ISCAC. pp:505-509.

  • Pentland A, Fletcher R and Hasson (2004) DakNet: Rethinking connectivity in developing nations. Computer. 37(1), 78-83.

  • Romit Roy Choudhury and Nitin H. Vaidya (2004) MAClayer anycasting in ad hoc networks. ACM SIGCOMM Computer Communication Review. 34 (1).

  • Shah R, Roy S, Jain S and Brunette W (2003) Data MULEs: modeling and analysis of three-tier architecture for sparse sensor networks. Ad hoc Networks. 1(2-3), 215-233.

  • Small T and Haas Z (2003) The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way). Proc. of the 4th ACM int. symp. on mobile ad hoc networking & computing. pp:233-244.

  • Spyropoulos T, Psounis K and Raghavendra CS (2005) Spray and wait: An efficient routing scheme for intermittently connected mobile networks. Proc. ACM SIGCOMM. pp:252-259.

  • Wang J, Zheng Y and Jia W (2003) An AODV-based anycast protocol in mobile ad hoc network. Proc. IEEE PIMR, 8, 10-17

  • Xie Z, Wang J, Zheng Y and Chen S (2003) A novel anycast routing algorithm in MANET. Proc. IEEE PACRIM, 2, 505-508.

  • Ye Q, Cheng L, Chuah MC and Davison BD (2006) OSmulticast: On-demand situation-aware multicasting in disruption tolerant networks. Proc. IEEE VTC, Australia. pp:96-100.

  • Zegura E, Ammar M, Fei Z and Bhattachargee S (2000) Application-layer anycasting: A server selection architecture and use in a replicated Web service. IEEE/ACM Trans. on networking (TON). 8(4), 455-466.

  • Zhao W, Ammar M and Zegura E (2004) A message ferrying approach for data delivery in sparse mobile ad hoc networks. Proc. of the 5th ACM Intl. Symp. on Mobile Ad Hoc Networking and Computing. pp:187-198.


Abstract Views: 492

PDF Views: 107




  • A Novel Forwarding Scheme for Adaptive Anycasting in Delay/Disruption-Tolerant Networks

Abstract Views: 492  |  PDF Views: 107

Authors

Fazl-e-Hadi
Bahria University, Islamabad, Pakistan
Abid Ali Minhas
Bahria University, Islamabad, Pakistan
Nadir Shah
Beihang University of Aeronautics and Astronautics, Beijing, China
M. Yasin
COMSATS Institute of Information Technology, Islamabad, Pakistan

Abstract


Delay/disruption-tolerant networks (DTNs) are characterized by frequent and long duration partitions and end-to-end connectivity may never be present between the source and the destination at the message origination time. Anycast is an important service used for many applications in DTNs such as information exchange in hazards/crisis situation, resource discovery etc. In this paper, we propose classification of DTNs into three subcategories, namely: networks utilizing message ferries (MFN), interplanetary networks (IPN) and intermittently connected mobile Ad hoc networks (ICMAN). Further, we propose a novel anycasting scheme for ICMANs called receivers based forwarding (RBF), which considers the number of anycast receivers available through a link as well as the path length to the nearest receiver through that link in deciding the next hop while forwarding an anycast bundle. Simulation results with respect to link availability, group size and buffer size show that the RBF performs better than the shortest path forwarding (SPF) in term of data delivery ratio, average end-to-end delay and overall data efficiency.

Keywords


Delay-Tolerant Networks, Anycast, Routing

References





DOI: https://doi.org/10.17485/ijst%2F2010%2Fv3i12%2F29853