On Deployment of Multiple Base Stations for Energy-Efficient Communication in Wireless Sensor Networks

Data transmission from sensor nodes to a base station or a sink node often incurs significant energy consumption, which critically affects network lifetime. We generalize and solve the problem of deploying multiple base stations to maximize network lifetime in terms of two different metrics under one-hop and multihop communication models. In the one-hop communication model, the sensors far away from base stations always deplete their energy much faster than others. We propose an optimal solution and a heuristic approach based on the minimal enclosing circle algorithm to deploy a base station at the geometric center of each cluster. In the multihop communication model, both base station location and data routing mechanism need to be considered in maximizing network lifetime. We propose an iterative algorithm based on rigorous mathematical derivations and use linear programming to compute the optimal routing paths for data transmission. Simulation results show the distinguished performance of the proposed deployment algorithms in maximizing network lifetime.

[1]  Jianping Pan,et al.  Optimal base-station locations in two-tiered wireless sensor networks , 2005, IEEE Transactions on Mobile Computing.

[2]  Wendi Heinzelman,et al.  Proceedings of the 33rd Hawaii International Conference on System Sciences- 2000 Energy-Efficient Communication Protocol for Wireless Microsensor Networks , 2022 .

[3]  Cem Ersoy,et al.  Multiple sink network design problem in large scale wireless sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[4]  N. Megiddo Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[5]  Sandip Das,et al.  Efficient algorithm for placing a given number of base stations to cover a convex region , 2006, J. Parallel Distributed Comput..

[6]  Yiwei Thomas Hou,et al.  Approximation Algorithm for Base Station Placement in Wireless Sensor Networks , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

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

[8]  Sanjay Jha,et al.  Deploying long-lived and cost-effective hybrid sensor networks , 2006, Ad Hoc Networks.

[9]  Rolland Vida,et al.  Deploying Multiple Sinks in Multi-hop Wireless Sensor Networks , 2007, IEEE International Conference on Pervasive Services.

[10]  Richard C. T. Lee,et al.  The slab dividing approach to solve the EuclideanP-Center problem , 2005, Algorithmica.

[11]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[12]  Zvi Drezner,et al.  The p-Centre Problem—Heuristic and Optimal Algorithms , 1984 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[15]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[16]  Milind Dawande,et al.  Energy efficient schemes for wireless sensor networks with multiple mobile base stations , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).