Pseudorandom sequence contention algorithm for IEEE 802.11ah based internet of things network

The IEEE 802.11ah standard relies on the conventional distributed coordination function (DCF) as a backoff selection method. The DCF is utilized in the contention-based period of the newly introduced medium access control (MAC) mechanism, namely restricted access window (RAW). Despite various advant...

Full description

Saved in:
Bibliographic Details
Published in:PloS one 2020-08, Vol.15 (8), p.e0237386-e0237386
Main Authors: Raouf, Mohammed A, Hashim, Fazirulhisyam, Liew, Jiun Terng, Alezabi, Kamal Ali
Format: Article
Language:English
Subjects:
Access control
Algorithms
Automation
Biology and Life Sciences
Collision dynamics
Communication
Computer and Information Sciences
Engineering
Engineering and Technology
Freezing
Internet of Things
Markov chains
Mathematical models
Methods
Performance evaluation
Photonics
Physical Sciences
Pseudorandom sequences
Quality of service
Research and Analysis Methods
Sensors
Social Sciences
Software
Two dimensional models
Wi-Fi
Wireless access points
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The IEEE 802.11ah standard relies on the conventional distributed coordination function (DCF) as a backoff selection method. The DCF is utilized in the contention-based period of the newly introduced medium access control (MAC) mechanism, namely restricted access window (RAW). Despite various advantages of RAW, DCF still utilizes the legacy binary exponential backoff (BEB) algorithm, which suffers from a crucial disadvantage of being prone to high probability of collisions with high number of contending stations. To mitigate this issue, this paper investigates the possibility of replacing the existing exponential sequence (i.e., as in BEB) with a better pseudorandom sequence of integers. In particular, a new backoff algorithm, namely Pseudorandom Sequence Contention Algorithm (PRSCA) is proposed to update the CW size and minimize the collision probability. In addition, the proposed PRSCA incorporates a different approach of CW freezing mechanism and backoff stage reset process. An analytical model is derived for the proposed PRSCA and presented through a discrete 2-D Markov chain model. Performance evaluation demonstrates the efficiency of the proposed PRSCA in reducing collision probability and improving saturation throughput, network throughput, and access delay performance.
ISSN:1932-6203
1932-6203
DOI:10.1371/journal.pone.0237386