Algorithm design for base station placement problems in sensor networks

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.

[1]  Xue Zhang,et al.  Topology Control for Wireless Sensor Networks , 2007 .

[2]  Konstantinos Kalpakis,et al.  Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks , 2003, Comput. Networks.

[3]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[4]  Ellen W. Zegura,et al.  The energy-limited capacity of wireless networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[5]  Andrej Bogdanov,et al.  Power-aware base station positioning for sensor networks , 2004, IEEE INFOCOM 2004.

[6]  Hanif D. Sherali,et al.  Rate allocation in wireless sensor networks with network lifetime requirement , 2004, MobiHoc '04.

[7]  Qi Zhang,et al.  Maximum flow-life curve for a wireless ad hoc network , 2001, MobiHoc '01.

[8]  Stavros Toumpis,et al.  Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid , 2004, MobiHoc '04.

[9]  Jennifer C. Hou,et al.  On deriving the upper bound of α-lifetime for large sensor networks , 2004, MobiHoc '04.

[10]  Konstantinos Kalpakis,et al.  MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS , 2002 .

[11]  Anantha Chandrakasan,et al.  Bounding the lifetime of sensor networks via optimal role assignments , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Mingyan Liu,et al.  On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of Its Data , 2003, IPSN.

[13]  Joseph S. B. Mitchell,et al.  Approximation algorithms for location problems in sensor networks. , 2005 .

[14]  Bhaskar Krishnamachari,et al.  Maximizing Data Extraction in Energy-Limited Sensor Networks , 2005, Int. J. Distributed Sens. Networks.