Optimisation problems based on the maximal breach path measure for wireless sensor network coverage

Authors:
Anirvan DuttaGupta;Arijit Bishnu;Indranil Sengupta
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India;Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India;Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India
Venue:
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Year:
2006

Citing 8
Cited 2

Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Introduction to Algorithms

Introduction to Algorithms
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Worst and Best-Case Coverage in Sensor Networks

IEEE Transactions on Mobile Computing
Barrier coverage with wireless sensors

Proceedings of the 11th annual international conference on Mobile computing and networking
Coverage in wireless ad hoc sensor networks

IEEE Transactions on Computers

Maximal breach in wireless sensor networks: geometric characterization and algorithms

ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Coverage problems in sensor networks: A survey

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coverage is a central issue in the design of wireless sensor networks. There are many measures for coverage, based on what aspect of surveillance quality we wish to address. Designing a network that achieves desired standards in terms of the measure chosen is a non-trivial problem. In this paper we take the Maximal Breach Path measure and formulate the sensor-network design problem as a geometric optimisation problem. We present improved polynomial time algorithms for computing the aforesaid measure for a given sensor network. Also, as a first step toward solving the optimisation problem posed in this paper, we present a geometric transformation on a given configuration of sensors that brings the maximal breach to a “local optimal” – in the sense that the resulting breach is the best we can get keeping the topology of the starting configuration intact.