arXiv subjects

Xiaobo Zhou

Publications and source records attributed to Xiaobo Zhou.

At least 37 records · Page 2Linked to original sources

arXiv2023

UAV Deployment Optimization for Secure Precise Wireless Transmission

This paper develops an unmanned aerial vehicle (UAV) deployment scheme in the context of the directional modulation-based secure precise wireless transmissions (SPWTs), where the optimal UAV position for the SPWT is derived to maximum the secrecy rate (SR) without injecting any artificial noise (AN) signaling. To be specific, the proposed scheme reveals that the optimal position of UAV for maximizing the SR performance has to be placed at the null space of Eves channel, which impels the received energy of the confidential message at the unintended receiver deteriorating to zero whilst benefits the one at the intended receiver achieving its maximum value. Finally, simulation results verify the optimality of our proposed scheme in terms of the achievable SR performance.

eess.SP↗

arXiv2022

AI assisted method for efficiently generating breast ultrasound screening reports

Background: Ultrasound is one of the preferred choices for early screening of dense breast cancer. Clinically, doctors have to manually write the screening report which is time-consuming and laborious, and it is easy to miss and miswrite. Aim: We proposed a new pipeline to automatically generate AI breast ultrasound screening reports based on ultrasound images, aiming to assist doctors in improving the efficiency of clinical screening and reducing repetitive report writing. Methods: AI was used to efficiently generate personalized breast ultrasound screening preliminary reports, especially for benign and normal cases which account for the majority. Based on the preliminary AI report, doctors then make simple adjustments or corrections to quickly generate the final report. The approach has been trained and tested using a database of 4809 breast tumor instances. Results: Experimental results indicate that this pipeline improves doctors' work efficiency by up to 90%, which greatly reduces repetitive work. Conclusion: Personalized report generation is more widely recognized by doctors in clinical practice compared with non-intelligent reports based on fixed templates or containing options to fill in the blanks.

eess.IV↗

arXiv2022

Intelligent Reflecting Surface (IRS)-Aided Covert Wireless Communications with Delay Constraint

This work examines the performance gain achieved by deploying an intelligent reflecting surface (IRS) in covert communications. To this end, we formulate the joint design of the transmit power and the IRS reflection coefficients by taking into account the communication covertness for the cases with global channel state information (CSI) and without a warden's instantaneous CSI. For the case of global CSI, we first prove that perfect covertness is achievable with the aid of the IRS even for a single-antenna transmitter, which is impossible without an IRS. Then, we develop a penalty successive convex approximation (PSCA) algorithm to tackle the design problem. Considering the high complexity of the PSCA algorithm, we further propose a low-complexity two-stage algorithm, where analytical expressions for the transmit power and the IRS's reflection coefficients are derived. For the case without the warden's instantaneous CSI, we first derive the covertness constraint analytically facilitating the optimal phase shift design. Then, we consider three hardware-related constraints on the IRS's reflection amplitudes and determine their optimal designs together with the optimal transmit power. Our examination shows that significant performance gain can be achieved by deploying an IRS into covert communications.

cs.IT↗

arXiv2021

IRS-Aided WPCNs: A New Optimization Framework for Dynamic IRS Beamforming

In this paper, we propose a new dynamic IRS beamforming framework to boost the sum throughput of an intelligent reflecting surface (IRS) aided wireless powered communication network (WPCN). Specifically, the IRS phase-shift vectors across time and resource allocation are jointly optimized to enhance the efficiencies of both downlink wireless power transfer (DL WPT) and uplink wireless information transmission (UL WIT) between a hybrid access point (HAP) and multiple wirelessly powered devices. To this end, we first study three special cases of the dynamic IRS beamforming,namely user-adaptive IRS beamforming, UL-adaptive IRS beamforming, and static IRS beamforming,by characterizing their optimal performance relationships and proposing corresponding algorithms. Interestingly, it is rigorously proved that the latter two cases achieve the same throughput, thus helping halve the number of IRS phase shifts to be optimized and signalling overhead practically required for UL-adaptive IRS beamforming. Then, we propose a general optimization framework for dynamic IRS beamforming, which is applicable for any given number of IRS phase-shift vectors available. Despite of the non-convexity of the general problem with highly coupled optimization variables, we propose two algorithms to solve it and particularly, the low-complexity algorithm exploits the intrinsic structure of the optimal solution as well as the solutions to the cases with user-adaptive and static IRS beamforming. Simulation results validate our theoretical findings, illustrate the practical significance of IRS with dynamic beamforming for spectral and energy efficient WPCNs, and demonstrate the effectiveness of our proposed designs over various benchmark schemes.

