Asymmetric Hidden Node Problem Aware Routing Metric for Wireless Mesh Networks

Keisuke Maesako, Yumi Takaki, Tomio Kamada, C. Ohta
{"title":"Asymmetric Hidden Node Problem Aware Routing Metric for Wireless Mesh Networks","authors":"Keisuke Maesako, Yumi Takaki, Tomio Kamada, C. Ohta","doi":"10.1109/CCNC.2019.8651716","DOIUrl":null,"url":null,"abstract":"In recent years, wireless mesh networks (WMNs) have become popular because of their wide coverage areas and high fault tolerance. Although unlicensed-band off-the-shelf wireless devices based on IEEE 802.11 are widely deployed, WMNs based on IEEE 802.11 suffer from degradation of throughput owing to the hidden node problem. To mitigate this problem, in this study, we developed a new routing metric called the “Asymmetric Hidden node problem Aware routing Metric (AHAM).” AHAM enables a new flow to establish a source-destination path that largely avoids not only interference with hidden nodes of existing flows but also making hidden nodes on that path interfere with existing flows. This is because the hidden node problem can asymmetrically impact throughput between flows when new flows are established. As a response, AHAM aims to estimate the influence of hidden nodes accurately and compensate for how both the new and existing flows influence each other. Simulation results showed that AHAM realizes high throughput while maintaining network fairness compared with other metrics.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC.2019.8651716","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In recent years, wireless mesh networks (WMNs) have become popular because of their wide coverage areas and high fault tolerance. Although unlicensed-band off-the-shelf wireless devices based on IEEE 802.11 are widely deployed, WMNs based on IEEE 802.11 suffer from degradation of throughput owing to the hidden node problem. To mitigate this problem, in this study, we developed a new routing metric called the “Asymmetric Hidden node problem Aware routing Metric (AHAM).” AHAM enables a new flow to establish a source-destination path that largely avoids not only interference with hidden nodes of existing flows but also making hidden nodes on that path interfere with existing flows. This is because the hidden node problem can asymmetrically impact throughput between flows when new flows are established. As a response, AHAM aims to estimate the influence of hidden nodes accurately and compensate for how both the new and existing flows influence each other. Simulation results showed that AHAM realizes high throughput while maintaining network fairness compared with other metrics.
无线网状网络非对称隐节点问题感知路由度量
近年来,无线网状网络(WMNs)以其覆盖范围广、容错能力强等优点得到了广泛的应用。尽管基于IEEE 802.11的非授权频段现成无线设备得到了广泛部署,但由于隐藏节点问题,基于IEEE 802.11的wmn的吞吐量下降。为了缓解这个问题,在本研究中,我们开发了一种新的路由度量,称为“非对称隐藏节点问题感知路由度量(AHAM)”。AHAM使新流能够建立源-目的路径,在很大程度上避免了对现有流的隐藏节点的干扰,也避免了该路径上的隐藏节点对现有流的干扰。这是因为当建立新流时,隐藏节点问题会不对称地影响流之间的吞吐量。作为一种响应,AHAM旨在准确估计隐藏节点的影响,并补偿新流和现有流之间的相互影响。仿真结果表明,与其他指标相比,AHAM在保持网络公平性的同时实现了较高的吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信