Adaptive Graphical Routing Methodology for reducing traffic overhead in Wireless Sensor Networks

Increasing the scalability and location identification are the prime issues in Wireless Sensor Networks. The Geographical routing is used for getting solution to this kind of issues, but the main disadvantage of Geographical routing is its rely on greedy method and void node problem is the main issue of providing quality of routing. This paper demonstrates the Adaptive Graphical Routing methodology (AGR) for wireless sensor networks. In AGR, the adjacent hop is elected from nodes accessible dynamically with density of the network in some specific angle. The selection of forwarding node within the nodes in a solid angle is computed using the delay aware contention methodology. The proposed AGR methodology will solve the collision problem by prevention of looping and identifying the better path for routing. Moreover, the proposed methodology will utilize the outside of the solid angle using RTS and CTS concepts in dynamic routing. Reducing the traffic overhead by dynamic routing methodology will increase the quality of routing in wireless sensor networks. The performance of the proposed method is compared with the related methods using NS2 simulator. The simulation results specify that AGS achieves an improved packet delivery ratio by increasing the residual energy and reducing the traffic overhead.