Fair queueing wireless ATM MAC protocols

Sigle, Rolf; Renger, Thomas

doi:10.1109/pimrc.1998.733510

Cited by 4 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, a mobile only needs to turn on the transmitter/receiver once in the schedule broadcast phase and in the data transmission/receiving phase. Reference [31] integrates self-clocked fair queueing (SCFQ) [13] with a general form of TDMA/TDD-based MAC protocol for scheduling in wireless ATM networks. It is suggested in [31] that in case of link errors, the affected flow will get credits and free resources will be allocated to the affected flows.…”

Section: Further Discussion and Comparisonmentioning

confidence: 99%

“…Reference [31] integrates self-clocked fair queueing (SCFQ) [13] with a general form of TDMA/TDD-based MAC protocol for scheduling in wireless ATM networks. It is suggested in [31] that in case of link errors, the affected flow will get credits and free resources will be allocated to the affected flows. However, the paper does not describe the exact procedure of this compensation process.…”

Section: Further Discussion and Comparisonmentioning

confidence: 99%

See 1 more Smart Citation

Scheduling algorithms in broadband wireless networks

Cao

2001

Proc. IEEE

259

View full text Add to dashboard Cite

Scheduling algorithms that support quality of service (QoS) differentiation and guarantees for wireless data networks are crucial to the development of broad-band wireless networks. Wireless communication poses special problems that do not exist in wireline networks, such as time-varying channel capacity and location-dependent errors. Although many mature scheduling algorithms are available for wireline networks, they are not directly applicable in wireless networks because of these special problems. This paper provides a comprehensive and in-depth survey on recent research in wireless scheduling. The problems and difficulties in wireless scheduling are discussed. Various representative algorithms are examined. Their themes of thoughts and pros and cons are compared and analyzed. At the end of the paper, some open questions and future research directions are addressed.

show abstract

Section: Further Discussion and Comparisonmentioning

confidence: 99%