By Topic

A Heuristic Greedy Optimum Algorithm for Target Coverage in Wireless Sensor Networks

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
$31 $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

5 Author(s)
Zhang Hongwu ; Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Wang Hongyuan ; Feng Hongcai ; Liu Bing
more authors

In order to maximize the network lifetime for target coverage, we propose a heuristic greedy optimum coverage algorithm (HG-OCA). In HG-OCA, we first design a network model in which power supplies of sensor nodes follow a normal distribution. Next, we analyze energy model of target coverage, educe three rules to reduce network scale, present the concept of the key target and the prior coverage of key target. Moreover, we choose sensor with most energy utility as active sensor. In the end, we present HG-OCA to extend network lifetime, based on minimizing energy consumption of key target and maximizing energy efficiency of sensor node. Measurement results show that the new algorithm could increase 80% longer network lifetime and achieve more adaptability and stability.

Published in:

Circuits, Communications and Systems, 2009. PACCS '09. Pacific-Asia Conference on

Date of Conference:

16-17 May 2009