arXiv subjects

Xiaofeng Tao

Publications and source records attributed to Xiaofeng Tao.

71 records · Page 4Linked to original sources

arXiv2023

SemProtector: A Unified Framework for Semantic Protection in Deep Learning-based Semantic Communication Systems

Recently proliferated semantic communications (SC) aim at effectively transmitting the semantics conveyed by the source and accurately interpreting the meaning at the destination. While such a paradigm holds the promise of making wireless communications more intelligent, it also suffers from severe semantic security issues, such as eavesdropping, privacy leaking, and spoofing, due to the open nature of wireless channels and the fragility of neural modules. Previous works focus more on the robustness of SC via offline adversarial training of the whole system, while online semantic protection, a more practical setting in the real world, is still largely under-explored. To this end, we present SemProtector, a unified framework that aims to secure an online SC system with three hot-pluggable semantic protection modules. Specifically, these protection modules are able to encrypt semantics to be transmitted by an encryption method, mitigate privacy risks from wireless channels by a perturbation mechanism, and calibrate distorted semantics at the destination by a semantic signature generation method. Our framework enables an existing online SC system to dynamically assemble the above three pluggable modules to meet customized semantic protection requirements, facilitating the practical deployment in real-world SC systems. Experiments on two public datasets show the effectiveness of our proposed SemProtector, offering some insights of how we reach the goal of secrecy, privacy and integrity of an SC system. Finally, we discuss some future directions for the semantic protection.

cs.CR↗

arXiv2023

Physical-layer Adversarial Robustness for Deep Learning-based Semantic Communications

End-to-end semantic communications (ESC) rely on deep neural networks (DNN) to boost communication efficiency by only transmitting the semantics of data, showing great potential for high-demand mobile applications. We argue that central to the success of ESC is the robust interpretation of conveyed semantics at the receiver side, especially for security-critical applications such as automatic driving and smart healthcare. However, robustifying semantic interpretation is challenging as ESC is extremely vulnerable to physical-layer adversarial attacks due to the openness of wireless channels and the fragileness of neural models. Toward ESC robustness in practice, we ask the following two questions: Q1: For attacks, is it possible to generate semantic-oriented physical-layer adversarial attacks that are imperceptible, input-agnostic and controllable? Q2: Can we develop a defense strategy against such semantic distortions and previously proposed adversaries? To this end, we first present MobileSC, a novel semantic communication framework that considers the computation and memory efficiency in wireless environments. Equipped with this framework, we propose SemAdv, a physical-layer adversarial perturbation generator that aims to craft semantic adversaries over the air with the abovementioned criteria, thus answering the Q1. To better characterize the realworld effects for robust training and evaluation, we further introduce a novel adversarial training method SemMixed to harden the ESC against SemAdv attacks and existing strong threats, thus answering the Q2. Extensive experiments on three public benchmarks verify the effectiveness of our proposed methods against various physical adversarial attacks. We also show some interesting findings, e.g., our MobileSC can even be more robust than classical block-wise communication systems in the low SNR regime.

eess.SP↗

arXiv2023

Securing Semantic Communications with Physical-layer Semantic Encryption and Obfuscation

Deep learning based semantic communication(DLSC) systems have shown great potential of making wireless networks significantly more efficient by only transmitting the semantics of the data. However, the open nature of wireless channel and fragileness of neural models cause DLSC systems extremely vulnerable to various attacks. Traditional wireless physical layer key (PLK), which relies on reciprocal channel and randomness characteristics between two legitimate users, holds the promise of securing DLSC. The main challenge lies in generating secret keys in the static environment with ultra-low/zero rate. Different from prior efforts that use relays or reconfigurable intelligent surfaces (RIS) to manipulate wireless channels, this paper proposes a novel physical layer semantic encryption scheme by exploring the randomness of bilingual evaluation understudy (BLEU) scores in the field of machine translation, and additionally presents a novel semantic obfuscation mechanism to provide further physical layer protections. Specifically, 1) we calculate the BLEU scores and corresponding weights of the DLSC system. Then, we generate semantic keys (SKey) by feeding the weighted sum of the scores into a hash function. 2) Equipped with the SKey, our proposed subcarrier obfuscation is able to further secure semantic communications with a dynamic dummy data insertion mechanism. Experiments show the effectiveness of our method, especially in the static wireless environment.

cs.CR↗

arXiv2023

