By Topic

Solving K-Coverage Problem in Wireless Sensor Networks Using Improved Harmony Search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shohreh Ebrahim Nezhad ; Electr. & Comput. Eng. Dept., Shahid Beheshti Univ., Tehran, Iran ; Hoda Jalal Kamali ; Mohsen Ebrahimi Moghaddam

Coverage and energy efficiency metrics are two fundamental issues for distribution of wireless sensor nodes. Coverage reflects how well an area is monitored by sensor nodes and in energy efficient networks less energy is consumed to provide the same level of services. These twin specifics are presented to evaluate the performance of a wireless sensor network. On the other hand, connectivity and k-coverage are prerequisites for a k-covered Wireless Sensor Network. Connectivity shows how nodes in a sensor network can effectively communicate and k-coverage means hotspot regions are covered by at least k sensors. In this article, we propose an Improved Harmony Search algorithm in a k-covered and connected wireless sensor network to achieve a sensor node deployment such that the covered area is optimal and data transfer has low energy consumption. Through computer simulations, experimental results verified that the proposed method improved the coverage of area in compare to some related methods.

Published in:

Broadband, Wireless Computing, Communication and Applications (BWCCA), 2010 International Conference on

Date of Conference:

4-6 Nov. 2010