The week's pick
Random Articles
Reseach Article
Implementation and Analysis of Density based Location Aware Routing in Intermittently Connected MANETs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 149 - Number 8 |
| Year of Publication: 2016 |
| Authors: Anushruti Soni, Chandani Saxena |
10.5120/ijca2016911520
|
Anushruti Soni, Chandani Saxena . Implementation and Analysis of Density based Location Aware Routing in Intermittently Connected MANETs. International Journal of Computer Applications. 149, 8 ( Sep 2016), 5-9. DOI=10.5120/ijca2016911520
Abstract
Mobile Ad-Hoc Networks (MANETS)[7] are an emerging technology that allows establishing instant communication infrastructures for civilian and military applications. An Intermittently Connected Mobile Ad hoc Networks (IC-MANET)[4] operates in environments where the nodes do not form a completely connected network. Existing geographical routing protocol like location-aware routing for delay-tolerant networks (LAROD)[1,3] enhanced with a location service has shown to work well in IC-MANET. But the challenge here is to design a routing protocol to handle intermittently connectivity and dense/sparse topologies and also the performance of this geographical routing protocol degrades with varying network node densities such as sparse and dense topologies. For sparse systems, distribution of location information will probably be very slow. For dense systems, the transfer of location data may start to consume too much bandwidth locally at the dense areas. In this work, we propose a density based geographical routing algorithm called density based location-aware routing for delay tolerant networks (D-LAROD). D-LAROD calculates the density of the network based on location of the neighboring nodes information that counter for every route update that is performed at the time of route discovery process. The D-LAROD scheme is compared with the existing LAROD protocol[1] and is shown to have a competitive edge, both in terms of delivery ratio and overhead.
References
- E. Kuiper and S. Nadjm-Tehrani, “Geographical routing in intermittently connected ad hoc networks,” in Proc. 1st IEEE Int.Workshop Opportunistic Netw., 2008, pp. 1690–1695.
- T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and wait: An efficient routing scheme for intermittently connected mobile networks,” in Proc. ACM SIGCOMM Workshop Delay-Tolerant Netw., 2005, pp. 252-259.
- T. Camp, J. Boleng, and L. Wilcox, “Location information services in mobile ad hoc networks,” in Proc. IEEE Int. Conf. Commun., 2002, pp. 3318–3324.
- R. R. Choudhury, “Brownian gossip: Exploiting node mobility to diffuse information in ad hoc networks,” in Proc. Int. Conf. Collaborative Comput.: Netw., Appl. Worksharing, 2005, pp. 1–5.
- F. Warthman, Delay-Tolerant Networks (DTNs): A Tutorial v1.1. Warthman Assoc., Mar. 2003. [Online] Available:http://www.dtnrg.org/docs/tutorials/warthman1.1.df
- S. M. Das, H. Pucha, and Y. C. Hu, “Performance comparison of scalable location services for geographic ad hoc routing,” in Proc. IEEE 24th Annu.Joint Conf. IEEE Comput.Commun.Soc., 2005, pp. 1228– 1239.
- V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, and H.Weiss, Delay-tolerant networking architecture. RFC 4838.[Online]. Available: ftp://ftp.rfc-editor.org/in-notes/rfc4838.txt.
- R. Bruno and M. Nurchis, “Survey on diversity-based routing in wireless mesh networks: Challenges and solutions,” Comput. Commun., vol. 33, no. 3, pp. 269–282, Feb. 2010.
- C.E. Perkins, E.M. Royer,“Ad-hoc On-Demand Distance Vector Routing”, WMCSA-1999, IEEE.
- Abolhasan, M., T. Wysocki, E., Dutkiewicz, (2004),“A review of routing protocols for mobile Ad-Hoc networks”, Ad-Hoc Networks, 2: pp. 1-22.
Index Terms
Keywords