Boosting Physical Layer Black-Box Attacks with Semantic Adversaries in Semantic Communications

End-to-end semantic communication (ESC) system is able to improve communication efficiency by only transmitting the semantics of the input rather than raw bits. Although promising, ESC has also been shown susceptible to the crafted physical layer adversarial perturbations due to the openness of wireless channels and the sensitivity of neural models. Previous works focus more on the physical layer white-box attacks, while the challenging black-box ones, as more practical adversaries in real-world cases, are still largely under-explored. To this end, we present SemBLK, a novel method that can learn to generate destructive physical layer semantic attacks for an ESC system under the black-box setting, where the adversaries are imperceptible to humans. Specifically, 1) we first introduce a surrogate semantic encoder and train its parameters by exploring a limited number of queries to an existing ESC system. 2) Equipped with such a surrogate encoder, we then propose a novel semantic perturbation generation method to learn to boost the physical layer attacks with semantic adversaries. Experiments on two public datasets show the effectiveness of our proposed SemBLK in attacking the ESC system under the black-box setting. Finally, we provide case studies to visually justify the superiority of our physical layer semantic perturbations.

eess.SP↗

arXiv2023

Approaching Shannon's One-Time Pad: Metrics, Architectures, and Enabling Technologies

The rapid development of advanced computing technologies such as quantum computing imposes new challenges to current wireless security mechanism which is based on cryptographic approaches. To deal with various attacks and realize long-lasting security, we are in urgent need of disruptive security solutions. In this article, novel security transmission paradigms are proposed to approach Shannon's one-time pad perfect secrecy. First, two metrics, termed as Degree-of-Approaching (DoA) and Degree-of-Synchronous-Approaching (DoSA), are developed to characterize the closeness between the achieved security strength and perfect secrecy. These two metrics also serve as a guideline for secure transmission protocol design. After that, we present two paths towards Shannon's one-time pad, i.e., an explicit-encryption based approach and an implicit-encryption based approach. For both of them, we discuss the architecture design, enabling technologies, as well as preliminary performance evaluation results. The techniques presented in this article provide promising security-enhancing solutions for future wireless networks.

cs.CR↗

arXiv2018

Distributed Layered Grant-Free Non-Orthogonal Multiple Access for Massive MTC

Grant-free transmission is considered as a promising technology to support sporadic data transmission in massive machine-type communications (mMTC). Due to the distributed manner, high collision probability is an inherent drawback of grant-free access techniques. Non-orthogonal multiple access (NOMA) is expected to be used in uplink grant-free transmission, multiplying connection opportunities by exploiting power domain resources. However, it is usually applied for coordinated transmissions where the base station performs coordination with full channel state information, which is not suitable for grant-free techniques. In this paper, we propose a novel distributed layered grant-free NOMA framework. Under this framework, we divide the cell into different layers based on predetermined inter-layer received power difference. A distributed layered grant-free NOMA based hybrid transmission scheme is proposed to reduce collision probability. Moreover, we derive the closed-form expression of connection throughput. A joint access control and NOMA layer selection (JACNLS) algorithm is proposed to solve the connection throughput optimization problem. The numerical and simulation results reveal that, when the system is overloaded, our proposed scheme outperforms the grant-free-only scheme by three orders of magnitude in terms of expected connection throughput and outperforms coordinated OMA transmission schemes by 31.25\% with only 0.0189\% signaling overhead of the latter.

cs.IT↗

arXiv2018

Energy-Efficient Adaptive Transmission in Machine Type Communications with Delay-Outage Constraints

In this paper, we propose a novel Adaptive Transmission Strategy to improve energy efficiency~(EE) in a wireless point-to-point transmission system with Quality of Service~(QoS) requirement, i.e., delay-outage probability considered. The transmitter is scheduled to use the channel that has better coefficients, and is forced into silent state when the channel suffers deep fading. The proposed strategy can be easily implemented by applying two-mode circuitry and is suitable for massive machine type communications (MTC) scenarios. In order to enhance EE, we formulate an EE maximization problem, which has a single optimum under a loose QoS constraint. We also show that the maximization problem can be solved efficiently by a binary search algorithm. Simulations demonstrate that our proposed strategy can obtain significant EE gains, hence confirming our theoretical analysis.

cs.IT↗

arXiv2018

Effective Capacity Analysis in Ultra-Dense Wireless Networks with Random Interference

