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 Scopus citations

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
Publication statusPublished - 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

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