Throughput and Delay Analysis of IEEE 802.11 DCF in the Presence of Hidden Nodes for Multi-hop Wireless Networks

Hidden node collision in a contention-based medium access control protocol contributes to poor wireless network performance. This paper extended the Bianchi’s study and introduces a mathematical model that can be used to calculate throughput and delay for the IEEE 802.11 distributed coordination function of a multihop wireless network infrastructure assuming the presence of hidden node collision. This research investigates three essential parameters of multi-hop wireless networks. More specifically, this paper aims to analyze the effect of hidden nodes, network size, and maximum backoff stage on the overall system throughput and packet delay. Results clearly reveal the effect of large wireless network size, maximum backoff stage, and collision probability on throughput and packet delay. On one hand, throughput does not depend on the maximum backoff stage (m) for a small network size (e.g., n \(=\) 10). On the other hand, throughput does not strongly depend on the number of nodes when the backoff stage values are high. Comparing our proposed model in case single-hop with the Bianchi model, the analysis results indicate that the throughput values in our model when the numbers of nodes are 10, 50, and 100 are 0.6031, 0.4172 and 0.3433 respectively; whereas the throughput values are respectively 0.8370, 0.8317 and 0.8255 at the same number of nodes for the Bianchi model. The difference can be attributed to several assumptions made in our proposed model that were not considered in the Bianchi model.