 Research
 Open access
 Published:
Joint computation offloading and resource allocation strategy for D2Dassisted and NOMAempowered MEC systems
EURASIP Journal on Wireless Communications and Networking volumeÂ 2023, ArticleÂ number:Â 9 (2023)
Abstract
Multiaccess edge computing (MEC) emerged as a promising network paradigm that provides computation, storage and networking features within the edge of the pervasive mobile radio access network. This paper jointly considers computation offloading and resource allocation problem in devicetodevice (D2D)assisted and nonorthogonal multiple access (NOMA)empowered MEC systems, where each mobile device (MD) is allowed to execute its task in one of the three ways, i.e., local computing, MEC offloading or D2D offloading. We invoke orthogonal multiple access (OMA) and NOMA schemes for MDs that select D2D offloading mode, allowing them to assign tasks to their peers using OMA or NOMA. The original problem is formulated as an overall energy consumption minimization problem, which proves to be NPhard, making it intractable to solve optimally. We start from a simple case, OMA case and transform the original problem into two subproblems, i.e., resource allocation subproblem and computation offloading subproblem and propose two heuristic algorithms to obtain the suboptimal solutions of both subproblems. Then, for the MDs selecting D2D offloading mode, we conduct user pairing and apply the NOMA scheme. Finally, simulation results demonstrate the efficiency of the proposed scheme when compared with the related schemes.
1 Introduction
Technology scaling triggers some promising applications, i.e., face recognition, virtualreality (VR), augmentedreality (AR), interactive gaming, etc. These applications are very often running on mobile devices (MDs); however, the limited computation and processing capability of MDs may degrade the performance measures of the applications and result in the undesired quality of experience (QoE) [1]. Multiaccess edge computing (MEC) has emerged as a potent tool to satisfy the growing demands of high task execution rate, low latency, and low energy consumption by bringing the computation and storage resources to the edge of wireless networks, such as the base stations (BSs) of cellular networks. Leveraging the advanced processing capability of MEC servers, conducting computation offloading which offloads computationally intensive tasks from MDs to MEC servers, and executing user tasks at the servers is highly desired [2, 3].
The problem of computation offloading has been considered extensively in recent research work [4,5,6,7,8,9]. The authors in [4] formulate the cooperative computation offloading problem (which maximizes the expected longterm reward in terms of service delay) as a Markov decision process (MDP) and propose two intelligent computation offloading algorithms based on soft actor critic (SAC), i.e., centralized SAC offloading and decentralized SAC offloading to solve the problem. A devicecentric and riskbased distributed approach is proposed in [5], where the authors exploit game theory to obtain the optimal amount of computation offloading volume. The authors in [6] jointly optimize software caching and computation offloading to minimize the weighted sum energy consumption in a multiuser cacheassisted MEC system and propose an alternating direction method of multipliers (ADMM) and penalty convexâ€“concave procedure (PenaltyCCP) to obtain the suboptimal solutions. In [7], the authors formulate an energyefficient computation offloading problem as a mixed integer nonlinear programming problem in a MECenabled small cell network. To minimize the energy consumption of all user equipments, a suboptimal algorithm consisting of a hierarchical genetic algorithm and a particle swarm optimization (PSO)based computation algorithm is proposed. The authors in [8] study the computation offloading and caching problem aiming at minimizing the execution latency of user tasks by utilizing a collaborative call graph approach. In [9], a collaborative computation offloading scheme is proposed for centralized computing environment and a gametheoretic approach is proposed for distributed computing environment so as to minimize the energy consumption of the system.
To alleviate the evergrowing resource contention and improve the communication and computational efficiency of standalone MEC servers, devicetodevice (D2D) communication is leveraged, where the diversity among nearby devices can be exploited to share the computational burden [10, 11]. D2Daided computation offloading techniques have been considered in recent research work [12,13,14,15].
Taking into account the dynamic system status and random task arrival rate, the authors in [12] investigate the energyefficient task offloading problem in sociallyaware D2Dassisted MEC networks and maximize the longterm network utility by jointly optimizing D2D connection selection and task allocation. Aiming at minimizing the computation latency for the tasks in a D2Denabled heterogeneous network, the authors in [13] formulate a userassisted multitask offloading problem under the constraints on latency and energy consumption. A distributed optimization scheme based on ADMM is presented to determine the task offloading strategy. The authors in [14] formulate the computation capacity maximization problem in a multiuser D2DMEC system as a mixed integer nonlinear programming problem with constraints on both communication and computation resources. The original problem is decomposed into two subproblems, where the first subproblem aims to minimize the required edge computation resources for a given D2D pair, and the second subproblem aims to maximize the computation capacity of the D2DMEC system. A task offloading framework is proposed in [15], where MDs could share their computation and communication resources among each other via the assistance of network operators. Lyapunov optimization tool is utilized to produce dynamic task offloading decisions, which minimizes the timeaveraged energy consumption.
Some research work jointly considers computation offloading and resource allocation problems [16,17,18,19,20,21,22]. In [16], the authors jointly optimize task offloading, cache decision, transmission power and central processing unit (CPU) frequency allocation to minimize the weighted sum cost of the execution delay and energy consumption in a cloudedge heterogeneous network. The authors in [17] consider a D2Denabled MEC system and formulate user association, task offloading and resource allocation problem as a latency minimization problem. By solving the optimization problem, a joint optimal strategy is obtained. In order to maximize the longterm utility energy efficiency, the authors in [18] jointly optimize the transmit power of the D2D link, the cellular uplink transmit power and the local CPU speed in a wireless powered D2Denabled MEC system. Lyapunov optimization method is employed to transform the original problem into a series of deterministic driftpluspenalty subproblems in each time slot. The authors in [19] propose a mobilityaware task scheduling approach in a D2Denabled cooperative MEC framework, in which joint optimization of user mobility, computation capacities and task properties is performed to minimize task offloading latency. The authors in [20] jointly optimize computing resource, transmit power and channel allocation to minimize the weighted sum of delay and energy consumption of all users. Due to multivariate fractional summation nature, the original optimization problem is dissolved into subproblems, namely, power allocation subproblem, and channel allocation subproblem. To solve the power allocation subproblem, the authors employ PSO algorithm, and for the channel allocation subproblem, a onetoone matching algorithm based on swapping operations and Pareto improvement is proposed. The authors in [21] formulate the computation offloading and resource allocation problem in a multiuser MEC system as a weighted delay and energy consumption minimization problem and solve the problem by exploiting branch and bound method. A twostage heuristic optimization (THO) algorithm is proposed in [22], which minimizes the overall energy consumption of the MDs by jointly designing task offloading decisions, channel selection, power allocation and resource allocation strategy.
Emerged as a key enabler for the fifth generation (5G) of wireless networks, nonorthogonal multiple access (NOMA) allows multiple users to share the same resource block (RB) simultaneously by enabling superposition coding (SC) at the transmitters and successive interference cancellation (SIC) at the receivers [23, 24]. Aiming to achieve high spectral efficiency, improved quality of service (QoS) and lower latency, some recent research work has been carried out considering the cooperation of NOMA and MEC [25,26,27,28,29,30,31,32,33].
In order to minimize the overall system delay, the authors in [25] jointly optimize the offloaded computationworkloads and the transmission time in a NOMAassisted MEC system. To solve the formulated joint optimization problem, two algorithms are proposed for singleuser case and multiuser case, respectively. The authors in [26] jointly optimize the MEC server allocation, the transmit power allocation of all the MDs, the transmit power allocation of the MEC servers, the computational resource allocation of the MEC servers, the time allocation and the channel allocation variables to minimize the overall delay of all the tasks. The authors in [27] propose a hybrid NOMAMEC offloading strategy and formulate a multiobjective optimization problem to minimize the userâ€™s energy consumption by finding lowcomplexity paretooptimal resource allocation solution using exhaustive search method. Taking into account two different wireless channel scenarios, namely, staticchannel scenario and dynamicchannel scenario, the authors in [28] propose an algorithm based on channel quality ranking (CQR) as a means to minimize the overall computation delay for a singleuser multiedge computing server. An optimal offloading solution is obtained by combining the golden section search method with the CQR algorithm for a static channel. For a dynamic channel, an algorithm based on deep reinforcement learning (DRL) is proposed. A hybrid NOMAMEC offloading framework is proposed in [29], where the authors jointly optimize power, time and subchannels to minimize the overall energy consumption. A switched hybrid NOMA scheme is proposed to allocate power and time, while the total reward exchange stable algorithm is used for channel allocation.
Exploiting the advantages of NOMAbased MEC communication in vehicular networks, the authors in [30] propose a NOMAenabled vehicular edge computing (VEC) network, in which the joint optimization of offloading decisions, vehicular user equipment clustering, subchannel allocation, computational resource allocation and transmit power control is implemented to minimize the overall system cost. A backscatterassisted wirelesspowered NOMAMEC framework is presented in [31], in which the authors optimize energy harvesting (EH) time, backscatter communication time, uplink time, power reflection coefficient and transmit power, as well as computing frequencies in order to maximize the total amount of computation bits across all internet of things (IoT) devices. The authors in [32] jointly optimize the offloaded computation workloads of users, the offloadingduration as well as the computation resource allocation of the MEC servers to minimize the overall task execution latency. A computation efficiency maximization problem is formulated for NOMAenabled MEC networks in [33], where the authors jointly optimize the transmit power of users and the CPU frequency of MEC servers. To analyze the impacts of delay and energy consumption on computation offloading and resource allocation, the authors in [34] formulate a joint latency and energy consumption minimization problem and provide analytical results for both NOMA uplink and downlink communication scenarios. Aiming at minimizing the overall system cost, the authors in [35] jointly optimize the computationresource allocation at the MEC servers, the MDs computation offloading and the radio resource allocation for the data transmission in a NOMAenabled multiaccess MEC network and propose a threelayered algorithm to obtain the optimal solution. To minimize the weighted sum energy consumption of all the MDs, the authors in [36] jointly optimize task offloading, channel allocation and time allocation.
While computation offloading problem in NOMAenabled MEC systems has been investigated, the extensive study on the computation offloading and access mode selection problem is missing. In particular, exploiting the advantages of both NOMA and orthogonal multiple access (OMA) technologies so as to enhance the task transmission performance is still an important issue worthy studying. Furthermore, although there exist numerous research activities that investigate D2Dbased computation offloading and NOMAenabled MEC system, previous studies fail to jointly consider the computation offloading mode, resource allocation and access scheme selection issues for OMA/NOMAenabled cellular D2D systems. In this paper, we study computation offloading problem in cellular D2D systems. Specifically, it is assumed that MDs may execute theirÂ tasks locally, offload their tasks to the MEC servers or to their D2D peers by applying either OMA or NOMA schemes, and the resources of BSs and MEC servers are shared among multiple MDs, we address the computation offloading mode, communication and computation resource sharing and access scheme selection problem. The overall energy consumption is examined and the joint optimization problem is formulated and solved by dividing the original problem into two subproblems and solving the two subproblems, respectively. In a nutshell, the key contributions of the proposed design can be summarized as follows:

