A Voronoi Diagram Approach for Mobile Element Scheduling in Sparse Sensor Networks
Ruiyun Yu, Xingwei Wang, Sajal Kumar Das · 2008
Relaying data with the help of mobile elements seems an effective way to bridge the gaps in sparse sensor networks. In this paper, we propose the Voronoi-diagram-based mobile element scheduling (VDMES) algorithm to construct the shortest possible path for mobile elements. The mobile elements are scheduled to visit a small subset of Voronoi vertices rather than the sensor nodes, which is carefully constructed through iterative virtual site insertion, and exactly covers all sensor nodes in a given transmission radius. The path concatenating the Voronoi vertices is much shorter than that formed by regular sensor nodes.