Abstract
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 due to the resource-restricted nature of wireless devices, such as sensor nodes, and the error-prone character of the communication medium. This work introduces and evaluates a new local, probabilistic self-stabilizing algorithm providing fault-tolerance and scalability for networks of high density.