Jan 24, 2013
An Extension of Routing Tree Algorithm Considering Link Speed Change for Wireless Mesh Networks
IEICE technical report
- ,
- ,
- ,
- Volume
- 112
- Number
- 392
- First page
- 1
- Last page
- 6
- Language
- Japanese
- Publishing type
- Publisher
- The Institute of Electronics, Information and Communication Engineers
As a flexible inexpensive Internet-access network, we have studied the Wireless Internet-access Mesh NETwork (WIMNET) that is composed of wirelessly interconnected Access-Points (APs). Previously, we proposed the routing tree algorithm to generate a routing path connecting the APs in WIMNET such that the performance can improved by reducing congestions at links around the Internet Gate Way (GW). For this algorithm, we assume that every link has the same constant speed to transmit data packets regardless of its distance However, when we adopt the new high-speed IEEE802. 11n protocol for wireless communications, our preliminary experiments found that the speed decreases drastically as the distance increases. In this paper, we extend the routing tree algorithm in order to consider the link speed change and generate the routing path to the hosts. We show the effectiveness of this extension through simulations in three instances.
- Link information
-
- CiNii Articles
- http://ci.nii.ac.jp/naid/110009727134
- CiNii Books
- http://ci.nii.ac.jp/ncid/AA11546431
- URL
- http://id.ndl.go.jp/bib/024261427
- ID information
-
- ISSN : 0913-5685
- CiNii Articles ID : 110009727134
- CiNii Books ID : AA11546431