Differentially Private Stochastic Gradient Descent (DPSGD) is widely used to protect sensitive data during the training of machine learning models, but its privacy guarantee often comes at a large cost of model performance due to the lack of tight theoretical bounds quantifying privacy loss. While recent efforts have achieved more accurate privacy guarantees, they still impose some assumptions prohibited from practical applications, such as convexity and complex parameter requirements, and rarely investigate in-depth the impact of privacy mechanisms on the model's utility. In this paper, we provide a rigorous privacy characterization for DPSGD with general L-smooth and non-convex loss functions, revealing converged privacy loss with iteration in bounded-domain cases. Specifically, we track the privacy loss over multiple iterations, leveraging the noisy smooth-reduction property, and further establish comprehensive convergence analysis in different scenarios. In particular, we show that for DPSGD with a bounded domain, (i) the privacy loss can still converge without the convexity assumption, (ii) a smaller bounded diameter can improve both privacy and utility simultaneously under certain conditions, and (iii) the attainable big-O order of the privacy utility trade-off for DPSGD with gradient clipping (DPSGD-GC) and for DPSGD-GC with bounded domain (DPSGD-DC) and strongly convex population risk function, respectively. Experiments via membership inference attack (MIA) in a practical setting validate insights gained from the theoretical results.

Over-the-air federated learning (FL), i.e., AirFL, leverages computing primitively over multiple access channels. A long-standing challenge in AirFL is to achieve coherent signal alignment without relying on expensive channel estimation and feedback. This paper proposes NCAirFL, a CSI-free AirFL scheme based on unbiased non-coherent detection at the edge server. By exploiting binary dithering and a longterm memory based error-compensation mechanism, NCAirFL achieves a convergence rate of order$\mathcal{O}(1 / \sqrt{T})$in terms of the average square norm of the gradient for general non-convex and smooth objectives, where$T$is the number of communication rounds. Experiments demonstrate the competitive performance of NCAirFL compared to vanilla FL with ideal communications and to coherent transmission-based benchmarks.

Post-hoc calibration of pre-trained models is critical for ensuring reliable inference, especially in safety-critical domains such as healthcare. Conformal Prediction (CP) offers a robust post-hoc calibration framework, providing distribution-free statistical coverage guarantees for prediction sets by leveraging held-out datasets. In this work, we address a decentralized setting where each device has limited calibration data and can communicate only with its neighbors over an arbitrary graph topology. We propose two message-passing-based approaches for achieving reliable inference via CP: quantile-based distributed conformal prediction (Q-DCP) and histogram-based distributed conformal prediction (H-DCP). Q-DCP employs distributed quantile regression enhanced with tailored smoothing and regularization terms to accelerate convergence, while H-DCP uses a consensus-based histogram estimation approach. Through extensive experiments, we investigate the trade-offs between hyperparameter tuning requirements, communication overhead, coverage guarantees, and prediction set sizes across different network topologies. The code of our work is released on: https://github.com/HaifengWen/Distributed-Conformal-Prediction.

Addressing the communication bottleneck inherent in federated learning (FL), over-the-air FL (AirFL) has emerged as a promising solution, which is, however, hampered by deep fading conditions. In this paper, we propose AirFL-Mem, a novel scheme designed to mitigate the impact of deep fading by implementing a long-term memory mechanism. Convergence bounds are provided that account for long-term memory, as well as for existing AirFL variants with short-term memory, for general non-convex objectives. The theory demonstrates that AirFL-Mem exhibits the same convergence rate of federated aver-aging (FedAvg) with ideal communication, while the performance of existing schemes is generally limited by error floors. The theoretical results are also leveraged to propose a novel convex optimization strategy for the truncation threshold used for power control in the presence of Rayleigh fading channels. Experimental results validate the analysis, confirming the advantages of a long-term memory mechanism for the mitigation of deep fading.

Design of mechanisms towards deploying over-the-air federated learning (FL) encounters many key challenges. One of them is to comply with the power and bandwidth constraints of the shared channel, while causing minimum deterioration to the learning performance compared to baseline noiseless implementations. For additive white Gaussian noise (AWGN) channels with instantaneous per-device power constraints, prior work has demonstrated the optimality of a power control mechanism based on norm clipping. This was done through the minimization of an upper bound on the optimality gap for smooth learning objectives satisfying the Polyak-Lojasiewicz (PL) condition. In this paper, we make two contributions to the development of AirFL based on norm clipping, which we refer to as AirFL-Clip. First, we provide a convergence bound for AirFL-Clip that applies to general smooth and non-convex learning objectives. Unlike existing results, the derived bound is free from run-specific parameters, thus supporting an offline evaluation. Second, we extend AirFL-Clip to include Top-k sparsification and linear compression. For this generalized protocol, referred to as AirFL-Clip-Comp, we derive a convergence bound for general smooth and non-convex learning objectives. We argue and demonstrate via experiments, that the only time-varying quantities present in the bound can be efficiently estimated offline by leveraging the well-studied properties of sparse recovery algorithms.

