Energy efficient algorithms for static ad hoc wireless networks

Network lifetime in terms of connectivity, depends upon the average battery lifetime. The battery life decrease very fast if the transmission ranges of sensors are very large. Global connectivity, in the network may, not be guaranteed if the transmission power is low. The paper presented O(n log n) algorithms that keep the distance small enough among terminals to maintain the energy efficient topology. As a result, network consumes less energy, which increases the network lifetime in terms of connectivity. 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.