Difference between revisions of "Meguerdichian2001coverage"
From ACES
(Import from BibTeX) |
m (Default pdf) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
|abstract=Wireless ad-hoc sensor networks have recently emerged as a premier research topic. They have great long-term economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. We address one of the fundamental problems, namely coverage. Coverage in general, answers the questions about quality of service (surveillance) that can be provided by a particular sensor network. We first define the coverage problem from several points of view including deterministic, statistical, worst and best case, and present examples in each domain. By combining the computational geometry and graph theoretic techniques, specifically the Voronoi diagram and graph search algorithms, we establish the main highlight of the paper-optimal polynomial time worst and average case algorithm for coverage calculation. We also present comprehensive experimental results and discuss future research directions related to coverage in sensor networks. | |abstract=Wireless ad-hoc sensor networks have recently emerged as a premier research topic. They have great long-term economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. We address one of the fundamental problems, namely coverage. Coverage in general, answers the questions about quality of service (surveillance) that can be provided by a particular sensor network. We first define the coverage problem from several points of view including deterministic, statistical, worst and best case, and present examples in each domain. By combining the computational geometry and graph theoretic techniques, specifically the Voronoi diagram and graph search algorithms, we establish the main highlight of the paper-optimal polynomial time worst and average case algorithm for coverage calculation. We also present comprehensive experimental results and discuss future research directions related to coverage in sensor networks. | ||
|pages=1380 - 1387 | |pages=1380 - 1387 | ||
|month= | |||
|year=2001 | |||
|volume=3 | |volume=3 | ||
|booktitle=Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) | |booktitle=Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) | ||
|title=Coverage Problems in Wireless Ad-Hoc Sensor Networks | |title=Coverage Problems in Wireless Ad-Hoc Sensor Networks | ||
|entry=inproceedings | |entry=inproceedings | ||
| | |pdf=Meguerdichian2001coverage.pdf | ||
}} | }} | ||
Latest revision as of 17:37, 9 November 2021
| Meguerdichian2001coverage | |
|---|---|
| entry | inproceedings |
| address | |
| annote | |
| author | S. Meguerdichian and F. Koushanfar and M. Potkonjak and M. Srivastava |
| booktitle | Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) |
| chapter | |
| edition | |
| editor | |
| howpublished | |
| institution | |
| journal | |
| month | |
| note | |
| number | |
| organization | |
| pages | 1380 - 1387 |
| publisher | |
| school | |
| series | |
| title | Coverage Problems in Wireless Ad-Hoc Sensor Networks |
| type | |
| volume | 3 |
| year | 2001 |
| doi | |
| issn | |
| isbn | |
| url | |
| Meguerdichian2001coverage.pdf | |
Email:
farinaz@ucsd.edu
farinaz@ucsd.edu
Address:
Electrical & Computer Engineering
University of California, San Diego
9500 Gilman Drive, MC 0407
Jacobs Hall, Room 6401
La Jolla, CA 92093-0407
Electrical & Computer Engineering
University of California, San Diego
9500 Gilman Drive, MC 0407
Jacobs Hall, Room 6401
La Jolla, CA 92093-0407
Lab Location: EBU1-2514
University of California San Diego
9500 Gilman Dr, La Jolla, CA 92093
University of California San Diego
9500 Gilman Dr, La Jolla, CA 92093