cs.IT↗

arXiv2021

Memory at Your Service: Fast Memory Allocation for Latency-critical Services

Co-location and memory sharing between latency-critical services, such as key-value store and web search, and best-effort batch jobs is an appealing approach to improving memory utilization in multi-tenant datacenter systems. However, we find that the very diverse goals of job co-location and the GNU/Linux system stack can lead to severe performance degradation of latency-critical services under memory pressure in a multi-tenant system. We address memory pressure for latency-critical services via fast memory allocation and proactive reclamation. We find that memory allocation latency dominates the overall query latency, especially under memory pressure. We analyze the default memory management mechanism provided by GNU/Linux system stack and identify the reasons why it is inefficient for latency-critical services in a multi-tenant system. We present Hermes, a fast memory allocation mechanism in user space that adaptively reserves memory for latency-critical services. It advises Linux OS to proactively reclaim memory of batch jobs. We implement Hermes in GNU C Library. Experimental result shows that Hermes reduces the average and the $99^{th}$ percentile memory allocation latency by up to 54.4% and 62.4% for a micro benchmark, respectively. For two real-world latency-critical services, Hermes reduces both the average and the $99^{th}$ percentile tail query latency by up to 40.3%. Compared to the default Glibc, jemalloc and TCMalloc, Hermes reduces Service Level Objective violation by up to 84.3% under memory pressure.

cs.DC↗

arXiv2021

Intelligent Reflecting Surface for Wireless Communication Security and Privacy

Intelligent reflection surface (IRS) is emerging as a promising technique for future wireless communications. Considering its excellent capability in customizing the channel conditions via energy-focusing and energy-nulling, it is an ideal technique for enhancing wireless communication security and privacy, through the theories of physical layer security and covert communications, respectively. In this article, we first present some results on applying IRS to improve the average secrecy rate in wiretap channels, to enable perfect communication covertness, and to deliberately create extra randomness in wireless propagations for hiding active wireless transmissions. Then, we identify multiple challenges for future research to fully unlock the benefits offered by IRS in the context of physical layer security and covert communications. With the aid of extensive numerical studies, we demonstrate the necessity of designing the amplitudes of the IRS elements in wireless communications with the consideration of security and privacy, where the optimal values are not always $1$ as commonly adopted in the literature. Furthermore, we reveal the tradeoff between the achievable secrecy performance and the estimation accuracy of the IRS's channel state information (CSI) at both the legitimate and malicious users, which presents the fundamental resource allocation challenge in the context of IRS-aided physical layer security. Finally, a passive channel estimation methodology exploiting deep neural networks and scene images is discussed as a potential solution to enabling CSI availability without utilizing resource-hungry pilots. This methodology serves as a visible pathway to significantly improving the covert communication rate in IRS-aided wireless networks.

cs.IT↗

arXiv2021

IRS-Assisted Wireless Powered NOMA: Do We Really Need Different Phase Shifts in DL and UL?

Intelligent reflecting surface (IRS) is a promising technology to improve the performance of wireless powered communication networks (WPCNs) due to its capability to reconfigure signal propagation environments via smart reflection. In particular, the high passive beamforming gain promised by IRS can significantly enhance the efficiency of both downlink wireless power transfer (DL WPT) and uplink wireless information transmission (UL WIT) in WPCNs. Although adopting different IRS phase shifts for DL WPT and UL WIT, i.e., dynamic IRS beamforming, is in principle possible but incurs additional signaling overhead and computational complexity, it is an open problem whether it is actually beneficial. To answer this question, we consider an IRS-assisted WPCN where multiple devices employ a hybrid access point (HAP) to first harvest energy and then transmit information using non-orthogonal multiple access (NOMA). Specifically, we aim to maximize the sum throughput of all devices by jointly optimizing the IRS phase shifts and the resource allocation. To this end, we first prove that dynamic IRS beamforming is not needed for the considered system, which helps reduce the number of IRS phase shifts to be optimized. Then, we propose both joint and alternating optimization based algorithms to solve the resulting problem. Simulation results demonstrate the effectiveness of our proposed designs over benchmark schemes and also provide useful insights into the importance of IRS for realizing spectrally and energy efficient WPCNs.