To unlock the true potential of key multiple access techniques, i.e., OMA and NOMA, in the perspective to enhance the task transmission performance, which aimed at minimizing the overall energy consumption, in this paper, we consider a D2Dassisted and NOMAempowered MEC framework, in which computation and communication resources are jointly optimized.

To preserve the computation and communication efficiency, we jointly investigate the computation offloading mode, resource allocation and access scheme selection issues for OMA/NOMAempowered cellular D2D system. Each MD in the network can execute its task in one of the three execution modes, i.e., local, MEC or D2D. For the MDs selecting D2D offloading mode, we further invoke OMA and NOMA modes, which allow the MDs to offload their tasks to their D2D peers by applying either OMA or NOMA.

The joint computation offloading mode selection, resource allocation and access scheme selection problem is formulated as an energy consumption minimization problem. Since the formulated problem is of NPhard nature which is very difficult to solve in polynomial time, we start from a simple case and consider only OMAbased transmission scheme. We transform the original problem into two subproblems, i.e., computation offloading subproblem and resource allocation subproblem and propose two heuristics to solve them, then for the MDs selecting D2D offloading mode, we conduct user pairing and apply NOMA scheme. Extensive numerical results are provided to validate the performance of the proposed scheme.
The rest of this paper is organized as follows. SectionÂ 2 describes the system model. SectionÂ 3 further explores the system model, express different delay and energy consumption formulations for various computing modes and formulate the optimization problem. SectionsÂ 4 and 5 present the solution of the optimization problem and propose two heuristics to solve it. Extensive simulation results are presented in Sect.Â 6. A brief discussion on computational complexity and convergence analysis is provided in Sect.Â 7. Finally, conclusion is drawn and presented in Sect.Â 8.
2 System model
In this section, we discuss the system model considered in this paper, including network model and communication resources sharing schemes. Table 1 summarizes the notations used in this work.
2.1 Network model
We consider a cellular D2D communication system which consists of N BSs and a number of mobile devices (MDs), where each BS is equipped with one MEC server which is capable of offering computation offloading service to the MDs. The MDs in the network can be classified into two types, i.e., task offloading request users (RUs) and service providing users (PUs). Each RU has a computationintensive task to execute, while each PU is of relatively advanced computation performance and may offer computation offloading service to RUs via D2D links. Denote BS\(_n\) as the nth BS, \(1\le n\le N\). For convenience, we denote the MEC server attached to BS\(_n\) as MEC\(_n\). Let M and J denote, respectively, the number of RUs and PUs, and RU\(_m\) and PU\(_j\) denote, respectively, the mth RU and the jth PU, \(1\le m\le M\), \(1\le j\le J\).
Let T\(_m\) denote the task of RU\(_m\), \(1\le m\le M\). We assume that T\(_m\) can be described by a triple \(<\xi _m, \eta _m, D^{\max }_m>\), where \(\xi _m\) is the input data size of T\(_m\), \(\eta _m\) is the computing capacity (in CPU cycles per bit) required to process T\(_m\) and \(D^{\max }_m\) is the maximum tolerable latency to execute T\(_m\). It is apparent that in the considered cellular D2D system, one RU may execute its task in various manners, i.e., local computing, MEC offloading or D2D offloading. Specifically, in local computing mode, the RU executes its entire task locally. In MEC offloading mode, the RU offloads its task to one MEC server for task execution. In D2D offloading mode, the RU offloads its task to one neighboring PU for task execution. The considered system model is shown in Fig.Â 1.
2.2 Communication resources sharing schemes
To enable efficient task transmission in MEC offloading and D2D offloading mode, we assume that a number of orthogonal subchannels have been allocated to cellular links and D2D links as well. For cellular link transmission, multiple RUs may access one BS using orthogonal subchannels and one RU can only occupy one subchannel for task transmission. Let \(W_n^{\mathrm{max}}\) denote the maximal number of subchannels that can be utilized for data transmission between RUs and BS\(_n\), \(1\le n\le N\), and \(W_0\) denote the bandwidth of each subchannel. Let K denote the total number of subchannels. Note that in this work, we make a relatively simple assumption on channel interference. That is, we assume that thereâ€™s no interference between RUs. In the case that there exists interference between different links, we can apply power control or timefrequency resource allocation schemes to migrate or reduce the interference.
For D2D offloading mode, we assume that one PU may assign at most two (adjacent) subchannels to neighboring RUs in order to enable their task transmission in D2D offloading mode. In the case that two RUs tend to offload their tasks to one PU, given the bandwidth resources of D2D links, the two RUs may access the PU by applying either OMA or NOMA scheme. For convenience, the corresponding task computation modes are referred to as OMAbased D2D offloading mode and NOMAbased D2D offloading mode, respectively. The data rate of the D2D links in both modes is analyzed below.
2.2.1 Data rate in OMAbased D2D offloading mode
To apply OMA scheme to RUs in D2D offloading mode, we assume that one subchannel is assigned to at most one RU. Suppose RU\(_m\) offloads its task T\(_m\) to PU\(_j\) in OMAbased D2D offloading mode. Let \({R_{m,j}^{\mathrm{d}}}\) denote the achievable data rate of the link between RU\(_m\) and PU\(_j\), \({R_{m,j}^{\mathrm{d}}}\) can be formulated as
where \(\mu _{m,j,k}^{\mathrm{d}}\in \{0,1\}\) is the subchannel assignment variable in D2D offloading mode, i.e., \(\mu _{m,j,k}^{\mathrm{d}}=1\), if the kth subchannel is assigned to RU\(_m\) when offloading to PU\(_j\), otherwise, \(\mu _{m,j,k}^{\mathrm{d}}=0\), \(P_{m}\) is the transmit power of RU\(_m\), \(h_{m,j,k}^{\mathrm{d}}\) is the channel gain of the link between RU\(_m\) and PU\(_j\) at the kth subchannel, \(\sigma ^{2}\) is the power of channel noise.
2.2.2 Data rate in NOMAbased D2D offloading mode
Applying NOMAbased D2D offloading mode, we assume that two RUs are allowed to offload their tasks to one PU simultaneously. Suppose RU\(_{m}\) and RU\(_{m_1}\) both offload their tasks to PU\(_j\) using NOMA scheme. Let \(R_{m,m_1,j}^{\mathrm{1}}\) and \(R_{m,m_1,j}^{\mathrm{2}}\) denote, respectively, the data rate of the link between RU\(_{m}\) and PU\(_j\), and that between RU\(_{m_1}\) and PU\(_j\). Let \(h_{m,j,k}^{\mathrm{n}}\) and \(h_{m_1,j,k}^{\mathrm{n}}\) be the channel gain of the link between RU\(_{m}\) and PU\(_j\), and that between RU\(_{m_1}\) and PU\(_j\) at the kth subchannel. Without loss of generality, we assume that \(h_{m,j,k}^{\mathrm{n}}<h_{m_1,j,k}^{\mathrm{n}}\), \(h_{m,j,k}^{\mathrm{n}}\approx h_{m,j,k+1}^{\mathrm{n}}\), and \(h_{m_1,j,k}^{\mathrm{n}}\approx h_{m_1,j,k+1}^{\mathrm{n}}\) [37].
Suppose SIC scheme is exploited at PU\(_j\), \(R_{m,m_1,j}^{\mathrm{1}}\) and \(R_{m,m_1,j}^{\mathrm{2}}\) can be computed, respectively, as
where \(\mu _{m,m_1,j,k}^{\mathrm{n}}\in \{0,1\}\) is the subchannel assignment variable in NOMAbased D2D offloading mode, i.e, if the kth and the \((k+1)\)th subchannel are allocated to RU\(_m\) and RU\(_{m_1}\) for transmitting tasks to PU\(_j\) in NOMAbased D2D offloading mode, we set \(\mu _{m,m_1,j,k}^{\mathrm{n}}=1\), otherwise, \(\mu _{m,m_1,j,k}^{\mathrm{n}}=0\).
2.3 Task execution cost in various computation modes
In this section, the delay and energy consumption for task execution in different computation modes are analyzed.
2.3.1 Local computing mode
In the case that RU\(_m\) executes its task locally, \(1\le m\le M\), the task execution delay can be characterized by
where \(f_m^{\mathrm{0}}\) denotes the computational capability of RU\(_m\). The energy consumption of RU\(_m\) due to task execution can be expressed as
where \(\kappa _{m}\) is the energy consumption coefficient of RU\(_m\), which depends on the attributes of the CPU of RU\(_m\) [21].
2.3.2 MEC offloading mode
In MEC offloading mode, one RU sends its task to one of the MEC servers, which then conducts task execution for the RU. Hence, the delay required to complete task execution can be computed as the sum of task transmission time from the RU to the MEC server, and the task execution time at the MEC server. Suppose RU\(_m\) offloads its task T\(_m\) to MEC\(_n\), the total time for completing task execution can be calculated as
where \({D_{m,n}^{\mathrm{m,t}}}\) and \({D_{m,n}^{\mathrm{m,e}}}\) denote, respectively, the transmission time and execution time of T\(_m\). It should be noted that after executing T\(_m\), MEC\(_n\) needs to transmit the result back to RU\(_m\). Since the data size of the task after execution is in general very small, the required transmission delay from MEC\(_n\) to RU\(_m\) is negligible [21].
\({D_{m,n}^{\mathrm{m,t}}}\) in (6) can be formulated as
where \(R_{m,n}^{\mathrm{m}}\) is the transmission rate of the link between RU\(_m\) and MEC\(_n\), which can be expressed as
where \(\mu _{m,n,k}^{\mathrm{m}} \in \{0,1\}\) is the subchannel allocation variable in MEC offloading mode, i.e., \(\mu _{m,n,k}^{\mathrm{m}}=1\), if the kth subchannel is allocated to RU\(_m\) for offloading its task to MEC\(_n\), otherwise, \(\mu _{m,n,k}^{\mathrm{m}}=0\), \(h_{m,n,k}^{\mathrm{m}}\) denotes the channel gain of the link between RU\(_m\) and MEC\(_n\) at the kth subchannel.
The task execution delay, denoted by \(D_{m,n}^{\mathrm{m,e}}\) in (6), can be characterized as
where \(f_{n}^{\mathrm{m}}\) denotes the computational capacity of MEC\(_n\) for processing the task of one RU.
The energy consumption in MEC offloading mode is resulted from task transmission and execution. Consider RU\(_m\) offloads its task to MEC\(_n\), we obtain the energy consumption as
where \(E_{m,n}^{\mathrm{m,t}}\) is the energy consumption of RU\(_m\) when transmitting its task to MEC\(_n\), which is given by
\(E_{m,n}^{\mathrm{m,e}}\) in (10) is the energy consumption of MEC\(_n\) when executing T\(_m\) for RU\(_m\). \(E_{m,n}^{\mathrm{m,e}}\) can be computed as
where \(\kappa _{n}^{\mathrm{m}}\) denotes the energy consumption coefficient of MEC\(_n\).
2.3.3 D2D offloading mode
In D2D offloading mode, one RU may transmit its task to a neighboring PU which then executes the tasks for the RU. In order to facilitate efficient spectrum utilization, we assume that both OMAbased D2D scheme and NOMAbased D2D scheme are allowed during the task transmission from the RUs to the PUs.
To apply OMAbased D2D offloading mode, we assume that one subchannel is assigned to at most one RU for offloading its task to one PU. Suppose RU\(_m\) offloads its task T\(_m\) to PU\(_j\), the corresponding task completion delay can be determined by
where \(D_{m,j}^{\mathrm{d,t}}\) and \(D_{m,j}^{\mathrm{d,e}}\) denote, respectively, the transmission time required when RU\(_m\) offloads its task T\(_m\) to PU\(_j\) and the execution time of task T\(_m\) at PU\(_j\).
\(D_{m,j}^{\mathrm{d,t}}\) can be expressed as
\(D_{m,j}^{\mathrm{d,e}}\) in (13) can be characterized by
where \(f_{j}^{\mathrm{d}}\) is the computational capacity of PU\(_j\) for processing the task of one RU. The energy consumption in D2D offloading mode is caused by task transmission and execution. When RU\(_m\) offloads its task T\(_m\) to PU\(_j\), the energy consumption is given by
where \(E_{m,j}^{\mathrm{d,t}}\) and \(E_{m,j}^{\mathrm{d,e}}\) denote the energy consumption of RU\(_m\) for task transmission and the energy consumption of PU\(_j\) for task execution, respectively. \(E_{m,j}^{\mathrm{d,t}}\) can be expressed as
\(E_{m,j}^{\mathrm{d,e}}\) is given by
where \(\kappa _{j}^{\mathrm{d}}\) denotes the energy consumption coefficient of PU\(_j\).
To apply NOMAbased D2D offloading mode, we assume that two RUs offload their tasks to one PU simultaneously. Suppose RU\(_{m}\) and RU\(_{m_1}\) both offload their tasks to PU\(_j\) using two adjacent subchannels, the task completion time can be expressed as
where \(D_{m,m_1,j}^{\mathrm{n,t}}\) and \(D_{m,m_1,j}^{\mathrm{n,e}}\) are, respectively, the task transmission time and execution time of RU\(_{m}\) and RU\(_{m_1}\) when offloading their tasks to PU\(_j\). \(D_{m,m_1,j}^{\mathrm{n,t}}\) is given by
where \(D_{m,m_1,j}^{\mathrm{n,t,1}}\) and \(D_{m,m_1,j}^{\mathrm{n,t,2}}\) denote, respectively, the task transmission time of RU\(_{m}\) and RU\(_{m_1}\), and can be computed as
The task execution time of RU\(_{m}\) and RU\(_{m_1}\) at PU\(_j\) denoted by \(D_{m,m_1,j}^{\mathrm{n,e}}\) in (19) can be calculated as
where \(D_{m,m_1,j}^{\mathrm{n,e,1}}\) and \(D_{m,m_1,j}^{\mathrm{n,e,2}}\) are, respectively, the task execution time of RU\(_{m}\) and RU\(_{m_1}\) at PU\(_j\), which are given by
The energy consumed due to task transmission and execution when RU\(_{m}\) and RU\(_{m_1}\) offloading their tasks to PU\(_j\) in NOMAbased D2D mode can be expressed as
where \(E_{m,m_1,j}^{\mathrm{n,t}}\) and \(E_{m,m_1,j}^{\mathrm{n,e}}\) denote, respectively, the energy consumption during transmission and that during task execution. \(E_{m,m_1,j}^{\mathrm{n,t}}\) is given by
where \(E_{m,m_1,j}^{\mathrm{n,t,1}}\) and \(E_{m,m_1,j}^{\mathrm{n,t,2}}\) are, respectively, the transmission energy consumption of RU\(_{m}\) and RU\(_{m_1}\), and can be expressed as
\(E_{m,m_1,j}^{\mathrm{n,e}}\) can be expressed as
where \(E_{m,m_1,j}^{\mathrm{n,e,1}}\) and \(E_{m,m_1,j}^{\mathrm{n,e,2}}\) are, respectively, the energy consumption of PU\(_j\) when executing the task of RU\(_m\) and RU\(_{m_1}\). \(E_{m,m_1,j}^{\mathrm{n,e,1}}\) and \(E_{m,m_1,j}^{\mathrm{n,e,2}}\) are given by
3 Delay and energy consumption function formulation
In this work, we design a centralized scheme, where instead of optimizing the performance of a particular RU, we aim to minimize the overall system energy consumption which consists of the local task execution energy consumption of the RUs, the task transmission energy consumption of the RUs and the task execution energy consumption of the PUs and the MEC servers. In this section, we first examine the total energy consumption, then formulate joint computation offloading and resource allocation strategy as an energy consumption minimization problem.
The total energy consumption required for transmitting and executing the tasks of all the RUs can be expressed as
where \(E_{m}\) is the energy consumption required for transmitting and executing the task of RU\(_m\), and can be computed as
where \(x_{m}^{\mathrm{0}}\in \{0,1\}\) denotes the computation offloading decision variable for local computing mode, i.e., \(x_{m}^{\mathrm{0}}\)=1, if RU\(_{m}\) executes its task locally, otherwise, \(x_{m}^{\mathrm{0}}=0\); \(x_{m,n}^{\mathrm{m}}\in \{0,1\}\) is the computation offloading decision variable for MEC offloading mode, if RU\(_{m}\) offloads its task to MEC\(_n\), \(x_{m,n}^{\mathrm{m}}=1\), otherwise, \(x_{m,n}^{\mathrm{m}}=0\). Likewise, if RU\(_{m}\) offloads its task to PU\(_j\) in OMAbased D2D mode, \(x_{m,j}^{\mathrm{d}}=1\), otherwise, \(x_{m,j}^{\mathrm{d}}=0\), whereas \(x_{m,m_1,j}^{\mathrm{n}}=1\) indicates that both RU\(_{m}\) and RU\(_{m_1}\) offload their tasks to PU\(_j\) using NOMAbased D2D scheme, otherwise, \(x_{m,m_1,j}^{\mathrm{n}}=0\).
3.1 Optimization constraints
In order to jointly design the computation offloading and resource allocation strategy, we consider a number of optimization constraints.
3.1.1 Delay constraint
The tasks of RUs should be executed before the given maximum deadline, i.e.,
where \(D_{m}\) is the time required for transmitting and executing the task of RU\(_m\), and can be computed as
3.1.2 Computation offloading constraint
We assume that each RU can only execute its task in one of the three offloading modes, i.e., local computing, MEC offloading or D2D offloading, hence, the computing mode selection constraint is given as
3.1.3 Resource allocation constraints in MEC offloading mode
In MEC offloading mode, we assume that one subchannel can only be assigned to one RU and vice versa, hence, the subchannel allocation constraints can be expressed as
The maximal number of subchannels of BS\(_n\) puts the constraint on the number of RUs accessing the BS, i.e.,
3.1.4 Resource allocation constraints in OMAbased D2D scheme
In OMAbased D2D scheme, we assume that one subchannel can only be assigned to one RU and vice versa, hence, the subchannel allocation constraints can be expressed as
In OMAbased D2D scheme, at most two RUs may access one PU for computation offloading utilizing two subchannels, we obtain the following constraint:
3.1.5 Resource allocation constraints in NOMAbased D2D scheme
In NOMAbased D2D scheme, each subchannel can only be assigned to one NOMA pair, we obtain
In NOMAbased D2D scheme, at most two subchannels are assigned to two RUs, i.e.,
We assume that two adjacent subchannels should be assigned to one NOMA pair, i.e.,
where \(\odot\) represents the inclusive OR operator.
3.1.6 Constraints on offloading mode selection and resource allocation
Apparently, there exists a direct relation between offloading mode selection and subchannel allocation decision in allÂ the three offloading modes, we express the constraints as follows:
3.2 Optimization problem formulation
To minimize the energy consumption subject to a number of constraints, we formulate the optimization problem as follows:
4 Proposed algorithm: no NOMA scheme applied
Since the optimization problem formulated in (50) is NP hard, which is inconvenient to solve in polynomial time. In this section, we start from a relatively simple case, i.e., for D2D offloading mode, only OMAbased transmission scheme is considered, and propose a heuristic algorithm. By examining the energy consumption of RUs in different task offloading modes, we first determine local computing mode, then present a prioritybased subchannel allocation algorithm for conflicting RUs. In next section, we consider the RUs choosing D2D offloading mode, and determine task offloading mode and subchannel allocation strategy.
4.1 Rewriting energy consumption in various offloading modes
To minimize the energy consumption in (50), we may examine extensively the energy consumption of individual RUs in different offloading modes at various subchannels. Let \(E_{m}^{\mathrm{loc}}\), \(E_{m,n,k}^{\mathrm{mec}}\), \(E_{m,j,k}^{\mathrm{d2d}}\) denote, respectively, the energy consumption of RU\(_m\) in local computing mode, MEC offloading mode and OMAbased D2D offloading mode.
Suppose that only OMA scheme is allowed in D2D offloading mode and taking into account the constraints on mode selection variables and subchannel allocation variables specified in C12, C13, we may rewrite the energy consumption E as follows:
The original optimization problem in (50) is reduced to
The above optimization problem involves computation mode selection and subchannel allocation among various offloading modes, which is still difficult to tackle. In this subsection, we propose a heuristic algorithm, which conducts the following steps successively, i.e., local computing mode selection, subchannel allocation for nonconflicting RUs, prioritybased subchannel allocation for conflicting RUs.
4.2 Local computing mode selection
For RU\(_m\), we may calculate its energy consumption in different computing modes at different subchannels. It is obvious that if one RU needs to consume the minimum energy when performing local computing compared with both the MEC offloading mode and the D2D offloading mode, the RU should execute its task locally. Therefore, we can first assign the local computing mode for the RUs by comparing its energy consumption in various computing modes. That is, if RU\(_{m}\) achieves the minimum energy consumption when executing its task locally, i.e., \(E_{m}^{\mathrm{loc}}\le E_{m,n,k}^{\mathrm{mec}}\) and \(E_{m}^{\mathrm{loc}}\le E_{m,j,k}^{\mathrm{d2d}}\), \(\forall n, j, k\), we should assign the local computing mode to RU\(_m\), i.e., \(x_{m}^{\mathrm {0,*}}=1\), \(x_{m,n}^{\mathrm{m},*}=0\), \(x_{m,j}^{\mathrm{d},*}=0\), where \(x_{m}^{\mathrm {0,*}}\), \(x_{m,n}^{\mathrm{m},*}\), and \(x_{m,j}^{\mathrm{d},*}\) represent the optimal computing and offloading strategy.
4.3 KM algorithmbased subchannel allocation for nonconflicting RUs
After removing the RUs which have been assigned local computing mode, we place the remaining RUs into a set, denoted by \(\Psi _{\mathrm{RU}}\). We now solve the optimization problem in (52) for the RUs in \(\Psi _{\mathrm{RU}}\).
It is noticeable that the formulated optimization problem is similar as a matching problem in a bipartite graph, however, it is not a typical onetoone matching problem as the subchannel allocation among different offloading modes should be taken into account. To tackle this problem, we first consider an ideal subchannel allocation assumption for both the BSs and the PUs. More specifically, we assume that all the subchannels are available for all the BSs and the PUs, and then determine the resource allocation and computation offloading strategy which minimizes the energy consumption. Equivalently, we virtualize the set of subchannels into \(N+J\) sets and assign each BS and PU one set of subchannels. For instance, BS\(_n\) is assigned the \(((n1)K+1)\)th to the (nK)th subchannels, and PU\(_j\) is assigned \(((N+j1)K+1)\)th to the \(((N+j)K)\)th subchannels, \(1\le n\le N\), \(1\le k\le K\).
The energy consumption E can then be rewritten as
where \(\bar{E}_{m,n,k^{\prime}}^{\mathrm{mec}}\) is the energy consumption of RU\(_m\) when offloading its task to MEC\(_n\) using the \(k^{\prime}\)th subchannel after subchannel virtualization, \(\bar{E}_{m,n,k^{\prime}}^{\mathrm{mec}}\) can be expressed as
\(\bar{E}_{m,j,k^{\prime}}^{\mathrm{d2d}}\) is the energy consumption of RU\(_m\) when offloading its task to PU\(_j\) using the \(k^{\prime}\)th subchannel after subchannel virtualization, \(\bar{E}_{m,j,k^{\prime}}^{\mathrm{d2d}}\) can be expressed as
Similarly, \(\bar{\mu }_{m,n,k^{\prime}}^{\mathrm{m}}={\mu }_{m,n,k}^{\mathrm{m}}\) for \(k^{\prime}=(n1)K+k\), and \(\bar{\mu }_{m,j,k^{\prime}}^{\mathrm{d}}=\bar{\mu }_{m,j,k}^{\mathrm{d}}\), for \(k^{\prime}=(N+j1)K+k\).
The original optimization problem in (52) can be expressed as
The above optimization problem can be regarded as a onetoone matching problem in a bipartite graph, which can be solved by typical algorithm such as the Kuhnâ€“Munkres (KM) algorithm [38].
Let \(\tilde{x}_{m}^{\mathrm{0}}\), \(\tilde{\mu }_{m,n,k^{\prime}}^{\mathrm{m}}\) and \(\tilde{\mu }_{m,j,k^{\prime}}^{\mathrm{d}}\) denote, respectively, the local optimal strategy of \(x_{m}^{\mathrm{0}}\), \(\bar{\mu }_{m,n,k^{\prime}}^{\mathrm{m}}\) and \({\bar{\mu }}_{m,j,k^{\prime}}^{\mathrm{d}}\) obtained from the KM algorithm. Based on the local optimal strategy of the RUs, we may check whether there exist nonconflicting RUs of which the selected subchannel is not shared with other RUs. For nonconflicting RUs, we assign the local optimal offloading and subchannel allocation strategy as the global optimal one. As an example, suppose the local optimal strategy of RU\(_{m_1}\) is \(\tilde{x}_{m_1}^{\mathrm{0}}=0\), \(\tilde{\mu }_{m_1,n_1,k^{\prime}_1}^{\mathrm{m}}=1\) and \(\tilde{\mu }_{m_1,j,k^{\prime}}^{\mathrm{d}}=0\), and no other RUs select the same subchannel, i.e., \(\tilde{\mu }_{m,n,k^{\prime}}^{\mathrm{m}}=0\) and \(\tilde{\mu }_{m,j,k^{\prime}}^{\mathrm{d}}=0\), for \(m\ne m_1\), \(k^{\prime}_1\ne k^{\prime}\), we set the global optimal offloading and subchannel allocation strategy of RU\(_{m_1}\) as \({x}_{m_1}^{\mathrm{0},*}=0\), \({x}_{m_1,n_1}^{\mathrm{m},*}=1\), and \({x}_{m_1,j}^{\mathrm{d},*}=0\), \({\mu }_{m_1,n_1,k_1}^{\mathrm{m},*}=1\), \({\mu }_{m_1,n,k}^{\mathrm{m},*}=0\) and \({\mu }_{m_1,j,k}^{\mathrm{d},*}=0\), for \(n\ne n_1\), \(k^{\prime}\ne k\), \(k_1=\mathrm{mod}(k^{\prime}_1,K)\), \(k=\mathrm{mod}(k^{\prime},K)\), where \(\mathrm{mod}(x,y) =x  y\lfloor x/y \rfloor\).
Once the RUs have been assigned global optimal strategy, they are removed from the remaining user set \(\Psi _{\mathrm{RU}}\) and their selected subchannels are removed correspondingly.
4.4 Prioritybased subchannel allocation for conflicting RUs
Note that by applying subchannel virtualization, the BSs and PUs are allowed to share same subchannels, the obtained local optimal computation offloading and subchannel allocation strategy \(\tilde{x}_{m}^{\mathrm{0}}\), \(\tilde{\mu }_{m,n,k}^{\mathrm{m}}\) and \(\tilde{\mu }_{m,j,k}^{\mathrm{d}}\) may involve resource conflicting among RUs. More specifically, it is probable that more than one RU chooses to occupy a common subchannel for task offloading. For instance, if \(\tilde{\mu }_{m,n,k}=1\), \(\tilde{\mu }_{m_1,n_1,k_1}=1\), and \(\mathrm{mod}(k,K)=\mathrm{mod} (k_1,K)\), then both RU\(_{m}\) and RU\(_{m_1}\) choose the \(k \mathrm{mod} K\)th subchannel for task offloading. We refer RU\(_{m}\) and RU\(_{m_1}\) as a pair of conflicting users.
Since multiple subchannels are not allowed for MEC offloading mode and OMAbased D2D offloading mode, we need to design computation offloading and resource allocation strategy for the conflicting RUs. To this end, we propose a prioritybased offloading mode selection and subchannel allocation scheme. The steps of the proposed scheme can be summarized as follows:
(1) Assign priority to the conflicting RUs
We examine the energy consumption of the conflicting RUs and assign various priorities to these RUs. For each RU, we first evaluate the energy consumption in various offloading modes, and set the lowest one as the energy consumption of the RU. Then, aiming to minimize the energy consumption of all the RUs, we order the nonconflicting RUs according to their energy consumption and assign the highest priority to the RU having the lowest energy consumption.
(2) Assign global optimal strategy to the RU with the highest priority
For the RU with the highest priority, the local optimal strategy will be set as its global optimal strategy. We remove this RU as well as the corresponding subchannel from the RU set and subchannel set.
(3) Update local optimal strategy of the remaining RUs
The local optimal strategy of the remaining RUs is updated by applying the KM algorithm. Check whether conflicting RUs exist, if yes, return to (1), otherwise, set the local optimal strategy of the remaining RUs as the global optimal one, and the algorithm terminates.
5 Greedy methodbased task offloading and user pairing algorithm: NOMA scheme applied
In this subsection, we consider the RUs which need to offload their tasks to PUs using D2D offloading mode. Since RUs may apply OMAbased D2D scheme or NOMAbased D2D scheme, the optimal computation offloading selection, subchannel allocation and NOMA paring strategy is very difficult to obtain. For simplicity, we design a greedybased computation offloading and NOMA paring algorithm.
5.1 Task offloading strategy: one RU case
For individual PUs, we may assign different RUs for conducting D2D offloading, and accordingly, various computation offloading and NOMA paring strategies can be obtained. For one or two RUs, they may choose one PU and offload their tasks to the PU in OFDMA mode. Alternatively, two RUs may form a NOMA pair and send their tasks to a common PU. For a specific PU and the set of RUs choosing the PU to offload tasks, we may list all potential task offloading combinations, and compute the corresponding energy consumption by exploiting extensive search method.
Based on the local optimal strategy of RUs obtained from the KM algorithm, we assign task offloading strategy for the RUs choosing D2D offloading mode. In the case that only one RU chooses a PU for task offloading, we assign OMAbased D2D offloading mode to the RU. Suppose RU\(_{m}\) is the only user choosing \(\mathrm{PU}_j\) to offload its task, i.e., \(\tilde{\mu }_{m,j,k^{\prime}}^{\mathrm{d}}=1\) and \(\tilde{\mu }_{m^{\prime},j,k^{\prime}_1}^{\mathrm{d}}=0\), \(\forall m^{\prime}\ne m, \forall k^{\prime},k^{\prime}_1\), we set \({\mu }_{m,j,k}^{\mathrm{d},*}=1\) and \({\mu }_{m^{\prime},j,k_1}^{\mathrm{d},*}=0\), where \(k=\mathrm{mod}(k^{\prime},K)\), \(k_1=\mathrm{mod}(k^{\prime}_1,K)\).
If more than one RU choosing one PU to offload their tasks, we need to select one or two RUs and determine the optimal task offloading strategy. To this end, we propose two schemes, i.e., greedy methodbased user pairing and task offloading algorithm and low complexity user pairing and task offloading algorithm.
5.2 Task offloading and user pairing algorithm
We assume that multiple RUs select \(\mathrm{PU}_j\) for task offloading. Let \(\Phi _{\mathrm{RU}}\) denote the set of RUs, i.e., if \(\tilde{\mu }_{m,j,k^{\prime}}^{\mathrm{d}}=1\), then \(\mathrm{RU}_{m}\in \Phi _{\mathrm{RU}}\). Since at most two RUs are allowed to offload their tasks to one PU, among all the RUs in \(\Phi _{\mathrm{RU}}\), we need to choose one or two RUs and assign the task offloading mode and the corresponding subchannel.
5.2.1 Local optimal strategy in OMAbased D2D offloading mode
First examine the optimal performance obtained by using OMAbased D2D offloading mode. Suppose OMAbased D2D offloading mode is assigned to the RUs in \(\Phi _{\mathrm{RU}}\), we may examine the task offloading performance of the RUs and select one or two RUs achieving the optimal performance. Specifically, for \(\forall \mathrm{RU}_{m}\in \Phi _{\mathrm{RU}}\), compute \(E_{m,j,k}^{\mathrm{d2d}}\), and select two RUs with the corresponding subchannels obtaining the optimal task offloading performance, i.e., if \(E_{m_1,j,k_1}^{\mathrm{d2d}}+E_{m_2,j,k_2}^{\mathrm{d2d}}\le E_{m^{\prime}_1,j,k^{\prime}_1}^{\mathrm{d2d}}+E_{m^{\prime}_2,j,k^{\prime}_2}^{\mathrm{d2d}}\), for \((m_1,m_2)\ne (m^{\prime}_1,m^{\prime}_2)\), \((k_1,k_2)\ne (k^{\prime}_1,k^{\prime}_2)\), then \(\mathrm{RU}_{m_1}\) and \(\mathrm{RU}_{m_2}\) are selected as the local optimal users and subchannels \(k_1\) and \(k_2\) should be allocated to the two users. Let \(E_{m_1,m_2,j,k_1,k_2}^{\mathrm{o},*}=E_{m_1,j,k_1}^{\mathrm{d2d}}+E_{m_2,j,k_2}^{\mathrm{d2d}}\) denote the local optimal energy consumption of RUs when offloading tasks to \(\mathrm{PU}_j\) in OMAbased D2D mode.
5.2.2 Local optimal strategy in NOMAbased D2D offloading mode
We then evaluate the task offloading performance in NOMAbased D2D offloading mode. Following a similar manner as in OMAbased case, we choose two RUs in \(\Phi _{\mathrm{RU}}\) to form NOMA pair and compute the task offloading performance on various subchannels and select the pair achieving the optimal performance.
Let \({E}_{m^{\prime}_1,m^{\prime}_2,j,k}^{\mathrm{n},*}\) denote the energy consumption of \(\mathrm{RU}_{m^{\prime}_1}\) and \(\mathrm{RU}_{m^{\prime}_2}\) when offloading tasks to \(\mathrm{PU}_j\) in NOMAbased D2D mode via the kth and \((k+1)\)th subchannels, \(\forall \mathrm{RU}_{m^{\prime}_1},\mathrm{RU}_{m^{\prime}_2}\in \Phi _{\mathrm{RU}}\). If \(\tilde{E}_{m^{\prime}_1,m^{\prime}_2,j,k}^{\mathrm{n}}\le \tilde{E}_{\bar{m}_1,\bar{m}_2,j,k^{\prime}}^{\mathrm{n}}\), \(\forall (m^{\prime}_1,m^{\prime}_2)\ne (\bar{m}_1,\bar{m}_2)\), \(1\le k,k^{\prime}\le K\), then \(\mathrm{RU}_{m^{\prime}_1}\) and \(\mathrm{RU}_{m^{\prime}_2}\) are selected as the local optimal users in NOMAbased D2D offloading mode.
5.2.3 Determine task offloading and user pairing strategy
Given the local optimal task offloading performance in OMAbased and NOMAbased task offloading modes, we now compare the performance and choose the one offering the better performance. In particular, if the following condition meets:
we assign NOMAbased D2D offloading mode to RU\(_{m^{\prime}_1}\) and RU\(_{m^{\prime}_2}\) with PU\(_j\) being the offloading PU, and the kth and the \((k+1)\)th subchannels are allocated to the two RUs for task transmission. Similarly, if
we assign OMAbased D2D offloading mode to RU\(_{m_1}\) and RU\(_{m_2}\) with PU\(_j\) being the offloading PU and the \(k_1\)th and the \(k_2\)th subchannels are allocated to the two RUs for task transmission.
6 Simulation results
In this section, numerical results are presented to evaluate the performance of the proposed scheme. We run our simulations on Matlabbased simulator. The considered system model is a cellular D2D communication system with 4 BSs, 6 PUs and 530 RUs uniformly distributed around the BSs. The overall simulation region is chosen as 1000Â mÂ \(\times\)Â 1000Â m. All the simulation parameters utilized unless explicitly mentioned are reported in Table 2. Results are obtained by averaging over 2000 random trials.
FigureÂ 2 plots the curve for the energy consumption versus the number of RUs when three different algorithms are applied. For comparison, in addition to exhibiting the performance of our proposed algorithm, we also consider the one only OMAbased D2D offloading mode is applied and no NOMAbased scheme is utilized. Furthermore, the performance of the algorithm proposed in [22] is also evaluated.
It can be observed from the figure that with the increase in the number of RUs, energy consumption increases as well. This is because as large number of RUs offload their tasks, the energy consumption due to task transmission and execution increase accordingly. In addition, it can also be seen that when noise power increases, the energy consumption also increases, the reason is that higher noise power leads to lower data transmission rate and longer time for task transmission, hence, higher energy consumption is resulted. Comparing the performance of the three algorithms, we can see that our proposed algorithm offers the lowest energy consumption which is benefited from the joint optimization of task offloading and resource allocation, as well as the performance gain of NOMAbased scheme.
In Fig.Â 3, we show the comparison results of the energy consumption versus the CPU cycles required for three different algorithms, i.e., proposed greedy scheme, THO scheme [22] and scheme proposed in [3]. Since the device execution efficiency can be examined by its processorâ€™s clock cycles (frequency), as lengthy instructions (or data) take more cycles to process as compared to short instructions. Therefore, there exists a direct relation between energy consumption and the number of CPU cycles required. The increase in the required CPU cycles indicates the higher complexity required to process the tasks, hence, higher energy consumption is required. It can also be observed that our proposed scheme outperforms the two comparative schemes.
FigureÂ 4 shows the energy consumption versus the capacity of the MEC servers for the proposed scheme and the schemes proposed in [22] and [3]. It can be seen from the figure that with increasing the MEC server capacity by keeping the fixed task data size lowers the energy consumption due to the fact that the processorâ€™s clock frequency inversely affects the performance, as more clock cycles are available for fixed length data. The algorithms are evaluated against two different subchannel bandwidth settings, i.e., \(W_0 = 2\)Â MHz and \(W_0 = 1\)Â MHz, and stating the fact that high bandwidth resource produces high information transmission rate and in turn lower energy consumption is produced. It can be observed from the figure that the proposed greedy scheme which integrates both OMA and NOMA schemes, outperforms the schemes proposed in [22] and [3] as more RUs prefer to offload their tasks to PUs as compared to local execution or offloading at far distant placed MEC servers.
In Fig.Â 5, an evaluation of energy consumption and task data size with different noise variances and subchannel bandwidth settings is conducted for the proposed scheme and the schemes proposed in [22] and [3]. We can see that as the noise power increases, higher energy consumption is resulted. This is because increasing noise values decreases the signaltonoise ratio (SNR), hence increasing energy consumption. From the figure, it can be noticed that with the rise of task data sizes, the energy consumption values tend to increase gradually. It can also be observed that our proposed scheme outperforms the schemes under comparison.
An illustration of the energy consumption versus the task data size over different D2D distance combinations and RU counts is provided in Fig.Â 6. According to the figure, when more RUs offload their tasks at large distances, we get higher energy consumption. This is due to the fact that long distance produces low data transmission rates, which ultimately leads to high transmission energy consumption in comparison with short distances. Moreover, the proposed NOMA and OMA integrated algorithm outperforms the proposed OMAbased D2D scheme because the integrated algorithm yields better transmission performance, and lower energy consumption in turn.
7 Discussion
In this section, we will briefly discuss the computational complexity and convergence analysis of the proposed algorithm.
7.1 Computational complexity
In this section, the computation complexity of the proposed algorithm is analyzed. As the formulated problem is tackled according to two different use cases: no NOMA scheme and NOMA scheme, therefore, we examine the complexity of solving the both subproblems, i.e., resource allocation subproblem and computation offloading subproblem according to use cases.
For the case where no NOMA scheme is applied, we virtualize the set of subchannels into \(N+J\) sets, the complexity of the KM algorithm is \(O\) \((G^3)\) with (\(11G^3\)+\(12G^2\)+31G)/6 maximum number of operations, where G=\(N+2J+1\) [38].
For the case where NOMA scheme is applied, let K denote the RUs pairs in NOMA, the required number of operations needed using extensive search method is \(M(J+1)K\), having the computational complexity O(\(M(J+1)K)\). FigureÂ 7 plots the computational complexity of the proposed greedy scheme.
7.2 Convergence analysis
It should be mentioned that through the process of algorithm execution, we conduct various subalgorithms successively. Specifically, the subalgorithms include: Subalgorithm 1: determining local computing mode, Subalgorithm 2: KM algorithmbased subchannel allocation, Subalgorithm 3: prioritybased subchannel allocation for conflicting RUs, Subalgorithm 4: greedy methodbased task offloading and user pairing algorithm.
As Subalgorithm 1 is conducted in an extensive manner and no iteration is required, the convergence can be reached easily. Subalgorithm 2 is conducted in a centralized and noniterative mode, the strategy can be obtained directly by running the algorithm and the convergence of the algorithm is guaranteed. Subalgorithm 3 is conducted iteratively. In each iteration, at least one RU with the highest priority is selected. Given the number of conflicting RUs, the number of RUs with the highest priorities is highly limited, which is in general much smaller than the number of conflicting RUs, hence, the algorithm convergence can be guaranteed, and the maximum iteration number can simply be set as the number of conflicting RUs.
Subalgorithm 4 is applied to the RUs choosing D2D mode. Specifically, for various D2D pairs, the subalgorithm is conducted independently. For an individual D2D pair, the energy consumption in OFDMAbased scheme and NOMAbased scheme is evaluated and the one offering better performance is selected. Hence, the algorithm convergence is guaranteed.
8 Conclusion
This paper jointly considers the computation offloading and resource allocation problem in a D2Dassisted and NOMAempowered MEC systems. The original problem has been formulated as an energy consumption minimization problem that is NP hard; therefore, we have decomposed it into two subproblems, i.e., resource allocation subproblem and computation offloading subproblem, and proposed two heuristic algorithms to obtain appropriate strategies for resource allocation and computation offloading. Numerical results have validated the effectiveness of the proposed scheme when compared with the relevant schemes [3, 22]. Future strategies might include extending the proposed scheme into an integrated network, e.g., the integration of satellites, unmanned aerial vehicles (UAVs) and cellular systems, which would utilize satellites and UAVs as MEC servers, so as to increase the flexibility and efficiency of task offloading. In addition, the task offloading strategy under dynamic scenarios with randomly arriving tasks and dynamicallychanging channel models can also be investigated.
Availability of data and materials
Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.
Abbreviations
 MEC:

