CEAR: Cluster based Energy Aware Routing Algorithm to Maximize Lifetime of Wireless Sensor Networks (WSNs)
Technological development in wireless communication enables the development of smart, tiny, low cost and low power sensor nodes to outperform for various applications in Wireless Sensor Networks. In the existing Tabu search algorithm, clusters are formed
- PDF / 406,242 Bytes
- 7 Pages / 439.37 x 666.142 pts Page_size
- 50 Downloads / 173 Views
CEAR: Cluster based Energy Aware Routing Algorithm to Maximize Lifetime of Wireless Sensor Networks (WSNs) H. Sivasankari, R. Leelavathi, M. Vallabh, K. R. Venugopal, S. S. Iyengar and L. M. Patnaik
Abstract Technological development in wireless communication enables the development of smart, tiny, low cost and low power sensor nodes to outperform for various applications in Wireless Sensor Networks. In the existing Tabu search algorithm, clusters are formed using initial solution algorithm to conserve energy. We propose a Cluster Based Energy Aware Routing (CEAR) algorithm to maximize energy conservation and lifetime of network with active and sleep nodes. The proposed algorithm, removes duplication of data through aggregation at the cluster heads with active and sleep modes. A comparative study of CEAR algorithm with Tabu search algorithm is obtained. Comparative study shows improvement in the Lifetime and energy conservation by 17 and 22 % respectively over the existing algorithm.
Keywords Clusters Delay Energy aware routing Lifetime and wireless sensor networks
H. Sivasankari (&) R. Leelavathi M. Vallabh K. R. Venugopal Department of Computer Science and Engineering, University Visvesvaraya College of Engineering, Bangalore University, Bangalore 560 001, 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_4, Springer Science+Business Media New York 2013
31
32
H. Sivasankari et al.
4.1 Introduction Wireless Sensor Networks (WSNs) are deployed with hundreds or thousands of computable and low cost sensors. These sensor nodes are multi-functional and with computing capabilities. These sensor nodes are integrated on a single board in a few cubic inches with embedded microprocessor, radio receivers, sensing, and computing and communication unit. They are powered by 50 W and can last for 2–3 years with very less duty cycling and these sensor nodes are prone for failures. In WSN there are three types of communications, they are clock driven, event driven and query driven. In the clock driven approach, data collection and transmission takes place at regular periodic intervals. In the event driven and query driven approaches, data collection is triggered by events or queries. Data Aggregation, Clustering, effective routing and data compression, min–max and averaging methods are used to reduce energy consumption in WSNs. Tabu search algorithm [1] form clusters of sensor nodes and routes data from source to the destination through cluster heads. The sensor nodes are active and transmits data without aggregation all the time and this approach consumes more energy as there is no aggregation. We propose Cluster based Energy Aware Routing (CEAR) in order to maximize lifetime and energy conservation of WSNs
Data Loading...
