Leveraging the trade-off between spatial reuse and channel contention in wireless mesh networks

Subhrendu Chattopadhyay, Sandip Chakraborty, Sukumar Nandi
{"title":"Leveraging the trade-off between spatial reuse and channel contention in wireless mesh networks","authors":"Subhrendu Chattopadhyay, Sandip Chakraborty, Sukumar Nandi","doi":"10.1109/COMSNETS.2016.7439963","DOIUrl":null,"url":null,"abstract":"Performance optimization strategies in wireless mesh networks have witnessed many diverged directions, out of which the recent studies have explored the use of spatial multiplexing through data rate and transmit power adaptation to increase spatial re-usability while minimizing network interference. However, joint data rate and transmit power adaptation shows a clear trade-off, where higher transmit power helps in sustaining high achievable data rates with the cost of increased interference to the neighboring receiver nodes. Such a tradeoff results in channel access unfairness among contending flows, where a node with high transmit power gains more performance benefit compared to its neighbors. Unfairness among nodes in a mesh network results in performance drops for the end-to-end flows. In this paper, we formulate a multivariate optimization problem to maximize network utilization and fairness, while minimizing average transmit power for all transmitter nodes. The Pareto optimality nature of the vector optimization has been explored to design a distributed localized heuristic where every node individually decides their scheduling slots and transmit power while keeping fairness as a constraint. The performance of the proposed scheme has been evaluated through simulation, and the comparisons with recent studies reveal that it improves fairness that results approximately 10% - 40% improvement in end-to-end throughput for different network and traffic scenarios.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2016.7439963","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Performance optimization strategies in wireless mesh networks have witnessed many diverged directions, out of which the recent studies have explored the use of spatial multiplexing through data rate and transmit power adaptation to increase spatial re-usability while minimizing network interference. However, joint data rate and transmit power adaptation shows a clear trade-off, where higher transmit power helps in sustaining high achievable data rates with the cost of increased interference to the neighboring receiver nodes. Such a tradeoff results in channel access unfairness among contending flows, where a node with high transmit power gains more performance benefit compared to its neighbors. Unfairness among nodes in a mesh network results in performance drops for the end-to-end flows. In this paper, we formulate a multivariate optimization problem to maximize network utilization and fairness, while minimizing average transmit power for all transmitter nodes. The Pareto optimality nature of the vector optimization has been explored to design a distributed localized heuristic where every node individually decides their scheduling slots and transmit power while keeping fairness as a constraint. The performance of the proposed scheme has been evaluated through simulation, and the comparisons with recent studies reveal that it improves fairness that results approximately 10% - 40% improvement in end-to-end throughput for different network and traffic scenarios.
利用无线网状网络中空间重用和信道争用之间的权衡
无线网状网络的性能优化策略有许多不同的方向,其中最近的研究探索了通过数据速率和发射功率自适应来利用空间复用来提高空间复用性,同时最小化网络干扰。然而,联合数据速率和发射功率适应显示出一个明确的权衡,其中更高的发射功率有助于维持高可实现的数据速率,但代价是增加对相邻接收节点的干扰。这种权衡导致竞争流之间的信道访问不公平,其中具有高发射功率的节点比其邻居获得更多的性能优势。网状网络中节点间的不公平会导致端到端流的性能下降。在本文中,我们制定了一个多元优化问题,以最大化网络利用率和公平性,同时最小化所有发送节点的平均发射功率。利用矢量优化的帕累托最优性,设计了一种分布式局部启发式算法,其中每个节点在保持公平性约束的情况下自行决定调度时段和传输功率。通过仿真对该方案的性能进行了评估,并与最近的研究结果进行了比较,结果表明,该方案提高了公平性,在不同的网络和流量场景下,端到端吞吐量提高了约10% - 40%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信