Search

Ensuring high reliability and low latency poses challenges for numerous applications that require rigid performance guarantees, such as industrial automation and autonomous vehicles. Our research primarily concentrates on addressing the real-time requirements of ultra-reliable low-latency communication (URLLC). Specifically, we tackle the challenge of hard delay constraints in real-time transmission systems, overcoming this obstacle through a finite blocklength coding scheme. In the physical layer, we encode randomly arriving packets using a variable-length coding scheme and transmit the encoded symbols by truncated channel inversion over parallel channels. In the network layer, we model the encoding and transmission processes as tandem queues. These queues backlog the data bits waiting to be encoded and the encoded symbols to be transmitted, respectively. This way, we represent the system as a two-dimensional Markov chain. By focusing on instances when the symbol queue is empty, we simplify the Markov chain into a one-dimensional Markov chain, with the packet queue being the system state. This approach allows us to analytically express power consumption and formulate a power minimization problem under hard delay constraints. Finally, we propose a heuristic algorithm to solve the problem and provide an extensive evaluation of the trade-offs between the hard delay constraint and power consumption. [ABSTRACT FROM AUTHOR]

Device-edge co-inference opens up new possibilities for resource-constrained wireless devices (WDs) to execute deep neural network (DNN)-based applications with heavy computation workloads. In particular, the WD executes the first few layers of the DNN and sends the intermediate features to the edge server that processes the remaining layers of the DNN. By adapting the model splitting decision, there exists a tradeoff between local computation cost and communication overhead. In practice, the DNN model is re-trained and updated periodically at the edge server. Once the DNN parameters are regenerated, part of the updated model must be placed at the WD to facilitate on-device inference. In this paper, we study the joint optimization of the model placement and online model splitting decisions to minimize the energy-and-time cost of device-edge co-inference in presence of wireless channel fading. The problem is challenging because the model placement and model splitting decisions are strongly coupled, while involving two different time scales. We first tackle online model splitting by formulating an optimal stopping problem, where the finite horizon of the problem is determined by the model placement decision. In addition to deriving the optimal model splitting rule based on backward induction, we further investigate a simple one-stage look-ahead rule, for which we are able to obtain analytical expressions of the model splitting decision. The analysis is useful for us to efficiently optimize the model placement decision in a larger time scale. In particular, we obtain a closed-form model placement solution for the fully-connected multilayer perceptron with equal neurons. Simulation results validate the superior performance of the joint optimal model placement and splitting with various DNN structures. [ABSTRACT FROM AUTHOR]

Federated learning (FL) has recently emerged as a promising technology to enable artificial intelligence (AI) at the network edge, where distributed mobile devices collaboratively train a shared AI model under the coordination of an edge server. To significantly improve the communication efficiency of FL, over-the-air computation allows a large number of mobile devices to concurrently upload their local models by exploiting the superposition property of wireless multi-access channels. Due to wireless channel fading, the model aggregation error at the edge server is dominated by the weakest channel among all devices, causing severe straggler issues. In this paper, we propose a relay-assisted cooperative FL scheme to effectively address the straggler issue. In particular, we deploy multiple half-duplex relays to cooperatively assist the devices in uploading the local model updates to the edge server. The nature of the over-the-air computation poses system objectives and constraints that are distinct from those in traditional relay communication systems. Moreover, the strong coupling between the design variables renders the optimization of such a system challenging. To tackle the issue, we propose an alternating-optimization-based algorithm to optimize the transceiver and relay operation with low complexity. Then, we analyze the model aggregation error in a single-relay case and show that our relay-assisted scheme achieves a smaller error than the one without relays provided that the relay transmit power and the relay channel gains are sufficiently large. The analysis provides critical insights on relay deployment in the implementation of cooperative FL. Extensive numerical results show that our design achieves faster convergence compared with state-of-the-art schemes. [ABSTRACT FROM AUTHOR]

The recent development of unmanned aerial vehicle (UAV) and mobile edge computing (MEC) technologies provides flexible and resilient computation services to mobile users out of the terrestrial computing service coverage. In this paper, we consider a UAV-enabled MEC platform that serves multiple mobile ground users with random movements and task arrivals. We aim to minimize the average weighted energy consumption of all users subject to the average UAV energy consumption and data queue stability constraints. We formulate the problem as a multi-stage stochastic optimization, and adopt Lyapunov optimization to convert it into per-slot deterministic problems with fewer optimizing variables. We design two reduced-complexity methods that solve the resource allocation and the UAV movement either in two sequential steps or jointly in one step. Both methods can guarantee to satisfy the average UAV energy and queue stability constraints, meanwhile achieving a tradeoff between the user energy consumption and the length of queue backlog. Simulation results show that the two methods significantly outperform the other benchmark methods including a learning-based method in reducing the energy consumption of ground users. In between, the proposed joint optimization method achieves better performance than the two-stage method at the cost of higher computational complexity. [ABSTRACT FROM AUTHOR]

