Chapter

Computational Science and Its Applications – ICCSA 2009

Volume 5593 of the series Lecture Notes in Computer Science pp 361-371

On Relocation of Hopping Sensors for Balanced Migration Distribution of Sensors

  • Moonseong KimAffiliated withDepartment of Computer Science and Engineering, Michigan State University
  • , Matt W. MutkaAffiliated withDepartment of Computer Science and Engineering, Michigan State University

Abstract

When some sensors in Wireless Sensor Networks (WSNs) fail or become energy-exhausted, redundant mobile sensors might be moved to cover the sensing holes created by the failed sensors. Within rugged terrains where wheeled sensors are unsuitable, other types of mobile sensors, such as hopping sensors, are needed. In this paper, we address the problem of relocating hopping sensors to the detected sensing holes. The recently studied tendency for this problem considered the shortest path to relocate the sensors; however, even when multiple suppliers are considered, the previous works merely use the shortest path algorithm repeatedly. As a result, the migration distribution is imbalanced, since specific clusters on the obtained paths could be used repeatedly. In this paper, we first analyze the impact of using multiple suppliers to relocate the hopping sensors, and propose a Relocation Algorithm using the Most Disjointed Paths (RAMDiP). Simulation results show that the proposed RAMDiP guarantees a balanced movement of hopping sensors and higher movement success ratio of requested sensors than those of the representative relocation scheme, MinHopExt.

Keywords

Mobile Sensors Hopping Sensors Relocation Wireless Sensor Networks (WSNs)