Backbone-based Scheduling for Data Dissemination in Wireless Sensor Networks with Mobile Sinks
Abstract
We consider sensor networks for monitoring tasks, where data of each stimulus is required to be collected by at least one of potentially multiple, mobile nodes, called sinks. We propose a backbone-based scheduling that achieves fast data dissemination. The proposed schedules can also be used for general communication that reles on backbone structures. Theoretical analyses are presented and we show that our scheme is asymptotically optimal for networks with certain properties. We also propose for loop-free routing protocols a scheme to update routing state, which handles sink mobility with a small overhead; the routing links updated are confined within those incident to sensor nodes in paths connecting the old and new positions of sinks.
Origin : Files produced by the author(s)