Maximum Lifetime of Sensor Networks with Adjustable Sensing Range

Authors:
A. Dhawan;C. T. Vu;A. Zelikovsky;Y. Li;S. K. Prasad
Affiliations:
Georgia State University, Atlanta, GA;Georgia State University, Atlanta, GA;Georgia State University, Atlanta, GA;Georgia State University, Atlanta, GA;Georgia State University, Atlanta, GA
Venue:
SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Year:
2006

Citing 0
Cited 18

Variable radii connected sensor cover in sensor networks

ACM Transactions on Sensor Networks (TOSN)
Bounds on coverage time and node density for multi-modality sensing

Ad Hoc Networks
Multi-objective evolutionary optimization of 3D differentiated sensor network deployment

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Perimeter coverage made practical in wireless sensor networks

ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Energy efficient distributed algorithms for sensor target coverage based on properties of an optimal schedule

HiPC'08 Proceedings of the 15th international conference on High performance computing
Energy-efficient k-coverage for wireless sensor networks with variable sensing radii

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A Lagrangean relaxation based sensor deployment algorithm to optimize quality of service for target positioning

Expert Systems with Applications: An International Journal
Lifetime maximization of monitoring sensor networks

ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
On perimeter coverage in wireless sensor networks with minimum cost

International Journal of Sensor Networks
Maximising lifetime for fault-tolerant target coverage in sensor networks

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
A grid-based coverage approach for target tracking in hybrid sensor networks

Journal of Systems and Software
Maximizing network lifetime on the line with adjustable sensing ranges

ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Optimal energy allocation in heterogeneous wireless sensor networks for lifetime maximization

Journal of Parallel and Distributed Computing
Heuristic energy-efficient routing solutions to extend the lifetime of wireless ad-hoc sensor networks

ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
Sensing task assignment via sensor selection for maximum target coverage in WSNs

Journal of Network and Computer Applications
Communication restoration within wireless sensor networks

Proceedings of the 10th International Conference on Advances in Mobile Computing & Multimedia
Primal and dual-based algorithms for sensing range adjustment in WSNs

The Journal of Supercomputing
Optimal number of annuli for maximizing the lifetime of sensor networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of maximizing the lifetime of a target-covering sensor network in which each sensor can adjust its sensing range. The network model consists of a large number of sensors with adjustable sensing ranges being deployed to monitor a set of targets. Since more than one sensor can cover a target, in order to be energy efficient, one can activate successive subsets of sensors that cover all targets. This paper addresses the problem of maximizing the total lifetime of such an activation schedule. In contrast to the approach taken by Cardei et al. [4], our formulation directly maximizes the network lifetime rather than maximizing the number of sensor covers. We give a mathematical model of this problem using a linear program with exponential number of variables and solve this linear program using the approximation algorithm of Garg-Könemann [8]. Our experimental results on simulated data show a 4x increase in lifetime when compared with the previous approach taken by Cardei et al. [4].