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...
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...