Deterministic Energy Conserving Algorithms for Wireless Sensor Networks

In this paper we study the problem of maintaining energy efficient topology from the perspective of computational geometry. The paper presented two algorithms that keep the distance small enough among sensors to maintain energy efficient topology. In the design of wireless sensor network, we are given n sensors in the Euclidean plane. The problem is how to increase the network lifetime by choosing the locations of relay sensors such that the distances between sensors are at most some delta i.e., the range of the sensors. The algorithm efficiently combines the classical approach of Steiner tree for 3- and 4-terminals with the concepts based on the Prim´s and Kruskal´s algorithms. The quantitative analysis shows that after the application of the algorithm the network consumes ((1/2)n + O(n^3/2)) less energy