Mengyao Ge
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mengyao Ge has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Douglas M. Blough
School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA
2 shared publications - Shaowei Wang
Nanjing University
1 shared publication - Wentao Zhao
Shanghai Jiao Tong University
1 shared publication
Latest Publications
- 24 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 26 (5) , 2414-2427
High Throughput and Fair Scheduling for Multi-AP Multiuser MIMO in Dense Wireless Networks
This paper considers the fair scheduling problem for dense wireless networks with access point cooperation and multiple-input-multiple-output (MIMO) links. The problem is to maximize the aggregate throughput subject to a fairness constraint that is general enough to capture many different fairness objectives. We formally specify a non-convex optimization problem that captures all aspects of the problem setting, and we propose two algorithms to approximate its solution. The first algorithm jointly optimizes the selection of user sets, MIMO precoders, and assignment of user sets to time slots. The second algorithm separately optimizes first user sets and MIMO precoders and second assignment of user sets to time slots. The first algorithm guarantees perfect fairness and produces a local optimum or a saddle point for aggregate throughput at a fairly high computational cost. The second algorithm also guarantees perfect fairness and produces optimal aggregate throughput for a given set of (possibly non-optimal) user sets while having lower computational complexity. The second algorithm also has a parameter that allows throughput and fairness to be traded off for situations where maximizing throughput is critical and approximate fairness is acceptable. Analyses are complemented by simulation results, which show that: 1) the first algorithm produces significantly higher aggregate throughput than known approaches with a running time that is practical for scenarios with up to 50 users and 2) the second algorithm produces aggregate throughput that is very close to existing heuristics while having significantly lower running time.
- 24 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 26 (5) , 2414-2427
High Throughput and Fair Scheduling for Multi-AP Multiuser MIMO in Dense Wireless Networks
This paper considers the fair scheduling problem for dense wireless networks with access point cooperation and multiple-input-multiple-output (MIMO) links. The problem is to maximize the aggregate throughput subject to a fairness constraint that is general enough to capture many different fairness objectives. We formally specify a non-convex optimization problem that captures all aspects of the problem setting, and we propose two algorithms to approximate its solution. The first algorithm jointly optimizes the selection of user sets, MIMO precoders, and assignment of user sets to time slots. The second algorithm separately optimizes first user sets and MIMO precoders and second assignment of user sets to time slots. The first algorithm guarantees perfect fairness and produces a local optimum or a saddle point for aggregate throughput at a fairly high computational cost. The second algorithm also guarantees perfect fairness and produces optimal aggregate throughput for a given set of (possibly non-optimal) user sets while having lower computational complexity. The second algorithm also has a parameter that allows throughput and fairness to be traded off for situations where maximizing throughput is critical and approximate fairness is acceptable. Analyses are complemented by simulation results, which show that: 1) the first algorithm produces significantly higher aggregate throughput than known approaches with a running time that is practical for scenarios with up to 50 users and 2) the second algorithm produces aggregate throughput that is very close to existing heuristics while having significantly lower running time.
- 1 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1-6
High-Throughput and Fair Scheduling for Access Point Cooperation in Dense Wireless Networks
This paper studies the fair scheduling problem for dense wireless networks with AP cooperation and MIMO links. The problem is to maximize the aggregate throughput while meeting a specified fairness objective. The proposed scheduling algorithm works with a novel single-slot throughput optimization procedure to first generate a set of candidate communication sets that are both high-performing and have good representation among all users. For a given set of candidate communication sets, our algorithm then produces a communication schedule that achieves near-optimal aggregate throughput among solutions that meet the specified fairness objective. Simulation results show that our proposed scheduling algorithm achieves high aggregate throughput while maintaining very good fairness. We also include a mechanism to relax the fairness constraint by a specified amount, which produces a range of solutions that permit a tradeoff between performance and fairness.
- 1 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1-6
High-Throughput and Fair Scheduling for Access Point Cooperation in Dense Wireless Networks
This paper studies the fair scheduling problem for dense wireless networks with AP cooperation and MIMO links. The problem is to maximize the aggregate throughput while meeting a specified fairness objective. The proposed scheduling algorithm works with a novel single-slot throughput optimization procedure to first generate a set of candidate communication sets that are both high-performing and have good representation among all users. For a given set of candidate communication sets, our algorithm then produces a communication schedule that achieves near-optimal aggregate throughput among solutions that meet the specified fairness objective. Simulation results show that our proposed scheduling algorithm achieves high aggregate throughput while maintaining very good fairness. We also include a mechanism to relax the fairness constraint by a specified amount, which produces a range of solutions that permit a tradeoff between performance and fairness.
- 28 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 61 (8) , 3181-3191
Energy-Efficient Resource Allocation for OFDM-Based Cognitive Radio Networks
In this paper, we investigate the energy-efficient resource allocation in orthogonal frequency division multiplexing (OFDM)-based cognitive radio (CR) networks, where we try to maximize the system energy-efficiency under the consideration of many practical limitations, such as transmission power budget of the CR system, interference threshold of primary users and traffic demands of secondary users. Our general objective formulation leads to a challenging mixed integer programming problem that is hard to solve. To make it computationally tractable, we employ a time-sharing method to transform it into a non-linear fractional programming problem, which can be further converted into an equivalent convex optimization problem by using its hypogragh form. Based on these transformations, it is possible to obtain (near) optimal solution by standard optimization technique. However, the complexity of the standard technique is too high for this real-time optimization task. By exploiting the structure of the problem extensively, we develop an efficient barrier method to work out the (near) optimal solution with a reasonable complexity, significantly better than the standard technique. Numerical results show that our proposal can maximize the energy efficiency of the CR system, whilst the proposed algorithm performs quickly and stably.
- 28 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 61 (8) , 3181-3191
Energy-Efficient Resource Allocation for OFDM-Based Cognitive Radio Networks
In this paper, we investigate the energy-efficient resource allocation in orthogonal frequency division multiplexing (OFDM)-based cognitive radio (CR) networks, where we try to maximize the system energy-efficiency under the consideration of many practical limitations, such as transmission power budget of the CR system, interference threshold of primary users and traffic demands of secondary users. Our general objective formulation leads to a challenging mixed integer programming problem that is hard to solve. To make it computationally tractable, we employ a time-sharing method to transform it into a non-linear fractional programming problem, which can be further converted into an equivalent convex optimization problem by using its hypogragh form. Based on these transformations, it is possible to obtain (near) optimal solution by standard optimization technique. However, the complexity of the standard technique is too high for this real-time optimization task. By exploiting the structure of the problem extensively, we develop an efficient barrier method to work out the (near) optimal solution with a reasonable complexity, significantly better than the standard technique. Numerical results show that our proposal can maximize the energy efficiency of the CR system, whilst the proposed algorithm performs quickly and stably.