Scheduling in multihop wireless networks without back-pressure

Shihuan Liu, Eylem Ekici, Lei Ying

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

This paper focuses on scheduling in multihop wireless networks. The well-known back-pressure scheduling algorithm is throughput optimal, but requires constant exchange of queue-length information among neighboring nodes for calculating the "back-pressure". In this paper, we propose a self-regulated MaxWeight scheduling, which does not require back-pressure calculation.We prove that the self-regulated MaxWeight scheduling is throughput optimal1 when the traffic flows are associated with fixed routes and deterministic arrivals.

Original languageEnglish (US)
Title of host publication2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
Pages686-690
Number of pages5
DOIs
StatePublished - 2010
Externally publishedYes
Event48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 - Monticello, IL, United States
Duration: Sep 29 2010Oct 1 2010

Other

Other48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
CountryUnited States
CityMonticello, IL
Period9/29/1010/1/10

Fingerprint

Wireless networks
Scheduling
Throughput
Scheduling algorithms

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Liu, S., Ekici, E., & Ying, L. (2010). Scheduling in multihop wireless networks without back-pressure. In 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 (pp. 686-690). [5706973] https://doi.org/10.1109/ALLERTON.2010.5706973

Scheduling in multihop wireless networks without back-pressure. / Liu, Shihuan; Ekici, Eylem; Ying, Lei.

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. 2010. p. 686-690 5706973.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Liu, S, Ekici, E & Ying, L 2010, Scheduling in multihop wireless networks without back-pressure. in 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010., 5706973, pp. 686-690, 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010, Monticello, IL, United States, 9/29/10. https://doi.org/10.1109/ALLERTON.2010.5706973
Liu S, Ekici E, Ying L. Scheduling in multihop wireless networks without back-pressure. In 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. 2010. p. 686-690. 5706973 https://doi.org/10.1109/ALLERTON.2010.5706973
Liu, Shihuan ; Ekici, Eylem ; Ying, Lei. / Scheduling in multihop wireless networks without back-pressure. 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. 2010. pp. 686-690
@inproceedings{e1079f3c6eab4937b43971e4f4bfacb8,
title = "Scheduling in multihop wireless networks without back-pressure",
abstract = "This paper focuses on scheduling in multihop wireless networks. The well-known back-pressure scheduling algorithm is throughput optimal, but requires constant exchange of queue-length information among neighboring nodes for calculating the {"}back-pressure{"}. In this paper, we propose a self-regulated MaxWeight scheduling, which does not require back-pressure calculation.We prove that the self-regulated MaxWeight scheduling is throughput optimal1 when the traffic flows are associated with fixed routes and deterministic arrivals.",
author = "Shihuan Liu and Eylem Ekici and Lei Ying",
year = "2010",
doi = "10.1109/ALLERTON.2010.5706973",
language = "English (US)",
isbn = "9781424482146",
pages = "686--690",
booktitle = "2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010",

}

TY - GEN

T1 - Scheduling in multihop wireless networks without back-pressure

AU - Liu, Shihuan

AU - Ekici, Eylem

AU - Ying, Lei

PY - 2010

Y1 - 2010

N2 - This paper focuses on scheduling in multihop wireless networks. The well-known back-pressure scheduling algorithm is throughput optimal, but requires constant exchange of queue-length information among neighboring nodes for calculating the "back-pressure". In this paper, we propose a self-regulated MaxWeight scheduling, which does not require back-pressure calculation.We prove that the self-regulated MaxWeight scheduling is throughput optimal1 when the traffic flows are associated with fixed routes and deterministic arrivals.

AB - This paper focuses on scheduling in multihop wireless networks. The well-known back-pressure scheduling algorithm is throughput optimal, but requires constant exchange of queue-length information among neighboring nodes for calculating the "back-pressure". In this paper, we propose a self-regulated MaxWeight scheduling, which does not require back-pressure calculation.We prove that the self-regulated MaxWeight scheduling is throughput optimal1 when the traffic flows are associated with fixed routes and deterministic arrivals.

UR - http://www.scopus.com/inward/record.url?scp=79952368287&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952368287&partnerID=8YFLogxK

U2 - 10.1109/ALLERTON.2010.5706973

DO - 10.1109/ALLERTON.2010.5706973

M3 - Conference contribution

SN - 9781424482146

SP - 686

EP - 690

BT - 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

ER -