One of the emerging computing paradigms, mobile edge computing (MEC, also known as fog computing), has been developed to reduce both energy consumption and computation latency for computation-extensive IoT applications. Further, thanks to advantages brought by non-orthogonal multiple access (NOMA) in increasing the capacity of multiple-access channels (MAC), and by service caching in alleviating the burden of responding to repeated computation requests, this paper considers the joint design of communication, computation, and caching for multi-user MEC systems. Aiming for minimizing the weighted-sum energy consumption of communication and computation, given a finite set of computation services, we jointly optimize the NOMA transmission, the computation resources, and the Boolean-variable modeled cache placement, subject to the computation and caching capacity of the edge server as well as the computation latency constraints. To solve the formulated mixed-integer non-convex problem, first, given the cache placement, we solve the non-differentiable convex problem by Lagrangian dual method leveraging a semi-closed form of NOMA transmission power, followed by a one-dimension search for the optimal common task offloading time. Next, an optimal branch-and-bound (BnB) based caching strategy is proposed. Meanwhile, we also provide a heuristic suboptimal cache placement design to reduce computational complexity. Finally, numerical results show the striking performance of the proposed joint optimization of NOMA-based task offloading and service caching compared to the greedy cache placement and other benchmarks without either NOMA-based task offloading or service caching.

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 multiuser cache-assisted MEC system, users’ preferences for different types of services, possibly dependent on their locations, play an important role in the joint design of communication, computation, and service caching. In this article, 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 (BW) allocation to minimize the expected sum-energy consumption, subject to the BW and the computation limitations as well as the service latency constraints. To effectively solve the mixed-integer nonconvex 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.

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.

With the proliferation of Internet of things (IoT) devices and their growing demand for computation-extensive and real-time services, fog computing or mobile edge computing (MEC) has become a promising solution to reduce wireless network costs. To further exploit the cloud-like functions at the network edge, a paradigm shift has taken place from pursuing solely computation-communication tradeoffs to joint design of computation, communication and service caching. In this paper, we consider a multi-user caching-enabled MEC system, where users with their task requests proactively cached and executed at the edge server can directly download the desired results without computation offloading under the assumption of reusable caching. In a frequency-division multiple access (FDMA) setup, cache placement and bandwidth (BW) are jointly optimized to minimize the weighted-sum energy of the edge server and the users subject to the limits of computation, communication and caching capacities as well as the computation latency constraints. To solve this mixed-integer non-convex problem, first, we solve a BW allocation problem given any (feasible) caching decisions leveraging Lagrangian duality and ellipsoid method. Next, we propose a heuristic algorithm to iteratively update the cache placement. To further reduce the complexity, a one-shot mixed-integer linear programming (MILP) is also designed leveraging the optimal solution to the BW allocation problem. The striking performance of task caching has been provided by simulations verifying the effectiveness of the suboptimal caching decisions as well.

This article 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.

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.

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. Furthermore, 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, the 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.

In this paper, a security-aware energy-efficient resource allocation is modeled as a fractional programming problem for heterogeneous multi-homing networks. The security-aware resource allocation is formulated as a secrecy energy efficiency maximization problem subject to the average packet delay, the average packet dropping probability, and the total available power consumption. In order to guarantee the packet-level quality of service (QoS), first, the average packet delay and the average packet dropping probability requirement for each mobile terminal at the link layer are transformed into a minimum secrecy rate constraint at the physical layer. Then, the non-convex secrecy energy efficiency maximization problem is approximated by a convex problem through epigraph representation. A security-aware energy-efficient resource allocation algorithm is then proposed leveraging dual-decomposition method and bi-section search method. Finally, a heuristic security-aware resource allocation algorithm is proposed to serve as a benchmark. Simulation results demonstrate that the proposed security-aware energy-efficient resource allocation algorithm not only improves the secrecy energy efficiency and throughput, but also guarantees the packet-level QoS.

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.

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.

