arXiv subjects

Yonghui Li

Publications and source records attributed to Yonghui Li.

At least 127 records · Page 7Linked to original sources

arXiv2021

A New Frequency-Bin-Index LoRa System for High-Data-Rate Transmission: Design and Performance Analysis

As an attempt to tackle the low-data-rate issue of the conventional LoRa systems, we propose two novel frequency-bin-index (FBI) LoRa schemes. In scheme I, the indices of starting frequency bins (SFBs) are utilized to carry the information bits. To facilitate the actual implementation, the SFBs of each LoRa signal are divided into several groups prior to the modulation process in the proposed FBI-LoRa system. To further improve the system flexibility, we formulate a generalized modulation scheme and propose scheme II by treating the SFB groups as an additional type of transmission entity. In scheme II, the combination of SFB indices and that of SFB group indices are both exploited to carry the information bits. We derive the theoretical expressions for bit-error-rate (BER) and throughput of the proposed FBI-LoRa system with two modulation schemes over additive white Gaussian noise (AWGN) and Rayleigh fading channels. Theoretical and simulation results show that the proposed FBI-LoRa schemes can significantly increases the transmission throughput compared with the existing LoRa systems at the expense of a slight loss in BER performance. Thanks to the appealing superiorities, the proposed FBI-LoRa system is a promising alternative for high-data-rate Internet of Things (IoT) applications.

eess.SP↗

arXiv2021

Random Shifting Intelligent Reflecting Surface for OTP Encrypted Data Transmission

In this paper, we propose a novel encrypted data transmission scheme using an intelligent reflecting surface (IRS) to generate secret keys in wireless communication networks. We show that perfectly secure one-time pad (OTP) communications can be established by using a simple random phase shifting of the IRS elements. To maximize the secure transmission rate, we design an optimal time slot allocation algorithm for the IRS secret key generation and the encrypted data transmission phases. Moreover, a theoretical expression of the key generation rate is derived based on Poisson point process (PPP) for the practical scenario when eavesdroppers' channel state information (CSI) is unavailable. Simulation results show that employing our IRS-based scheme can significantly improve the encrypted data transmission performance for a wide-range of wireless channel gains and system parameters.

cs.IT↗

arXiv2021

Secret Key Generation for Intelligent Reflecting Surface Assisted Wireless Communication Networks

We propose and analyze secret key generation using intelligent reflecting surface (IRS) assisted wireless communication networks. To this end, we first formulate the minimum achievable secret key capacity for an IRS acting as a passive beamformer in the presence of multiple eavesdroppers. Next, we develop an optimization framework for the IRS reflecting coefficients based on the secret key capacity lower bound. To derive a tractable and efficient solution, we design and analyze a semidefinite relaxation (SDR) and successive convex approximation (SCA) based algorithm for the proposed optimization. Simulation results show that employing our IRS-based algorithm can significantly improve the secret key generation capacity for a wide-range of wireless channel parameters.

eess.SP↗

arXiv2021

Optimizing Information Freshness in Two-Hop Status Update Systems under a Resource Constraint

In this paper, we investigate the age minimization problem for a two-hop relay system, under a resource constraint on the average number of forwarding operations at the relay. We first design an optimal policy by modelling the considered scheduling problem as a constrained Markov decision process (CMDP) problem. Based on the observed multi-threshold structure of the optimal policy, we then devise a low-complexity double threshold relaying (DTR) policy with only two thresholds, one for relay's AoI and the other one for the age gain between destination and relay. We derive approximate closed-form expressions of the average AoI at the destination, and the average number of forwarding operations at the relay for the DTR policy, by modelling the tangled evolution of age at relay and destination as a Markov chain (MC). Numerical results validate all the theoretical analysis, and show that the low-complexity DTR policy can achieve near optimal performance compared with the optimal CMDP-based policy. Moreover, the relay should always consider the threshold for its local age to maintain a low age at the destination. When the resource constraint is relatively tight, it further needs to consider the threshold on the age gain to ensure that only those packets that can decrease destination's age dramatically will be forwarded.

cs.IT↗

arXiv2021

