无干扰无线网状网络实现最大吞吐量的信道要求

Aizaz U. Chaudhry, J. Chinneck, R. Hafez
{"title":"无干扰无线网状网络实现最大吞吐量的信道要求","authors":"Aizaz U. Chaudhry, J. Chinneck, R. Hafez","doi":"10.1109/ICCCN.2013.6614114","DOIUrl":null,"url":null,"abstract":"In a multi-radio multi-channel wireless mesh network, a channel assignment that is based on a fixed number of available frequency channels may cause co-channel interference, which degrades the network throughput. We address this problem by ensuring interference-free communication among the mesh nodes. The main purpose of this work is to determine the minimum number of non-overlapping frequency channels required for interference-free channel assignment in order to achieve the maximum network throughput while maintaining fairness among the multiple network flows, given the location of the mesh nodes and the number of their half-duplex radio interfaces. To minimize the number of channels required, we apply our Select x for less than x Topology Control Algorithm to build the connectivity graph instead of using the classical approach based on maximum power (MP). We show that our approach outperforms the MP-based approach in terms of the number of channels required as well as the links to channels ratio for all node-degrees.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Channel Requirements for Interference-Free Wireless Mesh Networks to Achieve Maximum Throughput\",\"authors\":\"Aizaz U. Chaudhry, J. Chinneck, R. Hafez\",\"doi\":\"10.1109/ICCCN.2013.6614114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a multi-radio multi-channel wireless mesh network, a channel assignment that is based on a fixed number of available frequency channels may cause co-channel interference, which degrades the network throughput. We address this problem by ensuring interference-free communication among the mesh nodes. The main purpose of this work is to determine the minimum number of non-overlapping frequency channels required for interference-free channel assignment in order to achieve the maximum network throughput while maintaining fairness among the multiple network flows, given the location of the mesh nodes and the number of their half-duplex radio interfaces. To minimize the number of channels required, we apply our Select x for less than x Topology Control Algorithm to build the connectivity graph instead of using the classical approach based on maximum power (MP). We show that our approach outperforms the MP-based approach in terms of the number of channels required as well as the links to channels ratio for all node-degrees.\",\"PeriodicalId\":207337,\"journal\":{\"name\":\"2013 22nd International Conference on Computer Communication and Networks (ICCCN)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 22nd International Conference on Computer Communication and Networks (ICCCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2013.6614114\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2013.6614114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

在多无线电多信道无线网状网络中,基于固定可用频率信道数量的信道分配可能导致同信道干扰,从而降低网络吞吐量。我们通过确保网格节点之间的无干扰通信来解决这个问题。本工作的主要目的是确定无干扰信道分配所需的非重叠频率信道的最小数量,以便在给定网格节点的位置及其半双工无线电接口的数量的情况下,实现最大网络吞吐量,同时保持多个网络流之间的公平性。为了最小化所需的通道数量,我们应用Select x for小于x的拓扑控制算法来构建连接图,而不是使用基于最大功率(MP)的经典方法。我们表明,就所需的通道数量以及所有节点度的通道链接比率而言,我们的方法优于基于mp的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Channel Requirements for Interference-Free Wireless Mesh Networks to Achieve Maximum Throughput
In a multi-radio multi-channel wireless mesh network, a channel assignment that is based on a fixed number of available frequency channels may cause co-channel interference, which degrades the network throughput. We address this problem by ensuring interference-free communication among the mesh nodes. The main purpose of this work is to determine the minimum number of non-overlapping frequency channels required for interference-free channel assignment in order to achieve the maximum network throughput while maintaining fairness among the multiple network flows, given the location of the mesh nodes and the number of their half-duplex radio interfaces. To minimize the number of channels required, we apply our Select x for less than x Topology Control Algorithm to build the connectivity graph instead of using the classical approach based on maximum power (MP). We show that our approach outperforms the MP-based approach in terms of the number of channels required as well as the links to channels ratio for all node-degrees.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信