A 2-Approximation Algorithm for Optimal Deployment of k Base Stations in WSNs

Abstract

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 log n), 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.

Lifetime aware deployment of k base stations in WSNs

“…Their heuristic uses a greedy approach to create k initial clusters, and repeatedly moves a sensor node from a cluster with higher total energy consumption to a cluster with lower total energy consumption until all clusters become balanced. [20] proposes a 2-approximation algorithm and a heuristic for the problem of deploying k base stations such that the maximum shortest hop distance between all the sensor nodes to their nearest base stations is minimised. [18] proposes an algorithm and a heuristic for placing k base stations in an optimal way such that the average Euclidean distance between the sensor nodes and their base stations is minimised.…”