Searcharxiv⌕ Search

arXiv subjects

Rongfei Fan

Publications and source records attributed to Rongfei Fan.

34 records · Page 2Linked to original sources

Federated Learning Robust to Byzantine Attacks: Achieving Zero Optimality Gap

In this paper, we propose a robust aggregation method for federated learning (FL) that can effectively tackle malicious Byzantine attacks. At each user, model parameter is firstly updated by multiple steps, which is adjustable over iterations, and then pushed to the aggregation center directly. This decreases the number of interactions between the aggregation center and users, allows each user to set training parameter in a flexible way, and reduces computation burden compared with existing works that need to combine multiple historical model parameters. At the aggregation center, geometric median is leveraged to combine the received model parameters from each user. Rigorous proof shows that zero optimality gap is achieved by our proposed method with linear convergence, as long as the fraction of Byzantine attackers is below half. Numerical results verify the effectiveness of our proposed method.

cs.LG↗

Joint Power Control and Data Size Selection for Over-the-Air Computation Aided Federated Learning

Federated learning (FL) has emerged as an appealing machine learning approach to deal with massive raw data generated at multiple mobile devices, {which needs to aggregate the training model parameter of every mobile device at one base station (BS) iteratively}. For parameter aggregating in FL, over-the-air computation is a spectrum-efficient solution, which allows all mobile devices to transmit their parameter-mapped signals concurrently to a BS. Due to heterogeneous channel fading and noise, there exists difference between the BS's received signal and its desired signal, measured as the mean-squared error (MSE). To minimize the MSE, we propose to jointly optimize the signal amplification factors at the BS and the mobile devices as well as the data size (the number of data samples involved in local training) at every mobile device. The formulated problem is challenging to solve due to its non-convexity. To find the optimal solution, with some simplification on cost function and variable replacement, which still preserves equivalence, we transform the changed problem to be a bi-level problem equivalently. For the lower-level problem, optimal solution is found by enumerating every candidate solution from the Karush-Kuhn-Tucker (KKT) condition. For the upper-level problem, the optimal solution is found by exploring its piecewise convexity. Numerical results show that our proposed method can greatly reduce the MSE and can help to improve the training performance of FL compared with benchmark methods.

cs.LG↗

Joint Task Offloading and Resource Allocation for Streaming Application in Cooperative Mobile Edge Computing

Mobile edge computing (MEC) enables resource-limited IoT devices to complete computation-intensive or delay-sensitive task by offloading the task to adjacent edge server deployed at the base station (BS), thus becoming an important technology in 5G and beyond. Due to channel occlusion, some users may not be able to access the computation capability directly from the BS. Confronted with this issue, many other devices in the MEC system can serve as cooperative nodes to collect the tasks of these users and further forward them to the BS. In this paper, we study a MEC system in which multiple users continuously generate the tasks and offload the tasks to the BS through a cooperative node. As the tasks are continuously generated, users should simultaneously execute the task generation in the current time frame and the task offloading of the last time frame, i.e. the task is processed in a streaming model. To optimize the power consumption of the users and the cooperative node for finishing these streaming tasks, we investigate the duration of each step in finishing the tasks together with multiuser offloading ratio and bandwidth allocation within two cases: the BS has abundant computation capacity (Case I) and the BS has limited computation capacity (Case II). For both cases, the formulated optimization problems are nonconvex due to fractional structure of the objective function and complicated variable coupling. To address this issue, we propose optimal solution algorithm with low complexity. Finally, simulation is carried out to verify the effectiveness of the proposed methods and reveal the performance of the considered system.

cs.IT↗

Minimum Age of Information in Internet of Things with Opportunistic Channel Access

This paper investigates an Internet of Things (IoT) system in which multiple devices are observing some object's physical parameters and then offloading their observations back to the BS in time with opportunistic channel access. Specifically, each device accesses the common channel through contention with a certain probability firstly and then the winner evaluates the instant channel condition and decides to accept the right of channel access or not. We analyze this system through the perspective of Age of Information (AoI), which describes the freshness of observed information. The target is to minimize average AoI by optimizing the probability of device participation in contention and the transmission rate threshold. The problem is hard to solve since the AoI expression in fractional form is complex. We first decompose the original problem into two single-variable optimization sub-problems through Dinkelbach method and Block Coordinate Descent (BCD) method. And then we transform them to Monotonic optimization problems by proving the monotonicity of the objective functions, whose global optimal solution is able to be found through Polyblock algorithm. Numerical results verify the validity of our proposed method.