The emerging mobile edge computing (MEC) technology has been recently applied to improve adaptive bitrate (ABR) streaming service quality under time-varying wireless channels. In this paper, we consider a heterogeneous multi-user MEC-enabled video streaming network with time-varying wireless channels in sequential time frames. In particular, we aim to design an online joint transcoding and transmission resource allocation algorithm to maximize the ABR streaming user’s quality of experience (QoE) subject to the bandwidth and CPU constraints. The algorithm is “online” in the sense that the bitrate and resource allocation decisions made at each frame depend only on the observation of past events. We formulate the problem as a mixed integer non-linear programming (MINLP) that jointly determines bitrate adaptation, bandwidth allocation, and CPU cycle assignment. To cope with the challenge arising from the coupling decisions of adjacent frames, we propose a low-complexity online algorithm, named OCCA. Specifically, by introducing queueing model constraints, we transform the offline non-conex MINLP problem into a multi-frame problem. Then, we analytically decouple the multi-stage(frame) problem to multiple per-frame convex subproblems that can be solved with high robustness and low computational complexity. We perform simulations with realistic scenarios to evaluate the performance of the proposed algorithm. Results manifest that compared with state-of-the-art approaches, our proposed algorithm can provide 97.84% (on average) extra QoE. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) is a promising paradigm to accommodate the increasingly prosperous delay-sensitive and computation-intensive applications in 5G systems. To achieve optimum computation performance in a dynamic MEC environment, mobile devices often need to make online decisions on whether to offload the computation tasks to nearby edge terminals under the uncertainty of future system information (e.g., random wireless channel gain and task arrivals). The design of an efficient online offloading algorithm is challenging. On one hand, the fast-varying edge environment requires frequently solving a hard combinatorial optimization problem where the integer offloading decision and continuous resource allocation variables are strongly coupled. On the other hand, the uncertainty of future system parameters makes it hard for the online decisions to satisfy long-term system constraints. To address these challenges, this article overviews the existing methods and introduces a novel framework that efficiently integrates model-based optimization and model-free learning techniques. We suggest some promising future research directions for online computation offloading control in MEC networks. [ABSTRACT FROM AUTHOR]

The emerging mobile edge computing (MEC) technology has been recently applied to improve the Quality of Experience (QoE) of network services, such as live video streaming. In this paper, we study an energy-aware adaptive live streaming scheme in wireless edge networks. In particular, we aim to design a joint uplink transmission and edge transcoding algorithm maximizing the video followers’ QoE, while minimizing the energy consumption of the video streamer. We formulate the problem as a Markov decision process (MDP), and propose a deep reinforcement learning (DRL) based framework, named SACCT, to determine the streamer’s encoding bitrate, the uploading power as well as the edge transcoding bitrates and frequency. We decompose the MDP problem into inter-frame and intra-frame problems to address the key design challenges that arise from continuous-discrete hybrid action space, time-varying state and action spaces, and unknown network variation. By doing so, SACCT integrates model-based optimization and model-free DRL to determine the intra-frame continuous resource allocation decisions and the inter-frame discrete bitrate adaptation decisions, respectively. To integrate both the numerical features (e.g., channel gain) and the categorical features (e.g., bitrate), we propose a communication Transformer (CT) as a backbone of SACCT by representing network states as communication tokens and running Transformers to model multi-scale dependencies. Extensive simulations manifest that compared with state-of-the-art approaches, SACCT can provide 128.23% (on average) extra reward. As such, by leveraging joint uplink adaption and edge transcoding, the proposed scheme enables an intelligent wireless network edge with QoE-assured and energy-aware live streaming services. [ABSTRACT FROM AUTHOR]

In this paper, we investigate over-the-air model aggregation in a federated edge learning (FEEL) system. We introduce a Markovian probability model to characterize the intrinsic temporal structure of the model aggregation series. With this temporal probability model, we formulate the model aggregation problem as to infer the desired aggregated update given all the past observations from a Bayesian perspective. We develop a message passing based algorithm, termed temporal-structure-assisted gradient aggregation (TSA-GA), to fulfil this estimation task with low complexity and near-optimal performance. We further establish the state evolution (SE) analysis to characterize the behaviour of the proposed TSA-GA algorithm, and derive an explicit bound of the expected loss reduction of the FEEL system under certain standard regularity conditions. In addition, we develop an expectation maximization (EM) strategy to learn the unknown parameters in the Markovian model. We show that the proposed TSA-GA significantly outperforms the state-of-the-art analog compression scheme, and is able to achieve comparable learning performance as the error-free benchmark in terms of final test accuracy. [ABSTRACT FROM AUTHOR]

