Advertisement
Published in:
2005 | OriginalPaper | Chapter
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
Authors : Michael Q. Rieck, Subhankar Dhar
Published in: Distributed Computing – IWDC 2005
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.