## Coloring unstructured radio networks (2005)

### Cached

### Download Links

- [dcg.ethz.ch]
- [www.distcomp.ethz.ch]
- [distcomp.ethz.ch]
- [www.dcg.ethz.ch]
- [disco.ethz.ch]
- [www.disco.ethz.ch]
- [www.tik.ee.ethz.ch]
- [distcomp.ethz.ch]
- [www.research.microsoft.com]
- [www.research.microsoft.com]
- [dcg.ethz.ch]
- [research.microsoft.com]
- [www.research.microsoft.com]
- [disco.ethz.ch]
- [www.distcomp.ethz.ch]
- [www.dcg.ethz.ch]
- [www.disco.ethz.ch]
- [research.microsoft.com]
- [research.microsoft.com]

Citations: | 36 - 8 self |

### BibTeX

@MISC{Moscibroda05coloringunstructured,

author = {Thomas Moscibroda and Roger Wattenhofer},

title = { Coloring unstructured radio networks},

year = {2005}

}

### OpenURL

### Abstract

During and immediately after their deployment, ad hoc and sensor networks lack an efficient communication scheme rendering even the most basic network coordination problems difficult. Before any reasonable communication can take place, nodes must come up with an initial structure that can serve as a foundation for more sophisticated algorithms. In this paper, we consider the problem of obtaining a vertex coloring as such an initial structure. We propose an algorithm that works in the unstructured radio network model. This model captures the characteristics of newly deployed ad hoc and sensor networks, i.e. asynchronous wake-up, no collision-detection, and scarce knowledge about the network topology. When modeling the network as a graph with bounded independence, our algorithm produces a correct coloring with O(∆) colors in time O( ∆ log n) with high probability, where n and ∆ are the number of nodes in the network and the maximum degree, respectively. Also, the number of locally used colors depends only on the local node density. Graphs with bounded independence generalize unit disk graphs as well as many other well-known models for

### Citations

1474 | Energyefficient communication protocol for wireless microsensor networks
- Heinzelman, Chandrakasan, et al.
- 2000
(Show Context)
Citation Context ...ter their deployment. In view of its practical importance, it is not surprising that there has recently been a lot of effort in designing efficient algorithms for setting up initial structures, i.e., =-=[10, 28, 19, 16, 4]-=-. The unstructured radio network model was first proposed in [15] and subsequently improved and generalized in [16]. It is an adaptation of the classic radio network model (e.g., [2]), combining vario... |

1345 | Wireless Sensor Networks: A Survey
- Akyildiz, Su, et al.
- 2002
(Show Context)
Citation Context ...reless multi-hop networks. They allow to capture aspects such as obstacles, fading, or irregular signal-propagation. 1 Introduction Wireless multi-hop radio networks such as ad hoc or sensor networks =-=[1]-=- are formed of autonomous nodes communicating via radio. Typically, if two nodes are not within their mutual transmission range, they may communicate through intermediate nodes. In other words, the co... |

430 | KLEINROCK L.: Packet switching in radio channels: Part I – carrier sense multiple-access modes and their throughput delay characteristics - TOBAGI - 1975 |

419 | A Transmission Control Scheme for Media Access
- Woo, Culler
- 2001
(Show Context)
Citation Context ...ter their deployment. In view of its practical importance, it is not surprising that there has recently been a lot of effort in designing efficient algorithms for setting up initial structures, i.e., =-=[10, 28, 19, 16, 4]-=-. The unstructured radio network model was first proposed in [15] and subsequently improved and generalized in [16]. It is an adaptation of the classic radio network model (e.g., [2]), combining vario... |

385 | A simple parallel algorithm for the maximal independent set problem - Luby - 1986 |

329 |
Distributed computing – A locality-sensitive approach
- Peleg
- 2000
(Show Context)
Citation Context ...hat admit a coloring with less than ∆ + 1 colors. Finally, an experimental study of various vertex coloring algorithms is given in [5]. 3sAll the above algorithms are based on a message passing model =-=[25]-=- that abstracts away problems such as interference, collisions, asynchronity, or the hidden-terminal problem, which are crucial in the context of wireless ad hoc and sensor networks. Specifically, it ... |

