Performance of wireless networks with hidden nodes: a queuing-theoretic analysis

  • Authors:

  • Saikat Ray;David Starobinski;Jeffrey B. Carruthers

  • Affiliations:

  • Department of Electrical and Computer Engineering, Boston University, Boston, MA 02215, USA;Department of Electrical and Computer Engineering, Boston University, Boston, MA 02215, USA;Department of Electrical and Computer Engineering, Boston University, Boston, MA 02215, USA

  • Venue:
  • Computer Communications
  • Year:
  • 2005

Quantified Score

Hi-index 0.24

Visualization

Abstract

Hidden nodes are a fundamental problem that can potentially affect any wireless network where nodes cannot hear each other. Although the hidden node problem is well known, so far only few papers have quantified its effects in a comprehensive manner. This paper represents a first step towards getting a quantitative insight into the impact of hidden nodes on the performance of wireless networks. We first carry out an exact queuing-theoretic analysis for a 4-node segment and derive analytical expressions for the probability of packet collision, the mean packet delay, and the maximum throughput, based on a model that closely follows the IEEE 802.11 standard. We then extend the analysis and provide an approximation for a general linear topology that is asymptotically exact at low load. Finally, we perform detailed simulations to validate our analytical results and show their applicability to predict the performance of IEEE 802.11 networks with hidden nodes. The simulation and analysis closely match. Moreover, they reveal that the impact of hidden nodes propagates through the network causing some nodes to saturate at load as low as 15% of the capacity.