"Hierarchical routing in sensor networks using κ-dominating sets "
| Title: | "Hierarchical routing in sensor networks using κ-dominating sets " |
| Author: | Rieck, Michael Q.; Dhar, Subhankar |
| Abstract: | 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 κ-SPR set methods become highly scalable, resulting in guaranteed minimal path routing, with comparatively little overhead. © Springer-Verlag Berlin Heidelberg 2005. |
| Description: | Michael Q. Rieck is Associate Professor of Computer Science in the Department of Math and Computer Science at Drake University. He can be contacted at michael.rieck@drake.edu |
| URI: | http://hdl.handle.net/2092/409 |
| Date: | 2005 |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| rieck1.pdf | 164.1Kb |
View/ |
The following license files are associated with this item:
This item appears in the following Collection(s)
-
Mathematics and Computer Science [5]
Publications and research submitted by the faculty members of the Department of Mathematics and Computer Science.