Open Access Open Access  Restricted Access Subscription or Fee Access

Performance of Greedy Algorithm for Detecting the Void Problem and Routing in Wireless Sensor Networks

T. Poonkodi, Dr. S. Sukumaran


Routing protocols plays a very significant part to produce interruption less and efficient communication between source and destination nodes. The performance, service and reliability of a network mostly depend on the selection of good routing protocol. The void problem causing the routing failure is the main challenge of the greedy routing in the wireless sensor networks. The topology of a remote sensor system changes as a few sensors come up short on force, fall flat or Join the system; which might bring about loss of information or the velocity of exchange of information backs off. This issue is solved using Greedy Algorithm and the Hop Count Reduction (HCR) plan is used as a short-listening so as to slice procedure to decrease the steering bounces to the neighbor's movement. The GAR protocol is a new protocol proposed here to guarantee the delivery of packets and excessive consumption of control overheads is resolved. The unreachability problem (i.e., void problem) that exists in the greedy routing algorithms has been studied for the wireless sensor networks.


Greedy Routing, Void Problem, GAR Protocol, Wireless Sensor Network.

Full Text:



N. Priya, “VANET Based Adaptive Traffic Signal Control”, Journal of Computer and Communication Engineering, 1, 1201-1208, 2014.

N. Sakthi Priya, “Cervical Cancer Screening and Classification Using Acoustic Shadowing”, International Journal of Computer and Communication Engineering, 1, 1676-1679, 2013.

B. Chella Prabha, B. Anuradha, &M. Dhivya, “Enhanced Greedy Routing with Anti-Void Traversal for Wireless Sensor Networks”, 2011.

F. Cadger, K. Curran, J. Santos, & S. Moffett, “A survey of geographical routing in wireless Ad-Hoc networks”, 15, 621–653, 2013.

B. Q. Tang & L. H. Zhang, “Optimization of energy multipath routing protocol in wireless sensor networks”, 35, 2607–2612, 2013.

A. Wahid and D. Kim, “An energy efficient localization-free routing protocol for underwater wireless sensor networks”, 2012.

M. Ayaz, A. Abdullah, I. Faye,& Y. Batira, “An efficient dynamic addressing based routing protocol for wireless sensor networks”,35 , 475–486, 2012.

A. Umar, M. Akbar, & N. Javaid, “Cooperative partner nodes selection criteria for cooperative routing in underwater WSNs”, 2015.

C. Detweiler, “Adaptive decentralized control of mobile underwater sensor networks and robots for modeling underwater phenomena”, 3, 113–149, 2014.

M. Hosseini, H. Chizari, &A. H. Abdullah, “Efficient underwater RSS value to distance inversion using the lambert function” , 8 , 2014.

S. Climent, A. Sanchez, J. V. Capella, N. Meratnia, and J. J. Serrano, “advances and future trends in physical, MAC and routing layers” , 14, 795–833, 2014.

X. Wang, M. Xu, H. Wang, Y. Wu, & H. Shi, “Combination of interacting multiple models with the particle filter in underwater wireless sensor networks,” 2012.

M. Maalej, S. Cherif, and H. Besbes, “QoS and energy aware cooperative routing protocol for monitoring wireless sensor networks” , 11, 2013.

H. Wu, X. Chen, C. Shi, Y. Xiao, & M. Xu, “An ACOAAFSA fusion routing algorithm for wireless sensor network” ,2012.

A. Bereketli and S. Bilgen, “Remotely powered underwater acoustic sensor networks”, 12, 3467–3472, 2012.

J. Elias, “Optimal design of energy-efficient and cost effective wireless body area networks”, 13, 560–574, 2014.

N. Javaid, A. Ahmad,& Y. Khan, “A Relay Based Routing Protocol for Wireless In-Body Sensor Networks”,80, 1063–1078, 2014.

J. Elias & A. Mehaoua, “Energy-aware topology design for wireless body area networks,” 3409–3410, 2012.

I. Ha, “Even Energy Consumption and Backside Routing: An Improved Routing Protocol for Effective Data Transmission in Wireless Body Area Networks “, 12, 1–11, 2016.

J. I. Bangash,A. H. Abdullah, M. H. Anisi, & A. W. khan , “A Survey of routing Protocols in wireless body sensor network”, 14,1322–1357, 2014.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.