Efficient Geographical Routing with Location Service in Intermittently Connected MANETs

  IJCTT-book-cover
 
International Journal of Computer Trends and Technology (IJCTT)          
 
© 2019 by IJCTT Journal
Volume-67 Issue-11
Year of Publication : 2019
Authors : Nishat Fatima, Dr.Asma Parveen
  10.14445/22312803/IJCTT-V67I11P117

MLA

MLA Style:Nishat Fatima, Dr.Asma Parveen "Efficient Geographical Routing with Location Service in Intermittently Connected MANETs" International Journal of Computer Trends and Technology 67.11 (2019):99-103.

APA Style Nishat Fatima, Dr.Asma Parveen. Efficient Geographical Routing with Location Service in Intermittently Connected MANETs  International Journal of Computer Trends and Technology, 67(11),99-103.

Abstract
The enormous number of applications peer assisted wireless communication and combining mobile platforms such as manned and unmanned vehicles is an enabler for an enormous amount of applications. A main enabler for the applications is the routing protocol that guides the packets in network. Generally, assumptions on full connectivity is not valid for routing packets in fully connected mobile as hoc networks(MANETs) has been studied in a real time system. In network structure routing protocol must lever alternating connection and end to end connections. Proposed new algorithm termed geographical routing algorithm named “location aware routing for delay tolerant (LAROD), improved along with location service, location dissemination service(LoDis)”, both these suit an intermittently connected MANET.Here, partial knowledge of geographical position “location dissemination takes time in IC-MANETs LAROD is planned to route packets”. To accomplish little overhead, a beaconless approach joined with a position based resolution of bids when forwarding packets used by LAROD. Which is simplified with the support of broadcast conversation united with routing eavesdropping. This algorithm ix examined under real time environment application i.e. unmanned aerial vehicles deployed in a reconnaissance scenario with the help of low level packet simulator-2. The main objective is to sound design selections in an accurate application with holistic selections in routing location management and the mobility model. The complete approach defends together important and possible excellent if continuing a local database of node locations. The LAROD-LoDis system is associated with important delaytolerant routing algorithm and is presented to have a competitive edge both in terms of delivery ratio an overhead. For spray and wait competitive edge both in expressions of delivery proportion an above. This case convoluted a fresh Packet-level implementation in ns-2 different to the original connection level custom simulator for spray and wait.

Reference
[1] A. Lindgren and P. Hui, ―The quest for a killer app for opportunistic and delay-tolerant networks,‖ in Proc. 4th ACM Workshop Challenged Netw., 2009, pp. 59–66.
[2] N. Aschenbruck, E. Gerhards-Padilla, and P. Martini, ―Modeling mobility in disaster area scenarios,‖ Perform. Eval., vol. 66, no. 12, pp. 773–790, Dec. 2009.
[3] M. Asplund and S. Nadjm-Tehrani, ―A partition-tolerant manycast algorithm for disaster area networks,‖ in Proc. 28th Int. Symp. Reliable Distrib. Syst., 2009, pp. 156–165.
[4] M. B. Donley and N. A. Schwartz, United States Air Force Unmanned Aircraft Systems Flight Plan 2009–2047, 2009. [5] E. Kuiper and S. Nadjm-Tehrani, ―Mobility models for UAV group reconnaissance applications,‖ in Proc. Int. Conf. Wireless Mobile Commun., 2006, p. 33.
[6] F. Warthman, Delay-Tolerant Networks (DTNs): A Tutorial v1.1.Warthman Assoc., Mar. 2003. [Online]. Available.
[7] P.-C. Cheng, K. C. Lee, M. Gerla, and J. Härri, ―GeoDTN +Nav: Geographic DTN routing with navigator prediction for urban vehicular environments,‖ Mobile Netw. Appl., vol. 15, no. 1, pp. 61–82, Feb. 2010.
[8] J. LeBrun, C. Chuah, D. Ghosal, and M. Zhang, ―Knowledgebased opportunistic forwarding in vehicular wireless ad hoc networks,‖ in Proc. IEEE 61st Veh. Technol. Conf., 2005, pp.2289–2293.
[9] 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.
[10] 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.
[11] 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.
[12] R. Friedman, D. Gavida, L. Rodrigues, A. C. Viana, and S. Voulgaris, ―Gossiping on MANETs: The beauty and the beast,‖ Oper. Syst. Rev.,vol. 41, no. 5, pp. 67–74, Oct. 2007.
[13] 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:

Keywords
MANET, LAROD,Node, Router,Wireless