Improved Dynamic Collision Recovery in Wireless Ad-Hoc Networks: System and RTL Modeling

Wireless ad-hoc networks are local area networks that are built without a centralized administration point. They are widely utilised in many applications, particularly those involving the Internet of Things (IoT), such as environmental monitoring, smart homes, smart agriculture, and many other IoT applications. However, when the network's size grows, network throughput rapidly declines, mainly because of more collisions. According to the IEEE 802.11 standard, the carrier sense multiple access with collision avoidance protocol is the basic medium access control technique used by the 802.11 standard, also known as the distributed coordination function. It uses the Binary Exponential Backoff (BEB) algorithm for collision avoidance. Avoiding collisions will optimize the network with regard to throughput. This paper proposes an improved dynamic backoff algorithm called Dynamic Enhanced Collision Resolution Algorithm (D-ECRA), which improves the recently introduced Enhanced Collision Resolution Algorithm (ECRA) by replacing the contention window exponential increment with a less aggressive and dynamic contention window increment based on the network’s size. The Register Transfer Level (RTL) design of D-ECRA is proposed using Verilog HDL. Results demonstrate that D-ECRA surpasses BEB and ECRA with regard to throughput with a maximum improvement percentage of 4% and 1.2% respectively. Also, results showed that D-ECRA performed better than ECRA with regard to delay with a maximum improvement percentage of 43%. This thesis shows the assessment process for D-ECRA including simulation parameters and test scenarios for both system and RTL modelling.