Delay-guaranteed cross-layer scheduling in multihop wireless networks

Authors:
Dongyue Xue;Eylem Ekici
Affiliations:
Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH;Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2013

Citing 19
Cited 0

A note on greedy algorithms for the maximum weighted independent set problem

Discrete Applied Mathematics
Dynamic power allocation and routing for satellite and wireless networks with time varying channels

Dynamic power allocation and routing for satellite and wireless networks with time varying channels
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
Throughput Region of Finite-Buffered Networks

IEEE Transactions on Parallel and Distributed Systems
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks

IEEE Transactions on Mobile Computing
Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Delay analysis for wireless networks with single hop traffic and general interference constraints

IEEE/ACM Transactions on Networking (TON)
Distributed cross-layer algorithms for the optimal control of multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
Q-CSMA: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Back-pressure routing for intermittently connected networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Optimal control of wireless networks with finite buffers

INFOCOM'10 Proceedings of the 29th conference on Information communications
Delay-based network utility maximization

INFOCOM'10 Proceedings of the 29th conference on Information communications
On scheduling for minimizing end-to-end buffer usage over multihop wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
A distributed CSMA algorithm for throughput and utility maximization in wireless networks

IEEE/ACM Transactions on Networking (TON)
Energy optimal control for time-varying wireless networks

IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks

IEEE Journal on Selected Areas in Communications
Joint congestion control, routing, and MAC for stability and fairness in wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput "ε-close" to the optimal throughput in multihop wireless networks with a tradeoff of O(1/ε) in average end-to-end delay guarantees. The algorithm guarantees finite buffer sizes and aims to solve a joint congestion control, routing, and scheduling problem in a multihop wireless network while satisfying per-flow average end-to-end delay constraints and minimum data rate requirements. This problem has been solved for both backlogged as well as arbitrary arrival rate systems. Moreover, we discuss the design of a class of low-complexity suboptimal algorithms, effects of delayed feedback on the optimal algorithm, and extensions of the proposed algorithm to different interference models with arbitrary link capacities.