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

Authors:
Hui Wu;Sabbir Mahmud
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
Venue:
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Year:
2012

Citing 10
Cited 1

Unit disk graphs

Discrete Mathematics - Topics on domination
Handbook of computational geometry

Handbook of computational geometry
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimizing the Placement of Internet TAPs in Wireless Neighborhood Networks

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Collaborative in-network processing for target tracking

EURASIP Journal on Applied Signal Processing
Optimal base station placement in wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
Radio range adjustment for energy efficient wireless sensor networks

Ad Hoc Networks
Efficient energy balancing aware multiple base station deployment for WSNs

EWSN'11 Proceedings of the 8th European conference on Wireless sensor 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

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

We study the problem of deploying k base stations in a wireless sensor network such that the maximum shortest hop distance from all the sensor nodes to their designated base stations is minimised. We propose a 2-approximation algorithm for this problem, and prove that a (2−ε )-approximation algorithm does not exist unless P =NP holds. The time complexity of our 2-approximation algorithm is O (n 2 logn ), where n is the number of sensor nodes of the wireless sensor network. In the special case where k is 1, we propose an O (n 2) time algorithm that is guaranteed to find the optimal location of the base station. Furthermore, we show that our previous heuristic for balancing clusters of sensors can be modified to significantly improve the performance of our 2-approximation algorithm.