Searcharxiv⌕ Search

arXiv subjects

Hong Xing

Publications and source records attributed to Hong Xing.

35 records · Page 2Linked to original sources

Joint Resource Allocation and Cache Placement for Location-Aware Multi-User Mobile Edge Computing

With the growing demand for latency-critical and computation-intensive Internet of Things (IoT) services, the IoT-oriented network architecture, mobile edge computing (MEC), has emerged as a promising technique to reinforce the computation capability of the resource-constrained IoT devices. To exploit the cloud-like functions at the network edge, service caching has been implemented to reuse the computation task input/output data, thus effectively reducing the delay incurred by data retransmissions and repeated execution of the same task. In a multi-user cache-assisted MEC system, users' preferences for different types of services, possibly dependent on their locations, play an important role in joint design of communication, computation and service caching. In this paper, we consider multiple representative locations, where users at the same location share the same preference profile for a given set of services. Specifically, by exploiting the location-aware users' preference profiles, we propose joint optimization of the binary cache placement, the edge computation resource and the bandwidth allocation to minimize the expected sum-energy consumption, subject to the bandwidth and the computation limitations as well as the service latency constraints. To effectively solve the mixed-integer non-convex problem, we propose a deep learning (DL)-based offline cache placement scheme using a novel stochastic quantization based discrete-action generation method. The proposed hybrid learning framework advocates both benefits from the model-free DL approach and the model-based optimization. The simulations verify that the proposed DL-based scheme saves roughly 33% and 6.69% of energy consumption compared with the greedy caching and the popular caching, respectively, while achieving up to 99.01% of the optimal performance.

cs.IT↗

Federated Learning over Wireless Device-to-Device Networks: Algorithms and Convergence Analysis

The proliferation of Internet-of-Things (IoT) devices and cloud-computing applications over siloed data centers is motivating renewed interest in the collaborative training of a shared model by multiple individual clients via federated learning (FL). To improve the communication efficiency of FL implementations in wireless systems, recent works have proposed compression and dimension reduction mechanisms, along with digital and analog transmission schemes that account for channel noise, fading, and interference. The prior art has mainly focused on star topologies consisting of distributed clients and a central server. In contrast, this paper studies FL over wireless device-to-device (D2D) networks by providing theoretical insights into the performance of digital and analog implementations of decentralized stochastic gradient descent (DSGD). First, we introduce generic digital and analog wireless implementations of communication-efficient DSGD algorithms, leveraging random linear coding (RLC) for compression and over-the-air computation (AirComp) for simultaneous analog transmissions. Next, under the assumptions of convexity and connectivity, we provide convergence bounds for both implementations. The results demonstrate the dependence of the optimality gap on the connectivity and on the signal-to-noise ratio (SNR) levels in the network. The analysis is corroborated by experiments on an image-classification task.

cs.IT↗

Real-Time Resource Allocation for Wireless Powered Multiuser Mobile Edge Computing With Energy and Task Causality

This paper considers a wireless powered multiuser mobile edge computing (MEC) system, in which a multi-antenna hybrid access point (AP) wirelessly charges multiple users, and each user relies on the harvested energy to execute computation tasks. We jointly optimize the energy beamforming and remote task execution at the AP, as well as the local computing and task offloading, aiming to minimize the total system energy consumption over a finite time horizon, subject to causality constraints for both energy harvesting and task arrival at the users. In particular, we consider a practical scenario with casual task state information (TSI) and channel state information (CSI), i.e., only the current and previous TSI and CSI are available, but the future TSI and CSI can only be predicted subject to certain errors. To solve this real-time resource allocation problem, we propose an offline-optimization inspired online design approach. First, we consider the offline optimization case by assuming that the TSI and CSI are perfectly known a-priori. In this case, the energy minimization problem corresponds to a convex problem, for which the semi-closed-form optimal solution is obtained via the Lagrange duality method. Next, inspired by the optimal offline solution, we propose a sliding-window based online resource allocation design in practical cases by integrating with the sequential optimization. Finally, numerical results show that the proposed joint wireless powered MEC designs significantly improve the system's energy efficiency, as compared with the benchmark schemes that consider a sliding window of size one or without such joint optimization.