cs.IT↗

arXiv2020

Low-complexity and High-performance Receive Beamforming for Secure Directional Modulation Networks against an Eavesdropping-enabled Full-duplex Attacker

In this paper, we present a novel scenario for directional modulation (DM) networks with a full-duplex (FD) malicious attacker (Mallory), where Mallory can eavesdrop the confidential message from Alice to Bob and simultaneously interfere Bob by sending a jamming signal. Considering that the jamming plus noise at Bob is colored, an enhanced receive beamforming (RBF), whitening-filter-based maximum ratio combining (MRC) (WFMRC), is proposed. Subsequently, two RBFs of maximizing the secrecy rate (Max-SR) and minimum mean square error (MMSE) are presented to show the same performance as WFMRC. To reduce the computational complexity of conventional MMSE, a low-complexity MMSE is also proposed. Eventually, to completely remove the jamming signal from Mallory and transform the residual interference plus noise to a white one, a new RBF, null-space projection (NSP) based maximizing WF receive power, called NSP-based Max-WFRP, is also proposed. From simulation results, we find that the proposed Max-SR, WFMRC, and low-complexity MMSE have the same SR performance as conventional MMSE, and achieve the best performance while the proposed NSP-based Max-WFRP performs better than MRC in the medium and high signal-to-noise ratio regions. Due to its low-complexity,the proposed low-complexity MMSE is very attractive. More important, the proposed methods are robust to the change in malicious jamming power compared to conventional MRC.

cs.IT↗

arXiv2020

Secure Multigroup Multicast Communication Systems via Intelligent Reflecting Surface

This paper considers a secure multigroup multicast multiple-input single-output (MISO) communication system aided by an intelligent reflecting surface (IRS). Specifically, we aim to minimize the transmit power at the Alice via jointly optimizing the transmit beamformer, AN vector and phase shifts at the IRS subject to the secrecy rate constraints as well as the unit modulus constraints of IRS phase shifts. However, the optimization problem is non-convex and directly solving it is intractable. To tackle the optimization problem, we first transform it into a semidefinite relaxation (SDR) problem, and then alternately update the transmit beamformer and AN matrix as well as the phase shifts at the IRS. In order to reduce the high computational complexity, we further propose a low-complexity algorithm based on second-order cone programming (SOCP). We decouple the optimization problem into two sub-problems and optimize the transmit beamformer, AN vector and the phase shifts alternately by solving two corresponding SOCP sub-problem. Simulation results show that the proposed SDR and SOCP schemes require half or less transmit power than the scheme without IRS, which demonstrates the advantages of introducing IRS and the effectiveness of the proposed methods.

eess.SP↗

arXiv2020

UAV-enabled Secure Communication with Finite Blocklength

In the finite blocklength scenario, which is suitable for practical applications, a method of maximizing the average effective secrecy rate (AESR) is proposed for a UAV-enabled secure communication by optimizing the UAV's trajectory and transmit power subject to the UAV's mobility constraints and transmit power constraints. To address the formulated non-convex optimization problem, it is first decomposed into two non-convex subproblems. Then the two subproblems are converted respectively into two convex subproblems via the first-order approximation. Finally, an alternating iteration algorithm is developed by solving the two subproblems iteratively using successive convex approximation (SCA) technique. Numerical results show that our proposed scheme achieves a better AESR performance than both the benchmark schemes.

eess.SP↗

arXiv2020

UAV-Enabled Confidential Data Collection in Wireless Networks

