Searcharxiv⌕ Search

arXiv subjects

H. Vincent Poor

Publications and source records attributed to H. Vincent Poor.

At least 379 records · Page 21Linked to original sources

Physical Layer Anonymous Precoding: The Path to Privacy-Preserving Communications

Next-generation systems aim to increase both the speed and responsiveness of wireless communications, while supporting compelling applications such as edge and cloud computing, remote-Health, vehicle-to-infrastructure communications, etc. As these applications are expected to carry confidential personal data, ensuring user privacy becomes a critical issue. In contrast to traditional security and privacy designs that aim to prevent confidential information from being eavesdropped upon by adversaries, or learned by unauthorized parties, in this paper we consider designs that mask the users' identities during communication, hence resulting in anonymous communications. In particular, we examine the recent interest in physical layer (PHY) anonymous solutions. This line of research departs from conventional higher layer anonymous authentication, encryption and routing protocols, and judiciously manipulates the signaling pattern of transmitted signals in order to mask the senders' PHY characteristics. We first discuss the concept of anonymity at the PHY, and illustrate a strategy that is able to unmask the sender's identity by analyzing his or her PHY information only, i.e., signalling patterns and the inherent fading characteristics. Subsequently, we overview the emerging area of anonymous precoding to preserve the sender's anonymity, while ensuring high receiver-side signal-to-interference-plus-noise ratio (SINR) for communication. This family of anonymous precoding designs represents a new approach to providing anonymity at the PHY, introducing a new dimension for privacy-preserving techniques.

eess.SP↗

Timely Status Updating Over Erasure Channels Using an Energy Harvesting Sensor: Single and Multiple Sources

A status updating system is considered in which data from multiple sources are sampled by an energy harvesting sensor and transmitted to a remote destination through an erasure channel. The goal is to deliver status updates of all sources in a timely manner, such that the cumulative long-term average age-of-information (AoI) is minimized. The AoI for each source is defined as the time elapsed since the generation time of the latest successful status update received at the destination from that source. Transmissions are subject to energy availability, which arrives in units according to a Poisson process, with each energy unit capable of carrying out one transmission from only one source. The sensor is equipped with a unit-sized battery to save the incoming energy. A scheduling policy is designed in order to determine which source is sampled using the available energy. The problem is studied in two main settings: no erasure status feedback, and perfect instantaneous feedback.

cs.IT↗

Joint LED Selection and Precoding Optimization for Multiple-User Multiple-Cell VLC Systems

This paper proposes a hybrid dimming scheme based on joint LED selection and precoding design (TASP-HD) for multiple-user (MU) multiple-cell (MC) visible light communications (VLC) systems. In TASP-HD, both the LED selection and the precoding of each cell can be dynamically adjusted to reduce the intra- and inter-cell interferences while satisfying illumination constraints. First, a MU-MC-VLC system model is established, and then a sum-rate maximization problem under dimming level and illumination uniformity constraints is formulated. In this studied problem, the indices of activated LEDs and precoding matrices are optimized, which result in a complex non-convex mixed integer problem. To solve this problem, the original problem is separated into two subproblems. The first subproblem, which maximizes the sum-rate of users via optimizing the LED selection with a given precoding matrix, is a mixed integer problem solved by the penalty method. With the optimized LED selection matrix, the second subproblem which focuses on the maximization of the sum-rate via optimizing the precoding matrix is solved by the Lagrangian dual method. Finally, these two subproblems are iteratively solved to obtain a convergent solution. Simulation results verify that in a typical indoor scenario under a dimming level of 70%, the mean bandwidth efficiency of TASP-HD is 4.8 bit/s/Hz and 7.13 bit/s/Hz greater than AD and DD, respectively.

eess.SY↗

Low-Latency Federated Learning over Wireless Channels with Differential Privacy

