Contention resolution algorithm for industrial Internet-of-Things networks

Maraden, Yan; Hardjawana, Wibowo; Vucetic, Branka

doi:10.1109/wf-iot.2018.8355192

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This scheme alleviates collisions in the data transmission phase, however, some parts of a frame have to be reserved for request signals rather than data transmission. In [18], the contention window of each device is optimized to minimize collisions and in [19], the probability of transmission of each device is adjusted. These methods have low signaling overhead but collisions might still happen.…”

Section: Introduction a Background And Motivationmentioning

confidence: 99%

Self-Organizing TDMA: A Distributed Contention-Resolution MAC Protocol

et al. 2019

View full text Add to dashboard Cite

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, delayoutage 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. INDEX TERMS Pseudo-TDMA, CSMA, MAC, effective capacity, Markov chain with one absorbing state, machine-type communications (MTC), Internet-of-Things.

show abstract

Section: Introduction a Background And Motivationmentioning

confidence: 99%