This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Optimization of the energy efficiency in Smart Internet of Vehicles assisted by MEC

J.F.\fnmJiafei Fu    P.Z.\fnmPengcheng Zhu    J.H.\fnmJingyu Hua    J.L.\fnmJiamin Li    J.W.\fnmJiangang Wen \orgdivNational Mobile Communications Research Laboratory, \orgnameSoutheast University, \cityNanjing, \cnyChina \orgdivSchool of Information and Electronic Engineering, \orgnameZhejiang Gongshang University, \cityHangzhou, \cnyChina
Abstract

Smart Internet of Vehicles (IoV) as a promising application in Internet of Things (IoT) emerges with the development of the fifth generation mobile communication (5G). Nevertheless, the heterogeneous requirements of sufficient battery capacity, powerful computing ability and energy efficiency for electric vehicles face great challenges due to the explosive data growth in 5G and the sixth generation of mobile communication (6G) networks. In order to alleviate the deficiencies mentioned above, this paper proposes a mobile edge computing (MEC) enabled IoV system, in which electric vehicle nodes (eVNs) upload and download data through an anchor node (AN) which is integrated with a MEC server. Meanwhile, the anchor node transmitters radio signal to electric vehicles with simultaneous wireless information and power transfer (SWIPT) technology so as to compensate the battery limitation of eletric vehicles. Moreover, the spectrum efficiency is further improved by multi-input and multi-output (MIMO) and full-duplex (FD) technologies which is equipped at the anchor node. In consideration of the issues above, we maximize the average energy efficiency of electric vehicles by jointly optimize the CPU frequency, vehicle transmitting power, computing tasks and uplink rate. Since the problem is nonconvex, we propose a novel alternate interior-point iterative scheme (AIIS) under the constraints of computing tasks, energy consumption and time latency. Results and discussion section verifies the effectiveness of the proposed AIIS scheme comparing with the benchmark schemes.

5G,
6G,
Smart Internet of Vehicle,
Mobile edge computing,
Simultaneous wireless information and power transfer,
Full-duplex,
Multi-input and multi-output,
keywords:
\startlocaldefs\endlocaldefs
{fmbox}\dochead

Research

{abstractbox}

1 Introduction

1.1 Background and related work

Recently, with the evolution from the fifth and beyond fifth generation mobile communication (5G/beyond 5G) [1, 2] to the sixth generation mobile communication (6G)[3], some novel technologies, such as mobile edge computing (MEC) [4, 5], satellite communication [6] and spatial multiplexing [7], have been proposed to promote the development of wireless sensor network (WSN) [8, 9], IoT [10] and other novel applications [11, 12, 13], so as to realize the interconnection of all things. IoV as a special application of IoT attracts extensive attention in terms of road safety, smart transportation and information service [14]. However, the demand of computing resources and battery capacity becomes more and more urgent due to a large number of data traffic of these novel applications in IoV [15]. Hence, mobile edge computing is proposed to mitigate the computing burden of electric vehicles [16]. Meanwhile, the spectrum efficiency is further improved by MIMO and FD technologies [17]. Besides, the energy consumption of data processing will increase significantly due to the large number of data traffic. Therefore, SWIPT is supposed to be a meaningful method which provides sufficient energy for electric vehicles to complete their intensive computing tasks.

The last decade, mobile cloud computing (MCC) [18] as a promising method proposed by researcheres to deal with the limited computing resources of vehicles [19]. However, the network edge meets uncovered service even though massive resources are provided by cloud to afford computing power for vehicles [20]. In addition, long latency resulting from the long propagation between vehicles and remote access unit are significant [21]. In consideration of the problems above, MEC technology is proposed to enhance the computing power at the edge of the network [22, 23, 24]. Hence, the author in [25] investigated the cooperation between MCC and MEC in order to improve the quality of service for vehicles at the network edge. Both [24] and [26] aimed at maximizing the system performance and minimizing the time latency assisted by MEC.

Taking account of the energy limitation of electric vehicles, SWIPT [27] is deployed to extend the battery lifetime of vehicles. Comparing with other practical methods, such as wireless power transfer (WPT) [28] and energy harvesting (EH) [29], SWIPT is used for information decoding and energy harvesting by time-shifting and power splitting, respectively [4]. Besides, MIMO and FD technologies are able to achieve further improvements of spectral efficiency and low latency [30, 31].

Although considerable research has been devoted to improve performance of vehicular network with MEC-assisted technologies, such as a cooperative computing task and redundant data scheme are established to reduce the redundancy of data and allocate the computing tasks through MEC server to abtain the minimal system cost [32]. The author in [33] developed a software defined network enabled heterogeneous vehicular network to improve the scalability of the network as well as provide high reliability and low-latency communication. K. Zhang, et al, [34] proposed a task offloading scheme by jointly consider the data transmission and server selection with Q-learning technology. Based on a multi-objective algorithm, an adaptive strategy of offloading is proposed to optimize the resource allocation in [35]. The author in [36] investigated the secrecy energy efficiency in a distributed massive MIMO Systems. In [37], an alternative optimization problem is also raised to maximize the transmission rate in a 5G-based IoT system by jointly optimizing the node powers and allocation coefficient. Rather less attention has been paid to improve energy efficiency of electric vehicles in IoV considering computing tasks, time latency and spectrum efficiency.

1.2 Contributions

In this paper, we propose an IoV system assisted by MEC which is used for cross-layer offloading to provide low latency and abundant computation resources. Meanwhile, electric vehicles are able to replenish battery capacity by SWIPT technology and the spectrum efficiency is further improved by MIMO and FD technologies. On the premise of computation requirement, time latency and energy constraint of electric vehicles, we maximize the average energy efficiency of electric vehicles. Since the problem is nonconvex, we decouple it into two subproblems at first. According to the previous research [38], a closed-form solution of the central processing unit (CPU) frequency is obtained by solving the first sub-problem. Likewise, in order to tackle with the second sub-problem, three sub-problems are divided from the second sub-problem. Finally, an alternate interior-point iterative scheme is proposed to address these subproblems. Numerical simulations are executed to demonstrate the superior performance of our scheme comparing with the benchmark schemes. Our main contributions in this paper can be summarized as follows:

  • We come up an IoV system by using the MEC, the FD and the SWIPT technologies comprehensively, so as to achieve low-latency, abundant computation resources and lower energy consumption by jointly optimizing the CPU frequency, power transfer of electric vehicles, the uplink rate and the offloading tasks.

  • Under the same computation task, energy consumption and time latency constraints, the proposed scheme can yield high energy efficiency, lower time transmission and is able to tackle more computing tasks comparing with the benchmark schemes.

  • MIMO and FD technologies deployed at anchor node are used to futher improve the spectrum efficiency and the time latency. Meanwhile, we analysis the energy efficiency fairness of the electric vehicles as well.

The remainder of this paper is organized as follows. In section 2, we illustrate the system model. A mathematical problem is formulated and solved in section 3. Section 4 provides numerical results and discussions. Finally, section 5 concludes this paper.

2 Methods

2.1 System model