In federated learning (FL), model training is distributed over clients and local models are aggregated by a central server. The performance of uploaded models in such situations can vary widely due to imbalanced data distributions, potential demands on privacy protections, and quality of transmissions. In this paper, we aim to minimize FL training delay over wireless channels, constrained by overall training performance as well as each client's differential privacy (DP) requirement. We solve this problem in the framework of multi-agent multi-armed bandit (MAMAB) to deal with the situation where there are multiple clients confornting different unknown transmission environments, e.g., channel fading and interferences. Specifically, we first transform the long-term constraints on both training performance and each client's DP into a virtual queue based on the Lyapunov drift technique. Then, we convert the MAMAB to a max-min bipartite matching problem at each communication round, by estimating rewards with the upper confidence bound (UCB) approach. More importantly, we propose two efficient solutions to this matching problem, i.e., modified Hungarian algorithm and greedy matching with a better alternative (GMBA), in which the first one can achieve the optimal solution with a high complexity while the second one approaches a better trade-off by enabling a verified low-complexity with little performance loss. In addition, we develop an upper bound on the expected regret of this MAMAB based FL framework, which shows a linear growth over the logarithm of communication rounds, justifying its theoretical feasibility. Extensive experimental results are conducted to validate the effectiveness of our proposed algorithms, and the impacts of various parameters on the FL performance over wireless edge networks are also discussed.

cs.DC↗

Distributed Reinforcement Learning for Age of Information Minimization in Real-Time IoT Systems

In this paper, the problem of minimizing the weighted sum of age of information (AoI) and total energy consumption of Internet of Things (IoT) devices is studied. In the considered model, each IoT device monitors a physical process that follows nonlinear dynamics. As the dynamics of the physical process vary over time, each device must find an optimal sampling frequency to sample the real-time dynamics of the physical system and send sampled information to a base station (BS). Due to limited wireless resources, the BS can only select a subset of devices to transmit their sampled information. Thus, edge devices must cooperatively sample their monitored dynamics based on the local observations and the BS must collect the sampled information from the devices immediately, hence avoiding the additional time and energy used for sampling and information transmission. To this end, it is necessary to jointly optimize the sampling policy of each device and the device selection scheme of the BS so as to accurately monitor the dynamics of the physical process using minimum energy. This problem is formulated as an optimization problem whose goal is to minimize the weighted sum of AoI cost and energy consumption. To solve this problem, we propose a novel distributed reinforcement learning (RL) approach for the sampling policy optimization. The proposed algorithm enables edge devices to cooperatively find the global optimal sampling policy using their own local observations. Given the sampling policy, the device selection scheme can be optimized thus minimizing the weighted sum of AoI and energy consumption of all devices. Simulations with real data of PM 2.5 pollution show that the proposed algorithm can reduce the sum of AoI by up to 17.8% and 33.9% and the total energy consumption by up to 13.2% and 35.1%, compared to a conventional deep Q network method and a uniform sampling policy.

cs.IT↗

Simultaneously Transmitting and Reflecting (STAR) Intelligent Omni-Surfaces, Their Modeling and Implementation

With the rapid development of advanced electromagnetic manipulation technologies, researchers and engineers are starting to study smart surfaces that can achieve enhanced coverages, high reconfigurability, and are easy to deploy. Among these efforts, simultaneously transmitting and reflecting intelligent omni-surface (STAR-IOS) is one of the most promising categories. Although pioneering works have demonstrated the benefits of STAR-IOSs in terms of its wireless communication performance gain, several important issues remain unclear including practical hardware implementations and physics-compliant models for STAR-IOSs. In this paper, we answer these pressing questions of STAR-IOSs by discussing four practical hardware implementations of STAR-IOSs, as well as three hardware modelling methods and five channel modelling methods. These discussions not only categorize existing smart surface technologies but also serve as a physicscompliant pipeline for further investigating the STAR-IOSs.

eess.SP↗

Multi-Dimensional Multiple Access with Resource Utilization Cost Awareness for Individualized Service Provisioning in 6G

