A Joint cross layer routing and resource allocation algorithm for multi-radio wireless mesh networks

T. Aldalgamouni, A. Elhakeem
{"title":"A Joint cross layer routing and resource allocation algorithm for multi-radio wireless mesh networks","authors":"T. Aldalgamouni, A. Elhakeem","doi":"10.1109/EIT.2009.5189641","DOIUrl":null,"url":null,"abstract":"In this paper we introduce a joint cross layer routing and resource allocation algorithm for multi radio wireless mesh networks. We focus on wireless mesh networks with stationary nodes. The resource allocation part assigns frequency bands to links such that the interference between those links is minimized while maximizing the coherence time of each link. The routing part selects the paths with the best end to end delay while avoiding links with high interference and short coherence time. The proposed algorithm shows a noticeable improvement in average end to end packet success rate and average end to end delay.","PeriodicalId":393467,"journal":{"name":"2009 IEEE International Conference on Electro/Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Electro/Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EIT.2009.5189641","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper we introduce a joint cross layer routing and resource allocation algorithm for multi radio wireless mesh networks. We focus on wireless mesh networks with stationary nodes. The resource allocation part assigns frequency bands to links such that the interference between those links is minimized while maximizing the coherence time of each link. The routing part selects the paths with the best end to end delay while avoiding links with high interference and short coherence time. The proposed algorithm shows a noticeable improvement in average end to end packet success rate and average end to end delay.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多无线电无线网状网络的联合跨层路由和资源分配算法
本文介绍了一种多无线网状网络的联合跨层路由和资源分配算法。我们主要研究具有固定节点的无线网状网络。资源分配部分为链路分配频带,使链路之间的干扰最小化,同时使各链路的相干时间最大化。路由部分选择端到端时延最好的路径,避开干扰大、相干时间短的链路。该算法在平均端到端数据包成功率和平均端到端延迟方面有显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Recognition strategies for general handwritten text documents A Highly accurate method to calculate capacitance of MEMS sensors with circular membranes A low-cost S-box for the Advanced Encryption Standard using normal basis Knowledge Management support for Quality Management to achieve higher customer satisfaction Mixed-signal CVNS adder for two-operand binary addition
wanfang
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1