الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 102 |  |  |
| | | from | 102 | | |
Abstract
Wireless ad-hoc networks, or infrastructure-less wireless 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.
In wireless local area networks, as per the IEEE 802.11 standard, the fundamental method for controlling access to the medium is the carrier sense multiple access with collision avoidance protocol. This protocol, commonly known as the distributed coordination function. It implements the utilization of the binary exponential backoff algorithm (BEB). BEB plays a crucial role in collision avoidance. Avoiding collisions will optimize the network with regard to throughput or/and delay.
This thesis 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 depending on the specific number of nodes present in the network. Moreover, the 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.