To exploit massive amounts of data generated at mobile edge networks, federated learning (FL) has been proposed as an attractive substitute for centralized machine learning (ML). By collaboratively training a shared learning model at edge devices, FL avoids direct data transmission and thus overcomes high communication latency and privacy issues as compared to centralized ML. To improve the communication efficiency in FL model aggregation, over-the-air computation has been introduced to support a large number of simultaneous local model uploading by exploiting the inherent superposition property of wireless channels. However, due to the heterogeneity of communication capacities among edge devices, over-the-air FL suffers from the straggler issue in which the device with the weakest channel acts as a bottleneck of the model aggregation performance. This issue can be alleviated by device selection to some extent, but the latter still suffers from a tradeoff between data exploitation and model communication. In this paper, we leverage the reconfigurable intelligent surface (RIS) technology to relieve the straggler issue in over-the-air FL. Specifically, we develop a learning analysis framework to quantitatively characterize the impact of device selection and model aggregation error on the convergence of over-the-air FL. Then, we formulate a unified communication-learning optimization problem to jointly optimize device selection, over-the-air transceiver design, and RIS configuration. Numerical experiments show that the proposed design achieves substantial learning accuracy improvement compared with the state-of-the-art approaches, especially when channel conditions vary dramatically across edge devices. [ABSTRACT FROM AUTHOR]

Opportunistic computation offloading is an effective method to improve the computation performance of mobile-edge computing (MEC) networks under dynamic edge environment. In this paper, we consider a multi-user MEC network with time-varying wireless channels and stochastic user task data arrivals in sequential time frames. In particular, we aim to design an online computation offloading algorithm to maximize the network data processing capability subject to the long-term data queue stability and average power constraints. The online algorithm is practical in the sense that the decisions for each time frame are made without the assumption of knowing the future realizations of random channel conditions and data arrivals. We formulate the problem as a multi-stage stochastic mixed integer non-linear programming (MINLP) problem that jointly determines the binary offloading (each user computes the task either locally or at the edge server) and system resource allocation decisions in sequential time frames. To address the coupling in the decisions of different time frames, we propose a novel framework, named LyDROO, that combines the advantages of Lyapunov optimization and deep reinforcement learning (DRL). Specifically, LyDROO first applies Lyapunov optimization to decouple the multi-stage stochastic MINLP into deterministic per-frame MINLP subproblems. By doing so, it guarantees to satisfy all the long-term constraints by solving the per-frame subproblems that are much smaller in size. Then, LyDROO integrates model-based optimization and model-free DRL to solve the per-frame MINLP problems with very low computational complexity. Simulation results show that under various network setups, the proposed LyDROO achieves optimal computation performance while stabilizing all queues in the system. Besides, it induces very low computation time that is particularly suitable for real-time implementation in fast fading environments. [ABSTRACT FROM AUTHOR]

Leveraging recent advances on mobile edge computing (MEC), edge intelligence has emerged as a promising paradigm to support mobile artificial intelligence (AI) applications at the network edge. In this paper, we consider the AI service placement problem in a multi-user MEC system, where the access point (AP) places the most up-to-date AI program at user devices to enable local computing/task execution at the user side. To fully utilize the stringent wireless spectrum and edge computing resources, the AP sends the AI service program to a user only when enabling local computing at the user yields a better system performance. We formulate a mixed-integer non-linear programming (MINLP) problem to minimize the total computation time and energy consumption of all users by jointly optimizing the service placement (i.e., which users to receive the program) and resource allocation (on local CPU frequencies, uplink bandwidth, and edge CPU frequency). To tackle the MINLP problem, we derive analytical expressions to calculate the optimal resource allocation decisions with low complexity. This allows us to efficiently obtain the optimal service placement solution by search-based algorithms such as meta-heuristic or greedy search algorithms. To enhance the algorithm scalability in large-sized networks, we further propose an ADMM (alternating direction method of multipliers) based method to decompose the optimization problem into parallel tractable MINLP subproblems. The ADMM method eliminates the need of searching in a high-dimensional space for service placement decisions and thus has a low computational complexity that grows linearly with the number of users. Simulation results show that the proposed algorithms perform extremely close to the optimum and significantly outperform the other representative benchmark algorithms. [ABSTRACT FROM AUTHOR]

Distribution grid agents are obliged to exchange and disclose their states explicitly to neighboring regions to enable distributed optimal power flow dispatch. However, the states contain sensitive information of individual agents, such as voltage and current measurements. These measurements can be inferred by adversaries, such as other participating agents or eavesdroppers, leading to the privacy leakage problem. To address the issue, we propose a privacy-preserving distributed optimal power flow (OPF) algorithm based on partially homomorphic encryption (PHE). First of all, we exploit the alternating direction method of multipliers (ADMM) to solve the OPF in a distributed fashion. In this way, the dual update of ADMM can be encrypted by PHE. We further relax the augmented term of the primal update of ADMM with the $\ell _{1}$ -norm regularization. In addition, we transform the relaxed ADMM with the $\ell _{1}$ -norm regularization to a semidefinite program (SDP), and prove that this transformation is exact. The SDP can be solved locally with only the sign messages from neighboring agents, which preserves the privacy of the primal update. At last, we strictly prove the privacy preservation guarantee of the proposed algorithm. Numerical case studies validate the effectiveness and exactness of the proposed approach. In particular, the case studies show that the encrypted messages cannot be inferred by adversaries. Besides, the proposed algorithm obtains the solutions that are very close to the global optimum, and converges much faster compared to competing alternatives. [ABSTRACT FROM AUTHOR]