The increasingly diversified Quality-of-Service (QoS) requirements envisioned for future wireless networks call for more flexible and inclusive multiple access techniques for supporting emerging applications and communication scenarios. To achieve this, we propose a multi-dimensional multiple access (MDMA) protocol to meet individual User Equipment's (UE's) unique QoS demands while utilizing multi-dimensional radio resources cost-effectively. In detail, the proposed scheme consists of two new aspects, i.e., selection of a tailored multiple access mode for each UE while considering the UE-specific radio resource utilization cost; and multi-dimensional radio resource allocation among coexisting UEs under dynamic network conditions. To reduce the UE-specific resource utilization cost, the base station (BS) organizes UEs with disparate multi-domain resource constraints as UE coalition by considering each UE's specific resource availability, perceived quality, and utilization capability. Each UE within a coalition could utilize its preferred radio resources, which leads to low utilization cost while avoiding resource-sharing conflicts with remaining UEs. Furthermore, to meet UE-specific QoS requirements and varying resource conditions at the UE side, the multi-dimensional radio resource allocation among coexisting UEs is formulated as an optimization problem to maximize the summation of cost-aware utility functions of all UEs. A solution to solve this NP-hard problem with low complexity is developed using the successive convex approximation and the Lagrange dual decomposition methods. The effectiveness of our proposed scheme is validated by numerical simulation and performance comparison with state-of-the-art schemes. In particular, the simulation results demonstrate that our proposed scheme outperforms these benchmark schemes by large margins.

cs.IT↗

Federated Learning: A Signal Processing Perspective

The dramatic success of deep learning is largely due to the availability of data. Data samples are often acquired on edge devices, such as smart phones, vehicles and sensors, and in some cases cannot be shared due to privacy considerations. Federated learning is an emerging machine learning paradigm for training models across multiple edge devices holding local datasets, without explicitly exchanging the data. Learning in a federated manner differs from conventional centralized machine learning, and poses several core unique challenges and requirements, which are closely related to classical problems studied in the areas of signal processing and communications. Consequently, dedicated schemes derived from these areas are expected to play an important role in the success of federated learning and the transition of deep learning from the domain of centralized servers to mobile edge devices. In this article, we provide a unified systematic framework for federated learning in a manner that encapsulates and highlights the main challenges that are natural to treat using signal processing tools. We present a formulation for the federated learning paradigm from a signal processing perspective, and survey a set of candidate approaches for tackling its unique challenges. We further provide guidelines for the design and adaptation of signal processing and communication methods to facilitate federated learning at large scale.

eess.SP↗

Present and Future of Reconfigurable Intelligent Surface-Empowered Communications

Signal processing and communication communities have witnessed the rise of many exciting communication technologies in recent years. Notable examples include alternative waveforms, massive multiple-input multiple-output (MIMO) signaling, non-orthogonal multiple access (NOMA), joint communications and sensing, sparse vector coding, index modulation, and so on. It is inevitable that 6G wireless networks will require a rethinking of wireless communication systems and technologies, particularly at the physical layer (PHY), considering the fact that the cellular industry reached another important milestone with the development of 5G wireless networks with diverse applications. Within this perspective, this article aims to shed light on the rising concept of reconfigurable intelligent surface (RIS)-empowered communications towards 6G wireless networks. Software-defined RISs can manipulate their impinging signals in an effective way to boost certain key performance indicators. We discuss the recent developments in the field and put forward promising candidates for future research and development. Specifically, we put our emphasis on active, transmitter-type, transmissive-reflective, and standalone RISs, by discussing their advantages and disadvantages compared to reflective RIS designs. Finally, we also envision an ultimate RIS architecture, which is able to adjust its operation modes dynamically, and introduce the new concept of PHY slicing over RISs towards 6G wireless networks.

eess.SP↗

6G Internet of Things: A Comprehensive Survey

The sixth generation (6G) wireless communication networks are envisioned to revolutionize customer services and applications via the Internet of Things (IoT) towards a future of fully intelligent and autonomous systems. In this article, we explore the emerging opportunities brought by 6G technologies in IoT networks and applications, by conducting a holistic survey on the convergence of 6G and IoT. We first shed light on some of the most fundamental 6G technologies that are expected to empower future IoT networks, including edge intelligence, reconfigurable intelligent surfaces, space-air-ground-underwater communications, Terahertz communications, massive ultra-reliable and low-latency communications, and blockchain. Particularly, compared to the other related survey papers, we provide an in-depth discussion of the roles of 6G in a wide range of prospective IoT applications via five key domains, namely Healthcare Internet of Things, Vehicular Internet of Things and Autonomous Driving, Unmanned Aerial Vehicles, Satellite Internet of Things, and Industrial Internet of Things. Finally, we highlight interesting research challenges and point out potential directions to spur further research in this promising area.

