MAC Scheduling with Low Overheads by Learning Neighborhood Contention Patterns

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 186
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorYi, Yungko
dc.contributor.authorde Veciana, Gustavoko
dc.contributor.authorShakkottai, Sanjayko
dc.date.accessioned2013-03-12T10:58:30Z-
dc.date.available2013-03-12T10:58:30Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2010-10-
dc.identifier.citationIEEE-ACM TRANSACTIONS ON NETWORKING, v.18, no.5, pp.1637 - 1650-
dc.identifier.issn1063-6692-
dc.identifier.urihttp://hdl.handle.net/10203/102088-
dc.description.abstractAggregate traffic loads and topology in multihop wireless networks may vary slowly, permitting MAC protocols to "learn" how to spatially coordinate and adapt contention patterns. Such an approach could reduce contention, leading to better throughput. To that end, we propose a family of MAC scheduling algorithms and demonstrate general conditions, which, if satisfied, ensure lattice rate optimality (i.e., achieving any rate-point on a uniform discrete lattice within the throughput region). This general framework enables the design of MAC protocols that meet various objectives and conditions. In this paper, as instances of such a lattice-rate-optimal family, we propose distributed, synchronous contention-based scheduling algorithms that: 1) are lattice-rate-optimal under both the signal-to-interference-plus-noise ratio (SINR)-based and graph-based interference models; 2) do not require node location information; and 3) only require three-stage RTS/CTS message exchanges for contention signaling. Thus, the protocols are amenable to simple implementation and may be robust to network dynamics such as topology and load changes. Finally, we propose a heuristic, which also belongs to the proposed lattice-rate-optimal family of protocols and achieves faster convergence, leading to a better transient throughput.-
dc.languageEnglish-
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC-
dc.subjectNETWORKS-
dc.subjectPOLICIES-
dc.titleMAC Scheduling with Low Overheads by Learning Neighborhood Contention Patterns-
dc.typeArticle-
dc.identifier.wosid000283446200023-
dc.identifier.scopusid2-s2.0-77958154094-
dc.type.rimsART-
dc.citation.volume18-
dc.citation.issue5-
dc.citation.beginningpage1637-
dc.citation.endingpage1650-
dc.citation.publicationnameIEEE-ACM TRANSACTIONS ON NETWORKING-
dc.identifier.doi10.1109/TNET.2010.2050903-
dc.contributor.localauthorYi, Yung-
dc.contributor.nonIdAuthorde Veciana, Gustavo-
dc.contributor.nonIdAuthorShakkottai, Sanjay-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorPerformance analysis-
dc.subject.keywordAuthorphysical interference-
dc.subject.keywordAuthorwireless scheduling-
dc.subject.keywordPlusNETWORKS-
dc.subject.keywordPlusPOLICIES-
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0