This paper presents a novel model of voltage source converter (VSC) based energy routers (ERs) in microgrids. The proposed model explicitly describes the circuit laws within the ERs and captures the coupling of control variables among the AC/DC, DC/DC, DC/AC links. Therefore, the proposed model possesses unparalleled control capabilities in the operational parameters of both the AC and DC sides of ERs. By incorporating such a model into the AC-DC optimal power flow formulation, we not only optimize the power flows between the AC and DC sides of ERs, but also strategically schedule the flexible resources. To solve the ERs based AC-DC optimal power flow (ER-OPF) in a distributed fashion, we propose a hierarchical distributed optimization method that decouples the power grids into a master region and several sub-regions. In the master region, we propose a sequence of strong relaxations to transform the problem into a semidefinite program (SDP). We further show that this SDP relaxation is exact. For the sub-regions, we utilize sequential quadratic programming (SQP) to solve multiple small-scale subproblems with non-convex constraints in parallel. Case studies on the IEEE benchmark system show that fuel costs and power losses are reduced dramatically by utilizing ERs in microgrids. In addition, the proposed distributed algorithm can converge faster than alternating direction method of multipliers (ADMM). [ABSTRACT FROM AUTHOR]

Provided with mobile edge computing (MEC) services, wireless devices (WDs) no longer have to experience long latency in running their desired programs locally, but can pay to offload computation tasks to the edge server. Given its limited storage space, it is important for the edge server at the base station (BS) to determine which service programs to cache by meeting and guiding WDs’ offloading decisions. In this article, we propose an MEC service pricing scheme to coordinate with the service caching decisions and control WDs’ task offloading behavior in a cellular network. We propose a two-stage dynamic game of incomplete information to model and analyze the two-stage interaction between the BS and multiple associated WDs. Specifically, in Stage I, the BS determines the MEC service caching and announces the service program prices to the WDs, with the objective to maximize its expected profit under both storage and computation resource constraints. In Stage II, given the prices of different service programs, each WD selfishly decides its offloading decision to minimize individual service delay and cost, without knowing the other WDs’ desired program types or local execution delays. Despite the lack of WD’s information and the coupling of all the WDs’ offloading decisions, we derive the optimal threshold-based offloading policy that can be easily adopted by the WDs in Stage II at the Bayesian equilibrium. In particular, a WD is more likely to offload when there are fewer WDs competing for the edge server’s computation resource, or when it perceives a good channel condition or low MEC service price. Then, by predicting the WDs’ offloading equilibrium, we jointly optimize the BS’ pricing and service caching in Stage I via a low-complexity algorithm. In particular, we first study the differentiated pricing scheme and prove that the same price should be charged to the cached programs of the same workload. Motivated by this analysis, we further propose a low-complexity uniform pricing heuristics. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surfaces (RISs) are regarded as a promising emerging hardware technology to improve the spectrum and energy efficiency of wireless networks by artificially reconfiguring the propagation environment of electromagnetic waves. Due to the unique advantages in enhancing wireless channel capacity, RISs have recently become a hot research topic. In this article, we focus on three fundamental physical-layer challenges for the incorporation of RISs into wireless networks, namely, channel state information acquisition, passive information transfer, and low-complexity robust system design. We summarize the state-of-the-art solutions and explore potential research directions. Furthermore, we discuss other promising research directions of RISs, including edge intelligence and physical-layer security. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surface (RIS) is envisioned to be an essential component of the paradigm for beyond 5G networks as it can potentially provide similar or higher array gains with much lower hardware cost and energy consumption compared with the massive multiple-input multiple-output (MIMO) technology. In this paper, we focus on one of the fundamental challenges, namely the channel acquisition, in a RIS-assisted multiuser MIMO system. The state-of-the-art channel acquisition approach in such a system with fully passive RIS elements estimates the cascaded transmitter-to-RIS and RIS-to-receiver channels by adopting excessively long training sequences. To estimate the cascaded channels with an affordable training overhead, we formulate the channel estimation problem in the RIS-assisted multiuser MIMO system as a matrix-calibration based matrix factorization task. By exploiting the information on the slow-varying channel components and the hidden channel sparsity, we propose a novel message-passing based algorithm to factorize the cascaded channels. Furthermore, we present an analytical framework to characterize the theoretical performance bound of the proposed estimator in the large-system limit. Finally, we conduct simulations to verify the high accuracy and efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Wireless powered mobile-edge computing (MEC) has recently emerged as a promising paradigm to enhance the data processing capability of low-power networks, such as wireless sensor networks and internet of things (IoT). In this paper, we consider a wireless powered MEC network that adopts a binary offloading policy, so that each computation task of wireless devices (WDs) is either executed locally or fully offloaded to an MEC server. Our goal is to acquire an online algorithm that optimally adapts task offloading decisions and wireless resource allocations to the time-varying wireless channel conditions. This requires quickly solving hard combinatorial optimization problems within the channel coherence time, which is hardly achievable with conventional numerical optimization methods. To tackle this problem, we propose a Deep Reinforcement learning-based Online Offloading (DROO) framework that implements a deep neural network as a scalable solution that learns the binary offloading decisions from the experience. It eliminates the need of solving combinatorial optimization problems, and thus greatly reduces the computational complexity especially in large-size networks. To further reduce the complexity, we propose an adaptive procedure that automatically adjusts the parameters of the DROO algorithm on the fly. Numerical results show that the proposed algorithm can achieve near-optimal performance while significantly decreasing the computation time by more than an order of magnitude compared with existing optimization methods. For example, the CPU execution latency of DROO is less than 0.1 second in a 30-user network, making real-time and optimal offloading truly viable even in a fast fading environment. [ABSTRACT FROM AUTHOR]

