Distributed construction of connected dominating set in unit disk graphs

We also propose a scheduling scheme that obtains O(Δ) conflict-free time slots to deal with interference.