Distributed Medium Access Over Time-Varying Channels

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 728
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorYun, Se-Youngko
dc.contributor.authorShin, Jinwooko
dc.contributor.authorYi, Yungko
dc.date.accessioned2016-12-01T04:55:22Z-
dc.date.available2016-12-01T04:55:22Z-
dc.date.created2015-11-24-
dc.date.created2015-11-24-
dc.date.created2015-11-24-
dc.date.issued2016-10-
dc.identifier.citationIEEE-ACM TRANSACTIONS ON NETWORKING, v.24, no.5, pp.3000 - 3013-
dc.identifier.issn1063-6692-
dc.identifier.urihttp://hdl.handle.net/10203/214466-
dc.description.abstractRecent studies on MAC scheduling have shown that carrier sense multiple access (CSMA) algorithms can be throughput optimal for arbitrary wireless network topology. However, these results are highly sensitive to the underlying assumption on 'static' or 'fixed' system conditions. For example, if channel conditions are time-varying, it is unclear how each node can adjust its CSMA parameters, so-called backoff and channel holding times, using its local channel information for the desired high performance. In this paper, we study 'channel-aware' CSMA (A-CSMA) algorithms in time-varying channels, where they adjust their parameters as some function of the current channel capacity. First, we assume that backoff rates can be arbitrary large and show that the achievable rate region of A-CSMA equals to the maximum rate region if and only if the function is exponential. Furthermore, given an exponential function in A-CSMA, we design updating rules for their parameters, which achieve throughput optimality for an arbitrary wireless network topology. They are the first CSMA algorithms in the literature which are proved to be throughput optimal under time-varying channels. Moreover, we also consider the case when back-off rates of A-CSMA are restricted compared to the speed of channel variations, and characterize the throughput performance of A-CSMA in terms of the underlying wireless network topology. Our results not only guide a high-performance design on MAC scheduling under highly time-varying scenarios, but also provide new insights on the performance of CSMA algorithms in relation to their backoff rates and underlying network topologies.-
dc.languageEnglish-
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC-
dc.subjectCSMA-
dc.subjectTHROUGHPUT-
dc.subjectALGORITHM-
dc.subjectNETWORKS-
dc.subjectDYNAMICS-
dc.subjectDELAY-
dc.titleDistributed Medium Access Over Time-Varying Channels-
dc.typeArticle-
dc.identifier.wosid000386238600032-
dc.identifier.scopusid2-s2.0-84953296629-
dc.type.rimsART-
dc.citation.volume24-
dc.citation.issue5-
dc.citation.beginningpage3000-
dc.citation.endingpage3013-
dc.citation.publicationnameIEEE-ACM TRANSACTIONS ON NETWORKING-
dc.identifier.doi10.1109/TNET.2015.2503394-
dc.contributor.localauthorYun, Se-Young-
dc.contributor.localauthorShin, Jinwoo-
dc.contributor.localauthorYi, Yung-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorCSMA-
dc.subject.keywordAuthortime-varying channel-
dc.subject.keywordAuthorbackoff-
dc.subject.keywordAuthorwireless ad-hoc network-
dc.subject.keywordPlusCSMA-
dc.subject.keywordPlusTHROUGHPUT-
dc.subject.keywordPlusALGORITHM-
dc.subject.keywordPlusNETWORKS-
dc.subject.keywordPlusDYNAMICS-
dc.subject.keywordPlusDELAY-
Appears in Collection
AI-Journal Papers(저널논문)EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0