Now showing items 1-3 of 3
"Hierarchical routing in sensor networks using κ-dominating sets "
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 ...
"Distributed routing schemes for ad hoc networks using d-SPR sets"
(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"
(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), ...