## Distributed link scheduling for TDMA mesh networks (2007)

Venue: | in Proceedings of ICC |

Citations: | 9 - 5 self |

### BibTeX

@INPROCEEDINGS{Djukic07distributedlink,

author = {Petar Djukic and Shahrokh Valaee},

title = {Distributed link scheduling for TDMA mesh networks},

booktitle = {in Proceedings of ICC},

year = {2007}

}

### OpenURL

### Abstract

Abstract — We present a distributed scheduling algorithm for provisioning of guaranteed link bandwidths in ad hoc mesh networks. The guaranteed link bandwidths are necessary to provide deterministic end-to-end bandwidth guarantees. Using Time Division Multiple Access (TDMA), links are assigned slots in each frame and during each slot a number of non-conflicting links can transmit simultaneously. The bandwidth of each link is given by the number of slots assigned to it the frame and the modulation used in the slots. Our scheduling algorithm has two parts. The first part of the algorithm is an iterative procedure that finds locally feasible schedules by exchanging link scheduling information between nodes. The iterative procedure is based on the distributed Bellman-Ford algorithm running on the conflict graph, whose partial view is available at every node. The second part of the algorithm is a wave based termination procedure used to detect when all nodes are locally scheduled and a new schedule should be activated. We use analysis to show the worst case convergence time of the algorithm and simulations to show performance of the algorithm in practice.

### Citations

8580 |
Introduction to Algorithms
- Cormen, Leiserson, et al.
- 1990
(Show Context)
Citation Context ...et of feasible conditions (5) is a set of difference inequalities defined on the conflict graph for the network. This type of difference inequalities can be solved with any minimum distance algorithm =-=[12]-=-. Given a solution to the difference inequalities ω = [ω1,...,ωm], a feasible schedule, π = [π1,...,πm], can be found by applying πi = ωi (mod T) for each ei ∈ E, since we have ωi = πi + ziT for some ... |

368 | Optimized link state routing protocol - Clausen, Jacquet - 2003 |

338 |
Optimized Link State Routing
- Clausen, Jacquet
(Show Context)
Citation Context ... → Z to specify the order of link transmissions. We use the convention that if Rj > Ri, ei transmits before ej. We have shown in [5] that the ranking 1 For example, OLSR keeps a two-hop neighbourhood =-=[11]-=-. 2 802.16 neighbour table keeps track of the two-hop neighbourhood. 2e1 e3 e5 di dj v1 v2 v3 e2 e4 e6 v4 ωi ωj ωi + T time (a) A four node chain c3 e2 e3 Fig. 2. Conflict-free Conditions e1 c1 c5 c1... |

324 | Standard for Local and metropolitan area networks - IEEE - 2004 |

216 |
for Local and metropolitan area networks - Part 16: Air Interface for Broadband Wireless Access Systems
- Standard
- 2009
(Show Context)
Citation Context ...ntrol (MAC) protocol within the 802.16 MAC protocol, and has also started This work was sponsored by the LG Electronics Corporation. work on a mesh extension to 802.11, 802.11s, which has a TDMA mode =-=[3]-=-, [4]. In TDMA networks, QoS required by terminals is negotiated in terms of end-to-end bandwidth reserved for each terminal through the mesh network and enforced at each hop with scheduled access to ... |

176 |
Link scheduling in polynomial time
- Hajek, Sasaki
- 1988
(Show Context)
Citation Context ... the time a new schedule starts is 1.5Dmax + 2mTf , where Dmax is the maximum return path TDMA delay in the network [5]. A. Related Work Research in TDMA scheduling was initiated by the seminal paper =-=[7]-=-, where the authors provide an algorithm to find a set of link bandwidths and a feasible schedule for that set of bandwidths. However, the results of that paper cannot be applied in mesh networks sinc... |

46 | Distributed computation on graphs: shortest path algorithms
- Chandy, Misra
- 1982
(Show Context)
Citation Context ...he scheduling graph. Due to space restrictions, we do not include a negative cycle detection algorithm. However, we note that this is a well studied problem with both centralized [12] and distributed =-=[13]-=- solutions. A. Iterative Schedule Construction In order to distribute schedule construction, we associate an independent scheduler with each link in the network. We denote a scheduler associated with ... |

41 | scheduling in sensor networks: Distributed edge coloring revisited
- Gandham, Dawande, et al.
(Show Context)
Citation Context ... account for communication difficulties with orthogonal channels, the authors propose an asynchronous TDMA protocol, which is inconsistent with the synchronized TDMA mesh protocols such as 802.16. In =-=[9]-=-, the authors propose a scheduling algorithm in which secondary conflicts are resolved by reversing the direction of link transmissions. However, the algorithm only allows for one slot to be allocated... |

