#### DMCA

## Towards Optimal TDMA Frame Size in Wireless Sensor Networks

Citations: | 4 - 0 self |

### Citations

467 | The flooding time synchronization protocol
- Maróti, Kusy, et al.
- 2004
(Show Context)
Citation Context ...sidered as neighbors. However, there are various solutions to these issues. Clock drifting can be handled by a buffer at the beginning of a slot (other proposals to deal with clock drifting appear in =-=[16]-=-). Topological flexibility can be introduced by having nodes recolor at random intervals. A major distinction among the various graph coloring based algorithms that we examine is where the coloring de... |

293 | Z-MAC: a hybrid MAC for wireless sensor networks
- Rhee, Warrier, et al.
- 2008
(Show Context)
Citation Context ...wer benefit of using TDMA protocols because nodes can turn off their radios when they are not scheduled to send or receive. While some MAC protocols that use TDMA strategies allow for some collisions =-=[14]-=-, [15], all of the graph coloring MAC protocols that we consider generate conflict free schedules. As noted in [2], there are drawbacks and challenges to TDMA scheduling for WSN’s in terms of clock dr... |

150 | A unified framework and algorithm for channel assignment in wireless networks,
- Ramanathan
- 1999
(Show Context)
Citation Context ... to color themselves. In most cases, we would expect better performance from a centralized algorithm, as it has more information with which to work. However, some centralized algorithms, such as RAND =-=[17]-=-, do not make use of a priori information. Distributed algorithms are applicable on a wider variety of applications when centralized knowledge of topology is not possible. A. Centralized In [17] the a... |

137 |
Introduction to Graph Theory, 2nd ed
- West
- 2001
(Show Context)
Citation Context ...just use χ. There is a large body of research on the chromatic number of graphs. The computational complexity of finding the optimal solution is proven to be NP-hard and χ is bounded by ω ≤ χ ≤ ∆ + 1 =-=[5]-=-, where ω is the maximum clique size in the graph, and ∆ is the maximum degree of any vertex of the graph, (see Table I for a summary of notation). For any greedy coloring algorithm, the worst case nu... |

98 | DRAND: Distributed Randomized TDMA Scheduling forWirelessAd Hoc Networks
- Rhee, Warrier, et al.
- 2006
(Show Context)
Citation Context ...mply the possibility of quicker rates for receipt of periodic data collection. Recently, there has been research into applying graph coloring theory to the assignment of time slots in a TDMA schedule =-=[2]-=-, [3], [4]. One of the goals of this work is to reduce the number of colors used, and thus reduce the number of time slots necessary for the schedule. We have developed a set of TDMA-based MAC protoco... |

51 |
Tdma service for sensor networks
- Kulkarni, Arumugam
- 2004
(Show Context)
Citation Context ...rough a sensor field all require high query rates and consistent, timely delivery of data in order to ensure that data’s usefulness. Contention based MACs behave quite poorly under these circumstances=-=[1]-=- and are not acceptable in real-time or time-sensitive applications. Time-division multiple access (TDMA) scheduling can eliminate collisions and remove the need for a backoff. This increased predicta... |

46 | Leeuwen. λ-coloring of graphs
- Bodlaender, Kloks, et al.
- 2000
(Show Context)
Citation Context ...ertices differ by at least p and the labels of vertices at distance two differ by at least q [6]. The L(p, q)-labeling problem has been studied well in the past, as summarized by Bodlaender et. al in =-=[7]-=-. The L(1, 1)-labeling problem, is also known as the distance2 coloring problem [8]. It is equivalent to the coloring of the square of a graph that has been stated in [9]. The square of a graph G is t... |

27 | K.G.: Comparing energy-saving MAC protocols for wireless sensor networks.
- Halkes, Dam, et al.
- 2005
(Show Context)
Citation Context ...s for wireless sensor networks. In this section, we describe some of the general results in this area, as well as results of applying graph coloring theory to WSN MAC protocols. Langendoen and Halkes =-=[13]-=- present a recent survey of MAC protocols for WSNs. They describe CSMA and TDMA protocols, and compare them based on various criteria. The authors mention the power benefit of using TDMA protocols bec... |

25 | Dynamic conflict-free query scheduling for wireless sensor networks - Chipara, Stankovic - 2006 |

20 | The chromatic number of graph powers.
- Alon, Mohar
- 2002
(Show Context)
Citation Context ...rized by Bodlaender et. al in [7]. The L(1, 1)-labeling problem, is also known as the distance2 coloring problem [8]. It is equivalent to the coloring of the square of a graph that has been stated in =-=[9]-=-. The square of a graph G is the graph G 2 such that the edge (u, v) is in G 2 if and only if there is a distance of at most two edges between the u and v. The order in which colors are assigned to no... |