Heterogeneous Network (HetNet), where Small cell Base Stations (SBSs) are densely deployed to offload traffic from macro Base Stations (BSs), is identified as a key solution to meet the unprecedented mobile traffic demand. The high density of SBSs are designed for peak traffic hours and consume an unnecessarily large amount of energy during off-peak time. In this paper, we propose a Deep Reinforcement-Learning (DRL) based SBS activation strategy that activates the optimal subset of SBSs to significantly lower the energy consumption without compromising the quality of service. In particular, we formulate the SBS on/off switching problem into a Markov Decision Process that can be solved by Actor Critic (AC) reinforcement learning methods. To avoid prohibitively high computational and storage costs of conventional tabular-based approaches, we propose to use deep neural networks to approximate the policy and value functions in the AC approach. Moreover, to expedite the training process, we adopt a Deep Deterministic Policy Gradient (DDPG) approach together with a novel action refinement scheme. Through extensive numerical simulations, we show that the proposed scheme greatly outperforms the existing methods in terms of both energy efficiency and computational efficiency. We also show that the proposed scheme can scale to large system with polynomial complexities in both storage and computation. [ABSTRACT FROM AUTHOR]

In this paper, we consider a mobile-edge computing (MEC) system, where an access point (AP) assists a mobile device (MD) to execute an application consisting of multiple tasks following a general task call graph. The objective is to jointly determine the offloading decision of each task and the resource allocation (e.g., CPU computing power) under time-varying wireless fading channels and stochastic edge computing capability, so that the energy-time cost (ETC) of the MD is minimized. Solving the problem is particularly hard due to the combinatorial offloading decisions and the strong coupling among task executions under the general dependency model. Conventional numerical optimization methods are inefficient to solve such a problem, especially when the problem size is large. To address the issue, we propose a deep reinforcement learning (DRL) framework based on the actor-critic learning structure. In particular, the actor network utilizes a DNN to learn the optimal mapping from the input states (i.e., wireless channel gains and edge CPU frequency) to the binary offloading decision of each task. Meanwhile, by analyzing the structure of the optimal solution, we derive a low-complexity algorithm for the critic network to quickly evaluate the ETC performance of the offloading decisions output by the actor network. With the low-complexity critic network, we can quickly select the best offloading action and subsequently store the state-action pair in an experience replay memory as the training dataset to continuously improve the action generation DNN. To further reduce the complexity, we show that the optimal offloading decision exhibits an one-climb structure, which can be utilized to significantly reduce the search space of action generation. Numerical results show that for various types of task graphs, the proposed algorithm achieves up to 99.1% of the optimal performance while significantly reducing the computational complexity compared to the existing optimization methods. [ABSTRACT FROM AUTHOR]

In mobile edge computing (MEC) systems, edge service caching refers to pre-storing the necessary programs for executing computation tasks at MEC servers. Service caching effectively reduces the real-time delay/bandwidth cost on acquiring and initializing service applications when computation tasks are offloaded to the MEC servers. The limited caching space at resource-constrained edge servers calls for careful design of caching placement to determine which programs to cache over time. This is in general a complicated problem that highly correlates to the computation offloading decisions of computation tasks, i.e., whether or not to offload a task for edge execution. In this paper, we consider a single edge server that assists a mobile user (MU) in executing a sequence of computation tasks. In particular, the MU can upload and run its customized programs at the edge server, while the server can selectively cache the previously generated programs for future reuse. To minimize the computation delay and energy consumption of the MU, we formulate a mixed integer non-linear programming (MINLP) that jointly optimizes the service caching placement, computation offloading decisions, and system resource allocation (e.g., CPU processing frequency and transmit power of MU). To tackle the problem, we first derive the closed-form expressions of the optimal resource allocation solutions, and subsequently transform the MINLP into an equivalent pure 0-1 integer linear programming (ILP) that is much simpler to solve. To further reduce the complexity in solving the ILP, we exploit the underlying structures of caching causality and task dependency models, and accordingly devise a reduced-complexity alternating minimization technique to update the caching placement and offloading decision alternately. Extensive simulations show that the proposed joint optimization techniques achieve substantial resource savings of the MU compared to other representative benchmark methods considered. [ABSTRACT FROM AUTHOR]

