Xiang-Yang Li
Peng-Jun Wan
Frieder, O.
Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA;
This paper appears in: Computers, IEEE Transactions on
Publication Date: June 2003
Volume: 52,
Issue: 6
On page(s): 753- 763
ISSN: 0018-9340
INSPEC Accession Number: 7667491
Digital Object Identifier: 10.1109/TC.2003.1204831
Posted online: 2003-06-20 13:34:19.0
Abstract
Sensor networks pose a number of challenging conceptual and optimization problems such as location, deployment, and tracking. One of the fundamental problems in sensor networks is the calculation of the coverage. In Meguerdichian et al. (2001), it is assumed that the sensor has uniform sensing ability. We provide efficient distributed algorithms to optimally solve the best-coverage problem raised in the above-mentioned article. In addition, we consider a more general sensing model: the sensing ability diminishes as the distance increases. As energy conservation is a major concern in wireless (or sensor) networks, we also consider how to find an optimum best-coverage-path with the least energy consumption and how to find an optimum best-coverage-path that travels a small distance. In addition, we justify the correctness of the method proposed above that uses the Delaunay triangulation to solve the best coverage problem and show that the search space of the best coverage problem can be confined to the relative neighborhood graph, which can be constructed locally.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
