Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
verfasst von : Michael Q. Rieck, Subhankar Dhar
Erschienen in: Distributed Computing – IWDC 2005
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, called
k
-SPR sets. Such a set can serve as a virtual backbone to facilitate shortest path routing, as introduced in [4] and [14]. When employed in a hierarchical fashion, together with a hybrid (partly proactive, partly reactive) strategy, the
k
-SPR set methods become highly scalable, resulting in guaranteed minimal path routing, with comparatively little overhead.