Skip to Content
Applied SciencesApplied Sciences
  • Article
  • Open Access

19 September 2024

Generative AI-Enabled Energy-Efficient Mobile Augmented Reality in Multi-Access Edge Computing

and
School of Computing, Gachon University, Seongnam 13120, Republic of Korea
*
Author to whom correspondence should be addressed.
This article belongs to the Special Issue Object Detection Technology

Abstract

This paper proposes a novel offloading and super-resolution (SR) control scheme for energy-efficient mobile augmented reality (MAR) in multi-access edge computing (MEC) using SR as a promising generative artificial intelligence (GAI) technology. Specifically, SR can enhance low-resolution images into high-resolution versions using GAI technologies. This capability is particularly advantageous in MAR by lowering the bitrate required for network transmission. However, this SR process requires considerable computational resources and can introduce latency, potentially overloading the MEC server if there are numerous offload requests for MAR services. In this context, we conduct an empirical study to verify that the computational latency of SR increases with the upscaling level. Therefore, we demonstrate a trade-off between computational latency and improved service satisfaction when upscaling images for object detection, as it enhances the detection accuracy. From this perspective, determining whether to apply SR for MAR, while jointly controlling offloading decisions, is challenging. Consequently, to design energy-efficient MAR, we rigorously formulate analytical models for the energy consumption of a MAR device, the overall latency and the MAR satisfaction of service quality from the enforcement of the service accuracy, taking into account the SR process at the MEC server. Finally, we develop a theoretical framework that optimizes the computation offloading and SR control problem for MAR clients by jointly optimizing the offloading and SR decisions, considering their trade-off in MAR with MEC. Finally, the performance evaluation indicates that our proposed framework effectively supports MAR services by efficiently managing offloading and SR decisions, balancing trade-offs between energy consumption, latency, and service satisfaction compared to benchmarks.

1. Introduction

Mobile augmented reality (MAR), which seamlessly combines virtual information into a person’s real-world environment, is becoming a prominent application within mobile multimedia networks (MMNs) by utilizing artificial intelligence (AI) [1]. For example, various deep learning (DL)-based AI object detection algorithms, such as YOLO, SSD, and Fast R-CNN, are employed to identify objects from images in MAR. While these DL algorithms provide precise object detection, they demand significant computational power from MAR devices that have limited processing capabilities and battery life. This leads to increased processing delays and quick battery depletion. To address this issue, multi-access edge computing (MEC) in MMNs provides additional computing resources to mobile devices (MDs) through computation offloading [2].
Since both MDs and MEC servers have heterogeneous computing and networking capabilities, designing efficient offloading management to optimize energy efficiency, minimize latency, or balance both is challenging [2]. Particularly, determining whether to offload images based on current networking and computing conditions has been extensively studied [3,4,5]. However, a significant issue in MAR is that frequently transmitting high-resolution images to the MEC server results in high latency and energy consumption. To address this, recent works [6,7,8] have considered resolution management to balance accuracy and latency/energy trade-offs, recognizing that image resolution impacts the object detection accuracy. Thus, maintaining an acceptable detection accuracy in MAR while reducing the bitrate remains a challenging trade-off.
To address this, recent research in MMNs has explored the potential of generative AI (GAI), such as super-resolution (SR) neural models, to enhance image quality by increasing the resolution of lower-quality frames, thereby reducing the bitrate of network transmission [1] (GAI can produce high-quality, naturalistic content in various formats, including images, videos, and 3D content [1,9]. Among the various GAI solutions, SR technologies such as EDSR and RCAN convert low-resolution images into high-resolution ones using machine learning (ML)-based AI schemes.). However, GAI technology demands substantial computational power and can introduce latency, which may significantly burden the MEC server if there are numerous offloading requests from MAR clients for MAR services [10]. To the best of our knowledge, no studies have investigated the use of GAI technology for MEC-assisted MAR. Therefore, a thorough investigation is necessary to determine how to efficiently utilize GAI while managing offloading decisions, presenting an opportunity to improve upon conventional approaches.
In this study, we propose a novel offloading and SR control scheme for energy-efficient MAR in MEC by leveraging GAI. Specifically, we adopt SR as a promising GAI technology and conduct an empirical study to verify that the computational latency of SR, including SRGAN and EDSR, increases with the upscaling level. From this empirical study, we highlight a trade-off between increased computational latency and enhanced service satisfaction when upscaling images for object detection, as it boosts the detection accuracy. This makes it difficult to decide whether to choose SR for MAR while simultaneously managing offloading decisions. As a result, to balance the trade-off between energy efficiency and latency in MAR with MEC, our approach considers both the computational latency for SR at MEC servers and the computing and networking conditions of MDs to determine whether to offload the image to the MEC server. If offloading is decided, SR management is conducted. To achieve this, we rigorously formulate analytical models and design an elaborate cost optimization problem that balances this trade-off by controlling the offloading decisions and SR management of each MAR client. Since the problem is a non-convex optimization problem, we leverage several relaxation techniques to develop a near-optimal yet feasible algorithm. Numerical analysis reveals that the proposed scheme significantly improves the balance among the computation latency, energy consumption of each MD, and the satisfaction of service quality from enforcement of service accuracy compared to benchmarks. This creates an incentive to apply GAI in future MAR services.
The rest of this paper is organized as follows: Section 2 reviews related work and offers an overview of previous research in this area. In Section 3, we describe the proposed system model. Section 4 details the problem formulation and the solution for the proposed scheme. Section 5 explains the evaluation setup and presents our results, including a comprehensive analysis and comparison with other approaches. Finally, Section 6 summarizes our findings and discusses possible future research directions.

