A fair scheduling scheme for a time-sensitive traffic over the dual-channel wireless network
Proceedings of the 2007 ACM symposium on Applied computing
Performance comparison of scheduling algorithms in network mobility environment
Computer Communications
On scheduling and clustering in hierarchical TH-PPM UWB wireless ad hoc networks
The Journal of Supercomputing
A graph theory based opportunistic link scheduling for wireless ad hoc networks
IEEE Transactions on Wireless Communications
QoS-Aware fair scheduling in wireless ad hoc networks with link errors
APNOMS'06 Proceedings of the 9th Asia-Pacific international conference on Network Operations and Management: management of Convergence Networks and Services
| Hi-index | 0.01 |
We study fair scheduling in ad hoc networks, accounting for channel errors. Since wireless channels are susceptible to failures, to ensure fairness, it may be necessary to compensate those flows on error-prone channels. Existing compensation mechanisms need the support of base stations and only work for one-hop wireless channels. Therefore, they are not suitable for multihop wireless networks. Existing fair scheduling protocols for ad hoc networks can be classified into timestamp-based and credit-based approaches. None of them takes channel errors into account. We investigate the compensation issue of fair scheduling and propose a mechanism called Timestamp-Based Compensation Protocol (TBCP) for mobile ad hoc networks. We evaluate the performance of TBCP by simulation and analyze its long-term throughput. The results show that our analytical result provides accurate performance estimation for TBCP.