eess.SP↗

RIS-assisted UAV Communications for IoT with Wireless Power Transfer Using Deep Reinforcement Learning

Many of the devices used in Internet-of-Things (IoT) applications are energy-limited, and thus supplying energy while maintaining seamless connectivity for IoT devices is of considerable importance. In this context, we propose a simultaneous wireless power transfer and information transmission scheme for IoT devices with support from reconfigurable intelligent surface (RIS)-aided unmanned aerial vehicle (UAV) communications. In particular, in a first phase, IoT devices harvest energy from the UAV through wireless power transfer; and then in a second phase, the UAV collects data from the IoT devices through information transmission. To characterise the agility of the UAV, we consider two scenarios: a hovering UAV and a mobile UAV. Aiming at maximizing the total network sum-rate, we jointly optimize the trajectory of the UAV, the energy harvesting scheduling of IoT devices, and the phaseshift matrix of the RIS. We formulate a Markov decision process and propose two deep reinforcement learning algorithms to solve the optimization problem of maximizing the total network sum-rate. Numerical results illustrate the effectiveness of the UAV's flying path optimization and the network's throughput of our proposed techniques compared with other benchmark schemes. Given the strict requirements of the RIS and UAV, the significant improvement in processing time and throughput performance demonstrates that our proposed scheme is well applicable for practical IoT applications.

eess.SP↗

Robotic Communications for 5G and Beyond: Challenges and Research Opportunities

The ongoing surge in applications of robotics brings both opportunities and challenges for the fifth-generation (5G) and beyond (B5G) of communication networks. This article focuses on 5G/B5G-enabled terrestrial robotic communications with an emphasis on distinct characteristics of such communications. Firstly, signal and spatial modeling for robotic communications are presented. To elaborate further, both the benefits and challenges derived from robots' mobility are discussed. As a further advance, a novel simultaneous localization and radio mapping (SLARM) framework is proposed for integrating localization and communications into robotic networks. Furthermore, dynamic trajectory design and resource allocation for both indoor and outdoor robots are provided to verify the performance of robotic communications in the context of typical robotic application scenarios.

cs.RO↗

Federated Learning with Unreliable Clients: Performance Analysis and Mechanism Design

Owing to the low communication costs and privacy-promoting capabilities, Federated Learning (FL) has become a promising tool for training effective machine learning models among distributed clients. However, with the distributed architecture, low quality models could be uploaded to the aggregator server by unreliable clients, leading to a degradation or even a collapse of training. In this paper, we model these unreliable behaviors of clients and propose a defensive mechanism to mitigate such a security risk. Specifically, we first investigate the impact on the models caused by unreliable clients by deriving a convergence upper bound on the loss function based on the gradient descent updates. Our theoretical bounds reveal that with a fixed amount of total computational resources, there exists an optimal number of local training iterations in terms of convergence performance. We further design a novel defensive mechanism, named deep neural network based secure aggregation (DeepSA). Our experimental results validate our theoretical analysis. In addition, the effectiveness of DeepSA is verified by comparing with other state-of-the-art defensive mechanisms.

cs.LG↗

On Optimal Quantization in Sequential Detection

The problem of designing optimal quantization rules for sequential detectors is investigated. First, it is shown that this task can be solved within the general framework of active sequential detection. Using this approach, the optimal sequential detector and the corresponding quantizer are characterized and their properties are briefly discussed. In particular, it is shown that designing optimal quantization rules requires solving a nonconvex optimization problem, which can lead to issues in terms of computational complexity and numerical stability. Motivated by these difficulties, two performance bounds are proposed that are easier to evaluate than the true performance measures and are potentially tighter than the bounds currently available in the literature. The usefulness of the bounds and the properties of the optimal quantization rules are illustrated with two numerical examples.

cs.IT↗

Moving-Target Defense Against Cyber-Physical Attacks in Power Grids via Game Theory