3. System Model

3.1. Proposed Framework

In this section, we outline the system architecture for a multi-user SR-supported MMN environment utilizing MEC, as illustrated in Figure 1. The system model consists of multiple MDs labeled as N = 1 , 2 , , n , along with a single MEC server linked to the core network with a network bandwidth of B and a computing capacity of f M E C . Each MAR client device is assigned a specific network bandwidth B n and possesses distinct computing resources f n . MAR tasks are represented as a vector comprising task workload density ω n defined as CPU cycles per bit, offloading data size d n , and the resolution level of source data R n . Here, we assume that each MAR client executes only one MAR application per decision process, and this application may differ from those of other clients. Consequently, each MAR client has a unique MAR task workload and its data size. In this framework, MAR clients can offload their tasks to the MEC server to manage time-sensitive and computation-intensive MAR tasks given the MDs’ limited battery life and computing power. During the offloading process, the MD can transmit low-resolution source images to the MEC server, where the resolution is enhanced using SR to improve accuracy, thereby increasing MAR service satisfaction. Therefore, throughout the entire MAR process, including offloading and SR, MAR clients should optimize offloading and SR control for efficient MAR services.
Figure 1. Proposed system architecture.
The proposed system model consists of four main components, as shown in Figure 1. The communication module gathers information from MAR clients, such as the data needed for offloading and SR decisions. The decision controller then calculates the optimal offloading and SR choices, represented by binary variables s 1 and s 2 , which indicate whether to offload or not, and whether to apply SR or not, respectively. Once the optimal values of s 1 and s 2 are determined, the decision controller sends the results to the MDs. The MAR clients then execute their MAR tasks based on the received decisions. The MEC server processes the offloaded MAR tasks and applies SR as required. This process flow is detailed in Figure 2. Importantly, as illustrated in Figure 2, some MAR clients may choose to offload their MAR tasks (4.1), while others may process their tasks locally (4.2). In the flow of 4.1, MAR clients can take advantage of SR from the MEC server to enhance the resolution of the offloaded images, provided that the additional computational latency introduced by the SR process is within acceptable limits. If the overall latency exceeds acceptable limits, MAR clients will offload their tasks without requesting SR. In this context, the primary objective of the proposed framework is to balance the overall energy consumption, acceptable latency, and service satisfaction from the MAR service throughout the process. The key notations used in this paper are summarized in Table 2.
Figure 2. Task flow in proposed system.
Table 2. Parameter description.

3.2. Analytical Models

In this subsection, we present analytical models to evaluate the overall latency and energy consumption of the proposed system. To achieve this, we first conduct an empirical study to analyze the computational latency of SR in relation to different source resolution levels.

3.2.1. SR Latency Analytics

As observed, SR is a type of GAI technology that uses neural networks to upscale low-resolution images to high-resolution images. While SR enhances the accuracy of AR services by providing higher-resolution images, it also imposes a significant computational burden, which can increase the overall latency in MAR. Understanding the relationship between SR latency and other parameters is crucial for optimizing the efficiency of MAR services.
SR latency is significantly affected by the SR model used, the size of the input image (or its source resolution), and the available computing resources. Given that computing resources are limited and a more advanced SR model demands additional resources, the source resolution becomes the key parameter for influencing the SR latency. To optimize the SR computation latency, it is essential to understand how the resolution of the source image impacts this latency. Figure 3 illustrates the empirical results on how input image resolution influences SR computation latency. In this study, we employed two SR models: EDSR, based on the ResNet architecture, and SRGAN, based on the GAN framework. The U r b a n 100 dataset from [26] was used for experimentation. As shown in Figure 3, increasing the resolution of the source image leads to a higher SR computation latency, following a consistent pattern across both SR models for the same upscaling factor. This allows us to define the relationship between the input image resolution R, denoted as the number of pixels per height, and the SR computation latency l S R (ms). Here, l S R increases as a function of R because the computational workload grows with R. However, due to the complexity of analytically determining this relationship, a data-driven approach is more practical. This involves using offline training with empirical data to model the relationship. We employed regression-based modeling, a common technique seen in areas like mobile CPU property modeling, including CPU power and temperature variations [21]. Thus, we conclude that l S R can be modeled as
l S R = α R 2 + β R + γ ,
where α , β , γ are hyperparameters decided by the SR model. This equation (Equation (1)) makes quantifying the latency of SR computation possible via input image resolution.
Figure 3. The impact of input image resolution on the SR computational latency.

3.2.2. Network Latency and Energy Consumption

