File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 647 -
dc.citation.number 2 -
dc.citation.startPage 634 -
dc.citation.title IEEE-ACM TRANSACTIONS ON NETWORKING -
dc.citation.volume 21 -
dc.contributor.author Ji, Bo -
dc.contributor.author Joo, Changhee -
dc.contributor.author Shroff, Ness B. -
dc.date.accessioned 2023-12-22T04:08:50Z -
dc.date.available 2023-12-22T04:08:50Z -
dc.date.created 2013-07-05 -
dc.date.issued 2013-04 -
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. -
dc.identifier.bibliographicCitation IEEE-ACM TRANSACTIONS ON NETWORKING, v.21, no.2, pp.634 - 647 -
dc.identifier.doi 10.1109/TNET.2012.2205017 -
dc.identifier.issn 1063-6692 -
dc.identifier.scopusid 2-s2.0-84876296713 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/3481 -
dc.identifier.url http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84876296713 -
dc.identifier.wosid 000317925300022 -
dc.language 영어 -
dc.publisher IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC -
dc.title Throughput-Optimal Scheduling in Multihop Wireless Networks Without Per-Flow Information -
dc.type Article -
dc.relation.journalWebOfScienceCategory Computer Science, Hardware & Architecture; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Telecommunications -
dc.relation.journalResearchArea Computer Science; Engineering; Telecommunications -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor Fluid limit tecniques -
dc.subject.keywordAuthor multihop wireless networks -
dc.subject.keywordAuthor per-hop/per-link queues -
dc.subject.keywordAuthor scheduling -
dc.subject.keywordAuthor throughput-optimal -
dc.subject.keywordAuthor without per-flow information -
dc.subject.keywordPlus MULTICLASS QUEUING-NETWORKS -
dc.subject.keywordPlus STABILITY -

qrcode

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