Algorithm design for base station placement problems in sensor networks

Yi Shi, Y. Thomas Hou, Alon Efrat

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

5 Citations (Scopus)

Abstract

Base station placement has significant impact on sensor network performance. Despite its significance, results on this problem remain limited, particularly theoretical results that can provide performance guarantee. This paper proposes a set of procedure to design (1 - ) approximation algorithms for base station placement problems under any desired small error bound > 0. It offers a general framework to transform infinite search space to a finite-element search space with performance guarantee. We apply this procedure to solve two practical problems. In the first problem where the objective is to maximize network lifetime, an approximation algorithm designed through this procedure offers 1 / 2 complexity reduction when compared to a state-of-the-art algorithm. This represents the best known result to this problem. In the second problem, we apply the design procedure to address base station placement problem for maximizing network capacity. Our (1 - ) approximation algorithm is the first theoretical result on this problem.

Original languageEnglish (US)
Title of host publicationACM International Conference Proceeding Series
Volume191
DOIs
StatePublished - 2006
Event3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks - Waterloo, ON, Canada
Duration: Aug 7 2006Sep 8 2006

Other

Other3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
CountryCanada
CityWaterloo, ON
Period8/7/069/8/06

Fingerprint

Approximation algorithms
Base stations
Sensor networks
Network performance

ASJC Scopus subject areas

  • Human-Computer Interaction

Cite this

Shi, Y., Hou, Y. T., & Efrat, A. (2006). Algorithm design for base station placement problems in sensor networks. In ACM International Conference Proceeding Series (Vol. 191). [1185391] https://doi.org/10.1145/1185373.1185391

Algorithm design for base station placement problems in sensor networks. / Shi, Yi; Hou, Y. Thomas; Efrat, Alon.

ACM International Conference Proceeding Series. Vol. 191 2006. 1185391.

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

Shi, Y, Hou, YT & Efrat, A 2006, Algorithm design for base station placement problems in sensor networks. in ACM International Conference Proceeding Series. vol. 191, 1185391, 3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, Waterloo, ON, Canada, 8/7/06. https://doi.org/10.1145/1185373.1185391
Shi Y, Hou YT, Efrat A. Algorithm design for base station placement problems in sensor networks. In ACM International Conference Proceeding Series. Vol. 191. 2006. 1185391 https://doi.org/10.1145/1185373.1185391
Shi, Yi ; Hou, Y. Thomas ; Efrat, Alon. / Algorithm design for base station placement problems in sensor networks. ACM International Conference Proceeding Series. Vol. 191 2006.
@inproceedings{e52159bde6e54211bfb7ce9a69720fd5,
title = "Algorithm design for base station placement problems in sensor networks",
abstract = "Base station placement has significant impact on sensor network performance. Despite its significance, results on this problem remain limited, particularly theoretical results that can provide performance guarantee. This paper proposes a set of procedure to design (1 - ) approximation algorithms for base station placement problems under any desired small error bound > 0. It offers a general framework to transform infinite search space to a finite-element search space with performance guarantee. We apply this procedure to solve two practical problems. In the first problem where the objective is to maximize network lifetime, an approximation algorithm designed through this procedure offers 1 / 2 complexity reduction when compared to a state-of-the-art algorithm. This represents the best known result to this problem. In the second problem, we apply the design procedure to address base station placement problem for maximizing network capacity. Our (1 - ) approximation algorithm is the first theoretical result on this problem.",
author = "Yi Shi and Hou, {Y. Thomas} and Alon Efrat",
year = "2006",
doi = "10.1145/1185373.1185391",
language = "English (US)",
isbn = "1595935371",
volume = "191",
booktitle = "ACM International Conference Proceeding Series",

}

TY - GEN

T1 - Algorithm design for base station placement problems in sensor networks

AU - Shi, Yi

AU - Hou, Y. Thomas

AU - Efrat, Alon

PY - 2006

Y1 - 2006

N2 - Base station placement has significant impact on sensor network performance. Despite its significance, results on this problem remain limited, particularly theoretical results that can provide performance guarantee. This paper proposes a set of procedure to design (1 - ) approximation algorithms for base station placement problems under any desired small error bound > 0. It offers a general framework to transform infinite search space to a finite-element search space with performance guarantee. We apply this procedure to solve two practical problems. In the first problem where the objective is to maximize network lifetime, an approximation algorithm designed through this procedure offers 1 / 2 complexity reduction when compared to a state-of-the-art algorithm. This represents the best known result to this problem. In the second problem, we apply the design procedure to address base station placement problem for maximizing network capacity. Our (1 - ) approximation algorithm is the first theoretical result on this problem.

AB - Base station placement has significant impact on sensor network performance. Despite its significance, results on this problem remain limited, particularly theoretical results that can provide performance guarantee. This paper proposes a set of procedure to design (1 - ) approximation algorithms for base station placement problems under any desired small error bound > 0. It offers a general framework to transform infinite search space to a finite-element search space with performance guarantee. We apply this procedure to solve two practical problems. In the first problem where the objective is to maximize network lifetime, an approximation algorithm designed through this procedure offers 1 / 2 complexity reduction when compared to a state-of-the-art algorithm. This represents the best known result to this problem. In the second problem, we apply the design procedure to address base station placement problem for maximizing network capacity. Our (1 - ) approximation algorithm is the first theoretical result on this problem.

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

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

U2 - 10.1145/1185373.1185391

DO - 10.1145/1185373.1185391

M3 - Conference contribution

SN - 1595935371

SN - 9781595935373

VL - 191

BT - ACM International Conference Proceeding Series

ER -