18 | Distributed algorithms for coloring and domination in wireless ad hoc networks”,
- Parthasarathy, Gandhi
- 2005
(Show Context)
Citation Context ...m in the coloring. Also, the bookkeeping for a breadth-first search would create significant 3soverhead since each node must request and pass a token containing the developing tree structure. Work by =-=[20]-=- provides two distributed algorithms for Distance − 2 coloring in Unit Disk Graphs. However, their goal is on shorter setup time for a conflict-free schedule instead of a smaller TDMA frame size. The ... |

17 |
Distributed shortest paths algorithms
- Awerbuch
- 1989
(Show Context)
Citation Context ...y algorithm which uses ∆(G 2 ) colors. In [4], the authors do not provide a distributed solution for qMAC. Instead they recommend using the distributed coloring algorithm of DRAND or the one found in =-=[19]-=- which implements a distributed breadth-first search in sensor networks. However, this solution has drawbacks. First, it has a performance issue based on the token passing. That is, the algorithm woul... |

14 | Labeling planar graphs with a condition at distance two
- Bella, Král, et al.
(Show Context)
Citation Context ...contain more constraints. One such generalization is the L(p, q)-labeling where the labels of neighboring vertices differ by at least p and the labels of vertices at distance two differ by at least q =-=[6]-=-. The L(p, q)-labeling problem has been studied well in the past, as summarized by Bodlaender et. al in [7]. The L(1, 1)-labeling problem, is also known as the distance2 coloring problem [8]. It is eq... |

14 |
Approximation algorithms for conflict-free channel assignment in wireless ad hoc networks
- Wan, Yi, et al.
(Show Context)
Citation Context ...lized algorithm for coloring a graph - The Degree Heuristic (DH) is a centralized greedy algorithm that colors the nodes in the graph in order of nodes’ degree from highest to lowest [5]. The work in =-=[18]-=- provides a First-Fit algorithm that leads to a low bound very close to optimal for L(1, 1)-Labeling for Disk Graphs by utilizing the geometric properties of unit disk graphs. However, there’s no impl... |

8 | Independence and coloring problems on intersection graphs of disks. E. Bampis et al
- Erlebach, Fiala
- 2006
(Show Context)
Citation Context ...ich must include transmissions from all of n’s children. Thus, n can aggregate it’s children’s data with its own data for transmission at time t. C. Unit Disk Radio Model A Unit Disk Graph (UD) [10], =-=[11]-=- can be used to model a sensor network because the radius of the disk can be considered the transmission distance for the radios on the nodes. Thus, two nodes are considered adjacent if the first node... |

6 | Structuring contentionbased channel access in wireless sensor networks
- Eisenman, Campbell
- 2006
(Show Context)
Citation Context ...ossibility of quicker rates for receipt of periodic data collection. Recently, there has been research into applying graph coloring theory to the assignment of time slots in a TDMA schedule [2], [3], =-=[4]-=-. One of the goals of this work is to reduce the number of colors used, and thus reduce the number of time slots necessary for the schedule. We have developed a set of TDMA-based MAC protocols based o... |

2 | Energy-efficient mac for broadcast problems in wireless sensor networks
- DiPippo, Tucker, et al.
- 2006
(Show Context)
Citation Context ...nefit of using TDMA protocols because nodes can turn off their radios when they are not scheduled to send or receive. While some MAC protocols that use TDMA strategies allow for some collisions [14], =-=[15]-=-, all of the graph coloring MAC protocols that we consider generate conflict free schedules. As noted in [2], there are drawbacks and challenges to TDMA scheduling for WSN’s in terms of clock drifting... |

1 |
Approximating the l(h, k)-labelling problem,” Engineering Research
- Halldórsson
- 2005
(Show Context)
Citation Context ...t least q [6]. The L(p, q)-labeling problem has been studied well in the past, as summarized by Bodlaender et. al in [7]. The L(1, 1)-labeling problem, is also known as the distance2 coloring problem =-=[8]-=-. It is equivalent to the coloring of the square of a graph that has been stated in [9]. The square of a graph G is the graph G 2 such that the edge (u, v) is in G 2 if and only if there is a distance... |

1 |
Ewa Malesinska, Steffen Piskorz, “On the chromatic number of disk graphs
- W
- 1998
(Show Context)
Citation Context ...ta, which must include transmissions from all of n’s children. Thus, n can aggregate it’s children’s data with its own data for transmission at time t. C. Unit Disk Radio Model A Unit Disk Graph (UD) =-=[10]-=-, [11] can be used to model a sensor network because the radius of the disk can be considered the transmission distance for the radios on the nodes. Thus, two nodes are considered adjacent if the firs... |

1 | On coloring the square of unit disk graph
- Ren, Bryan, et al.
- 2006
(Show Context)
Citation Context ...wo in G. G 2 (V, E) = G({u, v, w, x}, {{uv}, {uw}, {vw}}) In previous work, we have proven an upper bound on the chromatic number for G 2 of a UDG that is linear with respect to ω(G) for these graphs =-=[12]-=-. III. RELATED WORK Recently there has been a large amount of research done in the area of MAC protocols for wireless sensor networks. In this section, we describe some of the general results in this ... |