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.

You are here: Home / IEEE 2011 PROJECTS / Multipath Routing and Max-Min Fair QoS Provisioning under Interference Constraints in Wireless Multihop Networks