DocumentCode :
1219473
Title :
Coverage in wireless ad hoc sensor networks
Author :
Xiang-Yang Li ; Peng-Jun Wan ; Frieder, O.
Author_Institution :
Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA
Volume :
52
Issue :
6
fYear :
2003
fDate :
6/1/2003 12:00:00 AM
Firstpage :
753
Lastpage :
763
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.
Keywords :
ad hoc networks; computational complexity; computational geometry; distributed algorithms; mesh generation; Delaunay triangulation; best-coverage problem; computational geometry; distributed algorithms; energy conservation; least energy consumption; search space; uniform sensing ability; wireless ad hoc sensor networks; Complexity theory; Computational geometry; Distributed algorithms; Mesh generation;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.2003.1204831
Filename :
1204831
Link To Document :
بازگشت