The network latency and energy consumption are determined by the MAR client’s offloading data size. We consider the wireless network with an orthogonal frequency-division multiple access (OFDMA), and we assume that the MEC server provides a total bandwidth fairly over MAR clients such that B n for client n equals B / N . Let t r n u p and t r n d o w n denote the transmission rate of uplink and downlink for client n and base station, respectively. Then, the uplink and downlink transmission rates can be calculated by
t r n u p = B n log 2 ( 1 + p n h u p σ 2 ) ,
t r n d o w n = B n log 2 ( 1 + p m h d o w n σ 2 ) ,
where p n and p m denote the transmission power of MAR client n and base station, respectively, h u p and h d o w n denote the channel gain of uplink and downlink, respectively, and σ 2 denotes the noise power. Based on Equations (2) and (3), the transmission latency of uplink and downlink is calculated by
l n u p = d n t r n u p ,
l n d o w n = d m t r n d o w n ,
where d m is the output data size after execution in the MEC server. The transmission energy consumption of each MAR client is composed of input data size and energy consumption per bit. We do not consider downlink energy consumption since our framework aims to minimize the energy consumption of whole clients except for the MEC server. Thus, transmission energy is given by
e n u p = l n u p p n .

3.2.3. Computation Latency and Energy Consumption

With SR decision factor s 2 = { s 2 1 , s 2 2 , , s 2 n , s 2 N } { 0 , 1 } for all n. In this context, s 2 n = 1 indicates that the MAR client requests the SR process to upscale the image, while s 2 n = 0 signifies that the MAR client opts not to use the SR process. Computation in MEC is composed of an offloading task and an SR task defined as Equation (1). Let l M E C c denote the latency of the MEC computation about client n, which is calculated by
l M E C c = ω n f M E C + s 2 n ( α R n 2 + β R n + γ ) ,
where ω n denotes the data size of the task workload offloaded from MAR client n. Therefore, the latency and energy consumption of computation are defined by
l n c = ω n f n ,
e n c = μ n 2 ( f n ) 2 ω n ,
where μ n 2 denotes the energy coefficient of MAR client n’s device chipset. The energy consumption of computation is defined as the product of the energy coefficient, the square of CPU frequency, and the size of task workload [13].

3.2.4. Total Latency and Energy Consumption

Total latency and energy consumption can be described via the sum of the network part and computation part. Therefore, the total latency and energy consumption of MAR client n is calculated by
l n = s 1 n ( l n u p + l n d o w n ) + ( s 1 n l M E C c + ( 1 s 1 n ) l n c ) ,
e n = s 1 n e n u p + ( 1 s 1 n ) e n c .
where offloading decision factor is defined as s 1 = { s 1 1 , s 1 2 , , s 1 n , s 1 N } { 0 , 1 } for all n. In this context, s 1 n = 1 indicates that the MAR client requests task offloading to compute MAR tasks with the MEC server’s resources.

4. Problem Formulation and Solution

4.1. Problem Formulation

Based on the total latency and energy consumption model (10) and (11), we formulate the multi-objective optimization problem to balance the energy consumption of MAR clients, total latency, and the service satisfaction, which are the trade-off relationship. Such a trade-off relationship is expressed in multi-objective optimization problems by assigning weighted sums to each metric, as widely modeled in the literature, such as in [21]. Here, we define the service satisfaction of MAR client n, denoted as Q n , as
Q n = s 2 n S n R n
where S n represents the satisfaction attained by MAR client n from utilizing the SR, which enhances the detection accuracy by upscaling the resolution. However, since the input resolution, R n is already sufficiently high to achieve acceptable accuracy, the additional satisfaction gained from the SR will be diminished. Moreover, in our problem, latency does not necessarily have to be minimal but does not exceed an acceptable latency L n . To formulate this concept, we design a simple latency cost function as
c o s t ( x ) = 0 if L n x 0 θ x if x > 0
where x = l n L n is given. This cost function means that the cost value is 0 if the total latency l n is smaller than the latency constraint L n . If not, the cost value increases linearly via hyperparameter θ . Then, we can design the joint optimization problem of task offloading s 1 and SR decision s 2 for energy-efficient MAR. Since the problem has the integer variables of s 1 , and s 2 , it is a non-convex optimization problem. To solve this problem, we relax the integer variables of s 1 and s 2 into a continuous value. Then, we can design the multi-objective optimization problem as follows:
P 1 :
min s 1 i , s 2 i i = 1 N w 1 e i + w 2 c o s t ( l i L i ) Q i
s . t . 0 s 1 i , s 2 i 1 , s 1 i s 2 i 0 .
where w 1 and w 2 are the weight factors for balancing energy consumption and latency as well as service satisfaction. In the constraints, constraint (14b) means the value of offloading decision factor s 1 i and SR decision factor s 2 i is between 0 and 1, and SR works only if the MAR client declares the offloading since the local computing does not need to control the resolution of source images from the SR process. The detail of resolution levels is described in Table 2.

4.2. Optimization Solution

