In this paper, we propose an adaptive self- stabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with commun...
—The connected dominating set (CDS) has been commonly used for routing and broadcast in mobile ad hoc networks (MANETs). Considering the applications of MANETs, it is generally p...
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
— The connected dominating set (CDS) has been extensively used for routing and broadcast in mobile ad hoc networks. While existing CDS protocols are successful in constructing CD...
Kazuya Sakai, Fangyang Shen, Kyoung Min Kim, Min-T...
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...