Approximation Algorithm for Base Station Placement in Wireless Sensor Networks

Base station location has significant impact on network lifetime performance for a sensor network. For a multi- hop sensor network, this problem is particular challenging as we need to jointly consider base station placement and data routing strategy to maximize network lifetime performance. This paper presents an approximation algorithm that can guarantee (1 - epsiv) optimal network lifetime performance for base station placement problem with any desired error bound epsiv > 0. The proposed (1 - epsiv) optimal approximation algorithm is based on several novel techniques that enable to reduce an infinite search space to a finite-element search space for base station location. The first technique used in this reduction is to discretize cost parameters (with performance guarantee) associated with energy consumption. Subsequently, the continuous search space can be broken up into a finite number of subareas. The second technique is to exploit the cost property of each subarea and represent it by a novel notion called "fictitious cost point," each with guaranteed cost bounds. This approximation algorithm offers a simpler and in most cases practically faster algorithm than a state-of-the-art algorithm and represents the best known result to this important problem.

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

[2]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

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

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

[5]  Hanif D. Sherali,et al.  Prolonging sensor network lifetime with energy provisioning and relay node placement , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[6]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[7]  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.

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

[9]  Jianping Pan,et al.  Topology control for wireless sensor networks , 2003, MobiCom '03.

[10]  Krishnendu Chakrabarty,et al.  Sensor placement for effective coverage and surveillance in distributed sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[11]  Hossam S. Hassanein,et al.  Relay node deployment strategies in heterogeneous wireless sensor networks: multiple-hop communication case , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[12]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[13]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Jie Wu,et al.  SMART: a scan-based movement-assisted sensor deployment method in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

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

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

[18]  Wendi B. Heinzelman,et al.  Application-specific protocol architectures for wireless networks , 2000 .