29 | Distributed Dynamic Scheduling for End-to-end Rate Guarantees in Wireless Adhoc Networks.", ACM international symposium on Mobile ad hoc networking and computing
- Salonidis, Tassiulas
- 2005
(Show Context)
Citation Context ...ever, the results of that paper cannot be applied in mesh networks since the algorithm is centralized and the network model in the paper ignores secondary link conflicts existing in mesh networks. In =-=[8]-=-, the authors provide a distributed TDMA scheduling algorithm and they assume that secondary conflicts are removed with the use of multiple orthogonal channels. In order to account for communication d... |

22 | scheduling for minimum delay in spatial re-use tdma
- Djukic, Valaee
- 2007
(Show Context)
Citation Context ...each link finds locally feasible schedules, by exchanging update messages with its conflicting links, which are known from locally available twohop neighbourhood information. This extends our work in =-=[5]-=-, where we have proposed centralized TDMA scheduling algorithms. The second procedure, which works independently of the first procedure, is used to find out when the locally feasible schedules converg... |

15 |
Termination detection for distributed computations
- Topor
- 1984
(Show Context)
Citation Context ...rithm to be practical, the network needs a mechanism to detect when a schedule has converged and a new schedule should take place. We use a wave based termination detection procedure for this purpose =-=[6]-=-. The schedule detection procedure is initiated by the POP after a previous detection procedure has terminated. The POP starts the procedure by multicasting a SDA-DOWN message through the routing tree... |

12 |
Data Networks
- Bersekas, Gallager
- 1992
(Show Context)
Citation Context ...e that it is directly connected to s. Each scheduler finds the shortest route to the vertex s in the scheduling graph independently, using a modified version of the distributed Bellman-Ford algorithm =-=[14]-=-. Unlike, the original Bellman-Ford algorithm, which only uses one update message type, the version we present uses three types of messages. The UPD messages are sent by conflicting schedulers when th... |

7 |
TGs MAC enhacement proposal
- IEEE
- 2005
(Show Context)
Citation Context ... (MAC) protocol within the 802.16 MAC protocol, and has also started This work was sponsored by the LG Electronics Corporation. work on a mesh extension to 802.11, 802.11s, which has a TDMA mode [3], =-=[4]-=-. In TDMA networks, QoS required by terminals is negotiated in terms of end-to-end bandwidth reserved for each terminal through the mesh network and enforced at each hop with scheduled access to the w... |

4 |
The business case for wireless mesh networks,” www.nortelnetworks.com
- Chee
- 2003
(Show Context)
Citation Context ...int-of-presence (POP), which is connected to the Internet. Since the POP is the only node connected to the Internet, the cost of providing wireless access over a large area is significantly decreased =-=[1]-=-. Mesh networks are “ad hoc” networks in the sense that once the network is physically installed, the nodes will self-provision and create and maintain a wireless backbone to the POP without any actio... |

3 | The business case for wireless mesh networks - Chee - 2003 |

3 |
Building boom for Wi-Fi networks,” http://www. networkworld.com/research/2006/030606-municipal-wi-fi.html
- Briedenbach
- 2006
(Show Context)
Citation Context ...y the operator. Although mesh networks provide cost effective Internet access, they are still expected to provide a high level of qualityof-service (QoS) for applications such as voice over IP (VoIP) =-=[2]-=-. New mesh protocols provide QoS with Time Division Multiple Access (TDMA) technology. For example, IEEE has ratified a TDMA based mesh medium access control (MAC) protocol within the 802.16 MAC proto... |

3 |
OMNeT++ Discrete Event Simulation System User Manual
- Vargas
- 2005
(Show Context)
Citation Context ...ning of even numbered frames, the algorithm is equivalent to the synchronized version of the Belman-Ford algorithm [14]. We implement the scheduling procedure with the OMNeT++ discrete time simulator =-=[15]-=-. We show an example of algorithm convergence in Fig. 4, where we used the topology from Fig. 1a and ranks assigned with H = 4. In the scenario, we use frame length of Tf = 10ms, T = 365 data slots pe... |

2 |
A DAG-based approach to wireless scheduling
- Shen, Nikolaidis, et al.
(Show Context)
Citation Context ...er, the algorithm only allows for one slot to be allocated to each link, which makes it impractical for mesh networks, where links require multiple time-slots, corresponding to QoS in the network. In =-=[10]-=-, authors provide a scheduling algorithm tightly coupled with a schedule activation algorithm. The algorithm uses a wave to allow an opportunity for every node to negotiate a conflict free schedule wi... |