"Hierarchical routing in sensor networks using κ-dominating sets "
Rieck, Michael Q.
MetadataShow full item record
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  and . 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.
Showing items related by title, author, creator and subject.
Dhar, Subhankar; Rieck, Michael Q.; Pai, Sukesh; Kim, Eun Jik (Elsevier Science, 2004-10)In this paper, we propose several new distributed algorithms for producing sets of nodes that can be used to form backbones of an ad hoc wireless network. Our focus is on producing small sets that are d-hop connected and ...
"Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets" Rieck, Michael Q.; Pai, Sukesh; Dhar, Subhankar (Elsevier Science, Inc., 2005-04-22)This paper describes a distributed algorithm (generalized d-CDS) for producing a variety of d-dominating sets of nodes that can be used to form the backbone of an ad hoc wireless network. In special cases (ordinary d-CDS), ...
Manley, Eric D.; Deogun, Jitender S.; Xu, Lisong; Alexander, Dennis R. (2010-04)In this paper, we investigate the application of network coding to all-optical networks from both the algorithmic and infrastructural perspectives. We study the effectiveness of using network coding for optical-layer ...