TGAR: Trust Dependent Greedy Anti-Void Routing in Wireless Sensor Networks (WSNs)
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
- PDF / 338,233 Bytes
- 7 Pages / 439.37 x 666.142 pts Page_size
- 39 Downloads / 126 Views
TGAR: Trust Dependent Greedy Anti-Void Routing in Wireless Sensor Networks (WSNs) H. Sivasankari, R. Aparna, K. R. Venugopal, S. S. Iyengar and L. M. Patnaik
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. Keywords Sparse network networks
Unit distance graph
Void and wireless sensor
H. Sivasankari (&) R. Aparna K. R. Venugopal Department of Computer Science and Engineering, University Visvesvaraya College of Engineering, Bangalore University, Bangalore 560001, India e-mail: [email protected] S. S. Iyengar Florida International University, Miami, USA L. M. Patnaik Indian Institute of Science, Bangalore, India
V. V. Das (ed.), Proceedings of the Third International Conference on Trends in Information, Telecommunication and Computing, Lecture Notes in Electrical Engineering 150, DOI: 10.1007/978-1-4614-3363-7_5, Springer Science+Business Media New York 2013
39
40
H. Sivasankari et al.
5.1 Introduction Sensor nodes are battery operated and have limited energy in WSNs. It is desirable to design an energy efficient protocol for WSNs. There are three types of routing techniques i.e., flat, hierarchical and location based routing. In flat routing, nodes are collaborated to sense an event. There is no unique id for all nodes since they are deployed in large numbers and it is not feasible to give identification for each node. In hierarchical approach, high energy node can be used to process and send the information and low energy nodes are used only for sensing. In location based routing, sensor nodes are identified by their locations. The Greedy Anti-void routing is used to forward a packet in an alternative path if it encounters a void in the path. The alternative path is inefficient and there is a chance of encounter obstacles. We propose Bayesian estimation model to calculate trust value for each path, to avoid unreliable and inefficient paths. We propose Trust dependent Greedy Anti-void Routing(TGAR) for successful data delivery and energy conservation and better than the existing GAR algorithm. The rest of the paper is organized as follows: Related work is discussed in Sect. 5.2. Problem Definition is formulated in Sect. 5.3. Algorithm is developed in Sect. 5.4. Simulation and Performance Analysis are an
Data Loading...