198 |
Locality in distributed graph algorithms
- Linial
- 1992
(Show Context)
Citation Context ... to obtain a ∆ + 1 coloring in unit disk graphs and its generalization, the unit ball graph with constant doubling dimension. All these upper bounds are tight due to the seminal lower bound by Linial =-=[18]-=-, even for the case of randomized algorithms. For arbitrary graphs, a ∆ + 1-coloring can be computed in time O(log ∗ n + ∆ 2 ) [24] or O(∆ log n) [7]. The authors of [9] present distributed approaches... |

113 |
Deterministic coin tossing with applications to optimal parallel list ranking
- Cole, Vishkin
- 1986
(Show Context)
Citation Context ... this precludes algorithms working under any sort of message passing model in which nodes know their neighbors a-priori, and in which messages can be sent to neighbors without fearing collision, e.g. =-=[3, 8, 24]-=-. Studying classic network coordination problems such as coloring in absence of an established MAC layer highlights the chicken-and-egg problem of the initialization phase [15]. A MAC layer (“chicken”... |

84 |
On the Time-Complexity of broadcast in radio networks: an exponential gap between determinism randomization
- Bar-Yehuda, Goldreich, et al.
- 1987
(Show Context)
Citation Context ..., [10, 28, 19, 16, 4]. The unstructured radio network model was first proposed in [15] and subsequently improved and generalized in [16]. It is an adaptation of the classic radio network model (e.g., =-=[2]-=-), combining various of its flavors in order to model the harsh conditions during and immediately after the deployment. In [16], an algorithm is proposed that efficiently computes a minimum dominating... |

83 | Birthday Protocols for Low Energy Deployment and Flexible Neighbor Discovery in Ad Hoc Wireles Networks
- McGlynn, Borbash
(Show Context)
Citation Context ...infrastructure as in traditional wired networks. The lack of available a-priori infrastructure is particularly pronounced during and after the deployment, when the network is unstructured and chaotic =-=[15, 16, 19]-=-. Before any reasonable communication can be carried out and before the network can start performing its intended task, the nodes must establish some kind of structure that allows an efficient communi... |

76 | Models and approximation algorithms for channel assignment in radio networks
- Krumke, Marathe, et al.
- 2001
(Show Context)
Citation Context ...e an entirely collision-free schedule in wireless networks, a correct vertex coloring is not sufficient, for what is needed is a coloring of the square of the graph, i.e., a valid distance 2-coloring =-=[14, 26]-=-. However, besides being a non-trivial first step towards obtaining a distance 2-coloring, a simple vertex-coloring ensures a schedule in which a receiver can be disturbed by at most (a small) constan... |

73 | Parallel symmetry-breaking in sparse graphs
- Goldberg, Plotkin, et al.
- 1988
(Show Context)
Citation Context ...re tight due to the seminal lower bound by Linial [18], even for the case of randomized algorithms. For arbitrary graphs, a ∆ + 1-coloring can be computed in time O(log ∗ n + ∆ 2 ) [24] or O(∆ log n) =-=[7]-=-. The authors of [9] present distributed approaches for finding colorings in graphs that admit a coloring with less than ∆ + 1 colors. Finally, an experimental study of various vertex coloring algorit... |

71 |
Packet Switching in Radio Channels
- Tobagi, Kleinrock
- 1975
(Show Context)
Citation Context ...zed between all nodes. This assumption is used merely for the purpose of facilitating the analysis, i.e., our algorithm does not rely on this assumption in any way (see the standard argument given in =-=[27]-=-), as long as the nodes’ internal clock runs at the same speed. 5sIn each time slot, a node can either transmit or not transmit. If a node transmits in a time slot t, it cannot receive any messages in... |

56 |
On the Locality of Bounded Growth
- Kuhn, Moscibroda, et al.
- 2005
(Show Context)
Citation Context ...[3]. A generalization of the same technique can be used to color trees and arbitrary bounded-degree graphs with 3 and ∆ + 1 colors in time O(log ∗ n), respectively [8]. Recently, it has been shown in =-=[17]-=- that a running time of O(log ∗ n) also suffices to obtain a ∆ + 1 coloring in unit disk graphs and its generalization, the unit ball graph with constant doubling dimension. All these upper bounds are... |

55 | Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
- Jurdzinski, Stachowiak
- 2002
(Show Context)
Citation Context ...alistic to assume that some nodes wake up (e.g. become deployed, or switched on) later than others. Thus, nodes do not have access to a global clock. Contrary to work on the so-called wake-up problem =-=[6, 13]-=-, nodes are not woken up by incoming messages, that is, sleeping nodes do neither send nor receive any messages. Finally, the node’s wake-up pattern can be 2scompletely arbitrary. • Nodes do not featu... |

55 | A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs - Schneider, Wattenhofer - 2008 |

53 | Initializing newly deployed ad hoc and sensor networks
- Kuhn, Moscibroda, et al.
- 2007
(Show Context)
Citation Context ...lot (and if it is not sending itself). The message size in our model is limited to O(log n) bits per message. Further, notice that in contrast to previous work on the unstructured radio network model =-=[15, 16]-=-, we do not make the simplifying assumption of having several independent communication channels. In our model, there is only one communication channel. Every node has a unique identifier, which does ... |

47 | D.: The Wakeup Problem in Synchronous Broadcast Systems
- Ga̧sieniec, Pelc, et al.
(Show Context)
Citation Context ...alistic to assume that some nodes wake up (e.g. become deployed, or switched on) later than others. Thus, nodes do not have access to a global clock. Contrary to work on the so-called wake-up problem =-=[6, 13]-=-, nodes are not woken up by incoming messages, that is, sleeping nodes do neither send nor receive any messages. Finally, the node’s wake-up pattern can be 2scompletely arbitrary. • Nodes do not featu... |

44 | Protocol design beyond graph-based models - Moscibroda, Wattenhofer, et al. - 2006 |

35 | Maximal Independent Sets in Radio Networks
- Moscibroda, Wattenhofer
- 2005
(Show Context)
Citation Context ...r to model the harsh conditions during and immediately after the deployment. In [16], an algorithm is proposed that efficiently computes a minimum dominating set approximation from scratch. The paper =-=[21]-=- goes one step further by giving an algorithm for computing a maximal independent set in the unstructured radio network model in time O(log 2 n). Finally, notice that the recently proposed weak sensor... |

33 |
Some simple distributed algorithms for sparse networks
- Panconesi, Rizzi
(Show Context)
Citation Context ... this precludes algorithms working under any sort of message passing model in which nodes know their neighbors a-priori, and in which messages can be sent to neighbors without fearing collision, e.g. =-=[3, 8, 24]-=-. Studying classic network coordination problems such as coloring in absence of an established MAC layer highlights the chicken-and-egg problem of the initialization phase [15]. A MAC layer (“chicken”... |

29 | Contention-Free MAC Protocols for Wireless Sensor Networks - Busch, Magdon-Ismail, et al. - 2004 |

23 | Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms
- Finocchi, Panconesi, et al.
- 2002
(Show Context)
Citation Context ... [9] present distributed approaches for finding colorings in graphs that admit a coloring with less than ∆ + 1 colors. Finally, an experimental study of various vertex coloring algorithms is given in =-=[5]-=-. 3sAll the above algorithms are based on a message passing model [25] that abstracts away problems such as interference, collisions, asynchronity, or the hidden-terminal problem, which are crucial in... |

23 | Energy-Efficient Size Approximation for Radio Networks with no Collision Detection
- Jurdziński, Kutyłowski, et al.
(Show Context)
Citation Context ...on that nodes know an estimate of n and ∆. In single-hop radio networks with synchronous wake-up, there are efficient methods enabling nodes to approximately count the number of their neighbors, e.g. =-=[11]-=-. If such techniques could be adapted to an asynchronous multi-hop scenario, nodes might be able to estimate the local maximum degree, which could then be used instead of ∆ throughout the algorithm. 7... |

23 | Approximation algorithms for channel assignment in radio networks
- Krumke, Marathe, et al.
- 1998
(Show Context)
Citation Context ...e an entirely collision-free schedule in wireless networks, a correct vertex coloring is not sufficient, for what is needed is a coloring of the square of the graph, i.e., a valid distance 2-coloring =-=[14, 26]-=-. However, besides being a non-trivial first step towards obtaining a distance 2-coloring, a simple vertex-coloring ensures a schedule in which a receiver can be disturbed by at most (a small) constan... |

17 | Radio network clustering from scratch
- Kuhn, Moscibroda, et al.
- 2004
(Show Context)
Citation Context ...infrastructure as in traditional wired networks. The lack of available a-priori infrastructure is particularly pronounced during and after the deployment, when the network is unstructured and chaotic =-=[15, 16, 19]-=-. Before any reasonable communication can be carried out and before the network can start performing its intended task, the nodes must establish some kind of structure that allows an efficient communi... |

17 | Analyzing the energy-latency trade-off during the deployment of sensor networks - Moscibroda, Rickenbach, et al. |

14 | Fast distributed algorithms for Brooks-Vizing colorings
- Panconesi
(Show Context)
Citation Context ...seminal lower bound by Linial [18], even for the case of randomized algorithms. For arbitrary graphs, a ∆ + 1-coloring can be computed in time O(log ∗ n + ∆ 2 ) [24] or O(∆ log n) [7]. The authors of =-=[9]-=- present distributed approaches for finding colorings in graphs that admit a coloring with less than ∆ + 1 colors. Finally, an experimental study of various vertex coloring algorithms is given in [5].... |

12 | Bootstrapping a hop-optimal network in the weak sensor model
- Farach-Colton, Fernandes, et al.
- 2005
(Show Context)
Citation Context ...ter their deployment. In view of its practical importance, it is not surprising that there has recently been a lot of effort in designing efficient algorithms for setting up initial structures, i.e., =-=[10, 28, 19, 16, 4]-=-. The unstructured radio network model was first proposed in [15] and subsequently improved and generalized in [16]. It is an adaptation of the classic radio network model (e.g., [2]), combining vario... |

11 | Parallel (∆+1)-coloring of constant-degree graphs - Goldberg, Plotkin - 1987 |

8 |
S.: Energy-efficient initialization protocols for single-hop radio networks with no collision detection
- Nakano, Olariu
- 2000
(Show Context)
Citation Context ... within mutual transmission range of all other nodes (single-hop networks) reduces to the so-called initialization problem. This problem has been feverously studied and analyzed during the past years =-=[22, 23]-=-. For several reasons, the approach taken in these papers cannot be translated into efficient algorithms for the unstructured radio network model. First and foremost, the multi-hop character of our ne... |

7 |
Randomized Initialization Protocols for Radio networks
- Nakano, Olariu
(Show Context)
Citation Context ... within mutual transmission range of all other nodes (single-hop networks) reduces to the so-called initialization problem. This problem has been feverously studied and analyzed during the past years =-=[22, 23]-=-. For several reasons, the approach taken in these papers cannot be translated into efficient algorithms for the unstructured radio network model. First and foremost, the multi-hop character of our ne... |

3 |
Weak Communication in Radio Networks
- Jurdzinski, Kutylowski, et al.
- 2002
(Show Context)
Citation Context ...ion and do not receive the message. This difference renders it impossible for nodes to keep a coherent picture of the local situation. Secondly, most initialization papers assume strong communication =-=[12]-=-, that is, a sending node can distinguish whether its message was successfully received by all nodes or whether it has caused a collision. In a multi-hop scenario, this assumption makes little sense. ... |

3 | Weak communication in radio networks
- Jurdzinski, Kutylowski, et al.
- 2002
(Show Context)
Citation Context ...ion and do not receive the message. This difference renders it impossible for nodes to keep a coherent picture of the local situation. Secondly, most initialization papers assume strong communication =-=[12]-=-, that is, a sending node can distinguish whether its message was successfully received by all nodes or whether it has caused a collision. In a multi-hop scenario, this assumption makes little sense. ... |

1 |
Scheduling algorithms for multihhop radio networks
- Ramanathan, Lloyd
- 1992
(Show Context)
Citation Context ...e an entirely collision-free schedule in wireless networks, a correct vertex coloring is not sufficient, for what is needed is a coloring of the square of the graph, i.e., a valid distance 2-coloring =-=[14, 26]-=-. However, besides being a non-trivial first step towards obtaining a distance 2-coloring, a simple vertex-coloring ensures a schedule in which a receiver can be disturbed by at most (a small) constan... |