The Smart Grid represents an unprecedented opportunity to move the electric grid into a new era of reliability, availability, and efficiency. It uses two-way communications, digital technologies, advanced sensing and computing infrastructure, and software abilities to provide improved monitoring, protection and optimization of all the grids’ components including generation, transmission, distribution and consumers. [ABSTRACT FROM AUTHOR]

The recent upsurge of diversified mobile applications, especially those supported by AI, is spurring heated discussions on the future evolution of wireless communications. While 5G is being deployed around the world, efforts from industry and academia have started to look beyond 5G and conceptualize 6G. We envision 6G to undergo an unprecedented transformation that will make it substantially different from the previous generations of wireless cellular systems. In particular, 6G will go beyond mobile Internet and will be required to support ubiquitous AI services from the core to the end devices of the network. Meanwhile, AI will play a critical role in designing and optimizing 6G architectures, protocols, and operations. In this article, we discuss potential technologies for 6G to enable mobile AI applications, as well as AI-enabled methodologies for 6G network design and optimization. Key trends in the evolution to 6G will also be discussed. [ABSTRACT FROM AUTHOR]

In this paper, we consider a battery aggregator that coordinates a number of distributed battery energy storage systems (BESSs) to provide primary frequency control service in the ancillary service market. In particular, we propose a profit-maximizing BESS coordination strategy that is concerned with two operational phases, namely a frequency regulation phase and a state-of-charge (SoC) recovery phase. Regarding the frequency regulation phase, we minimize the regulation failure penalty by optimally coordinating the operation of multiple BESSs in response to local frequency deviations. The proposed coordination algorithm is “online optimal” in the sense that it does not require any knowledge of the future information, and yet achieves exactly the same optimal performance as if the entire future information is known. On the other hand, during idle periods, the BESSs shall recover their SoCs to a proper range to avoid regulation failure in the next frequency excursion event. We propose a SoC recovery strategy that is not only optimal, but also state invariant and separable in the sense that the target SoC range of each BESS neither varies with its own SoC nor depends on the operation of other BESSs. As such, the target SoC ranges can be calculated once and for all, resulting in extremely low run-time complexity. Numerical results based on real power system frequency measurement data show that the proposed algorithm significantly outperforms a number of benchmark algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel transactive energy trading (TET) framework to deal with the economic issues in energy trading and the technical issues in distribution system operation in a holistic manner. In particular, we innovatively integrate a bilateral energy trading mechanism with the optimal power flow (OPF) technique to increase economic benefits to individual participants, and meanwhile ensure the reliability and security of the system operation. In order to resolve the inherent conflict of interests, Nash bargaining theory is used to model the TET problem, which is further decomposed into a multiperiod OPF problem and a payment bargaining problem. Moreover, we develop an efficient distributed algorithm for solving the TET problem base on alternating direction method of multipliers (ADMM). Instead of directly solving optimization subproblems like most ADMM-based distributed algorithms, we derive closed-form solutions to all subproblems to significantly improve the computational efficiency. Finally, numerical tests on the IEEE 37-bus and 123-bus distribution systems demonstrate the effectiveness of our proposed framework and the efficiency of our distributed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we consider the profit-maximizing demand response of an energy load in the real-time electricity market. In a real-time electricity market, the market clearing price is determined by the random deviation of actual power supply and demand from the predicted values in the day-ahead market. An energy load, which requires a total amount of energy over a certain period of time, has the flexibility of shifting its energy usage in time, and therefore is in perfect position to exploit the volatile real-time market price through demand response. We show that the profit-maximizing demand response strategy can be obtained by solving a finite-horizon Markov decision process (MDP) problem, which requires extremely high computational complexity due to continuous state and action spaces. To tackle the high computational complexity, we propose a dual approximate approach that transforms the MDP problem into a linear programing problem by exploiting the threshold structure of the optimal solution. Then, a row-generation-based solution algorithm is proposed to solve the problem efficiently. We demonstrate through extensive simulations that the proposed method significantly reduces the computational complexity of the optimal MDP problem (linear versus exponential complexity), while incurring marginal performance loss. More interestingly, the proposed demand response strategy hits a triple win. It not only maximizes the profit of the energy load, but also alleviates the supply-demand imbalance in the power grid, and even reduces the bills of other market participants. On average, the proposed quadratic approximation and improved row generation algorithm increases the energy load's profit by 55.9% and saves the bills of other utilities by 80.2% comparing with the benchmark algorithms. [ABSTRACT FROM AUTHOR]

