Zhixiang Gao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhixiang Gao has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Aijun Liu
College of Communications Engineering, Army Engineering University of PLA, Nanjing, China
11 shared publications - Xiaohu Liang
School of Communication Engineering, Army Engineering University, Nanjing, China
10 shared publications - Chen Han
National University of Defense Technology
9 shared publications - Xin Lin
Army Engineering University of PLA
3 shared publications - Xin Xu
College of Communications Engineering, Army Engineering University of PLA, Nanjing, China
3 shared publications Aijun Liu
School of Communications Engineering, Army Engineering University, Nanjing, China
2 shared publications
Latest Publications
- 16 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (2) , 5337-5342
An Interpolation-Based Blind CFO Estimator for Faster-Than-Nyquist Signaling Over LEO Satellite Channel
In this paper, an interpolation-based blind carrier frequency-offset (CFO) estimator is proposed for faster-than-Nyquist (FTN) system in low-earth-orbit (LEO) satellite channel. According to maximum-likelihood criterion, we can obtain the CFO estimation problem formulation from the joint probability density function of output samples of matched filter. After simplifying, the CFO estimation problem can be equivalently solved by nonlinear least-square approach. Based on this, we have designed the objective function for CFO estimation of FTN. The physical meaning of designed objective function can be seen as the periodogram of the data samples. The peak location of the periodogram of the data samples is corresponding to the CFO estimate of FTN. Then, the objective function is proved to be approximated as a parabolic curve. By maximizing the designed objective function, an interpolation-based blind CFO estimator is proposed without iterated procedure. Finally, simulation results demonstrated that our proposed interpolation-based CFO estimator has lower computation complexity, and outperforms traditional estimators.
- 16 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (2) , 5337-5342
An Interpolation-Based Blind CFO Estimator for Faster-Than-Nyquist Signaling Over LEO Satellite Channel
In this paper, an interpolation-based blind carrier frequency-offset (CFO) estimator is proposed for faster-than-Nyquist (FTN) system in low-earth-orbit (LEO) satellite channel. According to maximum-likelihood criterion, we can obtain the CFO estimation problem formulation from the joint probability density function of output samples of matched filter. After simplifying, the CFO estimation problem can be equivalently solved by nonlinear least-square approach. Based on this, we have designed the objective function for CFO estimation of FTN. The physical meaning of designed objective function can be seen as the periodogram of the data samples. The peak location of the periodogram of the data samples is corresponding to the CFO estimate of FTN. Then, the objective function is proved to be approximated as a parabolic curve. By maximizing the designed objective function, an interpolation-based blind CFO estimator is proposed without iterated procedure. Finally, simulation results demonstrated that our proposed interpolation-based CFO estimator has lower computation complexity, and outperforms traditional estimators.
- 18 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (11) , 17905-17910
Sum Rate Maximization of Ad-Hoc Network in Adversarial Communication Environments: A Game-Theoretic Approach
Recently, the hierarchical coalition-based Ad-hoc network (HCAN) has been adopted to establish link connection in adversarial environments. In this paper, a game-theoretic-based link access (GTLA) approach is proposed to maximize the sum rate of HCAN. Our scheme consists of two phases: the assignment between coalition head (CH) and coalition member (CM) as well as the matching between CH and disconnected node (DN). Firstly, the CH-CM assignment problem is formulated as a coalition formation game (CFG). It's proved that the CFG with the two-side best order is an exact potential game (EPG), which can significantly mitigate co-channel interference and hostile jamming. Secondly, the CH-DN matching problem is formulated as a bilateral many-to-one matching game. Then a partial mutual benefit order (PMBO) based matching algorithm with low computational complexity is designed to reconstruct broken links. Finally, simulation results are provided to verify the superior performance of our scheme.
- 18 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (11) , 17905-17910
Sum Rate Maximization of Ad-Hoc Network in Adversarial Communication Environments: A Game-Theoretic Approach
Recently, the hierarchical coalition-based Ad-hoc network (HCAN) has been adopted to establish link connection in adversarial environments. In this paper, a game-theoretic-based link access (GTLA) approach is proposed to maximize the sum rate of HCAN. Our scheme consists of two phases: the assignment between coalition head (CH) and coalition member (CM) as well as the matching between CH and disconnected node (DN). Firstly, the CH-CM assignment problem is formulated as a coalition formation game (CFG). It's proved that the CFG with the two-side best order is an exact potential game (EPG), which can significantly mitigate co-channel interference and hostile jamming. Secondly, the CH-DN matching problem is formulated as a bilateral many-to-one matching game. Then a partial mutual benefit order (PMBO) based matching algorithm with low computational complexity is designed to reconstruct broken links. Finally, simulation results are provided to verify the superior performance of our scheme.
- 15 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72 (3) , 1701-1715
Sum Data Minimization in LEO Satellite-UAV Integrated Multi-Tier Computing Networks: A Game-Theoretic Multiple Access Approach
Massive devices have become a bottleneck restricting the improvement of computing networks. In this paper, we investigate massive multiple access (MA) schemes in low earth orbit satellite-unmanned aerial vehicle (UAV) integrated multi-tier computing networks to achieve higher connectivity. A game-theoretic MA approach is proposed for sum data minimization at UAVs. This approach is divided into two parts: data node (DN)-UAV assignment and UAV-satellite matching. In the first part, the DNs’ orthogonal MA process is formulated as a coalition formation game (CFG) with the derived optimal bandwidth allocation. The CFG with the proposed Max-Satisfaction order is proofed as an exact potential game, which can maximize the satisfaction between the collected data and UAVs’ real computing capacities. Besides, the overlapping CFG (OCFG) is utilized for higher satisfaction. In UAV-satellite matching, non-orthogonal MA-based sum rate maximization with imperfect successive interference cancellation is obtained by transmit power optimization firstly. The UAV-satellite matching process is formulated as a many-to-one matching game (MTOMG). A swap-based MTOMG algorithm is proposed for UAVs grouping. Finally, the simulation results show the proposed schemes have better performance than other schemes, and the proposed approach remains the lowest data at UAVs compared to other approaches.
- 15 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72 (3) , 1701-1715
Sum Data Minimization in LEO Satellite-UAV Integrated Multi-Tier Computing Networks: A Game-Theoretic Multiple Access Approach
Massive devices have become a bottleneck restricting the improvement of computing networks. In this paper, we investigate massive multiple access (MA) schemes in low earth orbit satellite-unmanned aerial vehicle (UAV) integrated multi-tier computing networks to achieve higher connectivity. A game-theoretic MA approach is proposed for sum data minimization at UAVs. This approach is divided into two parts: data node (DN)-UAV assignment and UAV-satellite matching. In the first part, the DNs’ orthogonal MA process is formulated as a coalition formation game (CFG) with the derived optimal bandwidth allocation. The CFG with the proposed Max-Satisfaction order is proofed as an exact potential game, which can maximize the satisfaction between the collected data and UAVs’ real computing capacities. Besides, the overlapping CFG (OCFG) is utilized for higher satisfaction. In UAV-satellite matching, non-orthogonal MA-based sum rate maximization with imperfect successive interference cancellation is obtained by transmit power optimization firstly. The UAV-satellite matching process is formulated as a many-to-one matching game (MTOMG). A swap-based MTOMG algorithm is proposed for UAVs grouping. Finally, the simulation results show the proposed schemes have better performance than other schemes, and the proposed approach remains the lowest data at UAVs compared to other approaches.
- 11 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 59 (6) , 8859-8872
Rate Splitting-Based Nonorthogonal Multiple Access Transmission in Satellite– Terrestrial Relay Networks
Satellite-terrestrial relay networks (STRNs) play an important role in future wireless networks. Rate splitting (RS) is recognized as a promising paradigm for non-orthogonal transmission. Non-orthogonal multiple access (NOMA) can provide high spectral efficiency compared to orthogonal multiple access (OMA). In this paper, we investigate RS-based NOMA in STRNs. In our model, RS is applied in satellite-relay links and NOMA is used in the relay-user links with both amplify-and-forward (AF) and decode-and-forward (DF) modes considered at the relays. Firstly, the precoding vectors are derived for the common signal and the private signal based on statistical channel state information. And the closed-form expressions of users' ergodic capacity are derived detailed at both AF and DF modes. Then, the user fairness is achieved by transmit power optimization (TPO). By some mathematical transformations, the TPO is simplified to maximize the minimum average rate of the common signal and derive the optimal NOMA factor. Then, the simplified TPO problem is transformed into a convex problem. Besides, the relay-user section and power optimization algorithm is proposed for users fairness. Finally, the numerical results verify the correctness of theoretical analysis of the ergodic capacity and show the superiority of our proposed approach compared with other schemes.
- 11 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 59 (6) , 8859-8872
Rate Splitting-Based Nonorthogonal Multiple Access Transmission in Satellite– Terrestrial Relay Networks
Satellite-terrestrial relay networks (STRNs) play an important role in future wireless networks. Rate splitting (RS) is recognized as a promising paradigm for non-orthogonal transmission. Non-orthogonal multiple access (NOMA) can provide high spectral efficiency compared to orthogonal multiple access (OMA). In this paper, we investigate RS-based NOMA in STRNs. In our model, RS is applied in satellite-relay links and NOMA is used in the relay-user links with both amplify-and-forward (AF) and decode-and-forward (DF) modes considered at the relays. Firstly, the precoding vectors are derived for the common signal and the private signal based on statistical channel state information. And the closed-form expressions of users' ergodic capacity are derived detailed at both AF and DF modes. Then, the user fairness is achieved by transmit power optimization (TPO). By some mathematical transformations, the TPO is simplified to maximize the minimum average rate of the common signal and derive the optimal NOMA factor. Then, the simplified TPO problem is transformed into a convex problem. Besides, the relay-user section and power optimization algorithm is proposed for users fairness. Finally, the numerical results verify the correctness of theoretical analysis of the ergodic capacity and show the superiority of our proposed approach compared with other schemes.
- 31 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (23) , 20560-20573
LEO Satellite and UAVs Assisted Mobile Edge Computing for Tactical Ad-Hoc Network: A Game Theory Approach
As an emerging technology, mobile edge computing (MEC) network paradigm provides great computing potential for edge services, which has been widely applied in friendly city environment. However, there are still many challenges to deploy MEC technology in harsh tactical communication environment due to poor communication conditions, limited computational resources and hostile malicious interference. Thus, this paper investigates the computational resource pricing and task offloading strategy in tactical MEC Ad-hoc network, which consists of multiple tactical edge nodes, ground MEC servers, unmanned aerial vehicle-MEC (UAV-MEC) servers and a low earth orbit-MEC (LEO-MEC) satellite server. Each edge node can offload its partial computation-intensive task to the MEC servers to reduce computational delay and energy consumption. First, a multi-leader and multi-follower Stackelberg game (MLMF-SG) which includes leader subgame for MEC servers and follower subgame for edge nodes, is proposed to formulate the interaction between servers and edge nodes. It has been proved that there exists a Stackelberg equilibrium (SE) in the proposed MLMFSG. In order to decrease the delay, energy consumption and resource overhead, the follower subgame is further formulated as a multi-mode computation task offloading game. With the help of the exact potential game (EPG), we prove that the follower subgame can converge to the Nash equilibrium (NE). To achieve the SE, a hierarchical distributed iterative algorithm is designed to maximize the utilities of the leaders and followers. Finally, the simulation results demonstrate that the proposed scheme can achieve better performance compared with the existing schemes.
- 31 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (23) , 20560-20573
LEO Satellite and UAVs Assisted Mobile Edge Computing for Tactical Ad-Hoc Network: A Game Theory Approach
As an emerging technology, mobile edge computing (MEC) network paradigm provides great computing potential for edge services, which has been widely applied in friendly city environment. However, there are still many challenges to deploy MEC technology in harsh tactical communication environment due to poor communication conditions, limited computational resources and hostile malicious interference. Thus, this paper investigates the computational resource pricing and task offloading strategy in tactical MEC Ad-hoc network, which consists of multiple tactical edge nodes, ground MEC servers, unmanned aerial vehicle-MEC (UAV-MEC) servers and a low earth orbit-MEC (LEO-MEC) satellite server. Each edge node can offload its partial computation-intensive task to the MEC servers to reduce computational delay and energy consumption. First, a multi-leader and multi-follower Stackelberg game (MLMF-SG) which includes leader subgame for MEC servers and follower subgame for edge nodes, is proposed to formulate the interaction between servers and edge nodes. It has been proved that there exists a Stackelberg equilibrium (SE) in the proposed MLMFSG. In order to decrease the delay, energy consumption and resource overhead, the follower subgame is further formulated as a multi-mode computation task offloading game. With the help of the exact potential game (EPG), we prove that the follower subgame can converge to the Nash equilibrium (NE). To achieve the SE, a hierarchical distributed iterative algorithm is designed to maximize the utilities of the leaders and followers. Finally, the simulation results demonstrate that the proposed scheme can achieve better performance compared with the existing schemes.
- Open Access
- 28 July 2023
- Published by Elsevier in Computer Communications
- Vol. 210, 130-137
Robustness of satellite constellation networks
- 28 July 2023
- Published by Elsevier in Computer Communications
- Vol. 210, 130-137
Open AccessRobustness of satellite constellation networks
- 6 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (23) , 20311-20322
Anti-Jamming Transmission in NOMA-Based Satellite-Enabled IoT: A Game-Theoretic Framework in Hostile Environments
Satellite-enabled Internet of Things (IoT) (SatIoT) has drawn increasing attentions due to the ubiquitous coverage, high capacity and massive connectivity. The inherent openness and broadcast nature of the SatIoT are vulnerable to security threats, particularly the jamming attacks for interrupting transmissions. Non-orthogonal multiple access (NOMA) scheme has the potential to be applied in anti-jamming communication for SatIoT due to the characteristic of resource sharing. The severely jammed users can get more allocated power by forming NOMA groups with other users, and both parties can improve the spectrum efficiency by frequency sharing. In this paper, we aim to improve the performance of sum rate for SatIoT under the jamming environments. An anti-jamming transmission scheme is developed by jointly considering the NOMA-based user grouping and the power allocation for each NOMA group. Specifically, the users can enhance anti-jamming performance and improve the sum rate by NOMA-based users grouping, which is formulated as an anti-jamming coalition formation game, and the equilibrium solution is proved by the exact potential game theory. Moreover, in order to further improve NOMA performance, we derive the power allocation solution for multi-user NOMA by considering the imperfect successive interference cancellation. Finally, simulation results briefly highlight some details of the proposed approaches.
- 6 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (23) , 20311-20322
Anti-Jamming Transmission in NOMA-Based Satellite-Enabled IoT: A Game-Theoretic Framework in Hostile Environments
Satellite-enabled Internet of Things (IoT) (SatIoT) has drawn increasing attentions due to the ubiquitous coverage, high capacity and massive connectivity. The inherent openness and broadcast nature of the SatIoT are vulnerable to security threats, particularly the jamming attacks for interrupting transmissions. Non-orthogonal multiple access (NOMA) scheme has the potential to be applied in anti-jamming communication for SatIoT due to the characteristic of resource sharing. The severely jammed users can get more allocated power by forming NOMA groups with other users, and both parties can improve the spectrum efficiency by frequency sharing. In this paper, we aim to improve the performance of sum rate for SatIoT under the jamming environments. An anti-jamming transmission scheme is developed by jointly considering the NOMA-based user grouping and the power allocation for each NOMA group. Specifically, the users can enhance anti-jamming performance and improve the sum rate by NOMA-based users grouping, which is formulated as an anti-jamming coalition formation game, and the equilibrium solution is proved by the exact potential game theory. Moreover, in order to further improve NOMA performance, we derive the power allocation solution for multi-user NOMA by considering the imperfect successive interference cancellation. Finally, simulation results briefly highlight some details of the proposed approaches.
- 15 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 6 (3) , 1793-1805
Non-Orthogonal Multiple Access-Based Average Age of Information Minimization in LEO Satellite-Terrestrial Integrated Networks
In this paper, we investigate non-orthogonal multiple access (NOMA) based average age of information (AoI) in LEO satellite-terrestrial integrated networks. Two-user NOMA scheme is used in terrestrial networks and several satellites provide orthogonal access for the rest of users to update status packets. Firstly, the closed-form expressions of average AoI in terrestrial networks and satellite channels are derived with average block error rate. Then, the average AoI minimization problem is decomposed into two parts: 1) average AoI minimization in terrestrial networks and 2) average AoI minimization among satellites. In the first part, a base station-terrestrial user selection and transmit power optimization algorithm is proposed for choosing the optimal NOMA pair and transmit power to minimize average AoI in each BS. A coalition formation game (CFG) is formulated to minimize average AoI among satellites in second part. With the proposed Min-AoI order, the CFG is theoretically proven to be an exact potential game, which can achieve total average AoI minimization of all satellite users. A distributed CFG-based algorithm is proposed for SUs grouping with low complexity. Finally, numerical results are provided to verify the correctness of theoretical analysis and evaluate our proposed algorithms, compared with other schemes.
- 15 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 6 (3) , 1793-1805
Non-Orthogonal Multiple Access-Based Average Age of Information Minimization in LEO Satellite-Terrestrial Integrated Networks
In this paper, we investigate non-orthogonal multiple access (NOMA) based average age of information (AoI) in LEO satellite-terrestrial integrated networks. Two-user NOMA scheme is used in terrestrial networks and several satellites provide orthogonal access for the rest of users to update status packets. Firstly, the closed-form expressions of average AoI in terrestrial networks and satellite channels are derived with average block error rate. Then, the average AoI minimization problem is decomposed into two parts: 1) average AoI minimization in terrestrial networks and 2) average AoI minimization among satellites. In the first part, a base station-terrestrial user selection and transmit power optimization algorithm is proposed for choosing the optimal NOMA pair and transmit power to minimize average AoI in each BS. A coalition formation game (CFG) is formulated to minimize average AoI among satellites in second part. With the proposed Min-AoI order, the CFG is theoretically proven to be an exact potential game, which can achieve total average AoI minimization of all satellite users. A distributed CFG-based algorithm is proposed for SUs grouping with low complexity. Finally, numerical results are provided to verify the correctness of theoretical analysis and evaluate our proposed algorithms, compared with other schemes.
- 4 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 58 (4) , 3725-3729
Joint STO and DFO Estimation for SEFDM in Low-Earth-Orbit Satellite Communications
In this article, a joint symbol timing offset (STO) and Doppler frequency offset (DFO) estimation algorithm is proposed for spectrally efficient frequency division multiplexing (SEFDM) system in the downlink of low-earth-orbit (LEO) satellite communications. Considering the nonorthogonality of SEFDM, the proposed algorithm is derived by maximizing likelihood function. To reduce computation complexity of STO estimator, all unnecessary terms in likelihood function are ignored. Further, the proposed CFO estimator is simplified by replacing the inverse trigonometric function with polynomial approximation. According to relevant standards issued by the International Telecommunications Union and the 3rd Generation Partnership Project, simulation parameters are set to evaluate the estimation performance. Simulation results show that the proposed algorithm is robust to different packing factors of SEFDM, and outperforms traditional estimation methods.
- 4 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 58 (4) , 3725-3729
Joint STO and DFO Estimation for SEFDM in Low-Earth-Orbit Satellite Communications
In this article, a joint symbol timing offset (STO) and Doppler frequency offset (DFO) estimation algorithm is proposed for spectrally efficient frequency division multiplexing (SEFDM) system in the downlink of low-earth-orbit (LEO) satellite communications. Considering the nonorthogonality of SEFDM, the proposed algorithm is derived by maximizing likelihood function. To reduce computation complexity of STO estimator, all unnecessary terms in likelihood function are ignored. Further, the proposed CFO estimator is simplified by replacing the inverse trigonometric function with polynomial approximation. According to relevant standards issued by the International Telecommunications Union and the 3rd Generation Partnership Project, simulation parameters are set to evaluate the estimation performance. Simulation results show that the proposed algorithm is robust to different packing factors of SEFDM, and outperforms traditional estimation methods.
- 12 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (1) , 831-843
Files Delivery and Share Optimization in LEO Satellite-Terrestrial Integrated Networks: A NOMA Based Coalition Formation Game Approach
Non-orthogonal multiple access (NOMA) in satellite communication (SATCOM) system can bring high spectral efficiency and massive connectivity. In this paper, we investigate files delivery and share optimization in LEO satellite-terrestrial integrated networks (STINs). A NOMA based coalition formation game (CFG) approach is proposed for minimizing total cost, in which satellite transfer files to head users in each group via NOMA, and head users utilize device to device (D2D) communications to share files among users. Firstly, head users selection algorithm is proposed to choose each group's head users receiving files from satellite. Precoding vectors and transmit power optimization with imperfect channel state information (CSI) are derived to achieve successful NOMA transmission and files download cost minimization in each group. A graph theory based algorithm is proposed to find the optimal D2D links and minimize files share cost. Then, we formulate a CFG and propose a preference order (Group-Best order) for user grouping. Furthermore, we have proved that the CFG with Group-Best order is an exact potential game (EPG), which can get stable group partition and achieve global optimization, i.e., minimizing total cost. Finally, a best response algorithm for NOMA based CFG (NCFG) is proposed to find stable group partition. Simulation results verify that our proposed approach is better than other approaches.
- 12 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (1) , 831-843
Files Delivery and Share Optimization in LEO Satellite-Terrestrial Integrated Networks: A NOMA Based Coalition Formation Game Approach
Non-orthogonal multiple access (NOMA) in satellite communication (SATCOM) system can bring high spectral efficiency and massive connectivity. In this paper, we investigate files delivery and share optimization in LEO satellite-terrestrial integrated networks (STINs). A NOMA based coalition formation game (CFG) approach is proposed for minimizing total cost, in which satellite transfer files to head users in each group via NOMA, and head users utilize device to device (D2D) communications to share files among users. Firstly, head users selection algorithm is proposed to choose each group's head users receiving files from satellite. Precoding vectors and transmit power optimization with imperfect channel state information (CSI) are derived to achieve successful NOMA transmission and files download cost minimization in each group. A graph theory based algorithm is proposed to find the optimal D2D links and minimize files share cost. Then, we formulate a CFG and propose a preference order (Group-Best order) for user grouping. Furthermore, we have proved that the CFG with Group-Best order is an exact potential game (EPG), which can get stable group partition and achieve global optimization, i.e., minimizing total cost. Finally, a best response algorithm for NOMA based CFG (NCFG) is proposed to find stable group partition. Simulation results verify that our proposed approach is better than other approaches.