Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
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) Distance-2 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(Δ log 2 n) and the latter runs in time O(log 2 n). The two algorithms differ in the amount of local topology information available to the network nodes.
Our algorithms are geared at constructing Well Connected Dominating Sets (WCDS) which have certain powerful and useful structural properties such as low size, low stretch and low degree. In this work, we also explore the rich connections between WCDS and routing in ad hoc networks. Specifically, we combine the properties of WCDS with other ideas to obtain the following interesting applications:
An online distributed algorithm for collision-free, low latency, low redundancy and high throughput broadcasting.
Distributed capacity preserving backbones for unicast routing and scheduling.
KeywordsTime Slot Channel Assignment Unit Disk Graph Broadcast Algorithm Virtual Backbone
Unable to display preview. Download preview PDF.
- 1.Alzoubi, K.M.: Connected dominating set and its induced position-less sparse spanner for mobile ad hoc networks. In: Proceedings of the Eighth IEEE Symposium on Computers and Communications (June 2003)Google Scholar
- 2.Alzoubi, K.M., Wan, P.-J., Frieder, O.: Distributed heuristics for connected dominating sets in wireless ad hoc networks. IEEE ComSoc/KICS Journal on Communication Networks 4, 22–29 (2002)Google Scholar
- 3.Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message efficient construction of nontrivial connected dominating sets in wireless ad hoc networks. To appear in Special Issue of ACM Journal of Monet (2002)Google Scholar
- 4.Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks. In: Proceedings of the Third ACM International Symposium on Mobile Ad Hoc Networking and Computing (June 2002)Google Scholar
- 5.Alzoubi, K.M., Wan, P.-J., Frieder, O.: New distributed algorithm for connected dominating set in wireless ad hoc networks. In: IEEE HICSS35 (2002)Google Scholar
- 6.Cheng, X., Huang, X., Li, D., Du, D.-Z.: Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Technical reportGoogle Scholar
- 8.Das, B., Sivakumar, R., Bharghavan, V.: Routing in ad-hoc networks using a virtual backbone. In: 6th International Conference on Computer Communications and Networks IC3N 1997 (September 1997), pp. 1–20 (1997)Google Scholar
- 9.Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. ICC 1, 376–380 (1997)Google Scholar
- 13.Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: End-to-End Packet Scheduling in Ad Hoc Networks. To appear in ACM SODA (2004)Google Scholar
- 19.Sen, A., Melesinska, E.: On approximation algorithms for radio network scheduling. In: Proceedings of the 35th Allerton Conference on Communication, Control and Computing, pp. 573–582 (1997)Google Scholar
- 20.Sivakumar, R., Das, B., Bharghavan, V.: Spine routing in ad hoc networks. ACM/Baltzer Cluster Computing Journal (special issue on Mobile Computing) (1998)Google Scholar
- 21.Wan, P.-J., Alzoubi, K., Frieder, O.: Distributed construction of connnected dominating set in wireless ad hoc networks. In: IEEE INFOCOM (2002)Google Scholar