Abstract
Abstract Routing has been the main challenge for ad hoc networks due to dynamic topology as well as resource constraints. Completely GPS(Global Positioning System) free as well as GPS scarce positioning systems for wireless, mobile, ad-hoc networks has been proposed recently by many authors. High computational overhead and high mobility of the nodes typically require completely GPS enabled MANETs for higher performance. In this article, Improved Location aided Cluster based Routing Protocol (ILCRP) for GPS enabled MANETs has been evaluated for performance metrics such as end to end delay, control overhead, and packet delivery ratio. Use of cluster based routing as well as exact location information of the nodes in ILCRP reduces the control overhead resulting in higher packet delivery ratio. GPS utility in nodes reduces the end to end delay even during its high mobility. Simulations are performed using NS2 by varying the mobility (speed) of nodes as well as number of the nodes. The results illustrate that ILCRP performs better compared to other protocols.
Highlights
Routing has been the main challenge for ad hoc networks due to dynamic topology as well as resource constraints
This paper introduces a new stable clustering scheme that are applicable in highly mobile ad hoc networks
Use of location information in the m-hop cluster based routing forms the basis of Improved Location aided Cluster based Routing Protocol (ILCRP)
Summary
Maximum node value of a Node can be calculated by considering the mobility of the node as NULL. The threshold value is the value till which the elected CH retains the head of the cluster and is approximately given by forty percent of the maximum node value. After finding its node value NV, broadcasts NV using an INFO (Table 1) message to its 1-hop neighbors. Adjacency cluster discovery and gateway node selection are done as per the CBRP IETF MANET draft. All other nodes store node IDs, location information and its node values in its neighbor tables. When its node value falls below threshold value, the CH sends CH_RELEIVE (Table 2) to all its nodes in its cluster. Contains broadcaster’s ID, location information, node status, neighbour table, cluster adjacency table and sender’s node value
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
