写作系列之:贡献

范例1:

In this paper, we consider a downlink NOMA single cell wireless network and assume the base station (BS) is aware of the channel state information. With the SIC technique at the receivers, multiple users can be multiplexed on the same subchannel. (先提出模型)
By decoupling the problem as subchannel matching problem and power allocation problem,(分解成两个子问题) we can obtain a suboptimal solution of the original optimization problem. We first aim at providing a new subchannel matching scheme with the power constraint of users on same subchannel based on game theory.(解决第1个子问题) Then for given matching scheme,we achieve the power allocation to subchannels to maximize energy efficiency of NOMA systems.(解决第2个子问题)
The related conference version was given by [38]. We extend it in the following ways: (1) additional theorem and proof are provided now; (2) the convergence analysis of subchannel matching algorithm is provided for showing practicability; (3) we illustrate the proposed method can be applied to improve the sum data rate; (4) more simulations including the performance of data rate are given to verify the result. The main contributions are listed as follows:

一般3条

• We focus on the energy efficiency optimization problem for downlink NOMA network which is different from existing works about the sum data rate optimization problem. We first introduce the SIC technique to decrease the interference from other users on same suchannel.
Then we formulate the energy efficiency maximization problem as an optimization problem with the constraint of sum users’ power which is NP-hard and non-convex.(先formulate问题)
It is challenging to get the optimal solution due to its exponential complexity. (问题很challenging)
Therefore, we transform the optimization problem as subchannel matching scheme and power allocation subproblems.(问题分解成子问题)
By solving two subproblems, we obtain the suboptimal solution instead of the optimal one.
• We introduce a non-cooperative game to model the subchannel matching by some reasonable assumptions. To discuss the existence of NE point for proposed game, we give the definition and properties of super-modular game.
By applying the properties of super-modular game, we design an algorithm to converge to NE point. Based on above discussion about game theory and assume the equal power allocated to each subchannel, a greed bidirection subchannel matching scheme is provided for NOMA system by selecting the users who have the maximum sub-channel energy efficiency. The complexity of our scheme is lower compared with existed optimal exhaustive search.(第1个子问题)
• Given subchannel matching scheme, we solve the power allocation to further improve the energy efficiency of NOMA system. However, the power allocation problem is still a non-convex problem. To reducing the computation complexity, we first rewrite the objective function as difference of two concave functions and prove the quasi concavity of them. Then, a successive convex approximation method to deal with the non-convex term is applied. Based on above analysis, an algorithm to converge to suboptimal solution by solving a convex problem at each iteration is designed.(第2个子问题)

节选自 Super-Modular Game Based User Scheduling and Power Allocation for Energy-Efficient NOMA Network
Liu G , Wang R , Zhang H , et al. Super-Modular Game Based User Scheduling and Power Allocation for Energy-Efficient NOMA Network[J]. IEEE Transactions on Wireless Communications, 2018:1-1.

范例2:

The main contributions of this paper can be summarized
below.

1. We construct a UAV-to-X communication network, where the UAVs can either upload the collected data via U2N communications directly or send to other UAVs by U2U communications. A cooperative UAV sense-and-send protocol is proposed to enable these communications.(先提出模型)
2. We formulate a joint subchannel allocation and UAV speed optimization problem to maximize the uplink sum-rate of the network.(先formulate问题) We then prove that the problem is NP-hard and decompose it into three sub-problems: U2N and CU subchannel allocation, U2U subchannel allocation, and UAV speed optimization.(问题分解成子问题) An efficient iterative subchannel allocation and speed optimization algorithm (ISASOA) is proposed to solve the sub-problems iteratively.
3. We compare the proposed algorithm with a greedy algorithm in simulations. The results show that the proposed ISASOA outperforms the greedy algorithm by about 10% in terms of the uplink sum-rate.
   节选自 Cellular UAV-to-X Communications: Design and Optimization for Multi-UAV Networks
   Zhang S , Zhang H , Di B , et al. Cellular UAV-to-X Communications: Design and Optimization for Multi-UAV Networks[J]. IEEE Transactions on Wireless Communications, 2018, PP(99).

