Adaptive and distributed scheduling in heterogeneous MIMO-based ad hoc networks

Chu, Shan; Wang, Xin

doi:10.1109/mobhoc.2009.5336995

Cited by 13 publications

(18 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…in [1] and [2], allowing the links operate simultaneously (i.e., "Links B") with suitable stream control will result in improving the overall utilization of the network resource, which may be called stream control gains. With stream control access scheduling optimization, it obtains better performance than other two algorithms.…”

Section: Scheduling Approaches For Coascmentioning

confidence: 99%

Capacity-Optimized Access Scheduling Control for Heterogeneous MANETs with MIMO Links

Cui¹,

Feng²

2017

View full text Add to dashboard Cite

Multiple-input and multiple-output (MIMO) technique can significantly improve transmission reliability and bandwidth efficiency in wireless networks. However, many upper layer aspects of MIMO links, especially in mobile networks with heterogeneous antennas and strong interference environments, need further investigation. In this paper, we study its impact on medium access and network capacity. Since MIMO links can enhance physical layer capacity and co-channel interference suppression that affects network access scheduling directly, we develop a capacity-optimized access scheduling control (COASC) scheme for mobile ad hoc networks (MANETs) with MIMO links. We formulate the distributed scheduling taking the key of optimization into design to improve the network capacity and transmission reliability. Simulation results are presented to show the effectiveness of the proposed scheme.

show abstract

Section: Scheduling Approaches For Coascmentioning

confidence: 99%

Capacity-Optimized Access Scheduling Control for Heterogeneous MANETs with MIMO Links

Cui¹,

Feng²

2017

View full text Add to dashboard Cite

show abstract

“…It has only been fairly recently that MIMO networking research has considered network throughput optimization [3], [5], [10], [11], [13], [14], [16], [17], [18], [19]. A number of these papers present formal network optimization problem formulations [3], [5], [10], [13], [19].…”

Section: Related Workmentioning

confidence: 99%

“…A number of these papers present formal network optimization problem formulations [3], [5], [10], [13], [19]. Sundaresan, et al, give a probabilistic throughput formulation but do not explicitly consider interference constraints [19].…”

Section: Related Workmentioning

confidence: 99%

Optimal one-shot scheduling for MIMO networks

Blough

Resta

Santi

et al. 2011

2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

View full text Add to dashboard Cite

Abstract-A MIMO network is a wireless network made up of individual MIMO links. The problem we consider is to maximize throughput in a multihop MIMO network with interference suppression. Our problem formulation accounts for variable rates on the MIMO links, which depend on the channel conditions of the link, and the manner in which the diversity-multiplexing trade-off is handled. We present an ILP formulation of the MIMO one-shot scheduling problem with variable rates, which is the first exact formulation of a MIMO network optimization problem that accounts for full interference suppression capabilities of MIMO links. We use CPLEX to evaluate the optimal solution based on the ILP formulation for wireless networks with up to 32 concurrently transmitting links. We also modify a heuristic algorithm from a related MIMO scheduling problem to work in our problem setting. Results show that the heuristic can scale to networks with 80 or more concurrent links, but is 10-20% from optimal in terms of throughput. We show that the heuristic scheduler is not able to fully exploit the diversitymultiplexing-interference suppression tradeoff, which is inherent in the problem. This shows that there is substantial room for developing improved scheduling algorithms for MIMO networks and provides some insight into promising directions to explore.

show abstract

“…Although a number of efforts have been made in developing efficient MAC schemes to enable MIMO communications in ad hoc networks [1]- [5], there is very limited research on designing routing algorithms and protocols to specifically consider the MIMO features. The authors in [6] propose a routing protocol for ad hoc networks that leverages the various characteristics of MIMO links.…”

Section: Related Workmentioning

confidence: 99%

“…Most existing studies on applying MIMO technique in ad hoc and mesh networks focus on the physical and MAC layers [1]- [5]. In wireless ad hoc and mesh networks, routing is an important factor that affects the system performance.…”

Section: Introductionmentioning

confidence: 99%

MIMO-Aware Routing in Wireless Mesh Networks

Chu

Wang

2010

2010 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Adaptive and distributed scheduling in heterogeneous MIMO-based ad hoc networks

Cited by 13 publications

References 12 publications

Capacity-Optimized Access Scheduling Control for Heterogeneous MANETs with MIMO Links

Capacity-Optimized Access Scheduling Control for Heterogeneous MANETs with MIMO Links

Optimal one-shot scheduling for MIMO networks

MIMO-Aware Routing in Wireless Mesh Networks

Contact Info

Product

Resources

About