Difference between revisions of "Meguerdichian2001exposure"
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 will provide one of the missing connections between the Internet and the physical world. One of the fundamental problems in sensor networks is the calculation of coverage. Exposure is directly related to coverage in that it is a measure of how well an object, moving on an arbitrary path, can be observed by the sensor network over a period of time.In addition to the informal definition, we formally define exposure and study its properties. We have developed an efficient and effective algorithm for exposure calculation in sensor networks, specifically for finding minimal exposure paths. The minimal exposure path provides valuable information about the worst case exposure-based coverage in sensor networks. The algorithm works for any given distribution of sensors, sensor and intensity models, and characteristics of the network. It provides an unbounded level of accuracy as a function of run time and storage. We provide an extensive collection of experimental results and study the scaling behavior of exposure and the proposed algorithm for its calculation. | |abstract=Wireless ad-hoc sensor networks will provide one of the missing connections between the Internet and the physical world. One of the fundamental problems in sensor networks is the calculation of coverage. Exposure is directly related to coverage in that it is a measure of how well an object, moving on an arbitrary path, can be observed by the sensor network over a period of time.In addition to the informal definition, we formally define exposure and study its properties. We have developed an efficient and effective algorithm for exposure calculation in sensor networks, specifically for finding minimal exposure paths. The minimal exposure path provides valuable information about the worst case exposure-based coverage in sensor networks. The algorithm works for any given distribution of sensors, sensor and intensity models, and characteristics of the network. It provides an unbounded level of accuracy as a function of run time and storage. We provide an extensive collection of experimental results and study the scaling behavior of exposure and the proposed algorithm for its calculation. | ||
|pages=139 - 150 | |pages=139 - 150 | ||
|month= | |||
|year=2001 | |||
|booktitle=International conference on Mobile computing and networking (MobiCom) | |booktitle=International conference on Mobile computing and networking (MobiCom) | ||
|title=Exposure in wireless Ad-Hoc sensor networks | |title=Exposure in wireless Ad-Hoc sensor networks | ||
|entry=inproceedings | |entry=inproceedings | ||
| | |pdf=Meguerdichian2001exposure.pdf | ||
}} | }} | ||
Latest revision as of 17:37, 9 November 2021
| Meguerdichian2001exposure | |
|---|---|
| entry | inproceedings |
| address | |
| annote | |
| author | S. Meguerdichian and F. Koushanfar and G. Qu and M. Potkonjak |
| booktitle | International conference on Mobile computing and networking (MobiCom) |
| chapter | |
| edition | |
| editor | |
| howpublished | |
| institution | |
| journal | |
| month | |
| note | |
| number | |
| organization | |
| pages | 139 - 150 |
| publisher | |
| school | |
| series | |
| title | Exposure in wireless Ad-Hoc sensor networks |
| type | |
| volume | |
| year | 2001 |
| doi | |
| issn | |
| isbn | |
| url | |
| Meguerdichian2001exposure.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