Primal and dual-based algorithms for sensing range adjustment in WSNs

  • Authors:

  • Marjan Naderan;Mehdi Dehghan;Hossein Pedram

  • Affiliations:

  • Computer Engineering and Information Technology Department, Amirkabir University of Technology, Tehran, Iran;Computer Engineering and Information Technology Department, Amirkabir University of Technology, Tehran, Iran;Computer Engineering and Information Technology Department, Amirkabir University of Technology, Tehran, Iran

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Coverage and tracking of multiple targets, are viewed as important challenges in WSNs, mainly aimed for future ubiquitous and pervasive applications. Target coverage in WSNs with large numbers of sensor nodes and targets, and with a predefined placement of sensors, may be conducted through adjusting the sensing range and considering the energy consumption related to this operation. In this paper, we encounter the problem of multiple target coverage in WSNs by determining the sensing range of each sensor node to maximize the total utility of the network. We solve this Network Utility Maximization (NUM) problem via two approaches, primal and dual decompositions, which result in iterative distributed price-based algorithms. Convergence of sensing ranges to optimal values is proved by means of stability analysis and simulation experiments. Simulation results show convergence to optimal values in few iterations, with near optimal values for the total objective function and energy consumption of nodes. These results show scalability of our algorithm, in terms of the number of iterations needed for convergence when compared with the other two methods. Furthermore, the distributed algorithm based on dual decomposition is used to cover efficiently moving targets in consecutive time intervals.