A Traffic-Demand-Aware Collision-free Channel Allocation for Multi-channel Wireless Mesh Networks

Yi Tian, Takuya Yoshihiro
{"title":"A Traffic-Demand-Aware Collision-free Channel Allocation for Multi-channel Wireless Mesh Networks","authors":"Yi Tian, Takuya Yoshihiro","doi":"10.23919/ICMU48249.2019.9006629","DOIUrl":null,"url":null,"abstract":"Using multiple channels in wireless mesh networks (WMNs) can reduce collision and interference, which improves network performance. Reasonable channel allocation is an effective method for eliminating collisions in WMNs. In this paper, we aim to achieve collision-free channel allocation that is suitable for the traffic patterns in the target networks. Given a traffic-demand matrix of a network, we propose the Traffic-Aware Centralized Channel Allocation (TACCA) method to satisfy traffic demand without collisions in multi-channel WMNs. By incorporating a Carrier Sense Multiple Access aware (CSMA-aware) interference model, we formulate an optimization problem as Mixed Integer Linear Programming (MILP), which generates an optimal channel allocation when solved by an efficient solver. In TACCA, routing paths are consistently selected with satisfying capacity. Simulation studies show that TACCA can drastically improve performance for multi-channel WMNs by adjusting channel assignment incorporating the given traffic patterns.","PeriodicalId":348402,"journal":{"name":"2019 Twelfth International Conference on Mobile Computing and Ubiquitous Network (ICMU)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Twelfth International Conference on Mobile Computing and Ubiquitous Network (ICMU)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ICMU48249.2019.9006629","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Using multiple channels in wireless mesh networks (WMNs) can reduce collision and interference, which improves network performance. Reasonable channel allocation is an effective method for eliminating collisions in WMNs. In this paper, we aim to achieve collision-free channel allocation that is suitable for the traffic patterns in the target networks. Given a traffic-demand matrix of a network, we propose the Traffic-Aware Centralized Channel Allocation (TACCA) method to satisfy traffic demand without collisions in multi-channel WMNs. By incorporating a Carrier Sense Multiple Access aware (CSMA-aware) interference model, we formulate an optimization problem as Mixed Integer Linear Programming (MILP), which generates an optimal channel allocation when solved by an efficient solver. In TACCA, routing paths are consistently selected with satisfying capacity. Simulation studies show that TACCA can drastically improve performance for multi-channel WMNs by adjusting channel assignment incorporating the given traffic patterns.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于流量需求感知的多通道无线Mesh网络无冲突信道分配
在无线网状网络中使用多信道可以减少碰撞和干扰,从而提高网络性能。合理分配信道是消除WMNs冲突的有效方法。在本文中,我们的目标是实现适合目标网络中业务模式的无冲突信道分配。在给定网络流量需求矩阵的情况下,提出了一种基于流量感知的集中信道分配(TACCA)方法,以满足多信道wmn中不发生冲突的流量需求。结合载波感测多址感知(CSMA-aware)干扰模型,我们将优化问题表述为混合整数线性规划(MILP),当用高效求解器求解时,产生最优信道分配。在TACCA中,路由路径的选择始终是满足容量的。仿真研究表明,TACCA可以根据给定的通信模式调整信道分配,从而显著提高多信道wmn的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Number of TCP Connections to Saturate Bandwidth of Wireless Networks Detour Path Angular Information based Range Free Localization with Last Hop RSSI Measurement based Distance Calculation [Copyright notice] Prediction of Post-induction Hypotension Using Stacking Method Improving Accuracy of Localization with Portable APs in Ultra-Narrow-Band-based LPWA Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1