© 2011 J. Shanbehzadeh,M. Mehrani,A. Sarrafzadeh,Z. Razaghi. This is a research/review paper, distributed under the terms of
the Creative Commons Attribution-Noncommercial 3.0 Unported License http://creativecommons.org/licenses/by-nc/3.0/),
permitting all non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
Global Journal of Computer Science and Technology
Volume 11 Issue 1 Version 1.0 February 2011
Type: Double Blind Peer Reviewed International Research Journal
Publisher: Global Journals Inc. (USA)
Online ISSN: 0975-4172 & Print ISSN: 0975-4350
An Energy Efficient Coverage Method for Clustered Wireless
Sensor Networks
By J. Shanbehzadeh,M. Mehrani,A. Sarrafzadeh,Z. Razaghi
Islamic Azad University,Tehran
Abstracts - An important issue in WSN is the regional covering.A coverage algorithm should be
able to solve this issue by considering the power consumption to improve the network lifetime.
This requires employing the lowest number of sensors. A solution is just to turn on a subset of
nodes. This subset should be chosen in such a way to cover the entire region. This can be
achieved by partitioning the network nodes and considering a representative for each part in
a time slice to perform the responsibilities of all the partition members for full coverage. This will
lead to turn on some of the nodes in a time slice rather than all of them. This paper presents a
novel algorithm that employs grouping and time scheduling sensor nodes to turn some of them
on to cover the entire area. In this algorithm the sensing range of the nodes depends on their
energy. The cluster head denotes the sensing range and also turn on time slice of each node by
considering node’s remained energy and position.
Keywords: Sensor network; coverage; group; sensing range
Classification: GJCST C.2.1
AnEnergyEfficientCoverageMethodforClusteredWirelessSensorNetworks
Strictly as per the compliance and regulations of: