Approximation algorithms for two optimal location problems in sensor networks

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

81 Citations (Scopus)

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)
Title of host publication2nd International Conference on Broadband Networks, BROADNETS 2005
Pages767-776
Number of pages10
Volume2005
DOIs
StatePublished - 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

Approximation algorithms
Sensor networks
Sensors
Base stations

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. In 2nd International Conference on Broadband Networks, BROADNETS 2005 (Vol. 2005, pp. 767-776). [1589677] https://doi.org/10.1109/ICBN.2005.1589677

Approximation algorithms for two optimal location problems in sensor networks. / Efrat, Alon; Har-Peled, Sariel; Mitchell, Joseph S B.

2nd International Conference on Broadband Networks, BROADNETS 2005. Vol. 2005 2005. p. 767-776 1589677.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Efrat, A, Har-Peled, S & Mitchell, JSB 2005, Approximation algorithms for two optimal location problems in sensor networks. in 2nd International Conference on Broadband Networks, BROADNETS 2005. vol. 2005, 1589677, pp. 767-776, 2nd International Conference on Broadband Networks, BROADNETS 2005, Boston, MA, United States, 10/3/05. https://doi.org/10.1109/ICBN.2005.1589677
Efrat A, Har-Peled S, Mitchell JSB. Approximation algorithms for two optimal location problems in sensor networks. In 2nd International Conference on Broadband Networks, BROADNETS 2005. Vol. 2005. 2005. p. 767-776. 1589677 https://doi.org/10.1109/ICBN.2005.1589677
Efrat, Alon ; Har-Peled, Sariel ; Mitchell, Joseph S B. / Approximation algorithms for two optimal location problems in sensor networks. 2nd International Conference on Broadband Networks, BROADNETS 2005. Vol. 2005 2005. pp. 767-776
@inproceedings{513e975975644eedab9766e0a5875df6,
title = "Approximation algorithms for two optimal location problems in sensor networks",
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).",
author = "Alon Efrat and Sariel Har-Peled and Mitchell, {Joseph S B}",
year = "2005",
doi = "10.1109/ICBN.2005.1589677",
language = "English (US)",
volume = "2005",
pages = "767--776",
booktitle = "2nd International Conference on Broadband Networks, BROADNETS 2005",

}

TY - GEN

T1 - Approximation algorithms for two optimal location problems in sensor networks

AU - Efrat, Alon

AU - Har-Peled, Sariel

AU - Mitchell, Joseph S B

PY - 2005

Y1 - 2005

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=33847059223&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847059223&partnerID=8YFLogxK

U2 - 10.1109/ICBN.2005.1589677

DO - 10.1109/ICBN.2005.1589677

M3 - Conference contribution

AN - SCOPUS:33847059223

VL - 2005

SP - 767

EP - 776

BT - 2nd International Conference on Broadband Networks, BROADNETS 2005

ER -