Ultra-dense networks (UDNs) provide a promising paradigm to cope with exponentially increasing mobile traffic. However, little work has to date considered unsaturated traffic with quality-of-service (QoS) requirements. This paper presents a new cross-layer analytical model to capture the unsaturated traffic of a UDN in the presence of QoS requirements. The effective capacity (EC) of the UDN is derived, taking into account small-scale channel fading and possible interference. Key properties of the EC are revealed. The amount of traffic impacts effective capacity of the UDN due to the sophisticated interactions among small base stations operating in the same frequency. The maximization of total effective capacity is formulated as a non-cooperative game in the paper. The best-response function is derived, iteratively searching the Nash equilibrium point. System simulation results indicate that our proposed model is accurate. The simulations also show the maximum allowed arrival rate with the QoS guarantee, compared with the full interference model.

cs.IT↗

arXiv2018

Use of Two-Mode Circuitry and Optimal Energy-Efficient Power Control Under Target Delay-Outage Constraints

An accurate energy efficiency analytical model based on a two-mode circuitry was recently proposed; and the model showed that the use of this circuitry can significantly improve a system's energy efficiency. In this paper, we use this analytical model to develop a new power control scheme, a scheme that is capable of allocating a minimum transmission power precisely within the delay-outage probability constraint. Precision brings substantial benefits as numerical results show that the energy efficiency using our scheme is much higher than other schemes. Results further suggest that data rate values affect energy efficiency non-uniformly, i.e., there exists a specific data rate value that achieves maximum energy efficiency.

eess.SP↗

arXiv2018

Dense Small Cell Networks: From Noise-Limited to Dense Interference-Limited

Considering both non-line-of-sight (NLoS) and line-of-sight (LoS) transmissions, the transitional behaviors from noise-limited regime to dense interference-limited regime have been investigated for the fifth generation (5G) small cell networks (SCNs). Besides, we identify four performance regimes based on base station (BS) density, i.e., (i) the noise-limited regime, (ii) the signal-dominated regime, (iii) the interference-dominated regime, and (iv) the interference-limited regime. To characterize the performance regime, we propose a unified framework analyzing the future 5G wireless networks over generalized shadowing/fading channels, in which the user association schemes based on the strongest instantaneous received power (SIRP) and the strongest average received power (SARP) can be studied, while NLoS/LoS transmissions and multi-slop path loss model are considered. Simulation results indicate that different factors, i.e., noise, desired signal, and interference, successively and separately dominate the network performance with the increase of BS density. Hence, our results shed new light on the design and management of SCNs in urban and rural areas with different BS deployment densities.

cs.NI↗

arXiv2017

Preserving Reliability to Heterogeneous Ultra-Dense Distributed Networks in Unlicensed Spectrum

This article investigates the prominent dilemma between capacity and reliability in heterogeneous ultra-dense distributed networks, and advocates a new measure of effective capacity to quantify the maximum sustainable data rate of a link while preserving the quality-of-service (QoS) of the link in such networks. Recent breakthroughs are brought forth in developing the theory of the effective capacity in heterogeneous ultra-dense distributed networks. Potential applications of the effective capacity are demonstrated on the admission control, power control and resource allocation of such networks, with substantial gains revealed over existing technologies. This new measure is of particular interest to ultra-dense deployment of the emerging fifth-generation (5G) wireless networks in the unlicensed spectrum, leveraging the capacity gain brought by the use of the unlicensed band and the stringent reliability sustained by 5G in future heterogeneous network environments.

cs.IT↗

arXiv2017

Optimal Allocation of Power Pool for Two-Cell Single-User Joint Transmission

Joint transmission is a kind of cooperative transmission technology, which converts other cell interference into signal. In this letter, for single-user joint transmission, we propose that a power pool can be created in order to increase the system sum-rate or lower the power consumption. Then, we investigate the sum-rate maximization problem under this framework. Since it is impossible that subchannel gains for the two base stations are identical, we can obtain a much more concise structure and reduce variables to the half of original problem. And that the closed-form water-filling solution is unique and global optimum, because it is a convex optimization problem. Compared to the power allocation without pooling, the performance gain is verified by simulation.

cs.IT↗

arXiv2017

Power Allocation and Scheduling for Two-Cell Distributed Interference Subtraction System

This letter studies the power allocation and scheduling problem in two-cell distributed interference subtraction system. Through the interference is cancelled at one receiver side and the analysis of objective function monotony, our key result is the decoupling of power allocation and scheduling without loss of optimality. Simulation exhibits the significant gains of our proposed algorithm over open-loop power allocation with non-cooperation proportional fair scheduling.

