In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
—In this paper, we investigate the transmission-power assignment problem for k-connected mobile ad hoc networks (MANETs), the problem of optimizing the lifetime of a MANET at a g...
Oliviero Riganelli, Radu Grosu, Samir R. Das, C. R...
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
Minimal configuration and quick deployment of ad hoc networks make it suitable for numerous applications such as emergency situations, border monitoring, and military missions, e...
Abstract--In this paper, we investigate the problem of optimizing the lifetime of a mobile ad hoc network at a given degree k of connectivity by minimizing power consumption. Our p...