An extension of clustering algorithm for considering link speed in wireless mesh networks

S. Tajima, N. Funabiki, T. Higashino
{"title":"An extension of clustering algorithm for considering link speed in wireless mesh networks","authors":"S. Tajima, N. Funabiki, T. Higashino","doi":"10.1109/GCCE.2013.6664902","DOIUrl":null,"url":null,"abstract":"As a scalable Internet-access network, we have studied Wireless Internet-access Mesh Network (WIMNET) using multiple access point (APs) that are connected through wireless communications. In previous studies, we proposed a clustering algorithm for efficiently composing a large scale WIMNET by partitioning the APs into a set of clusters. This algorithm assumes that any link speed is constant for simplicity, whereas our preliminary experiments found that it is greatly changed as the link distance increases due to interferences when adopting the new high-speed IEEE802.11n protocol. In this paper, we extend our clustering algorithm to consider this link speed change to introduce IEEE802.11n into WIMNET. We verify the effectiveness of the extended algorithm through simulations in a grid topology instance using the WIMNET simulator.","PeriodicalId":294532,"journal":{"name":"2013 IEEE 2nd Global Conference on Consumer Electronics (GCCE)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 2nd Global Conference on Consumer Electronics (GCCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCCE.2013.6664902","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

As a scalable Internet-access network, we have studied Wireless Internet-access Mesh Network (WIMNET) using multiple access point (APs) that are connected through wireless communications. In previous studies, we proposed a clustering algorithm for efficiently composing a large scale WIMNET by partitioning the APs into a set of clusters. This algorithm assumes that any link speed is constant for simplicity, whereas our preliminary experiments found that it is greatly changed as the link distance increases due to interferences when adopting the new high-speed IEEE802.11n protocol. In this paper, we extend our clustering algorithm to consider this link speed change to introduce IEEE802.11n into WIMNET. We verify the effectiveness of the extended algorithm through simulations in a grid topology instance using the WIMNET simulator.
考虑无线网状网络中链路速度的聚类算法的扩展
作为一种可扩展的互联网接入网络,我们研究了使用多个通过无线通信连接的接入点(ap)的无线互联网接入网状网络(WIMNET)。在之前的研究中,我们提出了一种聚类算法,通过将ap划分为一组簇来高效地组成大规模WIMNET。为了简单起见,本算法假设任何链路速度都是恒定的,而我们的初步实验发现,在采用新的高速IEEE802.11n协议时,由于干扰,随着链路距离的增加,链路速度会发生很大的变化。在本文中,我们扩展了我们的聚类算法,以考虑这种链路速度变化,从而将IEEE802.11n引入WIMNET。我们通过使用WIMNET模拟器在网格拓扑实例中进行仿真来验证扩展算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信