scholarly journals Optimizing Information Freshness via Multiuser Scheduling with Adaptive NOMA/OMA

Author(s):  
Qian Wang ◽  
He Chen ◽  
Changhong Zhao ◽  
Yonghui Li ◽  
Petar Popovski ◽  
...  
Keyword(s):  
2015 ◽  
Vol 14 (7) ◽  
pp. 3586-3600 ◽  
Author(s):  
Hina Tabassum ◽  
Ekram Hossain ◽  
Md. Jahangir Hossain ◽  
Dong In Kim

Author(s):  
Anastasios Giovanidis ◽  
Thomas Haustein ◽  
Yosia Hadisusanto ◽  
Aydin Sezgin ◽  
Donghee Kim

Author(s):  
Yi Xie

Heterogeneous network is supposed to be the dominant network architecture of the fifth generation (5G) cellular network, which means small cells are overlaid on the macrocell. The beamforming (BF) and cell expansion are two important approaches to serve users in small cells. Furthermore, non-orthogonal multiple access (NOMA) is a new type of multiple access multiplexing which improves system performance without taking up extra spectrum resources. Therefore, it becomes one promising technique in 5G. In this paper, NOMA is applied in a 5G heterogeneous network with biased small cells. The BF strategy and the multiuser scheduling method are proposed. The main user in NOMA is scheduled inside the original coverage of the small cell while the side user is chosen from the biased expansion area. The BF strategy that is executed depends on the channel of main user. The multiuser scheduling method is to maximize the rate performance. The proposed method can provide performance benefits. Simulation results show that the proposed methods can be well applied in heterogeneous networks. The achieved performance gain is approximately twice better than traditional OMA and has 10% improvement to the stochastic schedule method. In addition, the average rate of cell edge users is improved.


2013 ◽  
Vol 392 ◽  
pp. 867-871
Author(s):  
Ming Xia Lv ◽  
Yan Kun Lai ◽  
Dong Tang

The total throughput of the communication system can be maximized by allocating the common radio resource to the user or the user group having the best channel quality at a given time and the multiuser diversity gain can be obtained when multiple users share the same channel at one time. The object to select the users is to select the users with the maximum sum capacity. As for a scheduling algorithm, exhaustive algorithm can get the largest capability of the system by multi-user scheduling. However, this algorithm is quite complex hence the cost of operation to a base station has substantial increased. We compare the multiuser performance of two fast user selection algorithms with low complexity in MIMO-MRC systems with co-channel interferences. From the simulation results, these two algorithms not only decrease the computational complexity of the scheduling algorithm but also retain large capability of the MIMO system.


Sign in / Sign up

Export Citation Format

Share Document