Distributed Link Scheduling for TDMA Mesh Networks

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.

[1]  Ieee Microwave Theory,et al.  IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems Draft Amendment: Management Information Base Extensions , 2007 .

[2]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[3]  Rodney W. Topor,et al.  Termination Detection for Distributed Computations , 1984, Inf. Process. Lett..

[4]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[5]  K. Mani Chandy,et al.  Distributed computation on graphs: shortest path algorithms , 1982, CACM.

[6]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[7]  Shahrokh Valaee,et al.  Link Scheduling for Minimum Delay in Spatial Re-Use TDMA , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[8]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[9]  Ioanis Nikolaidis,et al.  A DAG-based approach to wireless scheduling , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[10]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[11]  Milind Dawande,et al.  Link scheduling in sensor networks: distributed edge coloring revisited , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[12]  Leandros Tassiulas,et al.  Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks , 2005, MobiHoc '05.