An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Scheduling real-time traffic with deadlines over a wireless channel
WOWMOM '99 Proceedings of the 2nd ACM international workshop on Wireless mobile multimedia
WCFQ: an opportunistic wireless scheduler with statistical fairness bounds
IEEE Transactions on Wireless Communications
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Scheduling resource allocation with timeslot penalty for changeover
Theoretical Computer Science
A fair scheduling scheme for a time-sensitive traffic over the dual-channel wireless network
Proceedings of the 2007 ACM symposium on Applied computing
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Spatial and temporal fairness in heterogeneous HSDPA-enabled UMTS networks
EURASIP Journal on Wireless Communications and Networking - Special issue on fairness in radio resource management for wireless networks
Design of a Reliable Traffic Control System on City Area Based on a Wireless Network
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part I
| Hi-index | 0.00 |
Providing delay guarantees to time-sensitive traffic in wireless multimedia networks is a challenging issue. This is due to the time-varying link capacities and the variety of real-time applications expected to be handled by such networks. We propose and evaluate the performance of two channel-aware scheduling schemes that are capable of providing such delay guarantees in wireless networks. In the first proposed scheme, the Channel-Dependent Earliest-Due-Date (CD-EDD) discipline, the expiration time of the head of line packets of users' queues is taken into consideration in conjunction with the current channel states of users in the scheduling decision. This policy attempts to guarantee the targeted delay bounds in addition to exploiting multiuser diversity to make best utilization of the variable capacity of the channel. In the second scheme we attempt to ensure that the number of packets dropped due to deadline violation is fairly disturbed among users. This provides fairness in the quality of service (QoS) delivered to different users. A unique feature of our work is explicit provisioning of statistical QoS as well as ensuring fairness in data rates, delay bound, and delay bound violation. We provide extensive simulation results to show the different performance aspects of the proposed schemes.