TGAR: Trust Dependent Greedy Anti-Void Routing in Wireless Sensor Networks (WSNs)

  • H. Sivasankari
  • R. Aparna
  • K. R. Venugopal
  • S. S. Iyengar
  • L. M. Patnaik
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 150)


In Wireless Sensor Networks (WSNs), energy and reliable data delivery are two major issues. Sending data from source to destination without void problem is an objective of any routing algorithm. The existing Greedy Anti-void Routing (GAR) uses the Rolling ball Undirected Traversal to guarantee the packet delivery from source to the destination. In the case of sparse network when it encounters an obstacle in the route it fails to deliver the data. To address this issue, we propose Trust dependent Greedy Anti-void Routing (TGAR) to find the reliable path from source to sink. We use Bayesian estimation model to calculate the trust value for the entire path. Simulation results show that TGAR achieves successful data delivery and energy conservation in sparse networks when compared with the existing Greedy Anti-void Routing (GAR) Algorithm.


Sparse network Unit distance graph Void and wireless sensor networks 


  1. 1.
    Chen S, Fan G, Cui JH (2006) Avoid “Void” in geographic routing for data aggregation in sensor networks. Int J Ad-hoc Ubiquitous Comput 1(4):169–178Google Scholar
  2. 2.
    Kwon S, Shroff NB (2006) Geographic routing in the presence of location errors. Int J Comput Netw 50(15) 2902–2917Google Scholar
  3. 3.
    Karp B, Kung HT (2006) GPSR: greedy perimeter stateless Routing for wireless networks. In: Proceedings of the Mobicom, pp 1158–1168Google Scholar
  4. 4.
    Frey H, Gorgen D (2005) Planar graph routing on geographical clusters. J Adhoc Netw 3:560–574Google Scholar
  5. 5.
    De S, Caruso A, Chaira T, Chessa S (2006) Bounds on Hop Distance in Greedy Routing Approach in Wireless Ad Hoc Networks. Int J wirel Mobile comput 1(2):131–140Google Scholar
  6. 6.
    Dimitriou T, Krontiris I (2007) Gravity: geographic routing around voids in sensor networks. Int J Pervas Comput Commun 2(4):351–361Google Scholar
  7. 7.
    Liu W-J, Feng K-T (2009) Greedy routing with anti-void traversal for wireless sensor networks. IEEE Trans Mobile Comput 8(7):910–922Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • H. Sivasankari
    • 1
  • R. Aparna
    • 1
  • K. R. Venugopal
    • 1
  • S. S. Iyengar
    • 2
  • L. M. Patnaik
    • 3
  1. 1.Department of Computer Science and EngineeringUniversity Visvesvaraya College of Engineering, Bangalore UniversityBangaloreIndia
  2. 2.Florida International UniversityMiamiUSA
  3. 3.Indian Institute of ScienceBangaloreIndia 

Personalised recommendations