Open Access Open Access  Restricted Access Subscription or Fee Access

LAROD-LoDiS - An Efficient Routing Algorithm for Intermittently Connected Mobile Ad Hoc Networks (IC-MANETs)

S. Monicka

Abstract


Mobile Ad Hoc Network (MANET) environments in which nodes are characterized by opportunistic connectivity are referred to as Intermittently Connected Mobile Ad Hoc Network (IC-MANETs). It is a form of Delay Tolerant Network (DTN). High Latency applications such as disaster scenario, military operations, wildlife tracking and etc., falls into this category. Routing is one of the major components significantly affecting the overall performance of IC-MANETs in terms of Resource Consumption, Delivery Rate and Latency. The Traditional routing protocols such as AODV, DSR and etc fail in the case of IC-MANET due to its sparse nature and no end to end connectivity between the nodes. Over the past few years a number of routing protocols have been proposed. This work proposes a geographical routing algorithm called location-aware routing for delay-tolerant networks (LAROD), enhanced with a location service, location dissemination service (LoDiS), which together are shown to suit an IC-MANET. LAROD uses a beaconless strategy combined with a position-based routing for forwarding the packets resulting in less overhead. LoDiS maintains a local database of node locations, which is updated using broadcast gossip combined with routing overhearing. LAROD-LoDiS is implemented and evaluated in Opportunistic Network Environment (ONE) simulator. Performance of LAROD-LoDiS is compared with SPRAY & WAIT exiting routing algorithm.

Keywords


DTN, Location Services, MANET, Routing Protocols.

Full Text:

PDF

References


T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and Wait :An Efficient Routing Scheme for Intermittently Connected Mobile Networks” in Proc. ACMSIGCOMM Workshop Delay – Tolerant Networks, 2005, pp. 252-253. doi: 10.1145/1080139.1080143

W. K. Lai, W. K. Chung, J. B. Tsai, and C. S. Shieh, “Spray and Hop: Efficient Utility–Mobility Routing for Intermittently Connected Mobile Networks” in Proceeding of International Conference on Communication and Networking, Chinacom, 2009. Doi: 10.1109/CHINACOM.2009.5339732.

E. J. Jebajothi, V. Kavitha, and T. Kavitha, “Contention Based Routing in Mobile Ad Hoc Networks with Multiple Copies,” in International Journal of Engineering and Technology, vol. 2, 2010, pp. 93-96.

K. Shi, “Semi-Probabilistic Routing in Intermittently Connected Mobile Ad-Hoc Networks” in Journal of Info. Science and Engg, vol. 26, 2010, pp. 1677-1693.

T. Spyropoulos, K. Psounis, and C. Ragavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case,” IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 77-90, Feb.2008. Doi: 10.1109/TNET.2007.897964

T. Spyropoulos, K. Psounis, and C. S. Ragavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case,” IEEE/ACM Transactions on Networking, vol. 16, no. 1, pp. 63–76, Feb. 2008. Doi: 10.1109/TNET.20070897962

Z. Li, and H. Shen, “A Direction Based Geographic Routing Scheme for Intermittently Connected Mobile Networks,” in IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, 2008, pp. 359-365. Doi: 10.1109/EUC.2008.159,

R. R. Choudhury, “Brownian gossip: Exploiting Node Mobility to Diffuse Information in Ad Hoc Networks,” in Proc. Int. Conf. Collaborative Computer.: Netw, Appl. Work sharing, 2005, pp. 1-5. doi:10.1109/COLCOM.1651262

M. Heissenbüttel, T. Braun, T. Bernoulli, and M. Wälchi, “BLR: Beaconless Routing Algorithm for Mobile Ad Hoc Networks”, Computer Communications, vol. 27, no. 11, pp. 1076-1088, July 2004. doi: 10.1016/j.comcom.2004.01.012.

Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks,” Duke Univ., Duhram, NC, TecH.Rep. CS-2000-06, 2000.

D. Cokuslu, K. Erciyes, “A Flooding based Routing Algorithm for Mobile Ad Hoc Networks,” in IEEE 16th. Int. Conf. SIU 2008, pp. 1-5.

KERÄNEN, A. Opportunistic Network Environment Simulator. Special Assignment report, Helsinki University of Technology, Department of Communications and Networking, May 2008.

Project page of the ONE simulator. http://www.netlab.tkk.fi/tutkimus/dtn/theone, 2008.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.