A modified routing tree algorithm considering link speed change in IEEE 802.11n for wireless mesh network

N. Funabiki, T. Nakanishi, Kan Watanabe, Wataru Maruyama
{"title":"A modified routing tree algorithm considering link speed change in IEEE 802.11n for wireless mesh network","authors":"N. Funabiki, T. Nakanishi, Kan Watanabe, Wataru Maruyama","doi":"10.1109/ISCE.2013.6570233","DOIUrl":null,"url":null,"abstract":"A Wireless Internet-access Mesh NETwork (WIMNET) can provide an expandable Internet-access network by adopting multiple Access-Points (APs) that have wireless connections with each other. Previously, we proposed a routing tree algorithm for generating an optimal routing path between the APs and the Internet Gate Way (GW) with a minimal transmission delay, assuming that every link has the same data transmission speed. However, our preliminary experiments found that the link speed using the IEEE802.11n as a new high-speed protocol for wireless communications, decreases drastically as the distance increases due to the lowered receiving signal quality. In this paper, we propose a modified routing tree algorithm to consider the large speed change in order to adopt the IEEE 802.11n in WIMNET effectively. In addition to links between APs, our modified algorithm selects the links between hosts and their associated APs. We verify the effectiveness of the modified algorithm through simulations in three topologies.","PeriodicalId":442380,"journal":{"name":"2013 IEEE International Symposium on Consumer Electronics (ISCE)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Symposium on Consumer Electronics (ISCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCE.2013.6570233","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A Wireless Internet-access Mesh NETwork (WIMNET) can provide an expandable Internet-access network by adopting multiple Access-Points (APs) that have wireless connections with each other. Previously, we proposed a routing tree algorithm for generating an optimal routing path between the APs and the Internet Gate Way (GW) with a minimal transmission delay, assuming that every link has the same data transmission speed. However, our preliminary experiments found that the link speed using the IEEE802.11n as a new high-speed protocol for wireless communications, decreases drastically as the distance increases due to the lowered receiving signal quality. In this paper, we propose a modified routing tree algorithm to consider the large speed change in order to adopt the IEEE 802.11n in WIMNET effectively. In addition to links between APs, our modified algorithm selects the links between hosts and their associated APs. We verify the effectiveness of the modified algorithm through simulations in three topologies.
一种考虑IEEE 802.11n中链路速度变化的改进路由树算法
WIMNET (Wireless Internet-access Mesh NETwork)是通过采用多个相互之间具有无线连接的接入点(access - point, ap)来提供可扩展的Internet-access网络。在此之前,我们提出了一种路由树算法,在假设每个链路具有相同的数据传输速度的情况下,以最小的传输延迟生成ap到Internet Gate Way (GW)之间的最优路由路径。然而,我们的初步实验发现,使用IEEE802.11n作为无线通信的新高速协议,由于接收信号质量降低,随着距离的增加,链路速度急剧下降。为了在WIMNET中有效地采用IEEE 802.11n,我们提出了一种改进的路由树算法来考虑较大的速度变化。修改后的算法除了选择ap之间的链路外,还选择主机与关联ap之间的链路。通过三种拓扑结构的仿真,验证了改进算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信