It is important and challenging to develop efficient schemes to coordinate node transmissions in a MIMO-based ad hoc network. In this work, we propose a scheme to fully exploit the multiuser diversity and spatial diversity by taking advantage of the meshed topology, while also supporting user transmission quality requirement. We formulate a concrete physical model, and present cross-layer algorithms which take advantage of physical layer channel information to opportunistically schedule cooperative spatial multiplexed transmissions between nodes, so that the data rate of the network can be maximized. The performance of our algorithm is studied by extensive simulations and the results demonstrate that our algorithm is very effective and can significantly increase the throughput while reducing the transmission delay.

No abstract

No abstract

Abstract-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 multi-commodity 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.

No abstract