Approximation algorithms for two optimal location problems in sensor networks

Alon Efrat, Sariel Har-Peled, Joseph S.B. Mitchell

Research output: Contribution to conferencePaper

88 Scopus citations

Abstract

This paper studies two problems that arise in optimization of sensor networks: First, we devise provable approximation schemes for locating a base station and constructing a network among a set of sensors each of which has a data stream to get to the base station. Subject to power constraints at the sensors, our goal is to locate the base station and establish a network in order to maximize the lifespan of the network. Second, we study optimal sensor placement problems for quality coverage of given domains cluttered with obstacles. We assume "line-of-site", sensors, that sense a point only if the straight segment connecting the sensor to this point (the "line-of-site") does not cross any obstacle, so obstacles occludes area from Using line-of-site sensors, the goal is to minimize the number of sensors required in order to have each point "well covered" according to precise criteria (e.g., that each point is seen by two sensors that form at least angle α, or that each point is seen by three sensors that form a triangle containing the point).

Original languageEnglish (US)
Pages767-776
Number of pages10
DOIs
StatePublished - Dec 1 2005
Event2nd International Conference on Broadband Networks, BROADNETS 2005 - Boston, MA, United States
Duration: Oct 3 2005Oct 7 2005

Other

Other2nd International Conference on Broadband Networks, BROADNETS 2005
CountryUnited States
CityBoston, MA
Period10/3/0510/7/05

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Efrat, A., Har-Peled, S., & Mitchell, J. S. B. (2005). Approximation algorithms for two optimal location problems in sensor networks. 767-776. Paper presented at 2nd International Conference on Broadband Networks, BROADNETS 2005, Boston, MA, United States. https://doi.org/10.1109/ICBN.2005.1589677