Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks

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 Unit Disk Graphs which are known to realistically model wireless networks. Our distributed algorithms take into account the loss of messages due to contention from simultaneous interfering transmissions in the wireless medium. We present randomized distributed algorithms for (conflict-free) Distance2 coloring, dominating set construction, and connected dominating set construction in Unit Disk Graphs. The coloring algorithm has a time complexity of O(∆ log2 n) and is guaranteed to use at most O(1) times the number of colors required by the optimal algorithm. We present two distributed algorithms for constructing the (connected) dominating set; the former runs in time O(∆ log2 n) and the latter runs in time O(log2 n). The two algorithms differ in the amount of local topology information available to the ne...

• Type: Conference
• Year: 2004
• Where: FSTTCS
• Authors: Srinivasan Parthasarathy 0002, Rajiv Gandhi
• Keywords: Connected Dominating Sets, Distributed Algorithm, Dominating Sets, FSTTCS 2004