BROWSE

Related Researcher

Author's Photo

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

DC Field Value Language
dc.contributor.author Ji, Bo ko
dc.contributor.author Joo, Changhee ko
dc.contributor.author Shroff, Ness B. ko
dc.date.available 2014-04-10T01:57:37Z -
dc.date.created 2013-07-05 ko
dc.date.issued 2013-04 -
dc.identifier.citation IEEE-ACM TRANSACTIONS ON NETWORKING, v.21, no.2, pp.634 - 647 ko
dc.identifier.issn 1063-6692 ko
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/3481 -
dc.identifier.uri http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84876296713 ko
dc.description.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. ko
dc.description.statementofresponsibility close -
dc.language ENG ko
dc.publisher IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC ko
dc.subject Fluid limits ko
dc.subject Multihop wireless network ko
dc.subject per-hop/per-link queues ko
dc.subject Throughput-optimal ko
dc.subject without per-flow information ko
dc.title Throughput-Optimal Scheduling in Multihop Wireless Networks Without Per-Flow Information ko
dc.type ARTICLE ko
dc.identifier.scopusid 2-s2.0-84876296713 ko
dc.identifier.wosid 000317925300022 ko
dc.type.rims ART ko
dc.description.scopustc 0 *
dc.date.scptcdate 2014-07-12 *
dc.identifier.doi 10.1109/TNET.2012.2205017 ko
Appears in Collections:
EE_Journal Papers

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

Show simple item record

qrcode

  • mendeley

    citeulike

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

MENU