基于拓扑感知的基于贡献负载的WMN信道分配算法

K. Athota, A. Negi
{"title":"基于拓扑感知的基于贡献负载的WMN信道分配算法","authors":"K. Athota, A. Negi","doi":"10.1109/WOCN.2014.6923044","DOIUrl":null,"url":null,"abstract":"Wireless Mesh Networks(WMNs) are evolving as an avenue for low-cost broadband wireless access networks. In WMN routers that are generally equipped with multiple radios. There are several challenges posed by WMN, here we look at Channel Assignment(CA) which influences capacity of WMN network. A solution to Channel Assignment problem must aim to improve network capacity by minimizing interference and retaining connectivity. In this paper we propose a novel CA algorithm named Topology-aware Contributory Load based CA (TCLCA). TCLCA addresses the objective of minimizing aggregate contributory load in the network yet preserving topology. The TCLCA uses `Contributory Load' to efficiently prioritize links based on expected load and interference. The performance evaluation of TCLCA is carried over ns-2 and is compared with an existing load aware CA algorithm and a load unaware CA algorithm. The TCLCA demonstrates improvement in terms of performance metrics throughput, delay and packet delivery ratio.","PeriodicalId":149158,"journal":{"name":"2014 Eleventh International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Topology-aware Contributory Load based Channel Assignment algorithm for WMN\",\"authors\":\"K. Athota, A. Negi\",\"doi\":\"10.1109/WOCN.2014.6923044\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless Mesh Networks(WMNs) are evolving as an avenue for low-cost broadband wireless access networks. In WMN routers that are generally equipped with multiple radios. There are several challenges posed by WMN, here we look at Channel Assignment(CA) which influences capacity of WMN network. A solution to Channel Assignment problem must aim to improve network capacity by minimizing interference and retaining connectivity. In this paper we propose a novel CA algorithm named Topology-aware Contributory Load based CA (TCLCA). TCLCA addresses the objective of minimizing aggregate contributory load in the network yet preserving topology. The TCLCA uses `Contributory Load' to efficiently prioritize links based on expected load and interference. The performance evaluation of TCLCA is carried over ns-2 and is compared with an existing load aware CA algorithm and a load unaware CA algorithm. The TCLCA demonstrates improvement in terms of performance metrics throughput, delay and packet delivery ratio.\",\"PeriodicalId\":149158,\"journal\":{\"name\":\"2014 Eleventh International Conference on Wireless and Optical Communications Networks (WOCN)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Eleventh International Conference on Wireless and Optical Communications Networks (WOCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOCN.2014.6923044\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Eleventh International Conference on Wireless and Optical Communications Networks (WOCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCN.2014.6923044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

无线网状网络(WMNs)作为一种低成本宽带无线接入网络正在不断发展。在WMN路由器中,通常配备多个无线电。WMN带来了一些挑战,这里我们研究了影响WMN网络容量的信道分配(CA)。信道分配问题的解决方案必须以减少干扰和保持连通性来提高网络容量为目标。本文提出了一种新的CA算法——基于拓扑感知的贡献负载CA (TCLCA)。TCLCA的目标是在保持拓扑结构的同时最小化网络中的总贡献负载。TCLCA使用“贡献负载”来根据预期负载和干扰有效地对链接进行优先级排序。通过ns-2对TCLCA进行了性能评估,并与现有的负载感知CA算法和负载不感知CA算法进行了比较。TCLCA在性能指标吞吐量、延迟和数据包传送率方面证明了改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Topology-aware Contributory Load based Channel Assignment algorithm for WMN
Wireless Mesh Networks(WMNs) are evolving as an avenue for low-cost broadband wireless access networks. In WMN routers that are generally equipped with multiple radios. There are several challenges posed by WMN, here we look at Channel Assignment(CA) which influences capacity of WMN network. A solution to Channel Assignment problem must aim to improve network capacity by minimizing interference and retaining connectivity. In this paper we propose a novel CA algorithm named Topology-aware Contributory Load based CA (TCLCA). TCLCA addresses the objective of minimizing aggregate contributory load in the network yet preserving topology. The TCLCA uses `Contributory Load' to efficiently prioritize links based on expected load and interference. The performance evaluation of TCLCA is carried over ns-2 and is compared with an existing load aware CA algorithm and a load unaware CA algorithm. The TCLCA demonstrates improvement in terms of performance metrics throughput, delay and packet delivery ratio.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The mobile-cloud computing (MCC) roadblocks Efficient battery management in wireless sensor node: Review paper Design of Vivaldi like antenna using fourier series approach A novel approach for power reduction in asynchronous circuits by using AFPT Performance analysis of SC MIMO-CDMA system using STBC codes
×
引用
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