By Topic

Integer Programming Scheme for Target Coverage in Heterogeneous 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

3 Author(s)
Xiaofei Xing ; Sch. of Inf. Sci. & Eng., Central South Univ., Changsha, China ; Jie Li ; Guojun Wang

This paper addresses the polytype target coverage problem for heterogeneous wireless sensor networks (HWSNs) with clustered configurations. This problem is formulated as an integer programming (IP) problem for maximizing the whole lifetime of HWSNs. We present an energy-efficient target coverage algorithm (ETCA) to solve this problem and balance the energy consumption of sensor nodes. Each sensor node first calculates its sensing capability with neighbors' and sends a message with its current status information to a clusterhead. Then, the clusterhead decides which sensing units should be turned on to cover the targets in the most optimized way based on the information received from all its member nodes. Simulation results show that the performance of ETCA is close to the IP-solution that is an optimal coverage scheme regarding the energy efficiency. Moreover, ETCA can prolong 16% network lifetime compared with the energy first (EF) algorithm.

Published in:

Mobile Ad-hoc and Sensor Networks (MSN), 2010 Sixth International Conference on

Date of Conference:

20-22 Dec. 2010