cs.IT↗

Decentralized Federated Learning via SGD over Wireless D2D Networks

Federated Learning (FL), an emerging paradigm for fast intelligent acquisition at the network edge, enables joint training of a machine learning model over distributed data sets and computing resources with limited disclosure of local data. Communication is a critical enabler of large-scale FL due to significant amount of model information exchanged among edge devices. In this paper, we consider a network of wireless devices sharing a common fading wireless channel for the deployment of FL. Each device holds a generally distinct training set, and communication typically takes place in a Device-to-Device (D2D) manner. In the ideal case in which all devices within communication range can communicate simultaneously and noiselessly, a standard protocol that is guaranteed to converge to an optimal solution of the global empirical risk minimization problem under convexity and connectivity assumptions is Decentralized Stochastic Gradient Descent (DSGD). DSGD integrates local SGD steps with periodic consensus averages that require communication between neighboring devices. In this paper, wireless protocols are proposed that implement DSGD by accounting for the presence of path loss, fading, blockages, and mutual interference. The proposed protocols are based on graph coloring for scheduling and on both digital and analog transmission strategies at the physical layer, with the latter leveraging over-the-air computing via sparsity-based recovery.

cs.IT↗

Collaborative Computation Offloading in Wireless Powered Mobile-Edge Computing Systems

This paper studies a novel user cooperation model in a wireless powered mobile edge computing system where two wireless users harvest wireless power transferred by one energy node and can offload part of their computation tasks to an edge server (ES) for remote execution. In particular, we consider that the direct communication link between one user to the ES is blocked, such that the other user acts as a relay to forward its offloading data to the server. Meanwhile, instead of forwarding all the received task data, we also allow the helping user to compute part of the received task locally to reduce the potentially high energy and time cost on task offloading to the ES. Our aim is to maximize the amount of data that can be processed within a given time frame of the two users by jointly optimizing the amount of task data computed at each device (users and ES), the system time allocation, the transmit power and CPU frequency of the users. We propose an efficient method to find the optimal solution and show that the proposed user cooperation can effectively enhance the computation performance of the system compared to other representative benchmark methods under different scenarios.

cs.NI↗

Energy-Efficient Proactive Caching for Fog Computing with Correlated Task Arrivals

With the proliferation of latency-critical applications, fog-radio network (FRAN) has been envisioned as a paradigm shift enabling distributed deployment of cloud-clone facilities at the network edge. In this paper, we consider proactive caching for a one-user one-access point (AP) fog computing system over a finite time horizon, in which consecutive tasks of the same type of application are temporarily correlated. Under the assumption of predicable length of the task-input bits, we formulate a long-term weighted-sum energy minimization problem with three-slot correlation to jointly optimize computation offloading policies and caching decisions subject to stringent per-slot deadline constraints. The formulated problem is hard to solve due to the mixed-integer non-convexity. To tackle this challenge, first, we assume that task-related information are perfectly known {\em a priori}, and provide offline solution leveraging the technique of semi-definite relaxation (SDR), thereby serving as theoretical upper bound. Next, based on the offline solution, we propose a sliding-window based online algorithm under arbitrarily distributed prediction error. Finally, the advantage of computation caching as well the proposed algorithm is verified by numerical examples by comparison with several benchmarks.

cs.IT↗

Joint Task Assignment and Resource Allocation for D2D-Enabled Mobile-Edge Computing

With the proliferation of computation-extensive and latency-critical applications in the 5G and beyond networks, mobile-edge computing (MEC) or fog computing, which provides cloud-like computation and/or storage capabilities at the network edge, is envisioned to reduce computation latency as well as to conserve energy for wireless devices (WDs). This paper studies a novel device-to-device (D2D)-enabled multi-helper MEC system, in which a local user solicits its nearby WDs serving as helpers for cooperative computation. We assume a time division multiple access (TDMA) transmission protocol, under which the local user offloads the tasks to multiple helpers and downloads the results from them over orthogonal pre-scheduled time slots. Under this setup, we minimize the computation latency by optimizing the local user's task assignment jointly with the time and rate for task offloading and results downloading, as well as the computation frequency for task execution, subject to individual energy and computation capacity constraints at the local user and the helpers. However, the formulated problem is a mixed-integer non-linear program (MINLP) that is difficult to solve. To tackle this challenge, we propose an efficient algorithm by first relaxing the original problem into a convex one, and then constructing a suboptimal task assignment solution based on the obtained optimal one. Next, we consider a benchmark scheme that endows the WDs with their maximum computation capacities. To further reduce the implementation complexity, we also develop a heuristic scheme based on the greedy task assignment. Finally, numerical results validate the effectiveness of our proposed algorithm, as compared against the heuristic scheme and other benchmark ones without either joint optimization of radio and computation resources or task assignment design.