Over-the-Air Computation with Spatial-and-Temporal Correlated Signals

Over-the-air computation (AirComp) leveraging the superposition property of wireless multiple-access channel (MAC), is a promising technique for effective data collection and computation of large-scale wireless sensor measurements in Internet of Things applications. Most existing work on AirComp only considered computation of spatial-and-temporal independent sensor signals, though in practice different sensor measurement signals are usually correlated. In this letter, we propose an AirComp system with spatial-and-temporal correlated sensor signals, and formulate the optimal AirComp policy design problem for achieving the minimum computation mean-squared error (MSE). We develop the optimal AirComp policy with the minimum computation MSE in each time step by utilizing the current and the previously received signals. We also propose and optimize a low-complexity AirComp policy in closed form with the performance approaching to the optimal policy.

cs.IT↗

arXiv2021

A Tutorial on Ultra-Reliable and Low-Latency Communications in 6G: Integrating Domain Knowledge into Deep Learning

As one of the key communication scenarios in the 5th and also the 6th generation (6G) of mobile communication networks, ultra-reliable and low-latency communications (URLLC) will be central for the development of various emerging mission-critical applications. State-of-the-art mobile communication systems do not fulfill the end-to-end delay and overall reliability requirements of URLLC. In particular, a holistic framework that takes into account latency, reliability, availability, scalability, and decision making under uncertainty is lacking. Driven by recent breakthroughs in deep neural networks, deep learning algorithms have been considered as promising ways of developing enabling technologies for URLLC in future 6G networks. This tutorial illustrates how domain knowledge (models, analytical tools, and optimization frameworks) of communications and networking can be integrated into different kinds of deep learning algorithms for URLLC. We first provide some background of URLLC and review promising network architectures and deep learning frameworks for 6G. To better illustrate how to improve learning algorithms with domain knowledge, we revisit model-based analytical tools and cross-layer optimization frameworks for URLLC. Following that, we examine the potential of applying supervised/unsupervised deep learning and deep reinforcement learning in URLLC and summarize related open problems. Finally, we provide simulation and experimental results to validate the effectiveness of different learning algorithms and discuss future directions.

eess.SP↗

arXiv2021

Optimizing Information Freshness for Cooperative IoT Systems with Stochastic Arrivals

This paper considers a cooperative Internet of Things (IoT) system with a source aiming to transmit randomly generated status updates to a designated destination as timely as possible under the help of a relay. We adopt a recently proposed concept, the age of information (AoI), to characterize the timeliness of the status updates. In the considered system, delivering the status updates via the one-hop direct link will have a shorter transmission time at the cost of incurring a higher error probability, while the delivery of status updates through the two-hop relay link could be more reliable at the cost of suffering longer transmission time. Thus, it is important to design the relaying protocol of the considered system for optimizing the information freshness. Considering the limited capabilities of IoT devices, we propose two low-complexity age-oriented relaying (AoR) protocols, i.e., the source-prioritized AoR (SP-AoR) protocol and the relay-prioritized AoR (RP-AoR) protocol, to reduce the AoI of the considered system. By carefully analyzing the evolution of the instantaneous AoI, we derive closed-form expressions of the average AoI for both proposed AoR protocols. We further optimize the generation probability of the status updates at the source in both protocols. Simulation results validate our theoretical analysis, and demonstrate that the two proposed protocols outperform each other under various system parameters. Moreover, the protocol with better performance can achieve near-optimal performance compared with the optimal scheduling policy attained by applying the Markov decision process (MDP) tool.

cs.IT↗

arXiv2020

Catalytically Potent and Selective Clusterzymes for Modulation of Neuroinflammation Through Single-Atom Substitutions

