A Voronoi Diagram Approach for Mobile Element Scheduling in Sparse Sensor Networks

Author

Yu, Ruiyun ; Wang, Xingwei ; Das, Sajal K.

Author_Institution

Comput. Center, Northeastern Univ., Shenyang, China

Volume

1

fYear

2008

fDate

13-15 Dec. 2008

Firstpage

62

Lastpage

67

Abstract

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.

Keywords

computational geometry; mobile radio; scheduling; wireless sensor networks; Voronoi diagram approach; Voronoi vertices; iterative virtual site insertion; mobile element scheduling; relaying data; sparse sensor networks; Bridges; Data engineering; Educational programs; Mobile communication; Mobile computing; Partitioning algorithms; Processor scheduling; Relays; Routing; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Future Generation Communication and Networking, 2008. FGCN '08. Second International Conference on

Conference_Location

Hainan Island

Print_ISBN

978-0-7695-3431-2

Type

conf

DOI

10.1109/FGCN.2008.159

Filename

4734058