The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks
IEEE Transactions on Mobile Computing
Distributed throughput maximization in wireless mesh networks via pre-partitioning
IEEE/ACM Transactions on Networking (TON)
A refined performance characterization of longest-queue-first policy in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
IEEE/ACM Transactions on Networking (TON)
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Longest-queue-first (LQF) link scheduling is a greedy link scheduling in multihop wireless networks. Its stability performance in single-channel single-radio (SC-SR) wireless networks has been well studied recently. However, its stability performance in multi-channel multi-radio (MC-MR)wireless networks is largely under-explored. In this paper, we present a stability subregion with closed form of the LQF scheduling in MC-MR wireless networks, which is within a constant factor of the network stability region. We also obtain constant lower bounds on the efficiency ratio of the LQF scheduling in MC-MR wireless networks under the 802.11 interference model or the protocol interference model.