Emerging artificial enzymes with reprogrammed and augmented catalytic activity and substrate selectivity have long been pursued with sustained efforts. The majority of current candidates rely on noble metals or transition metal oxides with rather poor catalytic activity compared with natural molecules. To tackle this limitation, we strategically designed a novel artificial enzyme based on a structurally well-defined Au25 cluster, namely clusterzyme, which is endowed with intrinsic high catalytic activity and selectivity driven by single-atom substitutions with modulated bond lengths. The 3-mercaptopropionic acid (MPA)-stabilized Au24Cu1 and Au24Cd1 clusterzymes exhibit 137 and 160 times higher antioxidant capacities than the natural trolox, respectively. Meanwhile, the clusterzymes each demonstrate preferential enzyme-mimicking catalytic activities with compelling selectivity: Au25 exhibits superior glutathione peroxidase-like (GPx-like) activity; Au24Cu1 shows a distinct advantage towards catalase-like (CAT-like) activity by its Cu single active site; Au24Cd1 preferably acts as a superoxide dismutase-like (SOD-like) enzyme via the Cd single active site. This unique diversified catalytic landscape manifests distinctive reactions against inflammation in brain. Au24Cu1 behaves as an endogenous multi-enzyme mimic that directly decreases peroxide in injured brain via catalytic reactions, while Au24Cd1, catalyzes superoxide and nitrogenous signal molecules by preference, and significantly decreases inflammation factors such as IL-1\b{eta}, IL-6, and TNFα, indicative of an important role in mitigating neuroinflammation.

physics.bio-ph↗

arXiv2020

Task Offloading for Large-Scale Asynchronous Mobile Edge Computing: An Index Policy Approach

Mobile-edge computing (MEC) offloads computational tasks from wireless devices to network edge, and enables real-time information transmission and computing. Most existing work concerns a small-scale synchronous MEC system. In this paper, we focus on a large-scale asynchronous MEC system with random task arrivals, distinct workloads, and diverse deadlines. We formulate the offloading policy design as a restless multi-armed bandit (RMAB) to maximize the total discounted reward over the time horizon. However, the formulated RMAB is related to a PSPACE-hard sequential decision-making problem, which is intractable. To address this issue, by exploiting the Whittle index (WI) theory, we rigorously establish the WI indexability and derive a scalable closed-form solution. Consequently, in our WI policy, each user only needs to calculate its WI and report it to the BS, and the users with the highest indices are selected for task offloading. Furthermore, when the task completion ratio becomes the focus, the shorter slack time less remaining workload (STLW) priority rule is introduced into the WI policy for performance improvement. When the knowledge of user offloading energy consumption is not available prior to the offloading, we develop Bayesian learning-enabled WI policies, including maximum likelihood estimation, Bayesian learning with conjugate prior, and prior-swapping techniques. Simulation results show that the proposed policies significantly outperform the other existing policies.

cs.IT↗

arXiv2020

Beyond Cell-free MIMO: Energy Efficient Reconfigurable Intelligent Surface Aided Cell-free MIMO Communications

Cell-free systems can effectively eliminate the inter-cell interference by enabling multiple base stations (BSs) to cooperatively serve users without cell boundaries at the expense of high costs of hardware and power sources due to the large-scale deployment of BSs. To tackle this issue, the low-cost reconfigurable intelligent surface (RIS) can serve as a promising technique to improve the energy efficiency of cell-free systems. In this paper, we consider an RIS aided cell-free MIMO system where multiple RISs are deployed around BSs and users to create favorable propagation conditions via reconfigurable reflections in a low-cost way, thereby enhancing cell-free MIMO communications. To maximize the energy efficiency, a hybrid beamforming (HBF) scheme consisting of the digital beamforming at BSs and the RIS-based analog beamforming is proposed. The energy efficiency maximization problem is formulated and an iterative algorithm is designed to solve this problem. The impact of the transmit power, the number of RIS, and the RIS size on energy efficiency are investigated. Both theoretical analysis and simulation results reveal that the optimal energy efficiency depends on the numbers of RISs and the RIS size. Numerical evaluations also show that the proposed system can achieve a higher energy efficiency than conventional ones.

cs.IT↗

arXiv2020

Deep Residual Learning-Assisted Channel Estimation in Ambient Backscatter Communications

