IEICE TRANSACTIONS on Communications
Load-Balanced and Interference-Aware Spanning Tree Construction Algorithm for TDMA-Based Wireless Mesh Networks
Summary :
Wireless mesh networks have been attracting many users in recent years. By connecting base stations (mesh nodes) with wireless connections, these network can achieve a wide-area wireless environment with flexible configuration and low cost at the risk of radio interference between wireless links. When we utilize wireless mesh networks as infrastructures for Internet access, all network traffic from mobile nodes goes through a gateway node that is directly connected to the wired network. Therefore, it is necessary to distribute the traffic load by deploying multiple gateway nodes. In this paper, we propose a spanning tree construction algorithm for TDMA-based wireless mesh networks with multiple gateway nodes so as to maximize the traffic volume transferred between the mesh network and the Internet (system throughput) by taking account of the traffic load on the gateway nodes, the access link capacity and radio interference. Through a performance evaluation, we show that the proposed algorithm increases the system throughput regardless of the bottleneck position and achieves up to 3.1 times higher system throughput than a conventional algorithm.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.1 pp.99-110
- Publication Date
- 2010/01/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.99
- Type of Manuscript
- PAPER
- Category
- Wireless Communication Technologies
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
Hiroshi TOKITO, Masahiro SASABE, Go HASEGAWA, Hirotaka NAKANO, "Load-Balanced and Interference-Aware Spanning Tree Construction Algorithm for TDMA-Based Wireless Mesh Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 1, pp. 99-110, January 2010, doi: 10.1587/transcom.E93.B.99.
Abstract: Wireless mesh networks have been attracting many users in recent years. By connecting base stations (mesh nodes) with wireless connections, these network can achieve a wide-area wireless environment with flexible configuration and low cost at the risk of radio interference between wireless links. When we utilize wireless mesh networks as infrastructures for Internet access, all network traffic from mobile nodes goes through a gateway node that is directly connected to the wired network. Therefore, it is necessary to distribute the traffic load by deploying multiple gateway nodes. In this paper, we propose a spanning tree construction algorithm for TDMA-based wireless mesh networks with multiple gateway nodes so as to maximize the traffic volume transferred between the mesh network and the Internet (system throughput) by taking account of the traffic load on the gateway nodes, the access link capacity and radio interference. Through a performance evaluation, we show that the proposed algorithm increases the system throughput regardless of the bottleneck position and achieves up to 3.1 times higher system throughput than a conventional algorithm.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.99/_p
Copy
@ARTICLE{e93-b_1_99,
author={Hiroshi TOKITO, Masahiro SASABE, Go HASEGAWA, Hirotaka NAKANO, },
journal={IEICE TRANSACTIONS on Communications},
title={Load-Balanced and Interference-Aware Spanning Tree Construction Algorithm for TDMA-Based Wireless Mesh Networks},
year={2010},
volume={E93-B},
number={1},
pages={99-110},
abstract={Wireless mesh networks have been attracting many users in recent years. By connecting base stations (mesh nodes) with wireless connections, these network can achieve a wide-area wireless environment with flexible configuration and low cost at the risk of radio interference between wireless links. When we utilize wireless mesh networks as infrastructures for Internet access, all network traffic from mobile nodes goes through a gateway node that is directly connected to the wired network. Therefore, it is necessary to distribute the traffic load by deploying multiple gateway nodes. In this paper, we propose a spanning tree construction algorithm for TDMA-based wireless mesh networks with multiple gateway nodes so as to maximize the traffic volume transferred between the mesh network and the Internet (system throughput) by taking account of the traffic load on the gateway nodes, the access link capacity and radio interference. Through a performance evaluation, we show that the proposed algorithm increases the system throughput regardless of the bottleneck position and achieves up to 3.1 times higher system throughput than a conventional algorithm.},
keywords={},
doi={10.1587/transcom.E93.B.99},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - Load-Balanced and Interference-Aware Spanning Tree Construction Algorithm for TDMA-Based Wireless Mesh Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 99
EP - 110
AU - Hiroshi TOKITO
AU - Masahiro SASABE
AU - Go HASEGAWA
AU - Hirotaka NAKANO
PY - 2010
DO - 10.1587/transcom.E93.B.99
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2010
AB - Wireless mesh networks have been attracting many users in recent years. By connecting base stations (mesh nodes) with wireless connections, these network can achieve a wide-area wireless environment with flexible configuration and low cost at the risk of radio interference between wireless links. When we utilize wireless mesh networks as infrastructures for Internet access, all network traffic from mobile nodes goes through a gateway node that is directly connected to the wired network. Therefore, it is necessary to distribute the traffic load by deploying multiple gateway nodes. In this paper, we propose a spanning tree construction algorithm for TDMA-based wireless mesh networks with multiple gateway nodes so as to maximize the traffic volume transferred between the mesh network and the Internet (system throughput) by taking account of the traffic load on the gateway nodes, the access link capacity and radio interference. Through a performance evaluation, we show that the proposed algorithm increases the system throughput regardless of the bottleneck position and achieves up to 3.1 times higher system throughput than a conventional algorithm.
ER -
English
