欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
现有的协作路由协议不能公平地分配无线网络资源,无法满足网络最小流的吞吐量需求。将多并发流的协作路由问题形式化成一个最大化网络整体效用的凸优化问题,并基于对偶分解和子梯度,提出一种分布式的多网关无线mesh网公平协作路由算法FCRMG。实验结果表明,与基于期望传输时间的非协作路由和基于竞争感知的协作路由相比,FCRMG算法在保证网络吞吐量的前提下,能显著提高最小业务流的吞吐量。
英文摘要：
Existing cooperative routings cannot fairly allocate the wireless resources, which results in that the throughput of minimum flow cannot satisfy the performance requirement. The multiple flow cooperative routing problem is formulated as a convex optimization problem with the goal of maximizing network utility. Based on dual decomposition and subgradient method, a distributed fair cooperative routing algorithm in multi-gates wireless mesh network-FCRMG is proposed. The simulation results show that, FCRMG can largely improve the throughput of the minimum flow without decreasing the total network throughput, compared with uncooperative routing based on expected transmission time metric and cooperative routing based on contention aware metric.
同期刊论文项目
同项目期刊论文
期刊信息
位置：