Channel estimation is a challenging problem for realizing efficient ambient backscatter communication (AmBC) systems. In this letter, channel estimation in AmBC is modeled as a denoising problem and a convolutional neural network-based deep residual learning denoiser (CRLD) is developed to directly recover the channel coefficients from the received noisy pilot signals. To simultaneously exploit the spatial and temporal features of the pilot signals, a novel three-dimension (3D) denoising block is specifically designed to facilitate denoising in CRLD. In addition, we provide theoretical analysis to characterize the properties of the proposed CRLD. Simulation results demonstrate that the performance of the proposed method approaches the performance of the optimal minimum mean square error (MMSE) estimator with perfect statistical channel correlation matrix.

cs.IT↗

arXiv2020

Deep Multi-Task Learning for Cooperative NOMA: System Design and Principles

Envisioned as a promising component of the future wireless Internet-of-Things (IoT) networks, the non-orthogonal multiple access (NOMA) technique can support massive connectivity with a significantly increased spectral efficiency. Cooperative NOMA is able to further improve the communication reliability of users under poor channel conditions. However, the conventional system design suffers from several inherent limitations and is not optimized from the bit error rate (BER) perspective. In this paper, we develop a novel deep cooperative NOMA scheme, drawing upon the recent advances in deep learning (DL). We develop a novel hybrid-cascaded deep neural network (DNN) architecture such that the entire system can be optimized in a holistic manner. On this basis, we construct multiple loss functions to quantify the BER performance and propose a novel multi-task oriented two-stage training method to solve the end-to-end training problem in a self-supervised manner. The learning mechanism of each DNN module is then analyzed based on information theory, offering insights into the proposed DNN architecture and its corresponding training method. We also adapt the proposed scheme to handle the power allocation (PA) mismatch between training and inference and incorporate it with channel coding to combat signal deterioration. Simulation results verify its advantages over orthogonal multiple access (OMA) and the conventional cooperative NOMA scheme in various scenarios.

cs.IT↗

arXiv2020

Optimizing Information Freshness via Multiuser Scheduling with Adaptive NOMA/OMA

This paper considers a wireless network with a base station (BS) conducting timely status updates to multiple clients via adaptive non-orthogonal multiple access (NOMA)/orthogonal multiple access (OMA). Specifically, the BS is able to adaptively switch between NOMA and OMA for the downlink transmission to optimize the information freshness of the network, characterized by the Age of Information (AoI) metric. If the BS chooses OMA, it can only serve one client within each time slot and should decide which client to serve; if the BS chooses NOMA, it can serve more than one client at the same time and needs to decide the power allocated to the served clients. For the simple two-client case, we formulate a Markov Decision Process (MDP) problem and develop the optimal policy for the BS to decide whether to use NOMA or OMA for each downlink transmission based on the instantaneous AoI of both clients. The optimal policy is shown to have a switching-type property with obvious decision switching boundaries. A near-optimal policy with lower computation complexity is also devised. For the more general multi-client scenario, inspired by the proposed near-optimal policy, we formulate a nonlinear optimization problem to determine the optimal power allocated to each client by maximizing the expected AoI drop of the network in each time slot. We resolve the formulated problem by approximating it as a convex optimization problem. We also derive the upper bound of the gap between the approximate convex problem and the original nonlinear, nonconvex problem. Simulation results validate the effectiveness of the adopted approximation. The performance of the adaptive NOMA/OMA scheme by solving the convex optimization is shown to be close to that of max-weight policy solved by exhaustive search...

cs.IT↗

arXiv2020

On the Latency, Rate and Reliability Tradeoff in Wireless Networked Control Systems for IIoT

Wireless networked control systems (WNCSs) provide a key enabling technique for Industry Internet of Things (IIoT). However, in the literature of WNCSs, most of the research focuses on the control perspective, and has considered oversimplified models of wireless communications which do not capture the key parameters of a practical wireless communication system, such as latency, data rate and reliability. In this paper, we focus on a WNCS, where a controller transmits quantized and encoded control codewords to a remote actuator through a wireless channel, and adopt a detailed model of the wireless communication system, which jointly considers the inter-related communication parameters. We derive the stability region of the WNCS. If and only if the tuple of the communication parameters lies in the region, the average cost function, i.e., a performance metric of the WNCS, is bounded. We further obtain a necessary and sufficient condition under which the stability region is $n$-bounded, where $n$ is the control codeword blocklength. We also analyze the average cost function of the WNCS. Such analysis is non-trivial because the finite-bit control-signal quantizer introduces a non-linear and discontinuous quantization function which makes the performance analysis very difficult. We derive tight upper and lower bounds on the average cost function in terms of latency, data rate and reliability. Our analytical results provide important insights into the design of the optimal parameters to minimize the average cost within the stability region.

