3
be more stable, so it is more efficient [35], [36]. At present,
some work on the uplink and downlink transmissive RMS
transceiver design has been carried out [36], [37], but it is still
in its infancy. Meanwhile, the application of the transmissive
RMS transceiver in various communication scenarios also has
potential.
B. Motivation and Contributions
Based on the above backgrounds and challenges, in order to
improve the computing capability, reduce the computing delay,
and reduce the BS deployment cost of the communication
and computing network, we propose a transmissive RMS
transceiver enabled multi-tier computing networks, where the
decoding-and-forward (DF) relay is equipped with a CN,
and transmissive RMS transceiver is equipped with an MEC
server. In general, the computing capability of the DF relay
should be comparable to or greater than that of the device
to make computational cooperation feasible. To the best of
our knowledge, the current research on communication and
computing networks with transmissive RMS transceivers is
still in its infancy, and the demand for improving network com-
puting capability, reducing computing delay, and reducing BS
deployment cost has greatly promoted this work. In this paper,
we minimize total energy consumption by jointly optimizing
the subcarrier allocation, task input bits, time slot allocation,
transmit power allocation, and RMS transmissive coefficient.
It is challenging to address this non-convex optimization
problem due to the high coupling of optimization variables.
Hence, we need to design an effective optimization algorithm
for solving it. In summary, the main contributions of this paper
can be summarized as follows:
•We propose a novel transmissive RMS transceiver en-
abled multi-tier computing framework, where the devices
and sensors can offload tasks to DF relay and RMS
multi-antenna system for calculations, thereby improving
computing capability and reducing computing latency
of the networks. Meanwhile, we formulate the energy
consumption minimization problem for joint optimization
of the subcarrier allocation, task input bits, time slot allo-
cation, transmit power allocation, and RMS transmissive
coefficient. Since the objective function and the partial
constraints are non-convex due to the high coupling of
the optimization variables, the problem is a non-convex
optimization problem and is challenging to solve directly.
•To address the formulated energy consumption minimiza-
tion problem, we first divide the non-convex optimization
problem into three sub-problems based on the block
coordinate descent (BCD) algorithm. Specifically, in the
first sub-problem, given the time allocation, task input
bits, and RMS transmissive coefficient, we solve the
joint optimization problem for the subcarrier allocation
and user transmit power allocation. In the second sub-
problem, we deal with the joint optimization problem
for the time allocation and task input bits by apply-
ing successive convex approximation (SCA) when the
subcarrier allocation, user transmit power allocation and
RMS transmissive coefficient are fixed. For the third
sub-problem, the RMS transmissive coefficient can be
obtained by using difference-convex (DC) programming
and SCA when other optimization variables are given.
Finally, the three sub-problems are optimized alternately
until convergence is achieved.
•Through the numerical simulation, we verify the effec-
tiveness of the proposed joint optimization algorithm for
the subcarrier allocation, task input bits, time slot allo-
cation, transmit power allocation and RMS transmissive
coefficient compared with the benchmark algorithms, i.e.,
it can decrease the total energy consumption. In addition,
the proposed multi-layer offload-computation scheme is
superior to other offload schemes, and the introduction of
transmissive RMS transceivers can greatly reduce the cost
of overall network deployment, which has great potential
in next-generation communications.
The rest of this paper is organized as follows. Section
II elaborates the system model and optimization problem
formulation for the transmissive RMS transceiver enabled
multi-tier computing networks. Section III presents the pro-
posed optimization algorithm for the formulated optimization
problem. In Section IV, numerical results demonstrate that
our algorithm has good convergence and effectiveness. Finally,
conclusions are given in Section V.
Notations: Scalars are denoted by lower-case letters, while
vectors and matrices are represented by bold lower-case letters
and bold upper-case letters, respectively. |x|denotes the abso-
lute value of a complex-valued scalar x. For a square matrix X,
tr(X),rank(X),XH,Xm,n and kXkdenote its trace, rank,
conjugate transpose, m, n-th entry and matrix norm, respec-
tively, while X0represents that Xis a positive semidefinite
matrix. Similarly, for a general matrix A,rank(A),AH,
Am,n and kAkalso denote its rank, conjugate transpose, m, n-
th entry and matrix norm, respectively. In addition, CM×N
denotes the space of M×Ncomplex matrices. INdenotes
an dentity matrix of size N×N.jdenotes the imaginary unit,
i.e., j2=−1.E{·} represents the expectation of random
variables. Finally, the distribution of a circularly symmetric
complex Gaussian (CSCG) random vector with mean µand
covariance matrix Cis denoted by CN (µ, C), and ∼stands
for ‘distributed as’.
II. SYSTEM MODEL AND PROBLEM FORMULATION
In this section, we mainly describe the system model and
problem formulation.
A. Network Model
As shown in the Fig. 1, we consider a multi-tier MEC
network model based on a relay-transmissive RMS multi-
antenna system, which includes Ksingle-antenna task nodes
(TN), a single-antenna DF relay and Mtransmissive elements
RMS multi-antenna system. In this paper, we consider the
orthogonal frequency division multiple access (OFDMA) sys-
tem, where the channel of bandwidth Bis divided into N
subcarriers, each with a bandwidth of W=B/N. Inter-
subcarrier interference is negligible, and the cyclic prefix is
large enough to overcome inter-symbol interference. Note that