Link Scheduling for Minimum Delay in Spatial Re-Use TDMA
- 1 January 2007
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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.Keywords
This publication has 10 references indexed in Scilit:
- Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networksPublished by Association for Computing Machinery (ACM) ,2005
- Impact of interference on multi-hop wireless network performancePublished by Association for Computing Machinery (ACM) ,2003
- Characterizing achievable rates in multi-hop wireless networksPublished by Association for Computing Machinery (ACM) ,2003
- Modeling TCP Reno performance: a simple model and its empirical validationIEEE/ACM Transactions on Networking, 2000
- Scheduling algorithms for multihop radio networksIEEE/ACM Transactions on Networking, 1993
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networksIEEE Transactions on Automatic Control, 1992
- A Mathematical Model for Periodic Scheduling ProblemsSIAM Journal on Discrete Mathematics, 1989
- Link scheduling in polynomial timeIEEE Transactions on Information Theory, 1988
- Spatial TDMA: A Collision-Free Multihop Channel Access ProtocolIEEE Transactions on Communications, 1985
- Some complexity results about packet radio networks (Corresp.)IEEE Transactions on Information Theory, 1984