Topology Control for Throughput Optimization in Wireless Mesh Networks

Deying Li, Baobing Wang, X. Jia
{"title":"Topology Control for Throughput Optimization in Wireless Mesh Networks","authors":"Deying Li, Baobing Wang, X. Jia","doi":"10.1109/MSN.2008.13","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the problem of topology control by joint power control and routing to maximize the network throughput in wireless mesh networks. First, we present two mathematical formulations of the joint power control and routing problem according to two different definitions of network throughput: the total throughput and the minimal per-node throughput. To reduce the computation cost, we next decompose this joint problem into two sub-problems: the power control sub-problem and the routing sub-problem. For the first sub-problem, we design two heuristic algorithms to assign transmission powers to mesh routers, such that the total interference or the maximum node interference in the network is minimized. For the routing sub-problem, we design two linear programming formulations to maximize the total throughput or the minimal per-node throughput. Simulation results reveal the following relationship: the topology with minimum total interference has higher total throughput, while the topology with minimum maximal node interference has higher minimal per-node throughput. This can server as a guidance for network design to satisfy different throughput considerations.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSN.2008.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

In this paper, we consider the problem of topology control by joint power control and routing to maximize the network throughput in wireless mesh networks. First, we present two mathematical formulations of the joint power control and routing problem according to two different definitions of network throughput: the total throughput and the minimal per-node throughput. To reduce the computation cost, we next decompose this joint problem into two sub-problems: the power control sub-problem and the routing sub-problem. For the first sub-problem, we design two heuristic algorithms to assign transmission powers to mesh routers, such that the total interference or the maximum node interference in the network is minimized. For the routing sub-problem, we design two linear programming formulations to maximize the total throughput or the minimal per-node throughput. Simulation results reveal the following relationship: the topology with minimum total interference has higher total throughput, while the topology with minimum maximal node interference has higher minimal per-node throughput. This can server as a guidance for network design to satisfy different throughput considerations.
无线Mesh网络吞吐量优化的拓扑控制
在无线网状网络中,为了使网络吞吐量最大化,我们考虑了联合功率控制和路由的拓扑控制问题。首先,根据网络吞吐量的两种不同定义:总吞吐量和最小每节点吞吐量,给出了联合功率控制和路由问题的两种数学公式。为了减少计算量,我们将该联合问题分解为两个子问题:功率控制子问题和路由子问题。对于第一个子问题,我们设计了两种启发式算法来分配网格路由器的传输功率,从而使网络中的总干扰或最大节点干扰最小化。对于路由子问题,我们设计了两个线性规划公式来最大化总吞吐量或最小每节点吞吐量。仿真结果表明:总干扰最小的拓扑具有较高的总吞吐量,而最大节点干扰最小的拓扑具有较高的最小单节点吞吐量。这可以作为网络设计的指导,以满足不同的吞吐量考虑。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信