The rapid emergence of electric vehicles (EVs) demands an advanced infrastructure of publicly accessible charging stations that provide efficient charging services. In this paper, we propose a new charging station operation mechanism, the Joint Admission and Pricing (JoAP), which jointly optimizes the EV admission control, pricing, and charging scheduling to maximize the charging station's profit. More specifically, by introducing a tandem queueing network model, we analytically characterize the average charging station profit as a function of the admission control and pricing policies. Based on the analysis, we characterize the optimal JoAP algorithm. Through extensive simulations, we demonstrate that the proposed JoAP algorithm on average can achieve 330% and 531% higher profit than a widely adopted benchmark method under two representative waiting-time penalty rates. [ABSTRACT FROM AUTHOR]

Wireless network virtualization enables mobile virtual network operators (MVNOs) to develop new services on a low-cost platform by leasing virtual resources from mobile network owners. In this paper, we investigate a two-stage spectrum leasing framework, where an MVNO acquires spectrum resources through both advance reservation and on-demand request. To maximize its surplus, the MVNO needs to jointly optimize the amount of spectrum resources to lease in the two stages by taking into account traffic intensity, random user locations, wireless channel statistics, quality-of-service requirements, and the price differences. Meanwhile, to maximize the utilization of the acquired resources, the MVNO dynamically allocates the spectrum resources to its mobile subscribers (users) according to fast wireless channel fading. We formulate the MVNO’s surplus maximization problem as a tri-level nested optimization problem consisting of dynamic resource allocation (DRA), on-demand request, and advance reservation subproblems. To solve the problem efficiently, we first analyze the DRA problem, and then use the optimal solution to find the optimal leasing decisions in the two stages. In particular, we derive a closed-form expression of the optimal on-demand request, and develop a stochastic gradient descent algorithm to find the optimal advance reservation. For a special case when the proportional fairness utility function is adopted, we show that the optimal two-stage leasing scheme is related to the number of users and is irrelevant to user locations. Simulation results show that the two-stage spectrum leasing scheme can adapt to different levels of traffic and on-demand price variations, and achieve higher surplus than conventional one-stage leasing schemes. [ABSTRACT FROM AUTHOR]

In ultra-dense networks (UDNs), distributed radio access points (RAPs) are configured into small virtual cells around mobile users for fair and high-throughput services. In this correspondence, we evaluate the performance of user-centric joint transmission (JT) in a UDN with a number of virtual cells. In contrast to existing cooperation schemes, which assume constant RAP transmit power, we consider a total transmit power constraint for each user, and assume that the total power is optimally allocated to the RAPs in each virtual cell using maximum ratio transmission (MRT). Based on stochastic geometry models of the RAP and user locations, we resolve the correlation of transmit powers introduced by MRT, and derive the average user throughput. Numerical results show that user-centric JT with MRT provides high signal-to-noise ratio without generating severe interference to other co-channel users. Moreover, we show that MRT precoding, while requiring channel-state-information (CSI), is essential for the success of JT. [ABSTRACT FROM PUBLISHER]

In this paper, we study the optimal location planning of renewable distributed generation (RDG) units by taking into account the random uncertainties of renewable generation and load demand. In presence of the random uncertainties, location planning problem is naturally a two-stage stochastic mixed integer nonlinear programming problem, which is hard to solve efficiently. Instead of using traditional sampling methods or robust optimization methods, we propose a novel analytical approach in this paper to solve the problem efficiently and optimally. In particular, analytical expressions are derived for efficiently evaluating the performance of a candidate RDG placement decision. In this way, the stochastic mixed integer nonlinear programming problem is equivalently transformed into a deterministic integer problem, which can be solved efficiently using off-the-shelf tools. Numerical results show that the optimal RDG placement can save up to $4.2\%$ of the long-term average cost and $80.59\%$ of the line losses on the IEEE 13-bus test feeder. In addition, our proposed approach effectively reduces the computational time by $99.51\%$ on the IEEE 123 node test feeder compared with other traditional sampling-based metaheuristic approaches. [ABSTRACT FROM PUBLISHER]

We consider a two-level profit-maximizing strategy, including planning and control, for battery energy storage system (BESS) owners that participate in the primary frequency control market. Specifically, the optimal BESS control minimizes the operating cost by keeping the state of charge (SoC) in an optimal range. Through rigorous analysis, we prove that the optimal BESS control is a “state-invariant” strategy in the sense that the optimal SoC range does not vary with the state of the system. As such, the optimal control strategy can be computed offline once and for all with very low complexity. Regarding the BESS planning, we prove that the minimum operating cost is a decreasing convex function of the BESS energy capacity. This leads to the optimal BESS sizing that strikes a balance between the capital investment and operating cost. This paper here provides a useful theoretical framework for understanding the planning and control strategies that maximize the economic benefits of BESSs in ancillary service markets. [ABSTRACT FROM PUBLISHER]

