Link Scheduling for Minimum Delay in Spatial Re-Use TDMA

Time division multiple access (TDMA) based medium access control (MAC) protocols provide QoS with guaranteed access to wireless channel. However, in multihop 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 NP-complete 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 is used to find the schedules. The simulation results confirm that the proposed algorithm can find effective min-max delay schedules.

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

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

[3]  PadhyeJitendra,et al.  Impact of interference on multi-hop wireless network performance , 2005 .

[4]  Erdal Arikan,et al.  Some complexity results about packet radio networks , 1983, IEEE Trans. Inf. Theory.

[5]  Decision Systems.,et al.  Some complexity results about packet radio networks , 1983 .

[6]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem , 2003, MobiCom '03.

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

[8]  Leon W P Peeters,et al.  Cyclic Railway Timetable Optimization , 2003 .

[9]  Pravin Varaiya,et al.  Scheduling Algorithms for Sensor Networks , 2005 .

[10]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

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

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

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

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

[15]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[16]  Leandros Tassiulas,et al.  Jointly optimal routing and scheduling in packet radio networks , 1992, IEEE Trans. Inf. Theory.

[17]  Walter Ukovich,et al.  A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..

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

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

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