As shown in Fig. 1, we consider an IoV system assisted by MEC, in which a MEC server is deployed at anchor node (AN) and the electric vehicle as a cognitive node connected with AN. Hence, computing tasks will be offloaded partially from electric vehicle nodes (eVNs) to MEC server. Moreover, we assume that the AN works in full-duplex mode which can transmit and receive signals using the same time-frequency resources so as to utilize SWIPT technology to fullfill energy of eVNs as well as receive the offloading computing tasks from the other eVNs at the same time. What’s more, each eVN is equipped with a power splitting receiver for ID and EH with the energy conversion ratio β\beta (β(0,1)\beta\in(0,1)).

In Fig. 2, each vehicle node VNi(i{1,,K})VN_{i}(i\in\{1,...,K\}) offloads partial computing tasks mi(0miMi)m_{i}(0\leq m_{i}\leq M_{i}) to the AN within the time duration τiu\tau_{i}^{\text{u}}, where MiM_{i} denotes the total computation tasks of VNiVN_{i} and KK is the number of vehicle nodes. Simultaneously, AN transmits the computation tasks mjr(j{1,,K})m_{j}^{\text{r}}(j\in\{1,...,K\}) executed by MEC server to VNjVN_{j} within the time duration τjd\tau_{j}^{\text{d}}, where mjr=αmj(0α1)m_{j}^{\text{r}}=\alpha m_{j}(0\leq\alpha\leq 1), and α\alpha is the ratio of the completed computation tasks from the MEC server. Moreover, the computing time consumption of the MEC server is ignored resulting from the powerful computing ability of it comparing with the vehicle nodes [39]. Furthermore, the local computing tasks milom_{i}^{\text{lo}}, which equals MimiM_{i}-m_{i}, is completed during the time duration τilo\tau_{i}^{\text{lo}}. Besides, the uplink time consumption of each VN is assumed to be more than the local computing time consumption of that, which is expressed as 0τiloτi0\leq\tau_{i}^{\text{lo}}\leq\tau_{i}. More details are given as follows.

Notations: The channel fading is modeled as Rayleigh distribution in this paper. 𝒉iu𝕔N×1\bm{h}_{i}^{\text{u}}\in\mathbb{Cc}^{N\times 1} and 𝒉jd𝕔N×1\bm{h}_{j}^{\text{d}}\in\mathbb{Cc}^{N\times 1} satisfy uniform distributionU(0.5,1)\sim U(0.5,1) which present the uplink and downlink channel, respectively, where NN is the antenna numbers of AN, and the superscript u and d refer to uplink and downlink transmission, respectively. Meanwhile, 𝑯an\bm{H}_{\text{an}} represents the self-interference channel of AN. did_{i} and 𝒅j𝕔N×1\bm{d}_{j}\in\mathbb{Cc}^{N\times 1} represent the transmitted signal from vehicle node and AN respectively, where |𝒅j|=1|\bm{d}_{j}|=1. Moreover, pip_{i} and pjp_{j} denote the transmitting power of VN and AN, respectively. Besides, the additive white Gaussian noise (AWGN) of AN is denoted as 𝒏an\bm{n}_{\text{a}n} with covariance matrix σan2𝑰M\sigma_{\text{a}n}^{2}\bm{I}_{M}. Similarly, njn_{j} and npsn_{\text{p}s} are the AWGN of VNjVN_{j} and PS receiver with variance σj2\sigma_{j}^{2} and σps2\sigma_{\text{p}s}^{2}, respectively. Finally, the bandwidth of the system is expressed as BB.

2.1.1 Computation task processing

In uplink transmission, partial computing tasks are uploaded from vehicle nodes to the AN in turns. Specifically, VNiVN_{i} transmits did_{i} with transmitting power pip_{i} to the AN within the time slot τiu\tau_{i}^{\text{u}}. Simultaneously, the AN transmits 𝒅j\bm{d}_{j} with transmitting power pjp_{j} to VN. Therefore, we can obtain the received signal at AN,

𝒙iu=pi𝒉iudi+𝑯an(pj𝒅j)+𝒏an\displaystyle\bm{x}_{i}^{u}=\sqrt{{p_{i}}}{\bm{h}}_{i}^{\text{u}}{d_{i}}+{{\bm{H}}_{\text{a}n}}(\sqrt{{p_{j}}}{\bm{d}_{j}})+\bm{n}_{\text{an}} (1)

where the first iterm represents the desired signal from VNiVN_{i}, while the self-interference at the AN is expressed as the second iterm, and the rest one is the AWGN of AN. Meanwhile, pip_{i} is the transmitting power of vehicle node which satisfies pminpipmaxp_{\text{min}}\leq p_{i}\leq p_{\text{max}}, where pminp_{\text{min}} and pmaxp_{\text{max}} are the minimal and maximal transmitting power of each vehicle node.

According to (1), the received signal of VN is expressed as equation (2), while equation (3) represents the signal to interference and noise ratio (SINR)

Pi\displaystyle P_{i} =Tr{𝒙i(𝒙i)H}\displaystyle=\text{Tr}\{\bm{x}_{i}(\bm{x}_{i})^{H}\} (2)
=piTr{𝒉iu(𝒉iu)H}+pjTr{𝑯an(𝑯an)H}+δan2\displaystyle=p_{i}\text{Tr}\{\bm{h}_{i}^{\text{u}}(\bm{h}_{i}^{\text{u}})^{H}\}+p_{j}\text{Tr}\{\bm{H}_{\text{an}}(\bm{H}_{\text{an}})^{H}\}+\delta_{\text{an}}^{2}
γi=piTr{𝒉iu(𝒉iu)H}pjTr{𝑯an(𝑯an)H}+δan2\displaystyle\gamma_{i}=\frac{p_{i}\text{Tr}\{\bm{h}_{i}^{\text{u}}(\bm{h}_{i}^{\text{u}})^{H}\}}{p_{j}\text{Tr}\{\bm{H}_{\text{an}}(\bm{H}_{\text{an}})^{H}\}+\delta_{\text{an}}^{2}} (3)

where (.)H(.)^{H}, Tr{.}\text{Tr}\{.\} represent the conjugate and trace of matrix, respectively. According to the equation above, we can obtain the uplink rate which is written as

ri=Blog2(1+γi)\displaystyle r_{i}={\text{B$log_{2}$}}(1+\gamma_{i}) (4)

As we know, if the self-interference can be eliminated completely by self-interference cancelation (SIC), the maximal SINR can be expressed as

γimax=piTr{𝒉iu(𝒉iu)H}δan2\displaystyle\gamma_{i}^{\text{max}}=\frac{p_{i}\text{Tr}\{\bm{h}_{i}^{\text{u}}(\bm{h}_{i}^{\text{u}})^{H}\}}{\delta_{\text{an}}^{2}} (5)

Hence, we can obtain the following ideal uplink rate

rimax=Blog2(1+γimax)\displaystyle r_{i}^{\text{max}}={\text{B}}log_{2}(1+\gamma_{i}^{\text{max}}) (6)

However, limited by SIC device, self interference cannot be completely eliminated. Therefore, the uplink rate should not exceed the ideal maximal uplink rate, i.e.,

ririmax\displaystyle r_{i}\leq r_{i}^{\text{max}} (7)

Based on the analysis above, each time slot τiu\tau_{i}^{\text{u}} of uplink transmission and the energy consumption of VNiVN_{i} can be formulated as follow,

τi=miri\displaystyle\tau_{i}=\frac{m_{i}}{r_{i}} (8)
eivn=pimiri\displaystyle e^{\text{vn}}_{i}=p_{i}\frac{m_{i}}{r_{i}} (9)