cs.IT↗

Joint Task Offloading and Resource Allocation for IoT Edge Computing with Sequential Task Dependency

Incorporating mobile edge computing (MEC) in Internet of Things (IoT) enables resource-limited IoT devices to offload their computation tasks to a nearby edge server. In this paper, we investigate an IoT system assisted by the MEC technique with its computation task subjected to sequential task dependency, which is critical for video stream processing and other intelligent applications. To minimize energy consumption per IoT device while limiting task processing delay, task offloading strategy, communication resource, and computation resource are optimized jointly under both slow and fast fading channels. In slow fading channels, an optimization problem is formulated, which is non-convex and involves one integer variable. To solve this challenging problem, we decompose it as a one-dimensional search of task offloading decision problem and a non-convex optimization problem with task offloading decision given. Through mathematical manipulations, the non-convex problem is transformed to be a convex one, which is shown to be solvable only with the simple Golden search method. In fast fading channels, optimal online policies depending on instant channel state are derived even though they are entangled. In addition, it is proved that the derived policy will converge to the offline policy when channel coherence time is low, which can help to save extra computation complexity. Numerical results verify the correctness of our analysis and the effectiveness of our proposed strategies over existing methods.

cs.IT↗

Joint Task Offloading and Resource Allocation for IoT Edge Computing with Sequential Task Dependency

Incorporating mobile edge computing (MEC) in the Internet of Things (IoT) enables resource-limited IoT devices to offload their computation tasks to a nearby edge server. In this paper, we investigate an IoT system assisted by the MEC technique with its computation task subjected to sequential task dependency, which is critical for video stream processing and other intelligent applications. To minimize energy consumption per IoT device while limiting task processing delay, task offloading strategy, communication resource, and computation resource are optimized jointly under both slow and fast fading channels. In slow fading channels, an optimization problem is formulated, which is mixed-integer and non-convex. To solve this challenging problem, we decompose it as a one-dimensional search of task offloading decision problem and a non-convex optimization problem with task offloading decision given. Through mathematical manipulations, the non-convex problem is transformed to be a convex one, which is shown to be solvable only with the simple Golden search method. In fast fading channels, optimal online policy depending on instant channel state is derived. In addition, it is proved that the derived policy will converge to the offline policy when channel coherence time is low, which can help to save extra computation complexity. Numerical results verify the correctness of our analysis and the effectiveness of our proposed strategies over existing methods.

eess.SY↗

Energy-Efficient Task Offloading and Resource Allocation for Multiple Access Mobile Edge Computing

In this paper, the problem of joint radio and computation resource management over multi-channel is investigated for multi-user partial offloading mobile edge computing (MEC) system. The target is to minimize the weighted sum of energy consumption by jointly optimizing transmission time, local and edge computation capacity allocation, bandwidth allocation and data partition. An optimization problem is formulated, which is nonconvex and can not be solved directly. Then, we transform the origin optimization problem into an equivalent convex optimization problem. For general case of multi-user multi-channel, we decouple the convex optimization problem into subproblems and an optimal resource management strategy is obtained by adopting block coordinate descent (BCD) method. To gain further insight, we investigate the optimal resource management strategy for two special cases. First, consider the case of multi-user shares single channel. Since the single-channel optimization problem is reduced from the multi-channel optimization problem, the solution approach of general case can be applied to this case, and the solving algorithm for this case has low computation complexity, which is a combination of analytical and bisection-search methods. Then, for the case of single-user occupies all channel, the optimization problem is simplified and an optimal solving algorithm with closed-form solutions is proposed.

cs.IT↗

Energy-efficient Task Offloading for Relay Aided Mobile Edge Computing under Sequential Task Dependency