Recently, non-orthogonal multiple access (NOMA) transmission has aroused an upsurge of interest due to its obvious superiority in spectral efficiency and user connectivity for the next generation cellular networks. However, as NOMA is intrinsically in favour of the users with strong channels who are capable of carrying out successive decoding, judicious design is required for ensuring user fairness. In this paper, we consider a two-user downlink NOMA with delay-tolerant transmission over fading channels in both scenarios of full and partial channel state information at the transmitter (CSIT). The average sum-rate is maximized subject to both an average and a peak power constraint as well as a minimum individual rate constraint. The dynamic resource allocation policy is optimally obtained using Lagrangian dual decomposition in the full CSIT case, while the power allocation in the partial CSIT case is also developed based on analytical results. Finally, the effectiveness of the proposed algorithms for NOMA over orthogonal multiple access (OMA) are verified in simulations by means of trade-offs for the average sum-rate and/or individual rate versus the minimum average rate requirement.

Recently, non-orthogonal multiple access (NOMA) has attracted considerable interest as one of the 5G-enabling techniques. However, the users with better channel conditions in downlink communications intrinsically benefit more from NOMA than the users with worse channel conditions 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 the 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 tradeoffs for the average sum rate (sum-DLT) versus the minimum (maximum) average user rate (outage) requirement.

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 is aimed at remedying the low efficiency of wireless power transfer, which nevertheless arouses out-of-band EH phases and thus low cooperation efficiency. To address this issue, in this paper, we consider a novel CCRN aided by full-duplex (FD)-enabled energy access points (EAPs) that can cooperate to wireless charge the secondary transmitter while concurrently receiving primary transmitter's signal in the first transmission phase, and to perform decode-and-forward relaying in the second transmission phase. We investigate a weighted sum-rate maximization problem subject to transmitting power constraints as well as a total cost constraint using successive convex approximation techniques. A zero-forcing-based suboptimal scheme that requires only local channel state information for the EAPs to obtain their optimum receiving 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.

Cognitive radio (CR) has been advocated to improve the network spectrum efficiency for decades, and the cooperation between the primary and secondary systems has become a new paradigm to further improve the spectrum utilization. However, in practice, secondary transmitters (STs) are usually power constrained, which limits the application of cooperative cognitive radio networks (CCRN). In this paper, to tackle this, we consider a novel spectrum sharing CCRN powered by energy access points (EAPs) that can charge users wirelessly, in which a multi-antenna secondary user (SU) solely powered by its harvested energy seeks cooperation with a single-antenna primary user (PU) by serving as a deocde-and-forward (DF) relay. We investigate a payoff maximization problem from the SU's perspective, who gets paid by offering data relaying service for PU but has to pay for WEH, and obtain its optimal DF relay and WEH strategy. A greedy-based algorithm that can assign the ST to right EAPs is also proposed for the ease of implementation. The proposed scheme is shown to be effective by simulations with a negligible gap to the optimal solution.

We consider secure resource allocations for orthogonal frequency division multiple access (OFDMA) two-way relay wireless sensor networks (WSNs). The joint problem of subcarrier (SC) assignment, SC pairing and power allocations, is formulated under scenarios of using and not using cooperative jamming (CJ) to maximize the secrecy sum rate subject to limited power budget at the relay station (RS) and orthogonal SC allocation policies. The optimization problems are shown to be mixed integer programming and nonconvex. For the scenario without CJ, we propose an asymptotically optimal algorithm based on the dual decomposition method and a suboptimal algorithm with lower complexity. For the scenario with CJ, the resulting optimization problem is nonconvex, and we propose a heuristic algorithm based on alternating optimization. Finally, the proposed schemes are evaluated by simulations and compared with the existing schemes.

This paper investigates secrecy rate optimization problems for a multiple-input-single-output (MISO) secrecy channel in the presence of multiple multiantenna eavesdroppers. Specifically, we consider power minimization and secrecy rate maximization problems for this secrecy network. First, we formulate the power minimization problem based on the assumption that the legitimate transmitter has perfect channel state information (CSI) of the legitimate user and the eavesdroppers, where this problem can be reformulated into a second-order cone program (SOCP). In addition, we provide a closed-form solution of transmit beamforming for the scenario of an eavesdropper. Next, we consider robust secrecy rate optimization problems by incorporating two probabilistic channel uncertainties with CSI feedback. By exploiting the Bernstein-type inequality and S-Procedure to convert the probabilistic secrecy rate constraint into the determined constraint, we formulate this secrecy rate optimization problem into a convex optimization framework. Furthermore, we provide analyses to show the optimal transmit covariance matrix is rank-one for the proposed schemes. Numerical results are provided to validate the performance of these two conservative approximation methods, where it is shown that the Bernstein-type inequality-based approach outperforms the S-Procedure approach in terms of the achievable secrecy rates.

This paper studies secrecy transmission with the aid of a group of wireless energy harvesting-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 with each relay employing a power splitting receiver in the first phase; each relay further divides its harvested power for forwarding the received signal and generating artificial noise for jamming the eavesdroppers in the second transmission phase. In the centralized case with global channel state information (CSI), we provide the 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.

