scholarly journals QoS-Based Data Aggregation and Resource Allocation Algorithm for Machine Type Communication Devices in Next-Generation Networks

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 119735-119754
Author(s):  
Nasser Mohammed Ahmed ◽  
Nasser-Eddine Rikli
2018 ◽  
Vol 14 (5) ◽  
pp. 155014771877821 ◽  
Author(s):  
Shujun Han ◽  
Xiaodong Xu ◽  
Litong Zhao ◽  
Xiaofeng Tao

Non-orthogonal multiple access is an essential promising solution to support large-scale connectivity required by massive machine-type communication scenario defined in the fifth generation (5G) mobile communication system. In this article, we study the problem of energy minimization in non-orthogonal multiple access–based massive machine-type communication network. Focusing on the massive machine-type communication scenario and assisted by grouping method, we propose an uplink cooperative non-orthogonal multiple access scheme with two phases, transmission phase and cooperation phase, for one uplink cooperative transmission period. Based on uplink cooperative non-orthogonal multiple access, the machine-type communication device with better channel condition and more residual energy will be selected as a group head, which acts as a relay assisting other machine-type communication devices to communicate. In the transmission phase, machine-type communication devices transmit data to the group head. Then, the group head transmits the received data with its own data to base station in the cooperation phase. Because the massive machine-type communication devices are low-cost dominant with limited battery, based on uplink cooperative non-orthogonal multiple access, we propose a joint time and power allocation algorithm to minimize the system energy consumption. Furthermore, the proposed joint time and power allocation algorithm includes dynamic group head selection and fractional transmit time allocation algorithms. Simulation results show that the proposed solution for uplink cooperative non-orthogonal multiple access–based massive machine-type communication network outperforms other schemes.


Author(s):  
Meiping Peng ◽  
Bo Li ◽  
Zhongjiang Yan ◽  
Mao Yang

Aiming at the problems of low efficiency of buffer information collection and sharp drop of system throughput caused by the aggravation of conflicts in the multi basic service set (BSS) high density deployment overlap coverage scenario of next generation wireless local access network (WLAN), an access point cooperation based multi-BSS multi-user full duplex multiple access protocol named as CMMFD is proposed. Firstly, a channel resource allocation algorithm for stations (STA) in overlapping coverage area is designed, in which, the access control (AC) equipment allocates the channel resources for all STA in response to buffer state and interference information (BI) according to the proportion of STA in the overlapped coverage area. Secondly, a BI information collection protocol process based on access point (AP) cooperation sending trigger frame is designed to collect all STA information. After receiving trigger frame, STA will access the channel and report BI information in p-probability according to the channel resources allocated by AC. Finally, a multi-BSS multi-user channel resource allocation algorithm based on full duplex is designed. AC allocates channel resources according to all BI information reported by AP, and schedules STA in the multi-BSS to carry out multi-user full duplex transmission over the sub-channel. Simulation results show that the throughput of the CMMFD protocol improves by 29.6%, compared with Mu-FuPlex protocol and EnFD-OMAX protocol.


2012 ◽  
Vol 546-547 ◽  
pp. 1470-1477
Author(s):  
Qin Wang ◽  
Jun Ping Wang ◽  
Qi Liang Zhu

In the next generation network, there are more and more types of service. And the resource allocation control is more and more difficult. So it is very useful to do some research in this field. An algorithm which is flexible and adaptive can make the parlay gateway works better. In this paper a proved adaptive and sensitive resource allocation algorithm has been presented in the environment of Parlay multi-service. The simulation results indicate that this algorithm can satisfy the requirements of different kinds of service. The Parlay gateway can make full use of resource using this algorithm.


2013 ◽  
Vol E96.B (5) ◽  
pp. 1218-1221 ◽  
Author(s):  
Qingli ZHAO ◽  
Fangjiong CHEN ◽  
Sujuan XIONG ◽  
Gang WEI

Sign in / Sign up

Export Citation Format

Share Document