An OL(n3) potential reduction algorithm for linear programming
Mathematical Programming: Series A and B
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
IEEE Communications Magazine
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Wireless sensor networks scheduling for full angle coverage
Multidimensional Systems and Signal Processing
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
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-efficient area coverage by sensors with two adjustable ranges
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Maximizing the number of broadcast operations in static random geometric ad-hoc networks
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
On perimeter coverage scheduling in wireless sensor networks
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Perimeter coverage made practical in wireless sensor networks
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
On securing perimeter coverage in wireless sensor networks
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
On perimeter coverage in wireless sensor networks
IEEE Transactions on Wireless Communications
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
On perimeter coverage in wireless sensor networks with minimum cost
International Journal of Sensor Networks
Energy-efficient area coverage by sensors with two sensing ranges
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Minimum perimeter coverage of query regions in a heterogeneous wireless sensor network
Information Sciences: an International Journal
Min-density stripe covering and applications in sensor networks
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Employing energy-efficient patterns for coverage problem to extend the network lifetime
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part IV
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
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
Mobility-assisted minimum connected cover in a wireless sensor network
Journal of Parallel and Distributed Computing
Sensor activation and radius adaptation (SARA) in heterogeneous sensor networks
ACM Transactions on Sensor Networks (TOSN)
Changing of the guards: strip cover with duty cycling
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Sensing task assignment via sensor selection for maximum target coverage in WSNs
Journal of Network and Computer Applications
Primal and dual-based algorithms for sensing range adjustment in WSNs
The Journal of Supercomputing
Brief announcement: set it and forget it - approximating the set once strip cover problem
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient power management can extend network lifetime. In this paper, we consider a large number of sensors with adjustable sensing range that are randomly deployed to monitor a number of targets. Since targets are redundantly covered by multiple sensors, to conserve energy resources, sensors can be organised in sets, activated successively. In this paper, we address the Adjustable Range Set Covers (AR-SC) problem that has as its objective finding a maximum number of set covers and the ranges associated with each sensor, such that each sensor set covers all the targets. A sensor can participate in multiple sensor sets, but the sum of the energy spent in each set is constrained by the initial energy resources. In this paper, we mathematically model solutions to this problem and design heuristics that efficiently compute the sets. Simulation results are presented to verify our approaches.