首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Cross-Layer Design of Congestion Control and Power Control in Fast-Fading Wireless Networks
【24h】

Cross-Layer Design of Congestion Control and Power Control in Fast-Fading Wireless Networks

机译:快速衰落的无线网络中拥塞控制和功率控制的跨层设计

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

We study the cross-layer design of congestion control and power allocation with outage constraint in an interference-limited multihop wireless networks. Using a complete-convexification method, we first propose a message-passing distributed algorithm that can attain the global optimal source rate and link power allocation. Despite the attractiveness of its optimality, this algorithm requires larger message size than that of the conventional scheme, which increases network overheads. Using the bounds on outage probability, we map the outage constraint to an SIR constraint and continue developing a practical near-optimal distributed algorithm requiring only local SIR measurement at link receivers to limit the size of the message. Due to the complicated complete-convexification method, however the congestion control of both algorithms no longer preserves the existing TCP stack. To take into account the TCP stack preserving property, we propose the third algorithm using a successive convex approximation method to iteratively transform the original nonconvex problem into approximated convex problems, then the global optimal solution can converge distributively with message-passing. Thanks to the tightness of the bounds and successive approximations, numerical results show that the gap between three algorithms is almost indistinguishable. Despite the same type of the complete-convexification method, the numerical comparison shows that the second near-optimal scheme has a faster convergence rate than that of the first optimal one, which make the near-optimal scheme more favorable and applicable in practice. Meanwhile, the third optimal scheme also has a faster convergence rate than that of a previous work using logarithm successive approximation method.
机译:我们研究了干扰受限的多跳无线网络中具有中断约束的拥塞控制和功率分配的跨层设计。使用完全凸化方法,我们首先提出一种消息传递分布式算法,该算法可以实现全局最优源速率和链路功率分配。尽管其最优性具有吸引力,但该算法与常规方案相比需要更大的消息大小,这会增加网络开销。使用中断概率的界限,我们将中断约束映射到SIR约束,并继续开发实用的接近最佳的分布式算法,该算法仅需要在链路接收器处进行本地SIR测量以限制消息的大小。由于复杂的完全凸化方法,但是这两种算法的拥塞控制不再保留现有的TCP堆栈。考虑到TCP堆栈的保留特性,我们提出了第三种算法,采用逐次凸逼近法将原始的非凸问题迭代转化为近似凸问题,然后全局最优解可以与消息传递进行分布式收敛。由于边界的紧密性和逐次逼近,数值结果表明,三种算法之间的差距几乎无法区分。尽管完全凸化方法的类型相同,但数值比较表明,第二种接近最优方案的收敛速度比第一种最优方案快,这使得近似最优方案更有利于实际应用。同时,第三最佳方案的收敛速度也比以前使用对数逐次逼近法的工作更快。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号