Interference-aware cooperative QoS routing in multi-hop wireless networks
Interference-aware cooperative QoS routing in multi-hop wireless networks
复制标题
DOI：
10.1016/j.compeleceng.2012.08.006
复制
发表时间：
2013-08
期刊：
影响因子：
--
通讯作者：
W. Feng;Jian Liu;Jiannong Cao;Liang Yang;Qin Xin
中科院分区：
文献类型：
--
作者：
W. Feng;Jian Liu;Jiannong Cao;Liang Yang;Qin Xin
协作通信是一种新的物理技术，它具有提高多跳无线网络QoS支持的潜力。现有的工作没有考虑链路之间的干扰影响，而设计的合作QoS路由。为了克服这一局限性，本文设计了一种干扰感知的协同QoS路由算法（CQ路由），以满足用户的带宽需求。我们制定的问题，找到合作路由路径的最大可用带宽的优化问题，称为合作路由问题。证明了Coop-routing问题是强NP-难的。我们提出了集中式和分布式算法来解决Coop-routing问题。我们证明了集中式算法可以实现一个常数的近似比。我们通过仿真来评估这些算法的性能。结果表明，CQ路由算法可以显着提高网络的可用带宽和接纳流的数量方面的性能。
Cooperative communication is a new physical technology, which has the potential to improve QoS support for multi-hop wireless network. Existing works did not consider the interference effect among links while designing cooperative QoS routing. To overcome this limitation, this paper targets at designing an interference-aware Cooperative QoS routing algorithm (CQ-routing) to satisfy users’ bandwidth requirement. We formulate the problem of finding cooperative routing path with maximum available bandwidth as an optimization problem, called Coop-routing problem. We prove that the Coop-routing problem is strong NP-hard. We propose both centralized and distributed algorithm to solve the Coop-routing problem. We prove that the centralized algorithm can achieve a constant approximation ratio. We evaluate the performance of these algorithms through simulations. The results show that CQ-routing algorithms can significantly improve the network performance in terms of available bandwidth and number of admitted flows.