Self-Organizing TDMA: A Distributed Contention-Resolution MAC Protocol
| Autor: | Duc Tuong Nguyen, Mahsa Derakhshani, Atoosa Dalili Shoaei, Tho Le-Ngoc, Saeedeh Parsaeefard, Yahya Khan |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
General Computer Science
Computer science machine-type communications (MTC) Time division multiple access Throughput 02 engineering and technology 01 natural sciences Markov chain with one absorbing state effective capacity 0202 electrical engineering electronic engineering information engineering General Materials Science 0101 mathematics MAC business.industry Pseudo-TDMA Node (networking) ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS 010102 general mathematics Message passing General Engineering 020206 networking & telecommunications Network congestion Channel state information Asynchronous communication lcsh:Electrical engineering. Electronics. Nuclear engineering CSMA business lcsh:TK1-9971 Communication channel Computer network |
| Zdroj: | IEEE Access, Vol 7, Pp 144845-144860 (2019) |
| ISSN: | 2169-3536 |
| DOI: | 10.1109/access.2019.2942114 |
| Popis: | This paper presents a self-organizing time division multiple access (SO-TDMA) protocol for contention resolution aiming to support delay-sensitive applications. The proposed SO-TDMA follows a cognition cycle where each node independently observes the operation environment, learns about the network traffic load, and then makes decisions to adapt the protocol for smart coexistence. Channel access operation in SO-TDMA is similar to carrier-sense multiple-access (CSMA) in the beginning, but then quickly converges to TDMA with an adaptive pseudo-frame structure. This approach has the benefits of TDMA in a high-load traffic condition, and overcomes its disadvantages in low-load, heterogeneous traffic scenarios. Furthermore, it supports distributed and asynchronous channel-access operation. These are achieved by adapting the transmission-opportunity duration to the common idle/busy channel state information acquired by each node, without any explicit message passing among nodes. The process of adjusting the transmission duration is modeled as a congestion control problem to develop an additive-increase-multiplicative-decrease (AIMD) algorithm, which monotonically converges to fairness. Furthermore, the initial access phase of SO-TDMA is modeled as a Markov chain with one absorbing state and its required convergence time is studied accordingly. Performance of SO-TDMA in terms of effective capacity, system throughput, collision probability, delay-outage probability and fairness is investigated. Simulation results illustrate its effectiveness in performance improvement, approaching the ideal case that needs complete and precise information about the queue length and the channel conditions of all nodes. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|