范例3:

In this paper, we are interested in an urban type environment where aerial base stations are deployed to support damaged/overloaded ground base stations. (提出模型) Our objective is to efficiently place the UAVs in the 3D plan and associate the users in order to reach an efficient value of the downlink sum-rate of the network. (提出目标，formulate 问题) Being non convex and NP-hard, the studied problem cannot be solved using classical convex optimization methods. (说这个问题很难) Therefore, we propose an algorithm referred to as ’Learn-As-You-Fly’ (LAYF) that iteratively breaks the underlying optimization problem into three subproblems: 2D UAVs positioning, the altitude optimization, and the UAV-user’s association. (分解成3个子问题)
At each iteration,

1. LAYF addresses the UAV-user’s association by leveraging a distributed matching scheme that alleviates the bottlenecks of the bandwidth and guarantees the required quality of service. 第1步
2. It also updates the 2D coordinates using a modified K-means approach where UAVs dynamically change their 2D positions in order to reach the barycenter of the served ground users. 第2步
3. Finally, LAYF adjusts UAVs altitudes by only optimizing a local utility function based on a neighborhood structure that depends on interference. 第3步
4. The last step of the algorithm is justified by the fact that under fixed UAVs 2D coordinates, a predefined association scheme, and limited interference, the UAVs altitudes subproblem can be seen as a non-cooperative potential game where the players (UAVs) can reach the optimum of the limited-interference sum-rate by only looking for a Nash equilibrium of a local utility function. 第4步
5. Our simulation results show that a good performance can be reached as compared to both a centralized suboptimal solution and a distributed approach that is based on closest UAVs association.

节选自 Hammouti H E , Benjillali M , Shihada B , et al. Learn to Fly: A Distributed Mechanism for Joint 3D Placement and Users Association in UAVs-assisted Networks[J]. 2018.

范文4

The main contribution of this paper is twofold:

• We propose a backhaul limited optimal drone-BS placement algorithm for various network design parameters, such as the number of the served users or the sum-rate of the served users for heterogeneous rate requirements in a clustered user distribution.

• We investigate the robustness of drone-BS placement and study how much the users movements may affect the proposed optimal solution.

节选自 E. Kalantari, M. Z. Shakir, H. Yanikomeroglu and A. Yongacoglu, “Backhaul-aware robust 3D drone placement in 5G+ wireless networks,” 2017 IEEE International Conference on Communications Workshops (ICC Workshops), Paris, France, 2017, pp. 109-114, doi: 10.1109/ICCW.2017.7962642.

范文5

The main contributions of the paper are summarized as follows.

1. We develop a model for energy-efficient UAV trajectory design and resource allocation in the MEC system. The model incorporates computing service improvement and energy consumption minimization in a UAV -mounted cloudlet. The communication and computing resources are allocated subject to the user communication energy budget, computation capability, and the mechanical operation constraints of the UA V .

2. We exploit the successive convex approximation (SCA) technique and Dinkelbach algorithm to transform the non-convex fractional programming problem into a solvable form. In order to improve scalability, we further decompose the optimization problem by the alternating direction method of multipliers (ADMM) technique. UAV and ground users solve the optimization problem cooperatively in a distributed manner. By our approach, both users and UA V can obtain the optimal resource allocation results iteratively without sharing local information.

3. We further consider the scenario with limited knowledge of node mobility. A spatial distribution estimation technique, Gaussian kernel density estimation, is applied to predict the location of ground users. Based on the predicted location information, our proposed strategy can determine an energy-efficient UAV trajectory when the user mobility and offloading requests are ambiguous at the beginning of each optimization cycle.

摘自 M. Li, N. Cheng, J. Gao, Y. Wang, L. Zhao and X. Shen, “Energy-Efficient UAV-Assisted Mobile Edge Computing: Resource Allocation and Trajectory Optimization,” in IEEE Transactions on Vehicular Technology, vol. 69, no. 3, pp. 3424-3438, March 2020, doi: 10.1109/TVT.2020.2968343.