In consideration of the theory in [39], the local computing time duration and the consumption of energy in each vehicle node is written as

τilo=i=1C(Mimi)1fit\displaystyle\tau_{i}^{\text{lo}}=\sum_{i=1}^{C(M_{i}-m_{i})}\frac{1}{f_{i}^{\text{t}}} (10)
eilo=n=1C(Mimi)κ(fit)2\displaystyle e_{i}^{\text{lo}}=\sum_{n=1}^{C(M_{i}-m_{i})}{\kappa(f_{i}^{\text{t}})^{2}} (11)

where the required CPU cycle is represented as CC which for computing one bit of data. And, for t-th CPU cycles, the CPU frequency of VNiVN_{i} is fitf_{i}^{\text{t}}. Here, fitf_{i}^{\text{t}} should no more than the maximal CPU frequency fimaxf_{i}^{\text{max}}. And κ\kappa denotes the efficient capacitance coefficient in view of the vehicles’ chip architecture.

2.1.2 Energy harvesting

Similarly, in the downlink transmission, VNjVN_{j} receives signal from the AN including the desired RF signal and the AWGN at VNjVN_{j}, which are expressed as

xj=pj(𝒉jd)T𝒅j+nj\displaystyle x_{j}=\sqrt{p_{j}}(\bm{h}_{j}^{\text{d}})^{T}\bm{d}_{j}+n_{j} (12)

In (12), (.)T(.)^{T} is the transposition operation. Here, the co-channel interference between vehicle nodes are not considered, since the VNs upload the computing tasks to the anchor node in turns. Likewise, we obtain the signal power received at VNiVN_{i} in (13) and equation (14) is the downlink signal to noise ratio (SNR).

Pj=pjTr{(𝒉jd)T(𝒉jd)TH}+δj2\displaystyle P_{j}={p_{j}}\text{Tr}\{(\bm{h}_{j}^{\text{d}})^{T}(\bm{h}_{j}^{\text{d}})^{TH}\}+\delta_{j}^{2} (13)
γj=βpjTr{(𝒉jd)T(𝒉jd)TH}δj2\displaystyle\gamma_{j}=\frac{\beta p_{j}\text{Tr}\{(\bm{h}_{j}^{\text{d}})^{T}(\bm{h}_{j}^{\text{d}})^{TH}\}}{\delta_{j}^{2}} (14)

Hence, the downlink rate and the time slot can be derived as

rj=Blog(1+γj)\displaystyle r_{j}=Blog(1+\gamma_{j}) (15)
τj=αmjrj\displaystyle\tau_{j}=\frac{\alpha m_{j}}{r_{j}} (16)

Based on the coefficient β\beta of the PS receiver for EH, the energy of EH at VNiVN_{i} is shown as

ejeh=βpjTr{(𝒉jd)T(𝒉jd)TH}τjd\displaystyle e_{j}^{\text{eh}}=\beta{p_{j}}\text{Tr}\{(\bm{h}_{j}^{\text{d}})^{T}(\bm{h}_{j}^{\text{d}})^{TH}\}\tau_{j}^{\text{d}} (17)

2.1.3 Problem formulation

The computing time of the MEC server is ignored, since the computing ability of it is more powerful than that of vehicle’s [39]. And, we assume that T is the overall duration. Hence, the relationship between the T and the total transmission time in uplink and downlink of vehicles as shown in formula (18) and (19), respectively.

0i=1KτiuT\displaystyle 0\leq\sum_{i=1}^{K}\tau_{i}^{\text{u}}\leq{\text{T}} (18)
0j=1KτjdT\displaystyle 0\leq\sum_{j=1}^{K}\tau_{j}^{\text{d}}\leq{\text{T}} (19)

Moreover, since vehicle node is not able to transmit and receive signal simultaneously, there should be no overlap between uplink and downlink transmission time of a same vehicle node, i.e.,

i=1Kτiu+τKdT\displaystyle\sum_{i=1}^{K}\tau_{i}^{\text{u}}+\tau_{K}^{\text{d}}\leq{\text{T}} (20)
i=1KtmpτiuTj=KtmpKτjd\displaystyle\sum_{i=1}^{K_{tmp}}\tau_{i}^{\text{u}}\leq{\text{T}}-\sum_{j=K_{tmp}}^{K}\tau_{j}^{\text{d}} (21)

where Ktmp{1,,K}K_{tmp}\in\{1,...,K\}.

Meanwhile, the downlink transmission slot is less than the uplink transmission slot, so as to gurantee the computing tasks offloading from the next vehicle node can be processed at the AN without time latency and queuing. i.e.,

τjdτiu,j=i1\displaystyle\tau_{j}^{\text{d}}\leq\tau_{i}^{\text{u}},j=i-1 (22)

Besides, we assume that each vehicle node has enough energy to complete the computing due to the sufficient energy supply from the AN. Hence, the energy harvested from the AN should no more than the total transmitting power from the AN. Hence, the energy consumption of each vehicle should satisfy,

eivn+eiloeieh\displaystyle e_{i}^{\text{vn}}+e_{i}^{\text{lo}}\leq e_{i}^{\text{eh}} (23)
eieheian\displaystyle e_{i}^{\text{eh}}\leq e_{i}^{\text{an}} (24)

where eian=pjτjde_{i}^{\text{an}}=p_{j}\tau_{j}^{\text{d}}. According to the derivations above, we formulate the following problem (P1P1) which is aim to maximizing the average enery efficiency of the total vehicle nodes.