cs.IT↗

Optimal Resource Allocation for Wireless Powered Mobile Edge Computing with Dynamic Task Arrivals

This paper considers a wireless powered multiuser mobile edge computing (MEC) system, where a multi-antenna access point (AP) employs the radio-frequency (RF) signal based wireless power transfer (WPT) to charge a number of distributed users, and each user utilizes the harvested energy to execute computation tasks via local computing and task offloading. We consider the frequency division multiple access (FDMA) protocol to support simultaneous task offloading from multiple users to the AP. Different from previous works that considered one-shot optimization with static task models, we study the joint computation and wireless resource allocation optimization with dynamic task arrivals over a finite time horizon consisting of multiple slots. Under this setup, our objective is to minimize the system energy consumption including the AP's transmission energy and the MEC server's computing energy over the whole horizon, by jointly optimizing the transmit energy beamforming at the AP, and the local computing and task offloading strategies at the users over different time slots. To characterize the fundamental performance limit of such systems, we focus on the offline optimization by assuming the task and channel information are known a-priori at the AP. In this case, the energy minimization problem corresponds to a convex optimization problem. Leveraging the Lagrange duality method, we obtain the optimal solution to this problem in a well structure. It is shown that in order to maximize the system energy efficiency, the optimal number of task input-bits at each user and the AP are monotonically increasing over time, and the offloading strategies at different users depend on both the wireless channel conditions and the task load at the AP. Numerical results demonstrate the benefit of the proposed joint-WPT-MEC design over alternative benchmark schemes without such joint design.

cs.IT↗

Energy-Efficient Mobile-Edge Computation Offloading for Applications with Shared Data

Mobile-edge computation offloading (MECO) has been recognized as a promising solution to alleviate the burden of resource-limited Internet of Thing (IoT) devices by offloading computation tasks to the edge of cellular networks (also known as {\em cloudlet}). Specifically, latency-critical applications such as virtual reality (VR) and augmented reality (AR) have inherent collaborative properties since part of the input/output data are shared by different users in proximity. In this paper, we consider a multi-user fog computing system, in which multiple single-antenna mobile users running applications featuring shared data can choose between (partially) offloading their individual tasks to a nearby single-antenna cloudlet for remote execution and performing pure local computation. The mobile users' energy minimization is formulated as a convex problem, subject to the total computing latency constraint, the total energy constraints for individual data downloading, and the computing frequency constraints for local computing, for which classical Lagrangian duality can be applied to find the optimal solution. Based upon the semi-closed form solution, the shared data proves to be transmitted by only one of the mobile users instead of multiple ones. Besides, compared to those baseline algorithms without considering the shared data property or the mobile users' local computing capabilities, the proposed joint computation offloading and communications resource allocation provides significant energy saving.

cs.IT↗

Optimal Throughput Fairness Trade-offs for Downlink Non-Orthogonal Multiple Access over Fading Channels

Recently, non-orthogonal multiple access (NOMA) has attracted considerable interest as one of the 5G-enabling techniques. However, users with better channel conditions in downlink communications intrinsically benefits from NOMA thanks to successive decoding, judicious designs are required to guarantee user fairness. In this paper, a two-user downlink NOMA system over fading channels is considered. For delay-tolerant transmission, the average sum-rate is maximized subject to both average and peak power constraints as well as a minimum average user rate constraint. The optimal resource allocation is obtained using Lagrangian dual decomposition under full channel state information at the transmitter (CSIT), while an effective power allocation policy under partial CSIT is also developed based on analytical results. In parallel, for delay-limited transmission, the sum of delay-limited throughput (DLT) is maximized subject to a maximum allowable user outage constraint under full CSIT, and the analysis for the sum of DLT is also performed under partial CSIT. Furthermore, an optimal orthogonal multiple access (OMA) scheme is also studied as a benchmark to prove the superiority of NOMA over OMA under full CSIT. Finally, the theoretical analysis is verified by simulations via different trade-offs for the average sum-rate (sum-DLT) versus the minimum (maximum) average user rate (outage) requirement.

