IEICE TRANSACTIONS on Communications
Hidden Node Problem Aware Routing Metrics for WLAN Mesh Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E91-B No.10 pp.3113-3121
- Publication Date
- 2008/10/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e91-b.10.3113
- Type of Manuscript
- Special Section PAPER (Special Section on Next-Generation Mobile Multimedia Communications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jaturong SANGIAMWONG, Kengo YAGYU, Toshihiro SUZUKI, "Hidden Node Problem Aware Routing Metrics for WLAN Mesh Networks" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 10, pp. 3113-3121, October 2008, doi: 10.1093/ietcom/e91-b.10.3113.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.10.3113/_p
Copy
@ARTICLE{e91-b_10_3113,
author={Jaturong SANGIAMWONG, Kengo YAGYU, Toshihiro SUZUKI, },
journal={IEICE TRANSACTIONS on Communications},
title={Hidden Node Problem Aware Routing Metrics for WLAN Mesh Networks},
year={2008},
volume={E91-B},
number={10},
pages={3113-3121},
abstract={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.},
keywords={},
doi={10.1093/ietcom/e91-b.10.3113},
ISSN={1745-1345},
month={October},}
Copy
TY - JOUR
TI - Hidden Node Problem Aware Routing Metrics for WLAN Mesh Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3113
EP - 3121
AU - Jaturong SANGIAMWONG
AU - Kengo YAGYU
AU - Toshihiro SUZUKI
PY - 2008
DO - 10.1093/ietcom/e91-b.10.3113
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2008
AB - 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.
ER -
English
