Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
On the stability of input-queued switches with speed-up
IEEE/ACM Transactions on Networking (TON)
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Scheduling algorithms for multi-carrier wireless data systems
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A Large Deviations Analysis of Scheduling in Wireless Networks
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Delay analysis and optimality of scheduling policies for multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Analysis of total average queue length in multi-hop wireless networks
Information Processing Letters
Delay-guaranteed cross-layer scheduling in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time.We restrict the traffic to be single-hop, but allow for simultaneous transmissions as long as they satisfy the underlying interference constraints. We begin by proving a lower bound on the delay performance of any scheduling scheme for this system. We then analyze a large class of throughput optimal policies which have been studied extensively in the literature. The delay analysis of these systems has been limited to asymptotic behavior in the heavy traffic regime and order results. We obtain a tighter upper bound on the delay performance for these systems. We use the insights gained by the upper and lower bound analysis to develop an estimate for the expected delay of wireless networks with mutually independent arrival streams operating under the well-known maximum weighted matching (MWM) scheduling policy. We show via simulations that the delay performance of the MWM policy is often close to the lower bound, which means that it is not only throughput optimal, but also provides excellent delay performance.