Since the latency cost(.) function in (13) is non-differentiable, we need to convert this cost(.) function into the max ( . ) form to translate the problem into LP by using the relaxation technique, which is max ( 0 , θ T ) , where l i L i is T. Then, we transform the max ( . ) form into an affine function by introducing an auxiliary variable z i = max ( 0 , θ T ) . Finally, the P 1 can be translated to as follows:
P 2 :
min s 1 i , s 2 i , z i i = 1 N w 1 e i + w 2 z i Q i
s . t . 0 s 1 i , s 2 i 1 , s 1 i s 2 i 0
0 z i , θ T i z i
As shown above, variable z i must also be optimized to solve P 2 . It makes our problem more complicated. To address P 2 , we illustrate a lemma for solving our problem in an alternative way.
Lemma 1. 
P 2 is a linear programming (LP) with respect to optimization variables s 1 i , s 2 i , and z i , respectively.
Proof. 
Regarding s 1 i , the objective function of P 2 takes a linear form because the other variables are constants relative to s 1 i . Additionally, constraint (15b) is affine with respect to s 1 i , and the remaining constraints are independent of s 1 i . As a result, P 2 is a linear program (LP) in terms of s 1 i , since both the objective function and the inequality constraint are affine functions. A similar argument applies to s 2 i and z i .    □
According to Lemma 1, we can solve P 2 using the block coordinate descent algorithm [27]. That is, for a given initial value of other optimization variables except the target optimization variable, the optimal s 1 , s 2 , and z can be calculated via the S i m p l e x   a l g o r i t h m (SA). Consequently, we can obtain all optimal values after an iteration that solves one variable by fixing each other until the result of the objective function converges below the threshold. The procedure of the proposed block coordinate descent algorithm is summarized in Algorithm 1.
Algorithm 1 Proposed optimization algorithm.
  • Input: B, f n , d n , R n , p n , ω n , h n , L n , σ , f M E C , α , β , γ , μ n , difference threshold  d f
  • Initialize: Initial s 1 and s 2 are initialized in 1. Initial cost C 0 is a large number.
  • Output: Optimal  s 1 , s 2 , R, z
  •    Initialize t = 0
  •    for all i in 1 , 2 , , n do
  •       while True do
  •           s 1 i ← solving P r o b . 2 with fixed s 2 i , z i
  •           s 2 i ← solving P r o b . 2 with fixed s 1 i , z i
  •           z i ← solving P r o b . 2 with fixed s 1 i , s 2 i
  •          Calculate current cost C t + 1
  •          if  | C t + 1 C t | < d f  then
  •                s 1 i s 1 i
  •                s 2 i s 2 i
  •                z i z i
  •               break
  •          end if
  •           t = t + 1
  •       end while
  •    end for
  •    return  s 1 * , s 2 * , z i *
As demonstrated in [28], the block coordinate descent method used in Algorithm 1 exhibits a sublinear convergence rate. Additionally, each block, formulated as the LP problem, can be efficiently solved using the SA, which has polynomial complexity denoted as O ( N 3 ) , where N represents the number of decision variables (here, the number of MDs). Therefore, the method is practically deployable, as the number of MDs connected to a single MEC server is typically within a reasonable range.

4.3. Discussion for Practical Considerations

As a practical consideration, we conduct experiments to analyze the SR effect on the MAR system in terms of the latency and object detection accuracy. We implement all modules, including our proposed framework, on the MEC side using Python and PyTorch. Specifically, to establish a practical MAR and SR environment, we implement the object detection module using the OpenCV library and the ultralytics YOLOv8 model [29], while the SR module is implemented using the EDSR model [30]. The client node sends object detection requests to the proposed framework, and after the MEC server node processes the object detection tasks based on the SR decision from our framework, the client displays the results using the OpenCV library. The overview of our implementation is shown in Figure 4.
Figure 4. The result of object detection on implemented framework.
To evaluate the effect of SR on object detection, our implementation collects three metrics from the object detection results using ultralytics YOLOv8 built-in methods: image preprocessing time, inference time, and confidence score. We compare the original low-resolution video case to the video with the SR case through the three metrics above. Image preprocessing time and inference time are used to analyze the impact on the object detection task’s latency regarding whether SR is applied or not, and confidence scores are used to analyze the impact on the object detection task’s accuracy. The higher the confidence score, the higher the accuracy. The comparison results about performance metrics are shown in Table 3. As shown in Table 3, the task execution time increases when SR is applied, and the confidence score also increases. That is, applying SR in the MAR system causes improvement in terms of accuracy but degeneration in terms of service latency. Also, depending on the trade-off between the latency decrement and the accuracy increment, users’ satisfaction with MAR applications such as QoS may vary. Therefore, the satisfaction model design in our framework is effective in a practical MAR environment.
Table 3. The performance metrics’ comparison of YOLO implementation.

5. Performance Evaluation

5.1. Simulation Setup

In this section, we present simulation results to validate the effectiveness of the proposed optimization scheme, comparing it to five benchmarks.
  • Benchmark 1—All local [31,32,33]: All MAR clients compute MAR tasks locally, without MEC offloading and SR.
  • Benchmark 2—All offload only [31,32,33]: All MAR clients offload MAR tasks to the MEC server without the SR process.
  • Benchmark 3—All offload and SR: All MAR clients request not only task offloading but also the SR process.
  • Benchmark 4—Minimum SR: Offloading decisions are optimum, but only the clients that have the lowest resolution data request SR tasks. It is one of the rule-based approaches for SR control.
  • Benchmark 5—Random [31,32,33]: The number of clients that request task offloading and SR is randomly decided.
