Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
IEEE/ACM Transactions on Networking (TON)
ICDCSW '05 Proceedings of the Second International Workshop on Wireless Ad Hoc Networking - Volume 09
Dynamic fair scheduling with QoS constraints in multimedia wideband CDMA cellular networks
IEEE Transactions on Wireless Communications
Asymptotically fair transmission scheduling over fading channels
IEEE Transactions on Wireless Communications
Analysis of TCP performance under joint rate and power adaptation in cellular WCDMA networks
IEEE Transactions on Wireless Communications
Communication over fading channels with delay constraints
IEEE Transactions on Information Theory
Delay-bounded packet scheduling of bursty traffic over wireless channels
IEEE Transactions on Information Theory
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
IEEE Journal on Selected Areas in Communications
Radio resource sharing for ad hoc networking with UWB
IEEE Journal on Selected Areas in Communications
Optimal power control, scheduling, and routing in UWB networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.24 |
A short range wireless infrastructure network, in which multiple UWB (ultra-wideband) WPANs are interconnected, is envisioned to be an important platform for various large scale mobile computing applications. It has been suggested that traditional packet scheduling algorithms used in cellular networks can be used for UWB based short-range networks. Unfortunately, these existing algorithms, e.g., HSDPA, cannot properly balance the conflicting goals of maximizing bandwidth efficiency while providing adequate fairness to users. Recently, an efficient scheme called MTA-ISIR is suggested and is found to be effective under several practical scenarios. Nevertheless, we find that there are still some drawbacks in the MTA-ISIR algorithm. In this paper, we propose two new approaches in which the power level threshold used for handling the fairness is dynamically adjusted for different traffic models. Our first approach is based on the ''opportunistic scheduling'' concept which enables the scheduler to optimize the bandwidth efficiency without sacrificing fairness. The second approach makes use of the consecutive packet lengths to prioritize users when assigning time slots. Simulation results indicate that the proposed methods outperform MTA-ISIR under a wide range of parameters.