Mobile Relay arrangement in Wireless Sensor Networks

Abstract

Wireless sensor Networks (WSNs) are more and more used in data-intensive applications like micro-climate monitoring, exactness agriculture, and audio/video police investigation. A key challenge faced by data-intensive WSNs is to transmit all the information generated within an application’s lifetime to the base station despite the actual fact that sensor nodes have restricted power supplies. We propose using low-cost disposable mobile relays to reduce the energy consumption of data-intensive WSNs. Our approach differs from previous add 2 main aspects. First, it doesn't need complicated motion planning of mobile nodes, so it can be enforced on variety of low-cost mobile sensor platforms. Second, we have a tendency to integrate the energy consumption owing to each mobility and wireless transmissions into a holistic improvement framework. Our framework consists of 3 main algorithms. The first algorithmic program computes an optimal routing tree assuming no nodes can move. The second algorithmic program improves the topology of the routing tree by greedily adding new nodes exploiting mobility of the newly extra nodes. The third algorithmic program improves the routing tree by relocating its nodes without dynamic its topology. This iterative algorithmic program converges on the optimum position for every node given the constraint that the routing tree topology doesn't change. We present efficient distributed implementations for each algorithmic program that need only restricted, localized synchronization. as a result of we have a tendency to don't necessarily compute an optimum topology, our final routing tree isn't essentially optimum. However, our simulation results show that our algorithms considerably outperform the best existing solutions.