Backbone-based Scheduling for Data Dissemination in Wireless Sensor Networks with Mobile Sinks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

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.
Fichier principal
Vignette du fichier
RR_BSDD.pdf (812.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00164291 , version 1 (19-07-2007)

Identifiers

  • HAL Id : inria-00164291 , version 1

Cite

Yu Chen, Eric Fleury. Backbone-based Scheduling for Data Dissemination in Wireless Sensor Networks with Mobile Sinks. [Research Report] 2007. ⟨inria-00164291⟩
60 View
32 Download

Share

Gmail Facebook X LinkedIn More