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 increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...