This work, for the first time, considers confidential data collection in the context of unmanned aerial vehicle (UAV) wireless networks, where the scheduled ground sensor node (SN) intends to transmit confidential information to the UAV without being intercepted by other unscheduled ground SNs. Specifically, a full-duplex (FD) UAV collects data from each scheduled SN on the ground and generates artificial noise (AN) to prevent the scheduled SN's confidential information from being wiretapped by other unscheduled SNs. We first derive the reliability outage probability (ROP) and secrecy outage probability (SOP) of a considered fixed-rate transmission, based on which we formulate an optimization problem that maximizes the minimum average secrecy rate (ASR) subject to some specific constraints. We then transform the formulated optimization problem into a convex problem with the aid of first-order restrictive approximation technique and penalty method. The resultant problem is a generalized nonlinear convex programming (GNCP) and solving it directly still leads to a high complexity, which motivates us to further approximate this problem as a second-order cone program (SOCP) in order to reduce the computational complexity. Finally, we develop an iteration procedure based on penalty successive convex approximation (P-SCA) algorithm to pursue the solution to the formulated optimization problem. Our examination shows that the developed joint design achieves a significant performance gain compared to a benchmark scheme.

eess.SP↗

arXiv2019

GuardRider: Towards Sustainable Backscattering System over WiFi in the Wild

The WiFi backscatter communications offer ultra-low power and ubiquitous connections for IoT systems. Caused by the intermittent-nature of the WiFi traffics, state-of-the-art WiFi backscatter communications are not reliable for backscatter link or simple for tag to do adaptive transmission. In order to build sustainable (reliable and simple) WiFi backscatter communications, we present GuardRider, a WiFi backscatter system that enables backscatter communications riding on WiFi signals in the wild. The key contribution of GuardRider is an optimization algorithm of designing RS codes to follow the statistical knowledge of WiFi traffics and adjust backscatter transmission. With GuardRider, the reliable baskscatter link is guaranteed and a backscatter tag is able to adaptively transmit information without heavily listening the excitation channel. We built a hardware prototype of GuardRider using a customized tag with FPGA implementation. Both the simulations and field experiments verify that GuardRider could achieve a notably gains in bit error rate and frame error rate, which are hundredfold reduction in simulations and around 99% in filed experiments.

eess.SP↗

arXiv2019

Enhanced Secure Wireless Information and Power Transfer via Intelligent Reflecting Surface

In this paper, secure wireless information and power transfer with intelligent reflecting surface (IRS) is proposed for a multiple-input single-output (MISO) system. Under the secrecy rate (SR) and the reflecting phase shifts of IRS constraints, the secure transmit beamforming at access point (AP) and phase shifts at IRS are jointly optimized to maximize the harvested power of energy harvesting receiver (EHR). Due to the non-convexity of optimization problem and coupled optimization variables, firstly, we convert the optimization problem into a semidefinite relaxation (SDR) problem and a sub-optimal solution is achieved. To reduce the high-complexity of the proposed SDR method, a low-complexity successive convex approximation (SCA) technique is proposed. Simulation results show the power harvested by the proposed SDR and SCA methods approximately double that of the existing method without IRS given the same SR. In particular, the proposed SCA achieves almost the same performance as the proposed SDR but with a much lower complexity.

eess.SP↗

arXiv2019

UAV-Enabled Uplink Non-Orthogonal Multiple Access System: Joint Deployment and Power Control

In order to overcome the inherent latency in multi-user unmanned aerial vehicle (UAV) networks with orthogonal multiple access (OMA). In this paper, we investigate the UAV enabled uplink non-orthogonal multiple access (NOMA) network, where a UAV is deployed to collect the messages transmitted by ground users. In order to maximize the sum rate of all users and to meet the quality of service (QoS) requirement, we formulate an optimization problem, in which the UAV deployment position and the power control are jointly optimized. This problem is non-convex and some variables are binary, and thus it is a typical NP hard problem. In this paper, an iterative algorithm is proposed with the assistance of successive convex approximate (SCA) technique and the penalty function method. In order to reduce the high computational complexity of the iterative algorithm, a low complexity approximation algorithm is then proposed, which can achieve a similar performance compared to the iterative algorithm. Compared with OMA scheme and conventional NOMA scheme, numerical results show that our proposed algorithms can efficiently improve the sum rate.

eess.SP↗

arXiv2019

Joint Optimization of a UAV's Trajectory and Transmit Power for Covert Communications

