Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Proceedings of the 11th annual international conference on Mobile computing and networking
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Routing in Ad-hoc Networks with MIMO Links
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Fundamentals of wireless communication
Fundamentals of wireless communication
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Opportunistic and cooperative spatial multiplexing in MIMO ad hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Cross-layer issues in MAC protocol design for MIMO ad hoc networks
IEEE Wireless Communications
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising emerging wireless technologies that can significantly improve transmission capacity and reliability in wireless mesh networks. While MIMO has been widely studied for single link transmission scenarios in physical layer as well as from MAC perspective, its impact on network layer, especially its interaction with routing has not drawn enough research attention. In this paper, we investigate the problem of routing in MIMO-based wireless mesh networks. We mathematically formulate the MIMO-enabled multi-source multidestination multi-hop routing problem into a multicommodity flow problem by identifying the specific opportunities and constraints brought by MIMO transmissions, in order to provide the fundamental basis for MIMO-aware routing design. We then use this formulation to develop a polynomial time approximation solution that maximizes the scaling factor for the concurrent flows in the network. Moreover, we also consider a more practical case where controllers are distributed, and propose a distributed algorithm to minimize the congestion in the network links based on steepest descent framework, which is proved to provide a fixed approximation ratio. The performance of the algorithms is evaluated through simulations and demonstrated to outperform the counterpart strategies without considering MIMO features.