Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/3317
Title: | CVLEACH: Coverage based Energy Efficient LEACH Algorithm |
Authors: | Thakkar, Ankit Kotecha, K. |
Keywords: | Wireless Sensor Networks Energy Efficient LEACH Coverage based LEACH RSSI based LEACH Overhearing Computer Faculty Paper Faculty Paper ITFIT007 ITDIR001 |
Issue Date: | Jun-2012 |
Publisher: | IJCSN |
Series/Report no.: | ITFIT007-4 |
Abstract: | Designing a protocol stack for wireless sensor network (WSN) is a challenging task due to energy, computational and storage constraints. Energy spent for communication between sensor nodes dominates the energy spent for the computation [10]. Multi-hop short range communication between wireless sensors nodes is energy efficient compared to single-hop long range communication. Hierarchical clustering is one of the possible solutions to save energy of wireless sensor nodes. Low-Energy Adaptive Clustering Hierarchy (LEACH), Centralized Low- Energy Adaptive Clustering Hierarchy (LEACH-C) and Advanced Low-Energy Adaptive Clustering Hierarchy (ALEACH) are energy efficient hierarchical clustering routing protocol. In this paper we proposed Coverage based Low-Energy Adaptive Clustering Hierarchy routing protocol – CVLEACH to make uniform distribution of Cluster Heads (CHs) by creating non-overlapped cluster regions using overhearing properties of the sensor nodes, which makes the routing protocol more energy efficient and prolongs life time of a wireless sensor network. Simulation results show that CVLEACH improves network life time compared to LEACH and ALEACH algorithms. |
Description: | International Journal of Computer Science and Network (IJCSN)Vol. 1 (3) June, 2012 |
URI: | http://10.1.7.181:1900/jspui/123456789/3317 |
Appears in Collections: | Faculty Papers, CE |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ITFIT007-4.pdf | ITFIT007-4 | 334.68 kB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.