cs.IT↗

arXiv2020

Optimizing Information Freshness in Two-Way Relay Networks

In this paper, we investigate an amplify-and-forward (AF) based two-way cooperative status update system, where two sources aim to exchange status updates with each other as timely as possible with the help of a relay. Specifically, the relay receives the sum signal from the two sources in one time slot, and then amplifies and forwards the received signal to both the sources in the next time slot. We adopt a recently proposed concept, the age of information (AoI), to characterize the timeliness of the status updates. Assuming that the two sources are able to generate status updates at the beginning of each time slot (i.e., generate-at-will model), we derive a closed-form expression of the expected weighted sum AoI of the considered system. We further minimize the expected weighted sum AoI by optimizing the transmission power at each node under the peak power constraints. Simulation results corroborate the correctness of our theoretical analysis.

cs.IT↗

arXiv2020

Wireless Feedback Control with Variable Packet Length for Industrial IoT

The paper considers a wireless networked control system (WNCS), where a controller sends packets carrying control information to an actuator through a wireless channel to control a physical process for industrial-control applications. In most of the existing work on WNCSs, the packet length for transmission is fixed. However, from the channel-encoding theory, if a message is encoded into a longer codeword, its reliability is improved at the expense of longer delay. Both delay and reliability have great impact on the control performance. Such a fundamental delay-reliability tradeoff has rarely been considered in WNCSs. In this paper, we propose a novel WNCS, where the controller adaptively changes the packet length for control based on the current status of the physical process. We formulate a decision-making problem and find the optimal variable-length packet-transmission policy for minimizing the long-term average cost of the WNCSs. We derive a necessary and sufficient condition on the existence of the optimal policy in terms of the transmission reliabilities with different packet lengths and the control system parameter.

cs.IT↗

arXiv2020

Physical Layer Authentication for Non-Coherent Massive SIMO-Enabled Industrial IoT Communications

Achieving ultra-reliable, low-latency and secure communications is essential for realizing the industrial Internet of Things (IIoT). Non-coherent massive multiple-input multiple-output (MIMO) is one of promising techniques to fulfill ultra-reliable and low-latency requirements. In addition, physical layer authentication (PLA) technology is particularly suitable for secure IIoT communications thanks to its low-latency attribute. A PLA method for non-coherent massive single-input multiple-output (SIMO) IIoT communication systems is proposed in this paper. This method realizes PLA by embedding an authentication signal (tag) into a message signal, referred to as "message-based tag embedding". It is different from traditional PLA methods utilizing uniform power tags. We design the optimal tag embedding and optimize the power allocation between the message and tag signals to characterize the trade-off between the message and tag error performance. Numerical results show that the proposed message-based tag embedding PLA method is more accurate than the traditional uniform tag embedding method which has an unavoidable tag error floor close to 10%.

eess.SP↗

arXiv2020

Over-the-Air Computation Systems: Optimal Design with Sum-Power Constraint

Over-the-air computation (AirComp), which leverages the superposition property of wireless multiple-access channel (MAC) and the mathematical tool of function representation, has been considered as a promising technique for effective collection and computation of massive sensor data in wireless Big Data applications. In most of the existing work on AirComp, optimal system-parameter design is commonly considered under the peak-power constraint of each sensor. In this paper, we propose an optimal transmitter-receiver (Tx-Rx) parameter design problem to minimize the computation mean-squared error (MSE) of an AirComp system under the sum-power constraint of the sensors. We solve the non-convex problem and obtain a closed-form solution. Also, we investigate another problem that minimizes the sum power of the sensors under the constraint of computation MSE. Our results show that in both of the problems, the sensors with poor and good channel conditions should use less power than the ones with moderate channel conditions.

cs.IT↗