(P1)max𝒇t,𝒑,𝒎,𝒓1K{i=1Krieivn+eilo}s.t.{C1:eivn+eiloeiehC2:eieheianC3:0fitfimaxC4:pminpipmaxC5:0miMiC6:0ririmaxC7:0τiloτiuC8:τjdτiu,j=i1C9:0i=1KτiuTC10:0j=1KτjdTC11:i=1KtmpτiuTj=KtmpKτjd\begin{array}[]{cl}(P1)&\mathop{\max}\limits_{{\bm{f}^{\text{t}},\bm{p},\bm{m},\bm{r}}}\frac{1}{K}\{\sum_{i=1}^{K}\frac{r_{i}}{e_{i}^{\text{vn}}+e_{i}^{\text{lo}}}\}\\ &s.t.\left\{\begin{array}[]{l}C1:e_{i}^{\text{vn}}+e_{i}^{\text{lo}}\leq e_{i}^{\text{eh}}\\ C2:e_{i}^{\text{eh}}\leq e_{i}^{\text{an}}\\ C3:0\leq f_{i}^{\text{t}}\leq f_{i}^{\text{max}}\\ C4:p_{\text{min}}\leq p_{i}\leq p_{\text{max}}\\ C5:0\leq m_{i}\leq M_{i}\\ C6:0\leq r_{i}\leq r_{i}^{\text{max}}\\ C7:0\leq\tau_{i}^{\text{lo}}\leq\tau_{i}^{\text{u}}\\ C8:\tau_{j}^{\text{d}}\leq\tau_{i}^{\text{u}},j=i-1\\ C9:0\leq\sum_{i=1}^{K}\tau_{i}^{\text{u}}\leq{\text{T}}\\ C10:0\leq\sum_{j=1}^{K}\tau_{j}^{\text{d}}\leq{\text{T}}\\ C11:\sum_{i=1}^{K_{tmp}}\tau_{i}^{\text{u}}\leq{\text{T}}-\sum_{j=K_{tmp}}^{K}\tau_{j}^{\text{d}}\end{array}\right.\end{array} (25)

where 𝒇t=[f1t,,fKt]T\bm{f}^{\text{t}}=[f_{1}^{\text{t}},...,f_{K}^{\text{t}}]^{T}, 𝒑=[p1,,pK]T\bm{p}=[p_{1},...,p_{K}]^{T}, 𝒎=[m1,,mK]T\bm{m}=[m_{1},...,m_{K}]^{T}, 𝒓=[r1,,rK]T\bm{r}=[r_{1},...,r_{K}]^{T} represent the CPU frequency, the uplink transmitting power, the offloading computation tasks and the uplink rate of all vehicle nodes, respectively. Moreover, the fimaxf_{i}^{\text{max}} is the maximum CPU frequency.

2.2 Problem solution

Since the cost function and the constraints in problem (P1P1) are nonlinear and nonconvex, two subproblems are derived from the problem (P1P1) first. For the first subproblem, a closed-form expression of ftf^{\text{t}} with fixed variables 𝒑,𝒎,𝒓\bm{p},\bm{m},\bm{r} is obtained. Combining the first subproblem with (P1P1), we derive the second subproblem. For the second subproblem, we utilize an alternate interior-point iterative scheme after decompose it into three subproblems. Finally, the suboptimal varibles <𝒇t,𝒑,𝒎,𝒓><\bm{f}^{\text{t}},\bm{p},\bm{m},\bm{r}> are abtained.

2.2.1 Local computing optimization

Inspired by [39], the optimal CPU frequency should satisfy

fi1=fi2==fiC(Mimi)=C(Mimi)τilo=f¯i\displaystyle f_{i}^{1}=f_{i}^{2}=...=f_{i}^{C(M_{i}-m_{i})}=\frac{C(M_{i}-m_{i})}{\tau_{i}^{\text{lo}}}=\overline{f}_{i} (26)

where the average CPU frequency is denoted as f¯i\overline{f}_{i}. Based on the derivation above, the original problem (P1P1) is converted into the problem (P2P2) as following.

(P2)min𝒇¯1K{i=1Keilo}s.t.{C1:eivn+eiloeiehC2:0τiloτiu\begin{array}[]{cl}(P2)&\mathop{\min}\limits_{{\bm{\overline{f}}}}\frac{1}{K}\{\sum_{i=1}^{K}e_{i}^{\text{lo}}\}\\ &s.t.\left\{\begin{array}[]{l}C1:e_{i}^{\text{vn}}+e_{i}^{\text{lo}}\leq e_{i}^{\text{eh}}\\ C2:0\leq\tau_{i}^{\text{lo}}\leq\tau_{i}^{\text{u}}\\ \end{array}\right.\end{array} (27)

To futher simplify the problem (P2P2), we obtain the following problem (P3P3)

(P3)min𝒇¯1K{i=1KκC(Mimi)(f¯i)2}s.t.{C1:eivn+κC(Mimi)(f¯i)2eiehC2:0C(Mimi)f¯iτiu\begin{array}[]{cl}(P3)&\mathop{\min}\limits_{{\bm{\overline{f}}}}\frac{1}{K}\{\sum_{i=1}^{K}{\kappa C(M_{i}-m_{i})(\overline{f}_{i})^{2}}\}\\ &s.t.\left\{\begin{array}[]{l}C1:e_{i}^{\text{vn}}+{\kappa C(M_{i}-m_{i})(\overline{f}_{i})^{2}}\leq e_{i}^{\text{eh}}\\ C2:0\leq\frac{C(M_{i}-m_{i})}{\overline{f}_{i}}\leq\tau_{i}^{\text{u}}\\ \end{array}\right.\end{array} (28)

where C2 indicates that C(Mimi)τiu\frac{C(M_{i}-m_{i})}{\tau_{i}^{\text{u}}} is the lower limit of f¯i\overline{f}_{i} as well as the optimal CPU frequency fioptf_{i}^{\text{opt}}.

2.2.2 Communication optimization

We obtan the rewritted problem (P4P4) by substituting the optimal CPU frequency fioptf_{i}^{\text{opt}} into (P1P1).

(P4)max𝒑,𝒎,𝒓1K{i=1Krieivn+eilo}s.t.{C1:eivn+eiloeiehC2:eieheianC3:pminpipmaxC4:0miMiC5:0ririmaxC6:τjdτiu,j=i1C7:0i=1KτiuTC8:0j=1KτjdTC9:i=1KtmpτiuTj=KtmpKτjd\begin{array}[]{cl}(P4)&\mathop{\max}\limits_{{\bm{p},\bm{m},\bm{r}}}\frac{1}{K}\{\sum_{i=1}^{K}\frac{r_{i}}{e_{i}^{\text{vn}}+e_{i}^{\text{lo}}}\}\\ &s.t.\left\{\begin{array}[]{l}C1:e_{i}^{\text{vn}}+e_{i}^{\text{lo}}\leq e_{i}^{\text{eh}}\\ C2:e_{i}^{\text{eh}}\leq e_{i}^{\text{an}}\\ C3:p_{\text{min}}\leq p_{i}\leq p_{\text{max}}\\ C4:0\leq m_{i}\leq M_{i}\\ C5:0\leq r_{i}\leq r_{i}^{\text{max}}\\ C6:\tau_{j}^{\text{d}}\leq\tau_{i}^{\text{u}},j=i-1\\ C7:0\leq\sum_{i=1}^{K}\tau_{i}^{\text{u}}\leq{\text{T}}\\ C8:0\leq\sum_{j=1}^{K}\tau_{j}^{\text{d}}\leq{\text{T}}\\ C9:\sum_{i=1}^{K_{tmp}}\tau_{i}^{\text{u}}\leq{\text{T}}-\sum_{j=K_{tmp}}^{K}\tau_{j}^{\text{d}}\end{array}\right.\end{array} (29)

Since the problem (P4P4) is still a NP-hard problem, we continue to decompose it into three subproblems, which are denoted as (P4.1P4.1) \sim (P4.3P4.3), respectively.

(P4.1)max𝒑1K{i=1Krieivn+eilo}s.t.{C1:eivn+eiloeiehC2:eieheianC3:pminpipmaxC4:τjdτiu,j=i1C5:0i=1KτiuTC6:0j=1KτjdTC7:i=1KtmpτiuTj=KtmpKτjd\begin{array}[]{cl}(P4.1)&\mathop{\max}\limits_{{\bm{p}}}\frac{1}{K}\{\sum_{i=1}^{K}\frac{r_{i}}{e_{i}^{\text{vn}}+e_{i}^{\text{lo}}}\}\\ &s.t.\left\{\begin{array}[]{l}C1:e_{i}^{\text{vn}}+e_{i}^{\text{lo}}\leq e_{i}^{\text{eh}}\\ C2:e_{i}^{\text{eh}}\leq e_{i}^{\text{an}}\\ C3:p_{\text{min}}\leq p_{i}\leq p_{\text{max}}\\ C4:\tau_{j}^{\text{d}}\leq\tau_{i}^{\text{u}},j=i-1\\ C5:0\leq\sum_{i=1}^{K}\tau_{i}^{\text{u}}\leq{\text{T}}\\ C6:0\leq\sum_{j=1}^{K}\tau_{j}^{\text{d}}\leq{\text{T}}\\ C7:\sum_{i=1}^{K_{tmp}}\tau_{i}^{\text{u}}\leq{\text{T}}-\sum_{j=K_{tmp}}^{K}\tau_{j}^{\text{d}}\end{array}\right.\end{array} (30)

The problem (P4.1P4.1) is only related to 𝒑\bm{p}, which can be tackled by classical interior-point algorithm.

(P4.2)max𝒎1K{i=1Krieivn+eilo}s.t.{C1:eivn+eiloeiehC2:eieheianC3:0miMiC4:τjdτiu,j=i1C5:0i=1KτiuTC6:0j=1KτjdTC7:i=1KtmpτiuTj=KtmpKτjd\begin{array}[]{cl}(P4.2)&\mathop{\max}\limits_{{\bm{m}}}\frac{1}{K}\{\sum_{i=1}^{K}\frac{r_{i}}{e_{i}^{\text{vn}}+e_{i}^{\text{lo}}}\}\\ &s.t.\left\{\begin{array}[]{l}C1:e_{i}^{\text{vn}}+e_{i}^{\text{lo}}\leq e_{i}^{\text{eh}}\\ C2:e_{i}^{\text{eh}}\leq e_{i}^{\text{an}}\\ C3:0\leq m_{i}\leq M_{i}\\ C4:\tau_{j}^{\text{d}}\leq\tau_{i}^{\text{u}},j=i-1\\ C5:0\leq\sum_{i=1}^{K}\tau_{i}^{\text{u}}\leq{\text{T}}\\ C6:0\leq\sum_{j=1}^{K}\tau_{j}^{\text{d}}\leq{\text{T}}\\ C7:\sum_{i=1}^{K_{tmp}}\tau_{i}^{\text{u}}\leq{\text{T}}-\sum_{j=K_{tmp}}^{K}\tau_{j}^{\text{d}}\end{array}\right.\end{array} (31)

As same as the problem (P4.1P4.1), interior-point algorithm is used to address the problem (P4.2P4.2) to achieve the optimal 𝒎\bm{m}.

(P4.3)max𝒓1K{i=1Krieivn+eilo}s.t.{C1:eivn+eiloeiehC2:eieheianC3:0ririmaxC4:τjdτiu,j=i1C5:0i=1KτiuTC6:0j=1KτjdTC7:i=1KtmpτiuTj=KtmpKτjd\begin{array}[]{cl}(P4.3)&\mathop{\max}\limits_{{\bm{r}}}\frac{1}{K}\{\sum_{i=1}^{K}\frac{r_{i}}{e_{i}^{\text{vn}}+e_{i}^{\text{lo}}}\}\\ &s.t.\left\{\begin{array}[]{l}C1:e_{i}^{\text{vn}}+e_{i}^{\text{lo}}\leq e_{i}^{\text{eh}}\\ C2:e_{i}^{\text{eh}}\leq e_{i}^{\text{an}}\\ C3:0\leq r_{i}\leq r_{i}^{\text{max}}\\ C4:\tau_{j}^{\text{d}}\leq\tau_{i}^{\text{u}},j=i-1\\ C5:0\leq\sum_{i=1}^{K}\tau_{i}^{\text{u}}\leq{\text{T}}\\ C6:0\leq\sum_{j=1}^{K}\tau_{j}^{\text{d}}\leq{\text{T}}\\ C7:\sum_{i=1}^{K_{tmp}}\tau_{i}^{\text{u}}\leq{\text{T}}-\sum_{j=K_{tmp}}^{K}\tau_{j}^{\text{d}}\end{array}\right.\end{array} (32)

Similarly, the optimal variable 𝒓\bm{r} is obtained by solving the problem (P4.3P4.3) using the interior-point algorithm.

Each subproblem of (P4.1P4.1) \sim (P4.3P4.3) is regarded as an approximate convex problem of the corresponding variable, while the other variable are fixed. In order to solve the problem (P4P4), each subproblem is addressed by classical interior-point algorithm. After that, the whole problem is solved by alternate iterative sheme, which is denoted as Algorithm1.

Algorithm 1 Alternate interior-point iterative scheme (AIIS)
0:  𝒉iu,𝒉jd,𝑯an,𝒑(0),𝒎(0),𝒓(0),𝒅j,di,K,N,B,T,C,κ,α,β,δj2,δps2,δan2,pmin,pmax,Mi,pj\bm{h}_{i}^{\text{u}},\bm{h}_{j}^{\text{d}},\bm{H}_{\text{an}},\bm{p}_{(0)},\bm{m}_{(0)},\bm{r}_{(0)},\bm{d}_{j},d_{i},K,N,B,{\text{T}},C,\kappa,\alpha,\beta,\delta_{j}^{2},\delta_{\text{p}s}^{2},\delta_{\text{an}}^{2},p_{\text{min}},p_{\text{max}},M_{i},p_{j}, where {i,j}{1,,K}\{i,j\}\in\{1,...,K\}, 𝒑(0)\bm{p}_{(0)}, 𝒎(0)\bm{m}_{(0)} and 𝒓(0)\bm{r}_{(0)} represent the initial offloading computation tasks, the uplink transmission power and rate of the vehicle nodes, respectively.
1:  According to (P3P3), fiopt=C(Mimi)τiuf_{i}^{\text{opt}}=\frac{C(M_{i}-m_{i})}{\tau_{i}^{\text{u}}}, τilo=τiu\tau_{i}^{\text{lo}}=\tau_{i}^{\text{u}}, and eilo=κC3(Mimi)3(τiu)2e_{i}^{\text{lo}}=\frac{\kappa C^{3}(M_{i}-m_{i})^{3}}{(\tau_{i}^{\text{u}})^{2}}.
2:  Turn (P3P3) into (P4P4) through substituting fiopt=C(Mimi)τiuf_{i}^{opt}=\frac{C(M_{i}-m_{i})}{\tau_{i}^{\text{u}}}, τilo=τiu\tau_{i}^{\text{lo}}=\tau_{i}^{\text{u}} and eilo=κC3(Mimi)3(τiu)2e_{i}^{\text{lo}}=\frac{\kappa C^{3}(M_{i}-m_{i})^{3}}{(\tau_{i}^{\text{u}})^{2}} into (P3P3).
3:  Let 𝒑ini=𝒑(0),𝒎ini=𝒎(0),𝒓ini=𝒓(0)\bm{p}_{ini}=\bm{p}_{(0)},\bm{m}_{ini}=\bm{m}_{(0)},\bm{r}_{ini}=\bm{r}_{(0)}, and iteration number k=1k=1 be the initial value.
4:  repeat
5:     Deal with (P4.1P4.1) with fixed 𝒎(k1),𝒓(k1)\bm{m}_{(k-1)},\bm{r}_{(k-1)}, 𝒑ini=𝒑(k1)\bm{p}_{ini}=\bm{p}_{(k-1)}, to abtain 𝒑(k)(opt)\bm{p}_{(k)}^{(\text{opt})};
6:     Deal with (P4.2P4.2) with fixed 𝒑(k1),𝒓(k1)\bm{p}_{(k-1)},\bm{r}_{(k-1)}, 𝒎ini=𝒎(k1)\bm{m}_{ini}=\bm{m}_{(k-1)}, to abtain 𝒎(k)(opt)\bm{m}_{(k)}^{(\text{opt})};
7:     Deal with (P4.3P4.3) with fixed 𝒑(k1),𝒎(k1)\bm{p}_{(k-1)},\bm{m}_{(k-1)}, 𝒓ini=𝒓(k1)\bm{r}_{ini}=\bm{r}_{(k-1)}, to abtain 𝒓(k)(opt)\bm{r}_{(k)}^{(\text{opt})};
8:     Let k=k+1k=k+1;
9:  until the objective function in (P4P4) converges.
9:  𝒇(opt),𝒑(opt),𝒎(opt),𝒓(opt)\bm{f}^{(\text{opt})},\bm{p}^{(\text{opt})},\bm{m}^{(\text{opt})},\bm{r}^{(\text{opt})}

4 Results and discussion

Based on numerical simulations, we dicuss the performance of the proposed scheme in this papaer comparing with the two benchmark schems. Three offloading strategies are denoted as below and the simulation parameters are listed in Table 1.

  • FVS: all variables are fixed.

  • FOS: computing tasks completely offload to the AN which indicates the local computing task is zero.

  • AIIS: computing tasks are offloaded arbitrarily based on the maximum average energy efficiency of total vehicle nodes.

In Fig. 3, we find that the average energy efficiency of the total vehicles decrease as computing tasks increase. However, the proposed AIIS scheme still has the maximum average energy efficiency comparing with the benchmark schemes. Fig. 4 investigates the influence of antenna numbers on system performance. Here, we assume that the number of vehicles equals 10 and the antenna numbers are {6,8,10}. As shown in figure, with the number of antennas increasing, the average energy efficiency for each schemes is improved. However, the average energy efficiency of the proposed scheme is higher than that of the comparing schemes with the same antenna numbers.

Fig. 5 studies the system performance with different number of vehicle nodes from 1 to 10, where we can find that the number of vehicles make no difference to the average energy efficiency for each schemes due to the total energy efficiency of all vehicles are averaged. Nerverthless, the proposed scheme is superior to the comparing scheme under the same number of vehicles.

Fig. 6 studies the effect of the downlink transmitting power from the AN. Generally speaking, additional downlink transmitting power means that vehicle node may have more energy to complete the computation tasks. However, since each vehicle node tends to maximize its uplink rate as well as minimize its uplink energy consumption so as to maximize the average energy efficiency. Hence, the redundant downlink transmitting power seems to have no effect on the average energy efficiency. In other words, we may achieve lower energy consumption with higher energy efficiency. Besides, the system performance of the proposed scheme is better than that of the other two schemes as well.

Under the same coditions, Fig. 7 shows that the transmission time of three schemes increase with the number of computation tasks increasing. However, the proposed scheme has the lower transmission time compared to the other schemes.

To futher study the fairness of each vehicles, we obtain the Fig. 8 and Fig. 9. For the former, variance of energy efficiency of all vehicles are given to prove that the proposed scheme AIIS has the best energy efficiency fairness between the same vehicle numbers compared to the other schemes, which indicates that the qulity of service of different vehicles can be guranteed. For the latter, the proposed scheme has the lower variance of transmission time consumptions between all vehicles with the same computation tasks comparing with the benchmark schemes, which indicates that the time-latency fairness between the different vehicles of AIIS is superior to that of the comparing schemes.

5 Conclusion

In this paper, we propose an IoV system assisted by MEC server which is deployed at anchor node. Electric vehicle as a cognitive node uploads their intensive computing tasks to the AN as well as harvests energy from the RF signal transmitted by the AN with SWIPT technology, so as to alleviate the heavy computing tasks, reduce the time latency and compensate the limited battery capacity of vehicle node. Besides, the spectral efficiency is further improved by MIMO and FD technologies. Finally, an alternate interior-point iterative scheme (AIIS) is proposed to deal with a non-convex problem which is aim to maximize the average energy efficiency of vehicles by jointly optimize the computing and communication resources. Simulation results verify that the proposed AIIS scheme outperforms the other two comparison schemes. Furthermore, the service of future IoV system may benefit from the proposed scheme.

References

  • [1] J. Zhao, S. Ni, L. Yang, Z. Zhang, Y. Gong and X. Yu, ”Multiband Cooperation for 5G HetNets: A Promising Network Paradigm,” IEEE Vehicular Technology Magazine. vol. 14, no. 4, pp. 85- 93, Oct. 2019, DOI: 10.1109/MVT.2019.2935793.
  • [2] P. Zhu, J. Xu, J. Li, D. Wang and X. You, ”Learning-Empowered Privacy Preservation in Beyond 5G Edge Intelligence Networks,” IEEE Wireless Communications, vol. 28, no. 2, pp. 12-18, April 2021, doi: 10.1109/MWC.001.2000331.
  • [3] X. You, C. -X. Wang, J. Huang et al., ”Towards 6G wireless communication networks: vision, enabling technologies, and new paradigm shifts,” Science China Information Sciences, vol. 64, no. 1, pp. 1-74, 2021, doi: 10.1007/s11432-020-2955-6.
  • [4] Jiafei Fu, Jingyu Hua*, Jiangang Wen, Kai Zhou, Jiamin Li, Bin Sheng, Optimization of Achievable Rate in the Multi-user Satellite IoT system with SWIPT and MEC, IEEE Transactions on Industrial Informatics, vol.17, no.3, pp. 2072-2080, 2021.
  • [5] J. Zhao, X. Sun, Q. Li, and X. Ma, “Edge Caching and Computation Management for Real-Time Internet of Vehicles: An Online and Distributed Approach,” IEEE Transactions on Intelligent Transportation Systems, vol. 22, no. 4, pp. 2183-2197, April 2021, doi: 10.1109/TITS.2020.3012966.
  • [6] Xin Liu, Xiangping Zhai, Weidang Lu and Celimuge Wu, QoS-guarantee Resource Allocation for Multibeam Satellite Industrial Internet of Things with NOMA, IEEE Transactions on Industrial Informatics. vol. 17, no. 3, 2021: 2052-2061.
  • [7] Y. Hama and H. Ochiai, ”Performance Analysis of Matched-Filter Detector for MIMO Spatial Multiplexing Over Rayleigh Fading Channels With Imperfect Channel Estimation,” in IEEE Transactions on Communications, vol. 67, no. 5, pp. 3220-3233, May 2019, doi: 10.1109/TCOMM.2019.2892758.
  • [8] Jingyu Hua, Yejia Yin, Anding Wang, Yu Zhang, Weidang Lu, Geometry-based non-line-of-sight error mitigation and localization in wireless communications, SCIENCE CHINA Information Sciences, 2019, 62: 202301, doi: 10.1007/s11432-019-9909-5.
  • [9] P. Zhu, B. Xu, J. Li, D. Wang, ”Joint utility optimization for wireless sensor networks with energy harvesting and cooperation,” SCIENCE CHINA Information Sciences, vol. 63, no. 2, p. 122302, Feb. 2020, doi: 10.1007/s11432-019-9936-y.
  • [10] Xin Liu, Xueyan Zhang. NOMA-based Resource Allocation for Cluster-based Cognitive Industrial Internet of Things. IEEE Transactions on Industrial Informatics. Vol.16, no. 8, 2020: 5379-5388.
  • [11] M. S. Greco, F. Gini, P. Stinco and K. Bell, ”Cognitive Radars: On the Road to Reality: Progress Thus Far and Possibilities for the Future,” in IEEE Signal Processing Magazine, vol. 35, no. 4, pp. 112-125, July 2018, doi: 10.1109/MSP.2018.2822847.
  • [12] M. S. Greco, F. Gini and P. Stinco, ”Cognitive radars: Some applications,” 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2016, pp. 1077-1082, doi: 10.1109/GlobalSIP.2016.7906008.
  • [13] P. Zhu, J. Li, D. Wang and X. You, ”Machine-Learning Based Opportunistic Spectrum Access in Cognitive Radio Networks,” IEEE Wireless Communications, vol. 27, no. 1, pp. 38-44, Feb. 2020.
  • [14] D. Singh and M. Singh, ”Internet of vehicles for smart and safe driving,” 2015 International Conference on Connected Vehicles and Expo (ICCVE), 2015, pp. 328-329, doi: 10.1109/ICCVE.2015.93.
  • [15] X. Hou et al., ”Reliable Computation Offloading for Edge-Computing-Enabled Software-Defined IoV,” in IEEE Internet of Things Journal, vol. 7, no. 8, pp. 7097-7111, Aug. 2020, doi: 10.1109/JIOT.2020.2982292.
  • [16] J. Zhao, Q. Li, Y. Gong, and K. Zhang, “Computation offloading and resource allocation for cloud assisted mobile edge computing in vehicular networks,” IEEE Transactions on Vehicular Technology, vol. 68, no. 8, pp. 7944-7956, Aug. 2019, DOI: 10.1109/TVT.2019.2917890.
  • [17] A. C. Cirik, R. Wang, Y. Hua and M. Latva-aho, ”Weighted Sum-Rate Maximization for Full-Duplex MIMO Interference Channels,” in IEEE Transactions on Communications, vol. 63, no. 3, pp. 801-815, March 2015, doi: 10.1109/TCOMM.2015.2397886.
  • [18] D. Yao, C. Yu, L. T. Yang and H. Jin, ”Using Crowdsourcing to Provide QoS for Mobile Cloud Computing,” in IEEE Transactions on Cloud Computing, vol. 7, no. 2, pp. 344-356, 1 April-June 2019, doi: 10.1109/TCC.2015.2513390.
  • [19] P. Si, Q. Zhang, F.R. Yu, Y. Zhang, QoS-aware dynamic resource management in heterogeneous mobile cloud computing networks. China Commun. 11(5), 144–159 (2014)
  • [20] B. Xu, P. Zhu, J. Li, D. Wang and X. You, ”Joint Long-Term Energy Efficiency Optimization in C-RAN With Hybrid Energy Supply,” IEEE Transactions on Vehicular Technology, vol. 69, no. 10, pp. 11128-11138, Oct. 2020.
  • [21] Z. Sanaei, S. Abolfazli, A. Gani and R. Buyya, ”Heterogeneity in Mobile Cloud Computing: Taxonomy and Open Challenges,” in IEEE Communications Surveys & Tutorials, vol. 16, no. 1, pp. 369-392, First Quarter 2014, doi: 10.1109/SURV.2013.050113.00090.
  • [22] H. Li, G. Shou, Y. Hu and Z. Guo, ”Mobile Edge Computing: Progress and Challenges,” 2016 4th IEEE International Conference on Mobile Cloud Computing, Services, and Engineering (MobileCloud), 2016, pp. 83-84, doi: 10.1109/MobileCloud.2016.16.
  • [23] Y. Mao, C. You, J. Zhang, K. Huang and K. B. Letaief, ”A Survey on Mobile Edge Computing: The Communication Perspective,” in IEEE Communications Surveys & Tutorials, vol. 19, no. 4, pp. 2322-2358, Fourthquarter 2017, doi: 10.1109/COMST.2017.2745201.
  • [24] X. Ma, S. Wang, S. Zhang, P. Yang, C. Lin and X. Shen, ”Cost-Efficient Resource Provisioning for Dynamic Requests in Cloud Assisted Mobile Edge Computing,” in IEEE Transactions on Cloud Computing, vol. 9, no. 3, pp. 968-980, 1 July-Sept. 2021, doi: 10.1109/TCC.2019.2903240.
  • [25] J. Ren, G. Yu, Y. He and G. Y. Li, ”Collaborative Cloud and Edge Computing for Latency Minimization,” in IEEE Transactions on Vehicular Technology, vol. 68, no. 5, pp. 5031-5044, May 2019, doi: 10.1109/TVT.2019.2904244.
  • [26] Y. Liu, Y. Li, Y. Niu and D. Jin, ”Joint Optimization of Path Planning and Resource Allocation in Mobile Edge Computing,” in IEEE Transactions on Mobile Computing, vol. 19, no. 9, pp. 2129-2144, 1 Sept. 2020, doi: 10.1109/TMC.2019.2922316.
  • [27] M. Liu, M. Xiong, Q. Liu, S. Zhou and H. Deng, ”Mobility-Enhanced Simultaneous Lightwave Information and Power Transfer,” in IEEE Transactions on Wireless Communications, vol. 20, no. 10, pp. 6927-6939, Oct. 2021, doi: 10.1109/TWC.2021.3078808.
  • [28] X. Liu, X. Zhang, et al. ”5G-based green broadband communication system design with simultaneous wireless information and power transfer,” Physical Communication. vol. 28, 2018: 130-137.
  • [29] C. In, H. Kim and W. Choi, ”Achievable Rate-Energy Region in Two-Way Decode-and-Forward Energy Harvesting Relay Systems,” in IEEE Transactions on Communications, vol. 67, no. 6, pp. 3923-3935, June 2019, doi: 10.1109/TCOMM.2019.2901783.
  • [30] Y. Fan, Y. Sun, X. Dai, Z. Zuo and A. You, ”Simultaneous Wireless Power Transfer and Full-Duplex Communication With a Single Coupling Interface,” in IEEE Transactions on Power Electronics, vol. 36, no. 6, pp. 6313-6322, June 2021, doi: 10.1109/TPEL.2020.3035782.
  • [31] M. A. Hossain, M. Schukat and E. Barrett, ”MU-MIMO Based Cognitive Radio in Internet of Vehicles (IoV) for Enhanced Spectrum Sensing Accuracy and Sum Rate,” 2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring), 2021, pp. 1-7, doi: 10.1109/VTC2021-Spring51267.2021.9449068.
  • [32] T. D. T. Nguyen, V. Nguyen, V. -N. Pham, L. N. T. Huynh, M. D. Hossain and E. -N. Huh, ”Modeling Data Redundancy and Cost-Aware Task Allocation in MEC-Enabled Internet-of-Vehicles Applications,” in IEEE Internet of Things Journal, vol. 8, no. 3, pp. 1687-1701, 1 Feb.1, 2021, doi: 10.1109/JIOT.2020.3015534.
  • [33] J. Liu, J. Wan, B. Zeng, Q. Wang, H. Song, and M. Qiu, “A scalable and quick-response software defined vehicular network assisted by mobile edge computing,” IEEE Commun. Mag., vol. 55, no. 7, pp. 94–100, Jul. 2017.
  • [34] K. Zhang, Y. Zhu, S. Leng, Y. He, S. Maharjan, and Y. Zhang, “Deep learning empowered task offloading for mobile edge computing in urban informatics,” IEEE Internet Things J., vol. 6, no. 5, pp. 7635–7647, Oct. 2019.
  • [35] X. Xu, X. Zhang, X. Liu, J. Jiang, L. Qi, and M. Z. A. Bhuiyan, “Adaptive computation offloading with edge for 5G-envisioned Internet of connected vehicles,” IEEE Trans. Intell. Transp. Syst., early access, Mar. 26, 2020, doi: 10.1109/TITS.2020.2982186.
  • [36] J. Xu, P. Zhu, J. Li, X. Wang, X. You, ”Secrecy Energy Efficiency Optimization for Multi-User Distributed Massive MIMO Systems,” IEEE Transactions on Communications, vol. 68, no. 2, pp.915-929, Feb. 2020.
  • [37] X. Liu and X. Zhang, ”Rate and Energy Efficiency Improvements for 5G-Based IoT With Simultaneous Transfer,” in IEEE Internet of Things Journal, vol. 6, no. 4, pp. 5971-5980, Aug. 2019, doi: 10.1109/JIOT.2018.2863267.
  • [38] F. Wang, J. Xu, X. Wang and S. Cui, ”Joint Offloading and Computing Optimization in Wireless Powered Mobile-Edge Computing Systems,” in IEEE Transactions on Wireless Communications, vol. 17, no. 3, pp. 1784-1797, March 2018, doi: 10.1109/TWC.2017.2785305.
  • [39] Y. Mao, J. Zhang, K. B. Letaief, “Dynamic computation offloading for mobile-edge computing with energy harvesting devices,” IEEE J. Sel. Areas Commun., vol. 34, no. 12, pp. 3590-3605, Dec. 2016.

Acknowledgements

Not applicable.

Funding

This work was supported by the National Key R&D Program of China under Grant 2021YFB2900300, and the National Natural Science Foundation of China under Grants 62171126 and 61871122.
Zhejiang Natural Science Foundation (LQ21F010008).

Abbreviations

IoV: Internet of Vehicle; IoT: Internet of Things; 5G: the fifth generation mobile communication; 6G: the sixth generation of mobile communication; MEC: mobile edge computing; eVNs: electric vehicle nodes; AN: anchor node; SWIPT: simultaneous wireless information and power transfer; FD:full-duplex; MIMO: multi-input and multi-output; WSN: wireless sensor network; MCC: mobile cloud computing; EH: energy harvesting; WPT: wireless power transfer; ID: information decoding; PS: power-splitting; TS: timeswitching; SDN: software defined network; CPU: central processing unit; SINR: interference plus noise ratio; SIC: selfinterference cancelation; RF: radio frequency; SNR: signal to noise.

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

Jiafei Fu proposes an alternate interior-point iterative scheme (AIIS) to optimize the energy efficiency of electric vehicles in a smart IoV system and she is the major contributor in writing the manuscript. All authors read and approved the final manuscript.

Authors’ information

Jiafei Fu received her B.S. degree in electronic and information engineering from Lishui University, Lishui, China, in 2017 and the M.S. degree in information and communication engineering from Zhejiang University of Technology, Hangzhou, China, in 2020. She is currently pursuing the Ph.D degree in information and communication engineering at Southeast University, Nanjing, China. Her research interests include full-duplex, distributed MIMO, mobile edge computing, and ultra reliable and low latency communication.

Pengcheng Zhu (M’09) received his B.S. and M.S. degrees in electrical engineering from Shandong University, Ji’nan, China, in 2001 and 2004, respectively, and his Ph.D. degree in information and communication engineering from Southeast University, Nanjing, China, in 2009. He is a professor with the National Mobile Communications Research Laboratory, Southeast University. His research interests lie in the areas of wireless communications and mobile networks, including B5G/6G mobile communication systems, physical layer security and privacy, distributed MIMO, and mmWave communications.

Jingyu Hua was born in Zhejiang province, China in 1978. He received the B.S. and M.S. degrees in electronic engineering from the South China University of Technology, Guangzhou, China, in 1999 and 2002. Then in 2006, he received the Ph.D. degree in electronic engineering from Southeast University, Nanjing, China. Since 2006, he had joined Zhejiang University of Technology as an assistant professor in the electronic engineering department, and promoted as full professor in 2012. From 2019, he is with Zhejiang Gongshang University as a distinguish professor. He is the author of more than 200 articles and more than 20 inventions. His research interests include the area of parameter estimation, channel modeling, wireless localization and digital filtering in wireless communications. He is currently an associate editor for the IEEE Transactions on Instrumentation and Measurements.

Jiamin Li received the Ph. D. degree in electronic engeneering from Southeast University, Nanjing, China in 2014. He joined the National Mobile Communications Research Laboratory at Southeast University, China, in 2015, where he has been an Associate Professor since 2018. His current research interests include turbo detection, vehicular communications and massive MIMO systems.

Jiangang Wen was born in 1989. He received the B.S. degree of electronic and information engineering in 2012, and the Ph.D. degree of Control Science and Engineering in 2019, both from the Zhejiang University of Technology, Hangzhou, China. Currently, he is a teacher at Zhejiang Gongshang University. His research interests include optimization and digital filtering in mobile communications.

Figures

Refer to caption
Figure 1: System model
Refer to caption
Figure 2: Time slot
Refer to caption
Figure 3: The average energy efficiency of vehicles versus the computation task M
Refer to caption
Figure 4: The average energy efficiency of vehicle nodes (VNs) versus the computation task M under different antenna numbers N
Refer to caption
Figure 5: The average energy efficiency of vehicle nodes (VNs) versus the different numer of VNs
Refer to caption
Figure 6: The average energy efficiency of vehicle nodes (VNs) versus the different transmitting power of AN
Refer to caption
Figure 7: The transmission time consumption of vehicle nodes (VNs) versus the computation task M
Refer to caption
Figure 8: The variance of energy efficiency between all vehicle nodes (VNs) under different antenna numbers N
Refer to caption
Figure 9: The variance of transmission time consumption of vehicle nodes (VNs) under different computation task M

Tables

Table 1: Simulation parameters
parameter value
𝒉iu,𝒉jd\bm{h}_{i}^{\text{u}},\bm{h}_{j}^{\text{d}} Random uniform distribution U(0.5,1)\sim U(0.5,1)
𝑯an\bm{H}_{\text{an}} Raylaigh Fading distribution 𝒞𝒩(0,0.1)\sim\mathcal{CN}(0,0.1)
NN 6,8,106,8,10
KK 1101\sim 10
BB 2MHz
CC 103cycles/bit10^{3}cycles/bit
TT 0.5
β\beta 0.2
α\alpha 0.8
κ\kappa 103310^{-33}
pjp_{j} 10W30W10W\sim 30W
pminp_{\text{min}} 1W1W
pmaxp_{\text{max}} 5W5W
δan2,δj2,δps2\delta_{\text{a}n}^{2},\delta_{j}^{2},\delta_{\text{p}s}^{2} 107W10^{-7}W