Abstract
Most existing grid-based routing protocols use reactive mechanisms to build routing paths. In this paper, we propose a new hybrid approach for grid-based routing in MANETs which uses a combination of reactive and proactive mechanisms. The proposed routing approach uses shortest-path trees to build the routing paths between source and destination nodes. We design a new protocol based on this approach called the Tree-based Grid Routing Protocol (TGRP). The main advantage of the new approach is the high routing path stability due to availability of readily constructed alternative paths. Our simulation results show that the stability of the TGRP paths results in a substantially higher performance compared to other protocols in terms of lower end-to-end delay, higher delivery ratio and reduced control overhead.
Highlights
A Mobile Ad-hoc Network (MANET) is defined as a collection of autonomous mobile nodes which communicate in the absence of access points
Any node that wants to establish a connection with an unknown node; it starts by sending a Route Request (RREQ) packet to seek for the destination location using cell-based flooding
We have extended the NS2 network simulator, which has been widely used in the literature for studying the performance of MANET routing protocols [15] [18] [19], to evaluate the performance of Tree-based Grid Routing Protocol (TGRP) and compare it with the performance of GRID protocols
Summary
A Mobile Ad-hoc Network (MANET) is defined as a collection of autonomous mobile nodes which communicate in the absence of access points. Position-based protocols mostly depend on location services [13] such as Home Agent [17] and Grid Location Service [14] to discover geographical locations of destinations Another limitation of existing grid-based routing protocols is that they use an election approach for selecting cell-head (gateway) nodes which leads to high control packet overhead and high end-to-end delays. Any node that wants to establish a connection with an unknown node (not registered in a local Node Table); it starts by sending a Route Request (RREQ) packet to seek for the destination location using cell-based flooding. The proactive layer information is saved in all nodes in the MANET environment This information enables a cellhead to build a shortest path tree from the cell where it is located to all grid cells.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