In our simulation, the total number of mobile devices is set to [5, 10, 15, 20, 25] [34] to analyze the tendency from the number of clients (i.e., MDs). Each MD is assigned a single MEC server with the wireless channel bandwidth B = 75 MHz [13] and the computation resource f M E C = 15 GHz. Also, each MD is allocated bandwidth resources and computation resources. The transmission power ranges from p = 50 mW to 100 mW randomly, and background noise power σ = 100 dBm [34]. The workload density of computation tasks ω n is randomly distributed between 500 and 1000 cycles per bit [13], and the data size of video frame size d n is randomly distributed between 500 and 3000 KB [20]. Each local device used by the MAR client has its own computing resource f n = 1 to 1.8 GHz and a delay threshold of AR application L n = 20 to 25 ms. The data size of offloaded tasks is 80% of the original tasks, although the proposed algorithm adopts the binary offloading decision in this paper. This is because the MAR tasks consist of a sequence of subtasks, and some subtasks cannot be offloaded to the MEC server [13].

5.2. Performance Evaluation

To evaluate the impact of weight parameters for latency and energy consumption, we first evaluate the change of latency and energy consumption with different weight parameters w 1 and w 2 in fixed client number 15. We identify trends by measuring the latency and energy consumption with the proposed algorithm while changing only as the weight parameters w 1 and w 2 in the above experimental environment. As shown in Figure 5, the weight parameter for latency w 1 increases and the weight parameter for energy consumption w 2 decreases, and the computation latency decreases and the energy consumption of MAR clients increases. On the contrary, as w 2 increases and w 1 decreases, the energy consumption of MAR clients increases, and the computation latency decreases. This means that latency and energy consumption are in a trade-off relationship regarding weight parameters w 1 and w 2 . Since this paper aims to balance the latency, energy consumption of MAR clients, and service satisfaction, we choose weight parameters w 1 = 0.5 and w 2 = 0.5 for performance evaluation.
Figure 5. The impact of latency and energy consumption on the change of weight parameters.
Next, we evaluate the performance of the proposed algorithm and benchmarks in terms of latency, energy consumption, and total cost that we defined with two different SR methods, EDSR and SRGAN. First of all, Figure 6 shows the result of the proposed total cost model from the proposed algorithm and benchmarks with the EDSR SR model. The proposed algorithm achieves the minimum values at the cost function compared to benchmarks. This is because the proposed cost model considered not only latency and energy consumption but also the satisfaction of service quality obtained from video resolution Q n by balancing all those factors. This is why the proposed algorithm achieves the minimum cost despite the proposed algorithm not gaining the definite minimum value in latency and energy consumption. Finally, the reason why benchmark 4 achieved a higher total cost than our proposed algorithm is that it is difficult to accurately adapt the satisfaction caused by SR process with a rule-based algorithm. Therefore, we can conclude that optimizing the offloading and SR decision leads to the balance of the computation latency, energy consumption, and service quality.
Figure 6. Total performance of proposed cost model per number of MAR users (MMN clients) with EDSR SR model.
Figure 7 and Figure 8 show the detailed results in terms of latency and energy consumption from the proposed model and benchmarks with the EDSR SR model. As shown in Figure 7, as the number of clients increases, the latency also increases, except for all local computing environments named benchmark 1. The main reason is that the offloading strategies including the proposed algorithm are greatly affected by the available network and computing resources of the MEC server. In other words, as the number of MAR clients increases, the allocated bandwidth and computing resource for each client decreases. However, the latency of benchmark 1 only affects the local computing resource of each client. In Figure 8, we present the energy consumption generated by different offloading and SR strategies. It can be seen that the number of clients does not greatly impact energy consumption. This is because the energy consumption of MAR clients is largely affected by the task computation energy rather than the transmission energy. It means that a client’s energy consumption is mainly determined by their available computing resources. Also, it can be seen that the proposed algorithm shows an almost identical average value as another offloading strategy. This is because all offloading strategies including the proposed algorithm, benchmark 2, and 3 adopt the same binary offloading strategy, and the proportion of task computation energy is larger than transmission energy.
Figure 7. Latency of proposed cost model per number of MAR users (MMN clients) with EDSR SR model.
Figure 8. Energy consumption of proposed cost model per number of MAR users (MMN clients) with EDSR SR model.
Figure 9, Figure 10 and Figure 11 present the average results for scaled proposed cost, latency, and energy consumption when using the SRGAN model. The SRGAN model requires more computational resources but provides more accurate SR results compared to the EDSR model. As illustrated in Figure 9, all strategies result in a higher cost than EDSR, due to increased satisfaction. However, the average latency also rises, as shown in Figure 10. Despite this, Figure 10 and Figure 11 indicate that the trends in latency and energy consumption are almost identical to those observed with the EDSR model.
Figure 9. Total performance of proposed cost model per number of MAR users (MMN clients) with SRGAN SR model.
Figure 10. Latency of proposed cost model per number of MAR users (MMN clients) with SRGAN SR model.
Figure 11. Energy consumption of proposed cost model per number of MAR users (MMN clients) with SRGAN SR model.

6. Discussions for Future Works