This work proposes a moving target defense (MTD) strategy to detect coordinated cyber-physical attacks (CCPAs) against power grids. The main idea of the proposed approach is to invalidate the knowledge that the attackers use to mask the effects of their physical attack by actively perturbing the grid's transmission line reactances via distributed flexible AC transmission system (D-FACTS) devices. The proposed MTD design consists of two parts. First, we identify the subset of links for D-FACTS device deployment that enables the defender to detect CCPAs against any link in the system. Then, in order to minimize the defense cost during the system's operational time, we formulate a zero-sum game to identify the best subset of links to perturb (which will provide adequate protection) against a strategic attacker. The Nash equilibrium robust solution is computed via exponential weights, which does not require complete knowledge of the game but only the observed payoff at each iteration. Extensive simulations performed using the MATPOWER simulator on IEEE bus systems verify the effectiveness of our approach in detecting CCPAs and reducing the operator's defense cost.

cs.CR↗

Next-Generation Multiple Access Based on NOMA with Power Level Modulation

To cope with the explosive traffic growth of next-generation wireless communications, it is necessary to design next-generation multiple access techniques that can provide higher spectral efficiency as well as larger-scale connectivity. As a promising candidate, power-domain non-orthogonal multiple access (NOMA) has been widely studied. In conventional power-domain NOMA, multiple users are multiplexed in the same time and frequency band by different preset power levels, which, however, may limit the spectral efficiency under practical finite alphabet inputs. Inspired by the concept of spatial modulation, we propose to solve this problem by encoding extra information bits into the power levels, and exploit different signal constellations to help the receiver distinguish between them. To convey this idea, termed power selection (PS)-NOMA, clearly, we consider a simple downlink two-user NOMA system with finite input constellations. Assuming maximum-likelihood detection, we derive closed-form approximate bit error ratio (BER) expressions for both users. The achievable rates of both users are also derived in closed form. Simulation results verify the analysis and show that the proposed PS-NOMA outperforms conventional NOMA in terms of BER and achievable rate.

cs.IT↗

Federated Learning with Downlink Device Selection

We study federated edge learning, where a global model is trained collaboratively using privacy-sensitive data at the edge of a wireless network. A parameter server (PS) keeps track of the global model and shares it with the wireless edge devices for training using their private local data. The devices then transmit their local model updates, which are used to update the global model, to the PS. The algorithm, which involves transmission over PS-to-device and device-to-PS links, continues until the convergence of the global model or lack of any participating devices. In this study, we consider device selection based on downlink channels over which the PS shares the global model with the devices. Performing digital downlink transmission, we design a partial device participation framework where a subset of the devices is selected for training at each iteration. Therefore, the participating devices can have a better estimate of the global model compared to the full device participation case which is due to the shared nature of the broadcast channel with the price of updating the global model with respect to a smaller set of data. At each iteration, the PS broadcasts different quantized global model updates to different participating devices based on the last global model estimates available at the devices. We investigate the best number of participating devices through experimental results for image classification using the MNIST dataset with biased distribution.

cs.IT↗

Intelligent Omni-Surface: Ubiquitous Wireless Transmission by Reflective-Transmissive Metasurface

Intelligent reflecting surface (IRS), which is capable to adjust propagation conditions by controlling phase shifts of the reflected waves that impinge on the surface, has been widely analyzed for enhancing the performance of wireless systems. However, the reflective properties of widely studied IRSs restrict the service coverage to only one side of the surface. In this paper, to extend the wireless coverage of communication systems, we introduce the concept of intelligent omni-surface (IOS)-assisted communication. More precisely, IOS is an important instance of reconfigurable intelligent surface (RIS) that is capable to provide service coverage to the mobile users (MUs) in a reflective and a transmissive manner. We consider a downlink IOS-assisted communication system, where a multi-antenna small base station (SBS) and an IOS perform beamforming jointly, to improve the received power of multiple MUs on both sides of the IOS, through different reflective/transmissive channels. To maximize the sum-rate, we formulate a joint IOS phase shift design and SBS beamforming optimization problem, and propose an iterative algorithm to solve the resulting non-convex program efficiently. Both theoretical analysis and simulation results show that an IOS significantly extends the service coverage of the SBS when compared to an IRS.

eess.SY↗