The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2003 vol.52)
pp: 753-763
ABSTRACT
<p><b>Abstract</b>—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. It is assumed that the sensor has the uniform sensing ability. We provide efficient distributed algorithms to optimally solve the <it>best-coverage problem</it> raised. 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 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.</p>
INDEX TERMS
Coverage, wireless networks, sensors, computational geometry, distributed algorithms.
CITATION
Xiang-Yang Li, Peng-Jun Wan, Ophir Frieder, "Coverage in Wireless Ad Hoc Sensor Networks", IEEE Transactions on Computers, vol.52, no. 6, pp. 753-763, June 2003, doi:10.1109/TC.2003.1204831
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool