BROWSE

Related Researcher

Author

Joo, Changhee
Learning, Modeling, and Networking
Research Interests
  • Learning, modeling, networking, resource allocation, stochastic optimization, distributed computing, low complexity

ITEM VIEW & DOWNLOAD

Throughput-Optimal Scheduling in Multihop Wireless Networks Without Per-Flow Information

Cited 0 times inthomson ciCited 0 times inthomson ci
Title
Throughput-Optimal Scheduling in Multihop Wireless Networks Without Per-Flow Information
Author
Ji, BoJoo, ChangheeShroff, Ness B.
Keywords
Fluid limits; Multihop wireless network; per-hop/per-link queues; Throughput-optimal; without per-flow information
Issue Date
201304
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Citation
IEEE-ACM TRANSACTIONS ON NETWORKING, v.21, no.2, pp.634 - 647
Abstract
In this paper, we consider the problem of link scheduling in multihop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a single data queue for each link, and exploit only local information, while guaranteeing throughput optimality. Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information. It is usually difficult to obtain and maintain this type of information, especially in large networks, where there are numerous flows. Also, the back-pressure algorithm maintains a complex data structure at each node, keeps exchanging queue-length information among neighboring nodes, and commonly results in poor delay performance. In this paper, we propose scheduling schemes that can circumvent these drawbacks and guarantee throughput optimality. These schemes use either the readily available hop-count information or only the local information for each link. We rigorously analyze the performance of the proposed schemes using fluid limit techniques via an inductive argument and show that they are throughput-optimal. We also conduct simulations to validate our theoretical results in various settings and show that the proposed schemes can substantially improve the delay performance in most scenarios.
URI
Go to Link
DOI
http://dx.doi.org/10.1109/TNET.2012.2205017
ISSN
1063-6692
Appears in Collections:
ECE_Journal Papers

find_unist can give you direct access to the published full text of this article. (UNISTARs only)

Show full item record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

MENU