In practical massive MIMO systems, a substantial portion of system resources are consumed to acquire channel state information (CSI), leading to a drastically lower system capacity compared with the ideal case, where perfect CSI is available. In this paper, we show that the overhead for CSI acquisition can be largely compensated by the potential gain due to the sparsity of the massive MIMO channel in a certain transformed domain. To this end, we propose a novel blind detection scheme that simultaneously estimates the channel and data by factorizing the received signal matrix. We show that by exploiting the channel sparsity, our proposed scheme can achieve a degree of freedom (DoF) very close to the ideal case, provided that the channel is sufficiently sparse. Specifically, the achievable DoF has a fractional gap of only $1/T$ from the ideal DoF, where $T$ is the channel coherence time. This is a remarkable advance for understanding the performance limit of the massive MIMO system. We further show that the performance advantage of our proposed scheme in the asymptotic SNR regime carries over to the practical SNR regime. Numerical results demonstrate that our proposed scheme significantly outperforms its counterpart schemes in the practical SNR regime under various system configurations. [ABSTRACT FROM PUBLISHER]

The smart power grid enables intelligent automation at all levels of power system operation, from electricity generation at power plants to power usage in the home. The key enabling factor of an efficient smart grid is its built-in ICT, which monitors the real-time system operating state and makes control decisions accordingly. As an important building block of the ICT system, power system state estimation is of critical importance to maintain normal operation of the smart grid, which, however, is under mounting threat from potential cyber attacks. In this article, we introduce a graph-based framework for performing cyber-security analysis in power system state estimation. Compared to conventional arithmetic- based security analysis, the graphical characterization of state estimation security provides intuitive visualization of some complex problem structures and enables efficient graphical solution algorithms, which are useful for both defending and attacking the ICT system of the smart grid. We also highlight several promising future research directions on graph-based security analysis and its applications in smart power grid. [ABSTRACT FROM PUBLISHER]

This paper considers the problem of charging station pricing and plug-in electric vehicles (PEVs) station selection. When a PEV needs to be charged, it selects a charging station by considering the charging prices, waiting times, and travel distances. Each charging station optimizes its charging price based on the prediction of the PEVs’ charging station selection decisions, and the other station’s pricing decision, in order to maximize its profit. To obtain insights of such a highly coupled system, we consider a 1-D system with two competing charging stations and Poisson arriving PEVs. We propose a multileader-multifollower Stackelberg game model, in which the charging stations (leaders) announce their charging prices in stage I and the PEVs (followers) make their charging station selections in stage II. We show that there always exists a unique charging station selection equilibrium in stage II, and such equilibrium depends on the charging stations’ service capacities and the price difference between them. We then characterize the sufficient conditions for the existence and uniqueness of the pricing equilibrium in stage I. We also develop a low complexity algorithm that efficiently computes the pricing equilibrium and the subgame perfect equilibrium of the two-stage Stackelberg game. [ABSTRACT FROM PUBLISHER]

The multi-hop multi-flow transmission has been proposed as a promising solution to cope with the spectrum scarcity in densely populated user environments. Due to the mutual interference between different flows and different hops of the same flow, the resource allocation for multi-hop multi-flow wireless networks is in general non-convex, and thus cannot be solved by conventional convex optimization techniques. In this paper, we propose an algorithm to effectively solve the resource allocation problem by jointly optimizing the rate control and scheduling. Specifically, we show that the problem can be decomposed into a set of problems that maximizes the weight-sum-flow rate at each slot. Furthermore, to solve the non-convex weighted sum flow rate maximization problem, we exploit its hidden monotonicity and develop a global optimal rate control and scheduling (G-RCS) algorithm based on the theory of monotonic optimization. Our analysis shows that the proposed G-RCS algorithm is guaranteed to converge to an optimal solution in a finite number of iterations. To reduce the complexity, we propose an accelerated algorithm, referred to as the A-G-RCS, based on the inherent symmetry of the optimal solution. Numerical results validate that the proposed algorithms can serve as a performance benchmark for the existing heuristic algorithms. [ABSTRACT FROM PUBLISHER]

The large-scale integration of plug-in electric vehicles (PEVs) to the power grid spurs the need for efficient charging coordination mechanisms. It can be shown that the optimal charging schedule smooths out the energy consumption over time so as to minimize the total energy cost. In practice, however, it is hard to smooth out the energy consumption perfectly, because the future PEV charging demand is unknown at the moment when the charging rate of an existing PEV needs to be determined. In this paper, we propose an online coordinated charging decision (ORCHARD) algorithm, which minimizes the energy cost without knowing the future information. Through rigorous proof, we show that ORCHARD is strictly feasible in the sense that it guarantees to fulfill all charging demands before due time. Meanwhile, it achieves the best known competitive ratio of 2.39. By exploiting the problem structure, we propose a novel reduced-complexity algorithm to replace the standard convex optimization techniques used in ORCHARD. Through extensive simulations, we show that the average performance gap between ORCHARD and the offline optimal solution, which utilizes the complete future information, is as small as 6.5%. By setting a proper speeding factor, the average performance gap can be further reduced to 5%. [ABSTRACT FROM PUBLISHER]