Our proposed framework has proven to be useful in improving the performance of the MAR system; however, there are some points for discussion or further development.
  • Expansion on the GAI aspect: In this paper, we focus on the SR aspect of GAI to improve MAR performance. However, there are many GAI solutions to adapt to the MAR system to improve MAR performance, and the effects of these GAI solutions are designed differently from SR. In the real-world MAR environment, different GAI solutions can be applied depending on the different requirements of the application since other GAI solutions have their unique advantages and requirements [1]. For example, the diffusion model, one of the GAI algorithms, generates images from text descriptions, even when the training dataset does not include the specific images described. This algorithm can be applied to various MAR applications that require flexible qualities or specifications. If the proposed framework with SR is advanced, it may be possible to consider expanding to other GAI technologies.
  • Expansion on the problem formulation and optimization method: In this paper, we formulated a multi-objective optimization problem to balance the trade-off between latency, energy consumption, and service satisfaction. We solved this problem using the block coordinate descent method, as it allows us to address the problem mathematically with minor modifications. However, our approach has the limitation of not enabling real-time decision making. Since the real-world MAR environment is dynamic, solutions that lack real-time adaptability are not applicable to practical MAR systems. To address this, our problem can be extended to a real-time decision-making framework using a Lyapunov-based, round-wise drift-plus-cost minimization approach. Additionally, key real-world factors such as heterogeneity among MEC servers and user mobility should be incorporated. As the problem becomes more complex and advanced, the optimization solutions will also require more sophisticated techniques. As discussed in Section 2, heuristic algorithms or AI-based solutions may be well suited for solving these more complex scenarios.
  • In-depth understanding of SR adaptation to MAR framework: Although we aim to enhance the user experience for MAR users through the application of SR, there is limited analysis on the effects of SR in MAR systems, such as distortions or loss of detail in SR results, as well as the overall impact of SR on users. Unfortunately, few studies have applied SR to MAR systems, and those that have often underestimated the challenges associated with SR [24], despite extensive research addressing these challenges in other fields [35,36]. For instance, some research suggests novel training methods using a distortion-aware network, as higher distortion in source images can degrade the performance and accuracy of SR. These studies explain that image distortion in AR is caused by the degradation process [35], changes in viewing range, and sphere-to-plane projection [36]. Moreover, as mentioned earlier, SR offers unique advantages that set it apart from other GAI technologies [1], and clearly demonstrating these differences will have important implications. In our future work, we plan to conduct more detailed analyses and evaluations to address these gaps.

7. Conclusions

In this study, we investigated GAI-enabled energy-efficient MAR in MEC environments, where SR is employed as one of the promising GAI technologies. Specifically, to balance the energy consumption of each MAR user, overall latency, and service satisfaction, the proposed algorithm designed a joint management framework for offloading and SR decisions in MEC-assisted MAR systems. This framework considered the trade-off between SR overhead in terms of the computational latency and the improved satisfaction resulting from higher image resolution. In our performance evaluation, we validated the effectiveness of the proposed algorithm in optimally managing offloading and SR decisions, demonstrating its ability to balance latency, energy consumption, and service satisfaction compared to benchmarks. Additionally, we discussed the practical deployment of the proposed scheme by presenting accuracy improvement tests related to practical object detection and SR implementation. As a future work, we plan to extend our research into developing a real-time decision-making algorithm utilizing Lyapunov-based round-wise drift-plus-cost minimization problems, leveraging the virtual queue concept. Specifically, more complex aspects such as heterogeneity among MEC servers and user mobility will be considered. Furthermore, a more rigorous implementation of real-world MAR applications will be explored to evaluate the extended work.

Author Contributions