In this paper, we study a mobile edge computing (MEC) system in which the mobile device is assisted by a base station (BS) and a cooperative node. The mobile device has sequential tasks to complete, whereas the cooperative node assists the mobile device on both task offloading and task computation. In specific, two cases are investigated, which are 1) the cooperative node has no tasks to complete itself, and 2) the cooperative node has tasks to complete itself. Our target is to minimize the total energy consumption of the mobile device and the cooperative node through optimizing the transmit duration in task offloading, CPU frequency in task computing along with the task index to offload in the sequential tasks. In the first case, we decompose the mixed-integer non-convex problem into two levels. In the lower level problem, thanks to the convexity, Karush-Kuhn-Tucker (KKT) conditions are utilized to simplify the problem, which is then solved with bisection search. In the upper level problem, to find solution of the task index to offload, rather than utilizing traversal method, we develop a monotonic condition to simplify the searching process. In the second case, in order to guarantee the successful computation of the mobile device and cooperative node, the uploading transmission is classified into three schemes. Within each scheme, the non-convex problem is decomposed. In the lower level problem, semi-closed solution is found by Lagrangian dual method. In the upper level problem, traversal method is applied to find the optimal offloading index.

cs.IT↗

Energy-efficient Resource Allocation for Mobile Edge Computing Aided by Multiple Relays

In this paper, we study a mobile edge computing (MEC) system with the mobile device aided by multiple relay nodes for offloading data to an edge server. Specifically, the modes of decode-and-forward (DF) with time-division-multiple-access (TDMA) and frequency-division-multiple-access (FDMA), and the mode of amplify-and-forward (AF) are investigated, which are denoted as DF-TDMA, DF-FDMA, and AF, respectively. Our target is to minimize the total energy consumption of the mobile device and multiple relay nodes through optimizing the allocation of computation and communication resources. Optimization problems under the three considered modes are formulated and shown to be non-convex. For DF-TDMA mode, we transform the original non-convex problem to be a convex one and further develop a low computation complexity yet optimal solution. In DF-FDMA mode, with some transformation on the original problem, we prove the mathematical equivalence between the transformed problem in DF-FDMA mode and the problem under DF-TDMA mode. In AF mode, the associated optimization problem is decomposed into two levels, in which monotonic optimization is utilized in upper level and successive convex approximation (SCA) is adopted to find the convergent solution in the lower level. Numerical results prove the effectiveness of our proposed methods under various working modes.

cs.IT↗

Reconfigurable Intelligent Surface assisted Two-Way Communications: Performance Analysis and Optimization

In this paper, we investigate the two-way communication between two users assisted by a re-configurable intelligent surface (RIS). The scheme that two users communicate simultaneously over Rayleigh fading channels is considered. The channels between the two users and RIS can either be reciprocal or non-reciprocal. For reciprocal channels, we determine the optimal phases at the RIS to maximize the signal-to-interference-plus-noise ratio (SINR). We then derive exact closed-form expressions for the outage probability and spectral efficiency for single-element RIS. By capitalizing the insights obtained from the single-element analysis, we introduce a gamma approximation to model the product of Rayleigh random variables which is useful for the evaluation of the performance metrics in multiple-element RIS. Asymptotic analysis shows that the outage decreases at $\left(\log(ρ)/ρ\right)^L$ rate where $L$ is the number of elements, whereas the spectral efficiency increases at $\log(ρ)$ rate at large average SINR $ρ$. For non-reciprocal channels, the minimum user SINR is targeted to be maximized. For single-element RIS, closed-form solution is derived whereas for multiple-element RIS the problem turns out to be non-convex. The latter one is solved through semidefinite programming relaxation and a proposed greedy-iterative method, which can achieve higher performance and lower computational complexity, respectively.

eess.SP↗

Channel Estimation for Wireless Communication Systems Assisted by Large Intelligent Surfaces

In this letter, the channel estimation problem is studied for wireless communication systems assisted by large intelligent surface. Due to features of assistant channel, channel estimation (CE) problem for the investigated system is shown as a constrained estimation error minimization problem, which differs from traditional CE problems. A Lagrange multiplier and dual ascent-based estimation scheme is then designed to obtain a closed-form solution for the estimator iteratively. Moreover, the Cramer-Rao lower bounds are deduced for performance evaluation. Simulation results show that the designed scheme could improve estimation accuracy up to 18%, compared with least square method in low signal-to-noise ratio regime.

cs.IT↗

Energy-Efficient Mobile-Edge Computation Offloading over Multiple Fading Blocks