cs.IT↗

arXiv2017

Cooperative Content Offloading Through WiFi and Mobile Device-to-Device Networks

This paper investigates the use of WiFi and mobile device-to-device networks, with vehicular ad hoc networks being a typical example, as a complementary means to offload and reduce the traffic load of cellular networks. A novel cooperative content dissemination strategy is proposed for a heterogeneous network consisting of different types of devices with different levels of mobility, ranging from static WiFi access points to mobile devices such as vehicles. The proposed strategy offloads a significant proportion of data traffic from cellular networks to WiFi or device-to-device networks. Detailed analysis is provided for the content dissemination process in heterogeneous networks adopting the strategy. On that basis, the optimal parameter settings for the content dissemination strategy are discussed. Simulation and numerical studies show that the proposed strategy effectively reduces data traffic for cellular networks while guaranteeing successful content delivery.

cs.NI↗

arXiv2014

Joint Multi-Cell Resource Allocation Using Pure Binary-Integer Programming for LTE Uplink

Due to high system capacity requirement, 3GPP Long Term Evolution (LTE) is likely to adopt frequency reuse factor 1 at the cost of suffering severe inter-cell interference (ICI). One of combating ICI strategies is network cooperation of resource allocation (RA). For LTE uplink RA, requiring all the subcarriers to be allocated adjacently complicates the RA problem greatly. This paper investigates the joint multi-cell RA problem for LTE uplink. We model the uplink RA and ICI mitigation problem using pure binary-integer programming (BIP), with integrative consideration of all users' channel state information (CSI). The advantage of the pure BIP model is that it can be solved by branch-and-bound search (BBS) algorithm or other BIP solving algorithms, rather than resorting to exhaustive search. The system-level simulation results show that it yields 14.83% and 22.13% gains over single-cell optimal RA in average spectrum efficiency and 5th percentile of user throughput, respectively.

cs.IT↗

arXiv2014

Transport Capacity of Distributed Wireless CSMA Networks

In this paper, we study the transport capacity of large multi-hop wireless CSMA networks. Different from previous studies which rely on the use of centralized scheduling algorithm and/or centralized routing algorithm to achieve the optimal capacity scaling law, we show that the optimal capacity scaling law can be achieved using entirely distributed routing and scheduling algorithms. Specifically, we consider a network with nodes Poissonly distributed with unit intensity on a $\sqrt{n}\times\sqrt{n}$ square $B_{n}\subset\Re^{2}$. Furthermore, each node chooses its destination randomly and independently and transmits following a CSMA protocol. By resorting to the percolation theory and by carefully tuning the three controllable parameters in CSMA protocols, i.e. transmission power, carrier-sensing threshold and count-down timer, we show that a throughput of $Θ\left(\frac{1}{\sqrt{n}}\right)$ is achievable in distributed CSMA networks. Furthermore, we derive the pre-constant preceding the order of the transport capacity by giving an upper and a lower bound of the transport capacity. The tightness of the bounds is validated using simulations.

cs.NI↗

arXiv2012

On Providing Downlink Services in Collocated Spectrum-Sharing Macro and Femto Networks

Femtocells have been considered by the wireless industry as a cost-effective solution not only to improve indoor service providing, but also to unload traffic from already overburdened macro networks. Due to spectrum availability and network infrastructure considerations, a macro network may have to share spectrum with overlaid femtocells. In spectrum-sharing macro and femto networks, inter-cell interference caused by different transmission powers of macrocell base stations (MBS) and femtocell access points (FAP), in conjunction with potentially densely deployed femtocells, may create dead spots where reliable services cannot be guaranteed to either macro or femto users. In this paper, based on a thorough analysis of downlink (DL) outage probabilities (OP) of collocated spectrum-sharing orthogonal frequency division multiple access (OFDMA) based macro and femto networks, we devise a decentralized strategy for an FAP to self-regulate its transmission power level and usage of radio resources depending on its distance from the closest MBS. Simulation results show that the derived closed-form lower bounds of DL OPs are tight, and the proposed decentralized femtocell self-regulation strategy is able to guarantee reliable DL services in targeted macro and femto service areas while providing superior spatial reuse, for even a large number of spectrum-sharing femtocells deployed per cell site.

cs.NI↗