cs.IT↗

Joint Task Assignment and Wireless Resource Allocation for Cooperative Mobile-Edge Computing

This paper studies a multi-user cooperative mobile-edge computing (MEC) system, in which a local mobile user can offload intensive computation tasks to multiple nearby edge devices serving as helpers for remote execution. We focus on the scenario where the local user has a number of independent tasks that can be executed in parallel but cannot be further partitioned. We consider a time division multiple access (TDMA) communication protocol, in which the local user can offload computation tasks to the helpers and download results from them over pre-scheduled time slots. Under this setup, we minimize the local user's computation latency by optimizing the task assignment jointly with the time and power allocations, subject to individual energy constraints at the local user and the helpers. However, the joint task assignment and wireless resource allocation problem is a mixed-integer non-linear program (MINLP) that is hard to solve optimally. To tackle this challenge, we first relax it into a convex problem, and then propose an efficient suboptimal solution based on the optimal solution to the relaxed convex problem. Finally, numerical results show that our proposed joint design significantly reduces the local user's computation latency, as compared against other benchmark schemes that design the task assignment separately from the offloading/downloading resource allocations and local execution.

eess.SP↗

Multiple Antenna Assisted Non-Orthogonal Multiple Access

Non-orthogonal multiple access (NOMA) is potentially capable of circumventing the limitations of the classic orthogonal multiple access schemes, hence it has recently received significant research attention both in industry and academia. This article is focused on exploiting multiple antenna techniques in NOMA networks, with an emphasis on investigating the rate region of multiple-input multiple-output (MIMO)-NOMA, whist reviewing two popular multiple antennas aided NOMA structures, as well as underlining resource management problems of both single-carrier and multi-carrier MIMO-NOMA networks. This article also points out several effective methods of tackling the practical implementation constraints of multiple antenna NOMA networks. Finally, some promising open research directions are provided in context of multiple antenna aided NOMA.

cs.IT↗

Optimizing DF Cognitive Radio Networks with Full-Duplex-Enabled Energy Access Points

With the recent advances in radio frequency (RF) energy harvesting (EH) technologies, wireless powered cooperative cognitive radio network (CCRN) has drawn an upsurge of interest for improving the spectrum utilization with incentive to motivate joint information and energy cooperation between the primary and secondary systems. Dedicated energy beamforming (EB) is aimed for remedying the low efficiency of wireless power transfer (WPT), which nevertheless arouses out-of-band EH phases and thus low cooperation efficiency. To address this issue, in this paper, we consider a novel RF EH CCRN aided by full-duplex (FD)-enabled energy access points (EAPs) that can cooperate to wireless charge the secondary transmitter (ST) while concurrently receiving primary transmitter (PT)'s signal in the first transmission phase, and to perform decode-and-forward (DF) relaying in the second transmission phase. We investigate a weighted sum-rate maximization problem subject to the transmitting power constraints as well as a total cost constraint using successive convex approximation (SCA) techniques. A zero-forcing (ZF) based suboptimal scheme that requires only local CSIs for the EAPs to obtain their optimum receive beamforming is also derived. Various tradeoffs between the weighted sum-rate and other system parameters are provided in numerical results to corroborate the effectiveness of the proposed solutions against the benchmark ones.

cs.IT↗

Physical Layer Security Jamming: Theoretical Limits and Practical Designs in Wireless Networks

