Efficient energy balancing aware multiple base station deployment for WSNs

Authors:
Sabbir Mahmud;Hui Wu;Jingling Xue
Affiliations:
School of Computer Science and Engineering, The University of New South Wales, Australia;School of Computer Science and Engineering, The University of New South Wales, Australia;School of Computer Science and Engineering, The University of New South Wales, Australia
Venue:
EWSN'11 Proceedings of the 8th European conference on Wireless sensor networks
Year:
2011

Citing 5
Cited 2

Handbook of computational geometry

Handbook of computational geometry
Collaborative in-network processing for target tracking

EURASIP Journal on Applied Signal Processing
Radio range adjustment for energy efficient wireless sensor networks

Ad Hoc Networks
Optimal multi-sink positioning and energy-efficient routing in wireless sensor networks

ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
On energy provisioning and relay node placement for wireless sensor networks

IEEE Transactions on Wireless Communications

A 2-approximation algorithm for optimal deployment of k base stations in WSNs

IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Lifetime aware deployment of k base stations in WSNs

Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Energy reduction is one of the major problems in the design of a wireless sensor network (WSN). Multiple base stations can be used to dramatically reduce the energy consumption of sensor nodes. We consider the following problem of deploying k base stations in a wireless sensor network: Given a wireless sensor network where the location of each sensor node is known, partition the whole sensor network into k disjoint clusters and place one base station for each cluster such that the maximum total energy consumption of any cluster is minimised. We propose the first heuristic for this problem. The time complexity of our heuristic is O(kn3), where n is the number of sensor nodes of the sensor network. In the special case where k is equal to 1, we propose a quadratic-time algorithm for optimally deploying the base station. Our simulation results show that our heuristic is efficient.