Effective initial route construction for mobile relay on wireless sensor network

Abstract

In recent years, mobile relay has been studied in order to reduce the energy consumption in WSN El-Moukaddem et al. (Mobile Relay Configuration in Data-intensive Wireless Sensor Networks, 2009). The concept of mobile relay is that some movable nodes change their location so as to minimize the total energy consumed by both wireless transmission and locomotion. Mobile relay needs to determine an initial route that represents the sequence of relaying nodes. We have already proposed several initial route construction algorithms based on greedy approaches Shigei et al. (IAENG Int J Comput Sci 39: 321–328, 2012), Yudo et al. (Battery-Aware Initial Route Construction for Mobile Relay on Wireless Sensor Network, 2012). However, the conventional method cannot always provide optimal routes, because they do not examine all the possible routes. In this paper, we propose a battery-aware initial route construction method based on Dijkstra’s algorithm (BAIR-D), which utilizes the node information outside of the direct communication range. The algorithm has a capability to examine all the possible routes. We show the effectiveness by numerical simulation.