By allowing a mobile device to offload computation-intensive tasks to a base station, mobile edge computing (MEC) is a promising solution for saving the mobile device's energy. In real applications, the offloading may span multiple fading blocks. In this paper, we investigate energy-efficient offloading over multiple fading blocks with random channel gains. An optimization problem is formulated, which optimizes the amount of data for offloading to minimize the total expected energy consumption of the mobile device. Although the formulated optimization problem is non-convex, we prove that the objective function of the problem is piecewise convex, and accordingly develop an optimal solution for the problem. Numerical results verify the correctness of our findings and the effectiveness of our proposed method.

cs.IT↗

Throughput Maximization in Two-hop DF Multiple-Relay Network with Simultaneous Wireless Information and Power Transfer

This paper investigates the end-to-end throughput maximization problem for a two-hop multiple-relay network, with relays powered by simultaneous wireless information and power transfer (SWIPT) technique. Nonlinearity of energy harvester at every relay node is taken into account and two models for approximating the nonlinearity are adopted: logistic model and linear cut-off model. Decode-and-forward (DF) is implemented, and time switching (TS) mode and power splitting (PS) mode are considered. Optimization problems are formulated for TS mode and PS mode under logistic model and linear cut-off model, respectively. End-to-end throughput is aimed to be maximized by optimizing the transmit power and bandwidth on every source-relay-destination link, and PS ratio and/or TS ratio on every relay node. Although the formulated optimization problems are all non-convex. Through a series of analysis and transformation, and with the aid of bi-level optimization and monotonic optimization, etc., we find the global optimal solution of every formulated optimization problem. In some case, a simple yet optimal solution of the formulated problem is also derived. Numerical results verify the effectiveness of our proposed methods.

cs.IT↗

Transceiver Design for Ambient Backscatter Communication over Frequency-Selective Channels

Existing studies about ambient backscatter communication mostly assume flat-fading channels. However, frequency-selective channels widely exist in many practical scenarios. Therefore, this paper investigates ambient backscatter communication systems over frequency-selective channels. In particular, we propose an interference-free transceiver design to facilitate signal detection at the reader. Our design utilizes the cyclic prefix (CP) of orthogonal frequency-division multiplexing (OFDM) source symbols, which can cancel the signal interference and thus enhance the detection accuracy at the reader. Meanwhile, our design leads to no interference on the existing OFDM communication systems. Next we suggest a chi-square based detector for the reader and derive the optimal detection threshold. Simulations are then provided to corroborate our proposed studies.

cs.IT↗

Decoupled Heterogeneous Networks with Millimeter Wave Small Cells

Deploying sub-6GHz network together with millimeter wave (mmWave) is a promising solution to simultaneously achieve sufficient coverage and high data rate. In the heterogeneous networks (HetNets), the traditional coupled access, i.e., the users are constrained to be associated with the same base station in both downlink and uplink, is no longer optimal, and the concept of downlink and uplink decoupling has recently been proposed. In this paper, we propose an analytical framework to investigate the traditional sub-6GHz HetNets integrating with mmWave small cells (SCells) with decoupled access, where both the uplink power control and mmWave interference are taken into account. Using the tools from stochastic geometry, the performance metrics of signal-to-interference-plus-noise ratio coverage probability, user-perceived rate coverage probability, and area sum rate are derived. The impact of the densification of different SCells on the network performance is also analyzed to give insights on the network design. Simulation results validate the accuracy of our analysis, and reveal that mmWave interference can not be neglected when the mmWave SCells are extremely dense and that different kinds of SCells have various effects on the network performance and thus need to be organized properly.

eess.SP↗

Dynamic Spectrum Leasing with Two Sellers

This paper studies dynamic spectrum leasing in a cognitive radio network. There are two spectrum sellers, who are two primary networks, each with an amount of licensed spectrum bandwidth. When a seller has some unused spectrum, it would like to lease the unused spectrum to secondary users. A coordinator helps to perform the spectrum leasing stage-by-stage. As the two sellers may have different leasing period, there are three epochs, in which seller 1 has spectrum to lease in Epochs II and III, while seller 2 has spectrum to lease in Epochs I and II. Each seller needs to decide how much spectrum it should lease to secondary users in each stage of its leasing period, with a target at revenue maximization. It is shown that, when the two sellers both have spectrum to lease (i.e., in Epoch II), the spectrum leasing can be formulated as a non-cooperative game. Nash equilibria of the game are found in closed form. Solutions of the two users in the three epochs are derived.

cs.GT↗