Asynchronous Random Access Systems with Immediate Collision Resolution for Low Power Wide Area Networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hu, Yangqian | - |
dc.contributor.author | Jin, Hu | - |
dc.contributor.author | Seo, Jun-Bae | - |
dc.date.accessioned | 2024-04-12T05:30:30Z | - |
dc.date.available | 2024-04-12T05:30:30Z | - |
dc.date.issued | 2024-02 | - |
dc.identifier.issn | 0018-9545 | - |
dc.identifier.issn | 1939-9359 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/118730 | - |
dc.description.abstract | Low power wide area networks (LPWAN) have adopted pure ALOHA systems as medium access control (MAC) protocol. Since pure ALOHA works asynchronously, it can reduce the cost of the system and devices and make the devices small by eliminating the time-synchronization hardware. However, its maximum throughput is limited only up to 0.183 (packets/sec). To overcome such a low throughput limit, this work proposes a novel asynchronous random access (RA) system that can yield the maximum throughput as good as slotted ALOHA (S-ALOHA). In the proposed system, the users transmit their packets as in pure ALOHA but trigger their feedback timer upon (re)transmission. When a collision occurs, the feedback timers enable the users who have transmitted the first and last packets in the collision to retransmit one after another right after the collision. Under some conditions, one or two users can retransmit successfully right after the collision, which improves the throughput significantly. This work analyzes the saturation throughput of the proposed system and proposes an optimal online backoff algorithm to maximize the throughput of the unsaturated traffic system. © 1967-2012 IEEE. | - |
dc.format.extent | 16 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Asynchronous Random Access Systems with Immediate Collision Resolution for Low Power Wide Area Networks | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TVT.2023.3320353 | - |
dc.identifier.scopusid | 2-s2.0-85174854405 | - |
dc.identifier.wosid | 001203463300128 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Vehicular Technology, v.73, no.2, pp 2755 - 2770 | - |
dc.citation.title | IEEE Transactions on Vehicular Technology | - |
dc.citation.volume | 73 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 2755 | - |
dc.citation.endPage | 2770 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalResearchArea | Transportation | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Transportation Science & Technology | - |
dc.subject.keywordPlus | UNSLOTTED ALOHA | - |
dc.subject.keywordPlus | LENGTH PACKETS | - |
dc.subject.keywordPlus | SLOTTED ALOHA | - |
dc.subject.keywordPlus | PURE ALOHA | - |
dc.subject.keywordPlus | THROUGHPUT | - |
dc.subject.keywordPlus | CHANNELS | - |
dc.subject.keywordPlus | DELAY | - |
dc.subject.keywordPlus | PERFORMANCE | - |
dc.subject.keywordAuthor | Bayesian optimization | - |
dc.subject.keywordAuthor | immediate retransmission | - |
dc.subject.keywordAuthor | pure ALOHA | - |
dc.subject.keywordAuthor | throughput maximization | - |
dc.subject.keywordAuthor | Unslotted ALOHA | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/10285046 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.