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: Contribution to journalArticle

1 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 algorithm achieves the maximal stability, its computational complexity is prohibitively 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 coupling between queues due to multihop traffic flows makes the local-pooling-factor analysis difficult to perform. Using the fluid-limit techniques, we show that LQF achieves the maximal stability for linear networks with multihop traffic and a single destination on the boundary of the network under the one-hop interference model.

Original languageEnglish (US)
Pages (from-to)273-291
Number of pages19
JournalQueueing Systems
Volume80
Issue number3
DOIs
StatePublished - Apr 4 2015

Keywords

  • Fluid limit
  • Linear networks
  • Longest-queue-first scheduling
  • Multihop traffic
  • Queueing networks
  • Stability
  • Throughput optimality

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Management Science and Operations Research

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