Traffic Oriented Topology Formation and Load-balancing Routing in Wireless Mesh Networks

Han Zhang, D. Tsang
{"title":"Traffic Oriented Topology Formation and Load-balancing Routing in Wireless Mesh Networks","authors":"Han Zhang, D. Tsang","doi":"10.1109/ICCCN.2007.4317956","DOIUrl":null,"url":null,"abstract":"Wireless mesh networks (WMNs) have emerged as a key technology for the next-generation wireless networking. Due to infrequent topology change and unreliable wireless links, a fundamental problem arisen is how to form an optimal topology to meet the traffic requirement. In this paper, we propose a joint optimization design on topology formation and traffic routing, which is formulated as a linear binary programming (LBP) problem. Since LBP is difficult to solve except for very small-size problems, we provide an efficient approximation method based on the decomposition method. Numerical results show that our approximation method not only obtains a very good performance, but also it reduces the number of network interfaces required by mesh nodes. Moreover, our approximation method significantly reduces the computation complexity and is capable of providing solution to practical problems when mathematical packages cannot offer a feasible solution.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 16th International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2007.4317956","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Wireless mesh networks (WMNs) have emerged as a key technology for the next-generation wireless networking. Due to infrequent topology change and unreliable wireless links, a fundamental problem arisen is how to form an optimal topology to meet the traffic requirement. In this paper, we propose a joint optimization design on topology formation and traffic routing, which is formulated as a linear binary programming (LBP) problem. Since LBP is difficult to solve except for very small-size problems, we provide an efficient approximation method based on the decomposition method. Numerical results show that our approximation method not only obtains a very good performance, but also it reduces the number of network interfaces required by mesh nodes. Moreover, our approximation method significantly reduces the computation complexity and is capable of providing solution to practical problems when mathematical packages cannot offer a feasible solution.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
面向流量的无线网状网络拓扑形成与负载均衡路由
无线网状网络(WMNs)已成为下一代无线网络的一项关键技术。由于拓扑变化不频繁,无线链路不可靠,如何形成最优拓扑以满足业务需求是一个根本问题。本文提出了一种基于拓扑形成和流量路由的联合优化设计,并将其表述为线性二进制规划(LBP)问题。由于除了非常小的问题外,LBP很难求解,因此我们提供了一种基于分解方法的有效近似方法。数值结果表明,该近似方法不仅获得了很好的性能,而且减少了网格节点所需的网络接口数量。此外,我们的近似方法大大降低了计算复杂度,能够在数学软件包无法提供可行解的情况下为实际问题提供解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multiple Access Interference Cancellation and Link Multiplexing for MIMO Mesh Network Containing Hitlist-Based Worms with Polymorphic Signatures Bloom Filter Accelerator for String Matching Challenges and Opportunities in Video Transmission Analysis of Retry Limit for Supporting VoIP in IEEE 802.11e EDCA WLANs
×
引用
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