Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference

Xiaohan Kang, Juan José Jaramillo, Lei Ying

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

3 Scopus citations

Abstract

We consider the stability of the longest-queue-first (LQF) scheduling policy in wireless networks with multihop traffic under the one-hop interference model. Although it is well known that the back-pressure (BP) algorithm achieves the maximal stability, its computational complexity is very high. In this paper, we consider LQF, a low-complexity scheduling algorithm, which has been shown to have near optimal throughput performance in many networks with single-hop traffic flows. We are interested in the performance of LQF for multihop traffic flows. In this scenario, the analysis of local-pooling factors for LQF does not carry through because of the complicated coupling between queues due to multihop traffic flows. Using fluid limit techniques, we show that LQF achieves the maximal stability for linear networks with multihop traffic and a single destination under the one-hop interference.

Original languageEnglish (US)
Title of host publication2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3312-3317
Number of pages6
ISBN (Print)9781467357173
DOIs
StatePublished - 2013
Event52nd IEEE Conference on Decision and Control, CDC 2013 - Florence, Italy
Duration: Dec 10 2013Dec 13 2013

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Other

Other52nd IEEE Conference on Decision and Control, CDC 2013
Country/TerritoryItaly
CityFlorence
Period12/10/1312/13/13

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference'. Together they form a unique fingerprint.

Cite this