Multiaccess edge computing
 D2D:

Devicetodevice
 NOMA:

Nonorthogonal multiple access
 MD:

Mobile device
 OMA:

Orthogonal multiple access
 QoE:

Quality of experience
 VR:

Virtualreality
 AR:

Augmentedreality
 PSO:

Particle swarm optimization
 MDP:

Markov decision process
 SAC:

Soft actor critic
 ADMM:

Alternating direction method of multipliers
 CCP:

Convexâ€“concave procedure
 CPU:

Central processing unit
 THO:

Twostage heuristic optimization
 5G:

Fifth generation
 SC:

Superposition coding
 SIC:

Successive interference cancellation
 QoS:

Quality of service
 CQR:

Channel quality ranking
 DRL:

Deep reinforcement learning
 VEC:

Vehicular edge computing
 EH:

Energy harvesting
 IoT:

Internet of things
 RU:

Request user
 PU:

Providing user
 KM:

Kuhnâ€“munkres
 SNR:

Signaltonoise ratio
 UAV:

Unmanned aerial vehicle
References
S. Sukhmani, M. Sadeghi, M. ErolKantarci, A. El Saddik, Edge caching and computing in 5G for mobile AR/VR and tactile internet. IEEE Multimed. 26(1), 21â€“30 (2018)
Y. Zhao, W. Wang, Y. Li, C.C. Meixner, M. Tornatore, J. Zhang, Edge computing and networking: a survey on infrastructures and applications. IEEE Access 7, 101213â€“101230 (2019)
J. Chen, Z. Chang, X. Guo, R. Li, Z. Han, T. HÃ¤mÃ¤lÃ¤inen, Resource allocation and computation offloading for multiaccess edge computing with fronthaul and backhaul constraints. IEEE Trans. Veh. Technol. 70(8), 8037â€“8049 (2021)
C. Sun, X. Wu, X. Li, Q. Fan, J. Wen, V.C. Leung, Cooperative computation offloading for multiaccess edge computing in 6g mobile networks via soft actor critic, in IEEE Transactions on Network Science and Engineering (2021)
P.A. Apostolopoulos, E.E. Tsiropoulou, S. Papavassiliou, Cognitive data offloading in mobile edge computing for internet of things. IEEE Access 8, 55736â€“55749 (2020)
W. Wen, Y. Cui, T.Q. Quek, F.C. Zheng, S. Jin, Joint optimal software caching, computation offloading and communications resource allocation for mobile edge computing. IEEE Trans. Veh. Technol. 69(7), 7879â€“7894 (2020)
F. Guo, H. Zhang, H. Ji, X. Li, V.C. Leung, An efficient computation offloading management scheme in the densely deployed small cell networks with mobile edge computing. IEEE/ACM Trans. Netw. 26(6), 2651â€“2664 (2018)
S. Yu, R. Langar, X. Fu, L. Wang, Z. Han, Computation offloading with data caching enhancement for mobile edge computing. IEEE Trans. Veh. Technol. 67(11), 11098â€“11112 (2018)
H. Guo, J. Liu, Collaborative computation offloading for multiaccess edge computing over fiberwireless networks. IEEE Trans. Veh. Technol. 67(5), 4514â€“4526 (2018)
D. Chatzopoulos, C. Bermejo, E. ul Haq, Y. Li, P. Hui, D2d task offloading: a datasetbased Q &A. IEEE Commun. Mag. 57(2), 102â€“107 (2018)
L. Zhang, J. Xu, Differential security game in heterogeneous devicetodevice offloading network under epidemic risks. IEEE Trans. Netw. Sci. Eng. 7, 1852â€“1861 (2019)
H. Long, C. Xu, G. Zheng, Y. Sheng, Sociallyaware energyefficient task partial offloading in MEC networks with d2d collaboration. IEEE Trans. Green Commun. Netw. 6, 1889â€“1902 (2022)
M. Sun, X. Xu, X. Tao, P. Zhang, Largescale userassisted multitask online offloading for latency reduction in D2Denabled heterogeneous networks. IEEE Trans. Netw. Sci. Eng. 7(4), 2456â€“2467 (2020)
Y. He, J. Ren, G. Yu, Y. Cai, D2d communications meet mobile edge computing for enhanced computation capacity in cellular networks. IEEE Trans. Wireless Commun. 18(3), 1750â€“1763 (2019)
L. Pu, X. Chen, J. Xu, X. Fu, D2D fogging: an energyefficient and incentiveaware task offloading framework via networkassisted D2D collaboration. IEEE J. Sel. Areas Commun. 34(12), 3887â€“3901 (2016)
Q. Chen, Z. Kuang, L. Zhao, Multiuser computation offloading and resource allocation for cloudedge heterogeneous network. IEEE Internet Things J. 9(5), 3799â€“3811 (2021)
U. Saleem, Y. Liu, S. Jangsher, X. Tao, Y. Li, Latency minimization for D2Denabled partial computation offloading in mobile edge computing. IEEE Trans. Veh. Technol. 69(4), 4472â€“4486 (2020)
M. Sun, X. Xu, Y. Huang, Q. Wu, X. Tao, P. Zhang, Resource management for computation offloading in D2Daided wireless powered mobileedge computing networks. IEEE Internet Things J. 8, 8005â€“8020 (2020)
U. Saleem, Y. Liu, S. Jangsher, Y. Li, T. Jiang, Mobilityaware joint task scheduling and resource allocation for cooperative mobile edge computing. IEEE Trans. Wirel. Commun. 20, 360â€“374 (2020)
X. Diao, J. Zheng, Y. Wu, Y. Cai, Joint computing resource, power, and channel allocations for D2Dassisted and NOMAbased mobile edge computing. IEEE Access 7, 9243â€“9257 (2019)
I.A. Elgendy, W. Zhang, Y.C. Tian, K. Li, Resource allocation and computation offloading with data security for mobile edge computing. Futur. Gener. Comput. Syst. 100, 531â€“541 (2019)
H. Li, H. Xu, C. Zhou, X. LÃ¼, Z. Han, Joint optimization strategy of computation offloading and resource allocation in multiaccess edge computing environment. IEEE Trans. Veh. Technol. 69(9), 10214â€“10226 (2020)
A.Y. Kiani, S.A. Hassan, B. Su, H. Pervaiz, Q. Ni, Minimizing the transaction time difference for NOMAbased mobile edge computing. IEEE Commun. Lett. 24(4), 853â€“857 (2020)
Y. Huang, Y. Liu, F. Chen, Nomaaided mobile edge computing via user cooperation. IEEE Trans. Commun. 68(4), 2221â€“2235 (2020)
Y. Wu, K. Ni, C. Zhang, L.P. Qian, D.H. Tsang, Nomaassisted multiaccess mobile edge computing: a joint optimization of computation offloading and time allocation. IEEE Trans. Veh. Technol. 67(12), 12244â€“12258 (2018)
Z. Wan, D. Xu, D. Xu, I. Ahmad, Joint computation offloading and resource allocation for NOMAbased multiaccess mobile edge computing systems. Comput. Netw. 196, 108256 (2021)
Z. Ding, D. Xu, R. Schober, H.V. Poor, Hybrid NOMA offloading in multiuser MEC networks. IEEE Trans. Wirel. Commun. 21, 5377â€“5391 (2022)
B. Zhu, K. Chi, J. Liu, K. Yu, S. Mumtaz, Efficient offloading for minimizing task computation delay of NOMAbased multiaccess edge computing. IEEE Trans. Commun. 70(5), 3186â€“3203 (2022)
I. Altin, M. Akar, A joint resource allocation method for hybrid NOMA MEC offloading. Phys. Commun. 54, 101809 (2022)
J. Du, Y. Sun, N. Zhang, Z. Xiong, A. Sun, Z. Ding, Costeffective task offloading in NOMAenabled vehicular mobile edge computing. IEEE Syst. J. 1â€“12 (2022). https://doi.org/10.1109/JSYST.2022.3167901
C. Zheng, W. Zhou, Computation bits maximization in backscatterassisted wirelesspowered NOMAMEC networks. EURASIP J. Wirel. Commun. Netw. 2022(1), 1â€“21 (2022)
L. Qian, Y. Wu, J. Ouyang, Z. Shi, B. Lin, W. Jia, Latency optimization for cellular assisted mobile edge computing via nonorthogonal multiple access. IEEE Trans. Veh. Technol. 69(5), 5494â€“5507 (2020)
H. Lin, Y. Cao, Y. Zhong, P. Liu, Secure computation efficiency maximization in NOMAenabled mobile edge computing networks. IEEE Access 7, 87504â€“87512 (2019)
Z. Ding, P. Fan, H.V. Poor, Impact of nonorthogonal multiple access on the offloading of mobile edge computing. IEEE Trans. Commun. 67(1), 375â€“390 (2018)
L.P. Qian, B. Shi, Y. Wu, B. Sun, D.H. Tsang, Nomaenabled mobile edge computing for internet of things via joint communication and computation resource allocations. IEEE Internet Things J. 7(1), 718â€“733 (2019)
Z. Song, Y. Liu, X. Sun, Joint task offloading and resource allocation for NOMAenabled multiaccess mobile edge computing. IEEE Trans. Commun. 69(3), 1548â€“1564 (2020)
M.S. Ali, H. Tabassum, E. Hossain, Dynamic user clustering and power allocation for uplink and downlink nonorthogonal multiple access (NOMA) systems. IEEE Access 4, 6325â€“6343 (2016)
J. Munkres, Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32â€“38 (1957)
Acknowledgements
Not applicable.
Funding
This work is supported by National Natural Science Foundation of China under Grant No. 62071078.
Author information
Authors and Affiliations
Contributions
UK proposes the system model, RC formulates it and assists with writing. UK simulates the proposed design and drafts the entire document in latex. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Khan, U.A., Chai, R., Ahmad, S. et al. Joint computation offloading and resource allocation strategy for D2Dassisted and NOMAempowered MEC systems. J Wireless Com Network 2023, 9 (2023). https://doi.org/10.1186/s13638022022072
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13638022022072