Multipath Routing and Max-Min Fair QoS Provisioning under Interference Constraints in Wireless Multihop Networks
Multipath Routing and Max-Min Fair QoS Provisioning under Interference Constraints in Wireless Multihop Networks
复制标题
DOI：
10.1109/tpds.2010.145
复制
发表时间：
2011-05
影响因子：
5.3
通讯作者：
P. Thulasiraman;Jiming Chen;Xuemin Shen
中科院分区：
文献类型：
--
作者：
P. Thulasiraman;Jiming Chen;Xuemin Shen
本文研究了多跳无线网络中干扰约束下的流路由和公平带宽分配问题。首先，我们开发了一种新的保序路由度量，RI 3 M，考虑流间和流内干扰的影响。利用虚网分解证明了路由度量的保序性。其次，为了确保QoS，提出了一种干扰感知的最大-最小公平带宽分配算法LMX：M3 F，其中每个用户到基站的多条路径（通过使用路由度量确定）共存。为了解决该算法，我们开发了一个优化配方，它被建模为一个多商品流的问题，字典最大的带宽分配向量中发现所有的最优分配向量，同时考虑干扰的流量的约束。我们比较我们的RI 3 M路由度量和LMX：M3 F带宽分配算法与各种基于干扰的路由度量和干扰感知带宽分配算法在文献中建立。我们表明，RI 3 M和LMX：M3 F成功地提高了网络性能的延迟，丢包率和带宽使用。
In this paper, we investigate the problem of flow routing and fair bandwidth allocation under interference constraints for multihop wireless networks. We first develop a novel isotonic routing metric, RI3M, considering the influence of interflow and intraflow interference. The isotonicity of the routing metric is proved using virtual network decomposition. Second, in order to ensure QoS, an interference-aware max-min fair bandwidth allocation algorithm, LMX:M3F, is proposed where multiple paths (determined by using the routing metric) coexist for each user to the base station. In order to solve the algorithm, we develop an optimization formulation that is modeled as a multicommodity flow problem where the lexicographically largest bandwidth allocation vector is found among all optimal allocation vectors while considering constraints of interference on the flows. We compare our RI3M routing metric and LMX:M3F bandwidth allocation algorithm with various interference-based routing metrics and interference-aware bandwidth allocation algorithms established in the literature. We show that RI3M and LMX:M3F succeed in improving network performance in terms of delay, packet loss ratio, and bandwidth usage.