Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

A distributed dual-based algorithm for multi-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

3 Author(s)
Naderan, M. ; Comput. Eng. & Inf. Technol. Dept., Amirkabir Univ. of Technol., Tehran, Iran ; Dehghan, M. ; Pedram, H.

In this paper, we formulate the problem of multiple targets coverage in WSNs as determining the sensing range of each sensor node to maximize total utility of the network. Our utility model includes a logarithmic function of sensing range for the utility of each sensor node as an approximation to the number of targets it covers. We used the dual decomposition technique to derive a distributed price-based algorithm for each node to adjust its sensing range during iterations with static targets. By using the dual-based algorithm in consecutive time intervals, it can be used to cover the moving targets. Extensive simulations show the convergence of sensing ranges and objective function of our approach towards optimal values in few iterations with near optimal energy consumption of nodes.

Published in:

Computer Networks and Distributed Systems (CNDS), 2011 International Symposium on

Date of Conference:

23-24 Feb. 2011