Hidden Node Problem Aware Routing Metrics for WLAN Mesh Networks

Jaturong SANGIAMWONG  Kengo YAGYU  Toshihiro SUZUKI  

IEICE TRANSACTIONS on Communications   Vol.E91-B   No.10   pp.3113-3121
Publication Date: 2008/10/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e91-b.10.3113
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Section on Next-Generation Mobile Multimedia Communications)
WLAN mesh networks,  hidden node problem,  packet collision,  routing metric,  

Full Text: PDF(776.3KB)>>
Buy this Article

This paper proposes two novel hidden node problem aware routing metrics for wireless local area network (WLAN) mesh networks. To select the path that is least affected by the serious hidden node problem, we propose two routing metrics, MNn and MPCP, that take into account the number of neighboring nodes (Nn) and the packet collision probability (PCP), respectively. The PCP is estimated from neighbor information that is periodically gathered as state announcement packets, which include the transmission time ratio and the neighbor list. Simulation results show that the first proposed MNn routing metric tends to be less effective as the number of WLAN nodes increases, i.e., the mesh network becomes denser. On the other hand, with an acceptable increased in the control overhead in the mesh network due to the neighbor information, the second proposed MPCP routing metric improves the number of allowable concurrent voice over Internet Protocol (VoIP) calls and the user datagram protocol (UDP) data throughput compared to the MNn metric. The MPCP also provides better performance than the other conventional routing metrics, the hop count, and the Airtime proposed in IEEE 802.11s.