Simultaneous wireless information and power transfer (SWIPT) has recently drawn much attention for its dual use of radio signals. A new type of relays, wireless energy harvesting (WEH)-enabled relays, are thus motivated to support cooperation. In this paper, we consider the use of power splitter (PS) at such relays for a distributed WEH-enabled amplify-and-forward (AF) relaying network, where a multi-antenna transmitter communicates with a single-antenna receiver with the aid of several single-antenna WEH-enabled AF relays, in the presence of a single-antenna eavesdropper. Assuming global channel state information (CSI) at the transmitter but local CSI from/to legitimate parties at the relays, the secrecy rate maximization problem is studied to optimize the beamforming vector at the transmitter as well as the PS ratios and the AF coefficients at the relays. We devise an efficient secure relay beamforming (SRB) algorithm to first obtain the PS ratios in a distributed manner and then iteratively adapt the transmit beam and the AF coefficients. The efficiency of the proposed algorithm is evaluated against other heuristic schemes by simulations.

TV White Spaces (TVWS) technology allows wireless devices to opportunistically use locally-available TV channels enabled by a geolocation database. The UK regulator Ofcom has initiated a pilot of TVWS technology in the UK. This paper concerns a large- scale series of trials under that pilot. The purposes are to test aspects of white space technology, including the white space device and geolocation database interactions, the validity of the channel availability/powers calculations by the database and associated interference effects on primary services, and the performances of the white space devices, among others. An additional key purpose is to perform research investigations such as on aggregation of TVWS resources with conventional resources and also aggregation solely within TVWS, secondary coexistence issues and means to mitigate such issues, and primary coexistence issues under challenging deployment geometries, among others. This paper provides an update on the trials, giving an overview of their objectives and characteristics, some aspects that have been covered, and some early results and observations.

The emerging radio signal enabled simultaneous wireless information and power transfer (SWIPT), has drawn significant attention. To achieve secrecy transmission by cooperative jamming, especially in the upcoming 5G networks with self-sustainable mobile base stations (BSs) and yet not to add extra power consumption, we propose in this paper a new relay protocol, i.e., harvest-and-jam (HJ), in a relay wiretap channel with an additional set of spare helpers. Specifically, in the first transmission phase, a single-antenna transmitter (Tx) transfers signals carrying both information and energy to a multi-antenna amplify-and-forward (AF) relay and a group of multi-antenna helpers; in the second transmission phase, the AF relay processes the information and forwards it to the receiver while each of the helpers generates an artificial noise (AN), the power of which is constrained by its previously harvested energy, to interfere with the eavesdropper. By optimizing the transmit beamforming matrix for the AF relay and the covariance matrix for the AN, we maximize the secrecy rate for the receiver subject to transmit power constraints for the AF relay and all helpers. The formulated problem is shown to be non-convex, for which we propose an iterative algorithm based on alternating optimization. Finally, the performance of the proposed scheme is evaluated by simulations as compared to other heuristic schemes.

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 problem arises in the SWIPT system since the messages sent to information receivers (IRs) may be eavesdropped by energy receivers (ERs), which are presumed to receive energy from the same signals broadcast by the transmitter. 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 power at the transmitter into two parts, to send the confidential message to the IR and an AN to interfere with the ER against eavesdropping, respectively. Under a simplified three-node wiretap channel setup, the transmit power allocations and power splitting ratios over fading channels are jointly optimized to maximize the average secrecy information rate for the IR subject to a combination of average and peak power constraints at the transmitter as well as an average energy harvesting constraint at the ER. The formulated problem is shown to be non-convex, for which we propose an efficient algorithm by iteratively optimizing the transmit power allocations and power splitting ratios over fading channels. Finally, the performance of the proposed scheme is evaluated by simulations and compared against other heuristic schemes in terms of achievable (secrecy) rate-energy trade-off.

In this paper, we consider the problem of secure resource allocation in orthogonal frequency division multiple access (OFDMA) two-way relay networks. Multiple sources exchange information with the assistance of an amplify-and-forward (AF) relay node in the presence of an eavesdropper. The joint subcarrier allocation, subcarrier pairing and power allocation problem aims to maximize the secrecy capacity for legitimate sources subject to limited power budget and orthogonal subcarrier allocation constraints. The optimization problem is modeled as a mixed integer programming problem, and then solved in an asymptotically optimal manner based on the dual method. Moreover, a suboptimal algorithm is proposed to reduce the complexity. Simulations are conducted to evaluate the effectiveness of the proposed near optimal and suboptimal algorithms.