Physical layer security has been recently recognized as a promising new design paradigm to provide security in wireless networks. In addition to the existing conventional cryptographic methods, physical layer security exploits the dynamics of fading channels to enhance secured wireless links. In this approach, jamming plays a key role by generating noise signals to confuse the potential eavesdroppers, and significantly improves quality and reliability of secure communications between legitimate terminals. This article presents theoretical limits and practical designs of jamming approaches for physical layer security. In particular, the theoretical limits explore the achievable secrecy rates of user cooperation based jamming whilst the centralized, and game theoretic based precoding techniques are reviewed for practical implementations. In addition, the emerging wireless energy harvesting techniques are exploited to harvest the required energy to transmit jamming signals. Future directions of these approaches, and the associated research challenges are also briefly outlined.

cs.IT↗

Wireless Powered Cooperative Jamming for Secrecy Multi-AF Relaying Networks

This paper studies secrecy transmission with the aid of a group of wireless energy harvesting (WEH)-enabled amplify-and-forward (AF) relays performing cooperative jamming (CJ) and relaying. The source node in the network does simultaneous wireless information and power transfer (SWIPT) with each relay employing a power splitting (PS) receiver in the first phase; each relay further divides its harvested power for forwarding the received signal and generating artificial noise (AN) for jamming the eavesdroppers in the second transmission phase. In the centralized case with global channel state information (CSI), we provide closed-form expressions for the optimal and/or suboptimal AF-relay beamforming vectors to maximize the achievable secrecy rate subject to individual power constraints of the relays, using the technique of semidefinite relaxation (SDR), which is proved to be tight. A fully distributed algorithm utilizing only local CSI at each relay is also proposed as a performance benchmark. Simulation results validate the effectiveness of the proposed multi-AF relaying with CJ over other suboptimal designs.

cs.IT↗

To Harvest and Jam: A Paradigm of Self-Sustaining Friendly Jammers for Secure AF Relaying

This paper studies the use of multi-antenna harvest-and-jam (HJ) helpers in a multi-antenna amplify-and-forward (AF) relay wiretap channel assuming that the direct link between the source and destination is broken. Our objective is to maximize the secrecy rate at the destination subject to the transmit power constraints of the AF relay and the HJ helpers. In the case of perfect channel state information (CSI), the joint optimization of the artificial noise (AN) covariance matrix for cooperative jamming and the AF beamforming matrix is studied using semi-definite relaxation (SDR) which is tight, while suboptimal solutions are also devised with lower complexity. For the imperfect CSI case, we provide the equivalent reformulation of the worst-case robust optimization to maximize the minimum achievable secrecy rate. Inspired by the optimal solution to the case of perfect CSI, a suboptimal robust scheme is proposed striking a good tradeoff between complexity and performance. Finally, numerical results for various settings are provided to evaluate the proposed schemes.

cs.IT↗

Secrecy Wireless Information and Power Transfer in Fading Wiretap Channel

Simultaneous wireless information and power transfer (SWIPT) has recently drawn significant interests for its dual use of radio signals to provide wireless data and energy access at the same time. However, a challenging secrecy communication issue arises as the messages sent to the information receivers (IRs) may be eavesdropped by the energy receivers (ERs), which are presumed to harvest energy only from the received signals. To tackle this problem, we propose in this paper an artificial noise (AN) aided transmission scheme to facilitate the secrecy information transmission to IRs and yet meet the energy harvesting requirement for ERs, under the assumption that the AN can be cancelled at IRs but not at ERs. Specifically, the proposed scheme splits the transmit power into two parts, to send the confidential message to the IR and an AN to interfere with the ER, respectively. Under a simplified three-node wiretap channel setup, the transmit power allocations and power splitting ratios over fading channels are jointly optimized to minimize the outage probability for delay-limited secrecy information transmission, or to maximize the average rate for no-delay-limited secrecy information transmission, subject to a combination of average and peak power constraints at the transmitter as well as an average energy harvesting constraint at the ER. Both the secrecy outage probability minimization and average rate maximization problems are shown to be non-convex, for each of which we propose the optimal solution based on the dual decomposition as well as suboptimal solution based on the alternating optimization. Furthermore, two benchmark schemes are introduced for comparison. Finally, the performances of proposed schemes are evaluated by simulations in terms of various trade-offs for wireless (secrecy) information versus energy transmissions.

cs.IT↗