TDMA Delay Aware Link Scheduling for Multi-hop Wireless Networks

Time division multiple access (TDMA) based medium access control (MAC) protocols can provide QoS with guaranteed access to wireless channel. However, in multi-hop wireless networks, these protocols may introduce delay when packets are forwarded from an inbound link to an outbound link on a node. Delay occurs if the outbound link is scheduled to transmit before the inbound link. The total round trip delay can be quite large since it accumulates at every hop in the path. This paper presents a method that finds schedules with minimum round trip scheduling delay. We show that the scheduling delay can be interpreted as a cost collected over a cycle on the conflict graph. We use this observation to formulate a min-max program for the delay across a set of multiple paths. The min-max delay program is NPcomplete since the transmission order of links is a vector of binary integer variables. We design heuristics to select appropriate transmission orders. Once the transmission orders are known, a modified Bellman-Ford algorithm finds the schedules. The simulation results confirm that the proposed algorithm can find effective min-max delay schedules.

[1]  G. Nemhauser,et al.  Integer Programming , 2020 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  A. Barrett.  Network Flows and Monotropic Optimization. , 1984 .

[4]  Leonard Kleinrock,et al.  Spatial TDMA: A Collision-Free Multihop Channel Access Protocol , 1985, IEEE Trans. Commun..

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

[6]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[7]  Michiel Adriaan Odijk,et al.  Railway timetable generation , 1998 .

[8]  S. Ramanathan,et al.  A unified framework and algorithm for channel assignment in wireless networks , 1999, Wirel. Networks.

[9]  Donald F. Towsley,et al.  Modeling TCP Reno performance: a simple model and its empirical validation , 2000, TNET.

[10]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[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]  Hung-Yu Wei,et al.  Interference-aware IEEE 802.16 WiMax mesh networks , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[13]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels , 2005, IEEE/ACM Transactions on Networking.

[14]  Shahrokh Valaee,et al.  Quality-of-Service Provisioning for Multi-service TDMA Mesh Networks , 2007, ITC.

[15]  Shahrokh Valaee,et al.  Distributed Link Scheduling for TDMA Mesh Networks , 2007, 2007 IEEE International Conference on Communications.

[16]  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 .

[17]  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.

[18]  Shahrokh Valaee,et al.  Centralized Scheduling Algorithms for 802.16 Mesh Networks , 2007 .