This work considers covert communications in the context of unmanned aerial vehicle (UAV) networks, aiming to hide a UAV for transmitting critical information out of a scenario that is monitored and where communication is not allowed. Specifically, the UAV as a transmitter intends to transmit information to a legitimate receiver (Bob) covertly in order to avoid being detected by a warden (Willie) with location uncertainties at Bob and/or Willie. In order to enhance the considered covert communication performance, we prefer to jointly optimize the UAV's trajectory and transmit power in terms of maximizing the average covert transmission rate from the UAV to Bob subject to transmission outage constraint and covertness constraint. The formulated optimization problem is difficult to tackle directly due to the intractable constraints. As such, we first employ conservative approximation to transform a constraint into a deterministic form and then apply the first-order restrictive approximation to transform the optimization problem into a convex form. By applying the successive convex approximation (SCA) technique, an efficient iterative algorithm is developed to solve the optimization problem. Our examination shows that the developed joint trajectory and transmit power optimization scheme achieves significantly better covert communication performance as compared to a benchmark scheme.

cs.IT↗

arXiv2019

UAV-Enabled Covert Wireless Data Collection

This work considers unmanned aerial vehicle (UAV) networks for collecting data covertly from ground users. The full-duplex UAV intends to gather critical information from a scheduled user (SU) through wireless communication and generate artificial noise (AN) with random transmit power in order to ensure a negligible probability of the SU's transmission being detected by the unscheduled users (USUs). To enhance the system performance, we jointly design the UAV's trajectory and its maximum AN transmit power together with the user scheduling strategy subject to practical constraints, e.g., a covertness constraint, which is explicitly determined by analyzing each USU's detection performance, and a binary constraint induced by user scheduling. The formulated design problem is a mixed-integer non-convex optimization problem, which is challenging to solve directly, but tackled by our developed penalty successive convex approximation (P-SCA) scheme. An efficient UAV trajectory initialization is also presented based on the Successive Hover-and-Fly (SHAF) trajectory, which also serves as a benchmark scheme. Our examination shows the developed P-SCA scheme significantly outperforms the benchmark scheme in terms of achieving a higher max-min average transmission rate from all the SUs to the UAV.

eess.SP↗

arXiv2019

DC-AL GAN: Pseudoprogression and True Tumor Progression of Glioblastoma Multiform Image Classification Based on DCGAN and AlexNet

Pseudoprogression (PsP) occurs in 20-30% of patients with glioblastoma multiforme (GBM) after receiving the standard treatment. In the course of post-treatment magnetic resonance imaging (MRI), PsP exhibits similarities in shape and intensity to the true tumor progression (TTP) of GBM. So, these similarities pose challenges on the differentiation of these types of progression and hence the selection of the appropriate clinical treatment strategy. In this paper, we introduce DC-AL GAN, a novel feature learning method based on deep convolutional generative adversarial network (DCGAN) and AlexNet, to discriminate between PsP and TTP in MRI images. Due to the adversarial relationship between the generator and the discriminator of DCGAN, high-level discriminative features of PsP and TTP can be derived for the discriminator with AlexNet. Also, a feature fusion scheme is used to combine higher-layer features with lower-layer information, leading to more powerful features that are used for effectively discriminating between PsP and TTP. The experimental results show that DC-AL GAN achieves desirable PsP and TTP classification performance that is superior to other state-of-the-art methods.

cs.CV↗

arXiv2019

Optimal Power Allocation for Secure Directional Modulation Networks with a Full-duplex UAV User

This paper make an investigation of a secure unmanned aerial vehicle (UAV)-aided communication network based on directional modulation(DM), in which one ground base station (Alice), one legitimate full-duplex (FD) user (Bob) and one illegal receiver (Eve) are involved. In this network, Alice acts as a control center to transmit confidential message and artificial noise (AN). The UAV user, moving along a linear flight trajectory, is intended to receive the useful information from Alice. At the same time, it also sends AN signals to further interference Eve's channel. Aiming at maximizing secrecy rate during the UAV flight process, a joint optimization problem is formulated corresponding to power allocation (PA) factors, beamforming vector, AN projection matrices. For simplicity, maximum ratio transmission, null-space projection and the leakage-based method are applied to form the transmit beamforming vector, AN projection matrix at Alice, and AN projection vector at Bob, respectively. Following this, the optimization problem reduces into a bivariate optimization programme with two PA factors. We put forward an alternating iterative algorithm to optimize the two PA factors. Simulation results demonstrate that the proposed strategy for FD mode achieves a higher SR than the half-duplex (HD) mode, and outperforms the FD mode with fixed PA strategy.

cs.IT↗