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

Sivasankari, H, Aparna, R, Venugopal, KR et al. (2013). TGAR: Trust Dependent Greedy Anti-void Routing in Wireless Sensor Networks (WSNs) . 150 LNEE 39-45. 10.1007/978-1-4614-3363-7_5

cited authors

  • Sivasankari, H; Aparna, R; Venugopal, KR; Iyengar, SS; Patnaik, LM

authors

abstract

  • 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. © 2013 Springer Science+Business Media New York.

publication date

  • January 1, 2013

Digital Object Identifier (DOI)

start page

  • 39

end page

  • 45

volume

  • 150 LNEE