M.N.: conceptualization, data curation, formal analysis, methodology, software, validation, visualization, and writing—original draft preparation; J.L.: conceptualization, methodology, validation, and writing—review and editing. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Gachon University research fund of 2022 (GCU-202300680001).

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The data presented in this study are available on request from the corresponding author. The data are not publicly available due to privacy.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Xu, M.; Niyato, D.; Kang, J.; Xiong, Z.; Guo, S.; Fang, Y.; Kim, D.I. Generative AI-enabled Mobile Tactical Multimedia Networks: Distribution, Generation, and Perception. arXiv 2024, arXiv:2401.06386. [Google Scholar] [CrossRef]
  2. Lee, J.; Seo, Y.J.; Kim, T.Y.; Niyato, D.; Poor, H.V. Local Cache-enabled Mobile Augmented Reality in Mobile Edge Computing. IEEE Commun. Mag. 2023, 62, 184–190. [Google Scholar] [CrossRef]
  3. Liu, S.; Yu, Y.; Lian, X.; Feng, Y.; She, C.; Yeoh, P.L.; Guo, L.; Vucetic, B.; Li, Y. Dependent Task Scheduling and Offloading for Minimizing Deadline Violation Ratio in Mobile Edge Computing Networks. IEEE J. Sel. Areas Commun. 2023, 41, 538–554. [Google Scholar] [CrossRef]
  4. Goh, Y.; Choi, M.; Jung, J.; Chung, J.M. Partial Offloading MEC Optimization Scheme using Deep Reinforcement Learning for XR Real-Time M&S Devices. In Proceedings of the 2022 IEEE International Conference on Consumer Electronics (ICCE), Las Vegas, NV, USA, 7–9 January 2022; pp. 1–3. [Google Scholar] [CrossRef]
  5. Hoa, N.T.; Huy, L.V.; Son, B.D.; Luong, N.C.; Niyato, D. Dynamic Offloading for Edge Computing-Assisted Metaverse Systems. IEEE Commun. Lett. 2023, 27, 1749–1753. [Google Scholar] [CrossRef]
  6. Seo, Y.J.; Lee, J.; Hwang, J.; Niyato, D.; Park, H.S.; Choi, J.K. A Novel Joint Mobile Cache and Power Management Scheme for Energy-Efficient Mobile Augmented Reality Service in Mobile Edge Computing. IEEE Wirel. Commun. Lett. 2021, 10, 1061–1065. [Google Scholar] [CrossRef]
  7. Ahn, J.; Lee, J.; Niyato, D.; Park, H.S. Novel QoS-Guaranteed Orchestration Scheme for Energy-Efficient Mobile Augmented Reality Applications in Multi-Access Edge Computing. IEEE Trans. Veh. Technol. 2020, 69, 13631–13645. [Google Scholar] [CrossRef]
  8. Ahn, J.; Lee, J.; Yoon, S.; Choi, J.K. A Novel Resolution and Power Control Scheme for Energy-Efficient Mobile Augmented Reality Applications in Mobile Edge Computing. IEEE Wirel. Commun. Lett. 2020, 9, 750–754. [Google Scholar] [CrossRef]
  9. Bond-Taylor, S.; Leach, A.; Long, Y.; Willcocks, C.G. Deep Generative Modelling: A Comparative Review of VAEs, GANs, Normalizing Flows, Energy-Based and Autoregressive Models. IEEE Trans. Pattern Anal. Mach. Intell. 2022, 44, 7327–7347. [Google Scholar] [CrossRef] [PubMed]
  10. Chen, N.; Zhang, S.; Liang, Y.; Wu, J.; Chen, Y.; Yan, Y.; Qian, Z.; Lu, S. TileSR: Accelerate On-Device Super-Resolution with Parallel Offloading in Tile Granularity. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), Vancouver, BC, Canada, 20–23 May 2024. [Google Scholar]
  11. Armonk. IBM and Nokia Siemens Networks Announce World’s First Mobile Edge Computing Platform. IBM. 2013. Available online: https://www.enterpriseitnews.com.my/ibm-and-nokia-siemens-networks-announce-worlds-first-mobile-edge-computing-platform/ (accessed on 14 August 2024).
  12. Cozzolino, V.; Tonetto, L.; Mohan, N.; Ding, A.Y.; Ott, J. Nimbus: Towards Latency-Energy Efficient Task Offloading for AR Services. IEEE Trans. Cloud Comput. 2023, 11, 1530–1545. [Google Scholar] [CrossRef]
  13. Chen, X.; Liu, G. Energy-Efficient Task Offloading and Resource Allocation via Deep Reinforcement Learning for Augmented Reality in Mobile Edge Networks. IEEE Internet Things J. 2021, 8, 10843–10856. [Google Scholar] [CrossRef]
  14. Tang, X.; Wen, Z.; Chen, J.; Li, Y.; Li, W. Joint Optimization Task Offloading Strategy for Mobile Edge Computing. In Proceedings of the 2021 IEEE 2nd International Conference on Information Technology, Big Data and Artificial Intelligence (ICIBA), Chongqing, China, 17–19 December 2021; Volume 2, pp. 515–518. [Google Scholar] [CrossRef]
  15. Zhang, Y.; Liu, T.; Zhu, Y.; Yang, Y. A Deep Reinforcement Learning Approach for Online Computation Offloading in Mobile Edge Computing. In Proceedings of the 2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS), Hang Zhou, China, 15–17 June 2020; pp. 1–10. [Google Scholar] [CrossRef]
  16. Ketykó, I.; Kecskés, L.; Nemes, C.; Farkas, L. Multi-user computation offloading as Multiple Knapsack Problem for 5G Mobile Edge Computing. In Proceedings of the 2016 European Conference on Networks and Communications (EuCNC), Athens, Greece, 27–30 June 2016; pp. 225–229. [Google Scholar] [CrossRef]
  17. Do, H.M.; Yoo, M. Delay Optimization for Augmented Reality Service using Mobile Edge Computing Federation System. In Proceedings of the 2023 14th International Conference on Information and Communication Technology Convergence (ICTC), Jeju Island, Republic of Korea, 11–13 October 2023; pp. 487–490. [Google Scholar] [CrossRef]
  18. Ren, P.; Liu, L.; Qiao, X.; Chen, J. Distributed Edge System Orchestration for Web-Based Mobile Augmented Reality Services. IEEE Trans. Serv. Comput. 2023, 16, 1778–1792. [Google Scholar] [CrossRef]
  19. Zhang, L.; Wu, X.; Wang, F.; Sun, A.; Cui, L.; Liu, J. Edge-Based Video Stream Generation for Multi-Party Mobile Augmented Reality. IEEE Trans. Mob. Comput. 2024, 23, 409–422. [Google Scholar] [CrossRef]
  20. Long, S.; Zhang, Y.; Deng, Q.; Pei, T.; Ouyang, J.; Xia, Z. An Efficient Task Offloading Approach Based on Multi-Objective Evolutionary Algorithm in Cloud-Edge Collaborative Environment. IEEE Trans. Netw. Sci. Eng. 2023, 10, 645–657. [Google Scholar] [CrossRef]
  21. Wang, H.; Xie, J. User Preference Based Energy-Aware Mobile AR System with Edge Computing. In Proceedings of the IEEE INFOCOM 2020—IEEE Conference on Computer Communications, Toronto, ON, Canada, 6–9 July 2020; pp. 1379–1388. [Google Scholar] [CrossRef]
  22. Liu, Z.; Lan, G.; Stojkovic, J.; Zhang, Y.; Joe-Wong, C.; Gorlatova, M. CollabAR: Edge-assisted Collaborative Image Recognition for Mobile Augmented Reality. In Proceedings of the 2020 19th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN), Sydney, NSW, Australia, 21–24 April 2020; pp. 301–312. [Google Scholar] [CrossRef]
  23. Hu, Z.; Xu, D. VideoControlNet: A Motion-Guided Video-to-Video Translation Framework by Using Diffusion Model with ControlNet. arXiv 2023, arXiv:2307.14073. [Google Scholar] [CrossRef]
  24. Li, V.; Amponis, G.; Nebel, J.C.; Argyriou, V.; Lagkas, T.; Ouzounidis, S.; Sarigiannidis, P. Super Resolution for Augmented Reality Applications. In Proceedings of the IEEE INFOCOM 2022—IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), New York, NY, USA, 2–5 May 2022; pp. 1–6. [Google Scholar] [CrossRef]
  25. Dang, X.; Wang, H.; Ren, J.; Chen, L. An application performance optimization model of mobile augmented reality based on hd restoration. In Proceedings of the 2020 Eighth International Conference on Advanced Cloud and Big Data (CBD), Taiyuan, China, 5–6 December 2020; pp. 201–206. [Google Scholar] [CrossRef]
  26. Huang, J.B.; Singh, A.; Ahuja, N. Single Image Super-Resolution From Transformed Self-Exemplars. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Boston, MA, USA, 7–12 June 2015; pp. 5197–5206. [Google Scholar]
  27. Tseng, P. Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization. J. Optim. Theory Appl. 2001, 109, 475–494. [Google Scholar] [CrossRef]
  28. Beck, A.; Tetruashvili, L. On the Convergence of Block Coordinate Descent Type Methods. SIAM J. Optim. 2013, 23, 2037–2060. [Google Scholar] [CrossRef]
  29. Uma, M.; Abirami, S.; Ambika, M.; Kavitha, M.; Sureshkumar, S.; Kaviyaraj, R. A Review on Augmented Reality and YOLO. In Proceedings of the 2023 4th International Conference on Smart Electronics and Communication (ICOSEC), Trichy, India, 20–22 September 2023; pp. 1025–1030. [Google Scholar] [CrossRef]
  30. Lim, B.; Son, S.; Kim, H.; Nah, S.; Mu Lee, K. Enhanced Deep Residual Networks for Single Image Super-Resolution. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) Workshops, Honolulu, HI, USA, 21–26 July 2017. [Google Scholar]
  31. Shan, N.; Cui, X.; Gao, Z.; Li, Y. Multi-User Multi-Server Multi-Channel Computation Offloading Strategy for Mobile Edge Computing. In Proceedings of the 2020 IEEE 4th Information Technology, Networking, Electronic and Automation Control Conference (ITNEC), Chongqing, China, 12–14 June 2020; Volume 1, pp. 1389–1400. [Google Scholar] [CrossRef]
  32. Huang, H.; Ye, Q.; Zhou, Y. Deadline-Aware Task Offloading with Partially-Observable Deep Reinforcement Learning for Multi-Access Edge Computing. IEEE Trans. Netw. Sci. Eng. 2022, 9, 3870–3885. [Google Scholar] [CrossRef]
  33. Pan, G.; Zhang, H.; Xu, S.; Zhang, S.; Chen, X. Joint Optimization of DNN Inference Delay and Energy under Accuracy Constraints for AR Applications. In Proceedings of the GLOBECOM 2022—2022 IEEE Global Communications Conference, Rio de Janeiro, Brazil, 4–8 December 2022; pp. 2230–2235. [Google Scholar] [CrossRef]
  34. Yang, L.; Zhang, H.; Li, M.; Guo, J.; Ji, H. Mobile Edge Computing Empowered Energy Efficient Task Offloading in 5G. IEEE Trans. Veh. Technol. 2018, 67, 6398–6409. [Google Scholar] [CrossRef]
  35. Nishiyama, A.; Ikehata, S.; Aizawa, K. 360° Single Image Super Resolution via Distortion-Aware Network and Distorted Perspective Images. In Proceedings of the 2021 IEEE International Conference on Image Processing (ICIP), Anchorage, AK, USA, 19–22 September 2021; pp. 1829–1833. [Google Scholar] [CrossRef]
  36. Wang, X.; Ma, J.; Jiang, J. Contrastive Learning for Blind Super-Resolution via A Distortion-Specific Network. IEEE/CAA J. Autom. Sin. 2023, 10, 78–89. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.