Modelling the desynchronisation of hidden nodes in IEEE 802.11 wireless networks

An analytically solvable mathematical model is presented for an IEEE 802.11 network, where two terminals, both visible to an access point but not to each other, contend for the channel. This situation, known as the hidden node topology, has been identified as a key reason for the degradation of the protocol's performance. It is shown that the renewal theory, the analytical tool used traditionally, is not suitable for this topology and a discrete time Markov chain is introduced for the modelling of the channel contention. The model permits the accurate computation of several key performance metrics and is in agreement with simulation results over a variety of scenarios.

[1]  Yue Fang,et al.  Theoretical channel capacity in multi-hop ad hoc networks , 2004, The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004..

[2]  Chao Yang,et al.  ARPACK users' guide - solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods , 1998, Software, environments, tools.

[3]  Masaaki Kijima,et al.  Markov processes for stochastic modeling , 1997 .

[4]  Suresh Subramaniam,et al.  MAC layer performance analysis of multi-hop ad hoc networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[5]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[6]  David Starobinski,et al.  Performance of wireless networks with hidden nodes: a queuing-theoretic analysis , 2005, Comput. Commun..

[7]  Marco Conti,et al.  Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit , 2000, TNET.

[8]  Sanjay Gupta,et al.  Performance of asynchronous data transfer methods of IEEE 802.11 MAC protocol , 1996, IEEE Wirel. Commun..

[9]  Koushik Kar,et al.  Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[10]  J. Wendelberger.  Adventures in Stochastic Processes , 1993 .

[11]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[12]  Basil S. Maglaris,et al.  Throughput Analysis in Multihop CSMA Packet Radio Networks , 1987, IEEE Trans. Commun..

[13]  Yu Wang,et al.  Performance of collision avoidance protocols in single-channel ad hoc networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[14]  Ansi Ieee,et al.  Part11 : Wireless LAN Media Access Control (MAC) and Physical Layer (PHY) Specifications , 1999 .

[15]  Sukumar Nandi,et al.  Modeling the short-term unfairness of IEEE 802.11 in presence of hidden terminals , 2004, Perform. Evaluation.

[16]  Sanjay Gupta,et al.  Performance modeling of asynchronous data transfer methods of IEEE 802.11 MAC protocol , 1997, Wirel. Networks.

[17]  S. Resnick.  Adventures in stochastic processes , 1992 .

[18]  A. M. Abdullah,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .

[19]  L. Kleinrock,et al.  Packet Switching in Radio Channels : Part Il-The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution , 2022 .

[20]  Oliver C. Ibe,et al.  Markov processes for stochastic modeling , 2008 .

[21]  Michele Garetto,et al.  Modeling media access in embedded two-flow topologies of multi-hop wireless networks , 2005, MobiCom '05.

[22]  David I. Laurenson,et al.  Insights into the hidden node problem , 2006, IWCMC '06.

[23]  J. A. Schmitt,et al.  Performance models of multirate traffic in various network implementations , 1994 .