Simple analytical method for wireless distributed networks considering contending and hidden nodes

Abstract

In this letter, we introduce a simple analytical model for wireless distributed networks (WDNs) using IEEE 802.11 distributed coordination function (DCF), which considers contending and hidden nodes. Furthermore, we derive simple formulas of throughput for maximum and saturated cases, and discuss the characteristics of the influence of the contending and hidden nodes. We also compare the analytical results with the simulation of 802.11 DCF. Although our analytical model simplifies the behavior of 802.11 DCF, analytical results coincide with the simulation.