A promising new class of wireless networks has recently emerged, the so-called Wireless Mesh Networks (WMNs). WMNs inherit many advantages from both wired infrastructure and also ad-hoc networks. However, in spite of their distinct characteristics, they also face many technical problems that were present in older classes of wireless networks, such as wireless LANs or pure ad-hoc networks. The much discussed hidden terminal problem is one of them. We argue that an accurate analysis of the effect of hidden nodes in the performance of a random access protocol is still an open issue. In this paper we show the problems and the limitations stemming from common assumptions used in the literature and propose a novel method of modeling time that uses a fixed size channel slot as the unit of time in order to take into account the desynchronisation of nodes. Finally we apply our general method to the classic hidden terminal problem incorporating an iterative step. The proposed analytical model is shown to have a very good match to simulation results for an IEEE 802.11 MAC protocol.
|Title of host publication||IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computing|
|Place of Publication||New York, NY, USA|
|Number of pages||6|
|Publication status||Published - 2006|
- Wireless Mesh Network, CSMA/CA, IEEE 802.11, hidden terminal, desynchronisation