Searcharxiv⌕ Search

arXiv subjects

Zhangdui Zhong

Publications and source records attributed to Zhangdui Zhong.

At least 73 records · Page 4Linked to original sources

Solving Sparse Linear Inverse Problems in Communication Systems: A Deep Learning Approach With Adaptive Depth

Sparse signal recovery problems from noisy linear measurements appear in many areas of wireless communications. In recent years, deep learning (DL) based approaches have attracted interests of researchers to solve the sparse linear inverse problem by unfolding iterative algorithms as neural networks. Typically, research concerning DL assume a fixed number of network layers. However, it ignores a key character in traditional iterative algorithms, where the number of iterations required for convergence changes with varying sparsity levels. By investigating on the projected gradient descent, we unveil the drawbacks of the existing DL methods with fixed depth. Then we propose an end-to-end trainable DL architecture, which involves an extra halting score at each layer. Therefore, the proposed method learns how many layers to execute to emit an output, and the network depth is dynamically adjusted for each task in the inference phase. We conduct experiments using both synthetic data and applications including random access in massive MTC and massive MIMO channel estimation, and the results demonstrate the improved efficiency for the proposed approach.

eess.SP↗

Physical Layer Security in UAV Systems: Challenges and Opportunities

Unmanned aerial vehicle (UAV) wireless communications have experienced an upsurge of interest in both military and civilian applications, due to its high mobility, low cost, on-demand deployment, and inherent line-of-sight (LoS) air-to-ground channels. However, these benefits also make UAV wireless communication systems vulnerable to malicious eavesdropping attacks. In this article, we aim to examine the physical layer security issues in UAV systems. In particular, passive and active eavesdroppings are two primary attacks in UAV systems. We provide an overview on emerging techniques, such as trajectory design, resource allocation, and cooperative UAVs, to fight against both types of eavesdroppings in UAV wireless communication systems. Moreover, the applications of non-orthogonal multiple access, multiple-input and multiple-output, and millimeter wave in UAV systems are also proposed to improve the system spectral efficiency and to guarantee security simultaneously. Finally, we discuss some potential research directions and challenges in terms of physical layer security in UAV systems.

cs.IT↗

Probabilistic Two-Ray Model for Air-to-Air Channel in Built-Up Areas

In this paper, we present a probabilistic two-ray (PTR) path loss model for air-to-air (AA) propagation channel in built-up areas. Based on the statistical model of city deployment, the PTR path loss model can be applied to suburban, urban, dense urban, and high-rise urban. The path loss is optimally fitted as the Weibull distribution and its fluctuation is fitted as the Normal distribution in ray-tracing simulations. The good agreements between our model and ray tracing indicate the proposed model can provide a useful tool for accurate and quick prediction for aerial platforms. As an extended research of PTR model, we extract the shadowing factor by numerous simulations and propose the altitude-dependent shadowing model. The result shows that the proposed shadowing model has very good consistent with the measurement-based model, which indicates that our research performs well in the extensibility and generality.

eess.SP↗

Analytical Modeling of UAV-to-Vehicle Propagation Channels in Built-Up Areas

This letter presents an analytical path loss model for air-ground (AG) propagation between unmanned aerial vehicles (UAVs) and ground-based vehicles. We consider built-up areas, such as the ones defined by ITU-R. The three-dimensional (3D) path loss model is based on propagation conditions and essential parameters are derived by using geometric methods. Owing to the generality, the analytical model is capable of arbitrary deployments of buildings, such as suburban, urban and dense urban. The analytical model is evaluated numerically, and validations conducted by ray-tracing simulations show the high accuracy of the proposed model. The closed-form analytical formulas provide a useful tool for quick and accurate prediction of UAV-to-vehicle propagation channels.

eess.SP↗

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

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

cs.IT↗

Robust Trajectory and Resource Allocation Design for Secure UAV-aided Communications

This paper aims to enhance the physical layer security against potential internal eavesdroppings by exploiting the maneuverability of an unmanned aerial vehicle (UAV). We consider a scenario where two receivers with different security clearance levels require to be served by a legitimate transmitter with the aid of the UAV. We jointly design the trajectory and resource allocation to maximize the accumulated system confidential data rate. The design is formulated as a mixed-integer non-convex optimization problem which takes into account the partial position information of a potential eavesdropper. To circumvent the problem non-convexity, a series of transformations and approximations are proposed which facilitates the design of a computationally efficient suboptimal solution. Simulation results are presented to provide important system design insights and demonstrate the advantages brought by the robust joint design for enhancing the physical layer security.

cs.IT↗

Resource Allocation for Device-to-Device Communications in Multi-Cell Multi-Band Heterogeneous Cellular Networks

Heterogeneous cellular networks (HCNs) with millimeter wave (mm-wave) communications are considered as a promising technology for the fifth generation mobile networks. Mm-wave has the potential to provide multiple gigabit data rate due to the broad spectrum. Unfortunately, additional free space path loss is also caused by the high carrier frequency. On the other hand, mm-wave signals are sensitive to obstacles and more vulnerable to blocking effects. To address this issue, highly directional narrow beams are utilized in mm-wave networks. Additionally, device-to-device (D2D) users make full use of their proximity and share uplink spectrum resources in HCNs to increase the spectrum efficiency and network capacity. Towards the caused complex interferences, the combination of D2D-enabled HCNs with small cells densely deployed and mm-wave communications poses a big challenge to the resource allocation problems. In this paper, we formulate the optimization problem of D2D communication spectrum resource allocation among multiple micro-wave bands and multiple mm-wave bands in HCNs. Then, considering the totally different propagation conditions on the two bands, a heuristic algorithm is proposed to maximize the system transmission rate and approximate the solutions with sufficient accuracies. Compared with other practical schemes, we carry out extensive simulations with different system parameters, and demonstrate the superior performance of the proposed scheme. In addition, the optimality and complexity are simulated to further verify effectiveness and efficiency.

cs.NI↗

Fog-Assisted Multi-User SWIPT Networks: Local Computing or Offloading

This paper investigates a fog computing-assisted multi-user simultaneous wireless information and power transfer (SWIPT) network, where multiple sensors with power splitting (PS) receiver architectures receive information and harvest energy from a hybrid access point (HAP), and then process the received data by using local computing mode or fog offloading mode. For such a system, an optimization problem is formulated to minimize the sensors' required energy while guaranteeing their required information transmissions and processing rates by jointly optimizing the multi-user scheduling, the time assignment, the sensors' transmit powers and the PS ratios. Since the problem is a mixed integer programming (MIP) problem and cannot be solved with existing solution methods, we solve it by applying problem decomposition, variable substitutions and theoretical analysis. For a scheduled sensor, the closed-form and semi-closedform solutions to achieve its minimal required energy are derived, and then an efficient multi-user scheduling scheme is presented, which can achieve the suboptimal user scheduling with low computational complexity. Numerical results demonstrate our obtained theoretical results, which show that for each sensor, when it is located close to the HAP or the fog server (FS), the fog offloading mode is the better choice; otherwise, the local computing mode should be selected. The system performances in a frame-by-frame manner are also simulated, which show that using the energy stored in the batteries and that harvested from the signals transmitted by previous scheduled sensors can further decrease the total required energy of the sensors.

cs.IT↗

Optimal Online Transmission Policy in Wireless Powered Networks with Urgency-aware Age of Information

This paper investigates the age of information (AoI) for a radio frequency (RF) energy harvesting (EH) enabled network, where a sensor first scavenges energy from a wireless power station and then transmits the collected status update to a sink node. To capture the thirst for the fresh update becoming more and more urgent as time elapsing, urgency-aware AoI (U-AoI) is defined, which increases exponentially with time between two received updates. Due to EH, some waiting time is required at the sensor before transmitting the status update. To find the optimal transmission policy, an optimization problem is formulated to minimize the long-term average U-AoI under constraint of energy causality. As the problem is non-convex and with no known solution, a two-layer algorithm is presented to solve it, where the outer loop is designed based on Dinklebach's method, and in the inner loop, a semi-closed-form expression of the optimal waiting time policy is derived based on Karush-Kuhn-Tucker (KKT) optimality conditions. Numerical results shows that our proposed optimal transmission policy outperforms the the zero time waiting policy and equal time waiting policy in terms of long-term average U-AoI, especially when the networks are non-congested. It is also observed that in order to achieve the lower U-AoI, the sensor should transmit the next update without waiting when the network is congested while should wait a moment before transmitting the next update when the network is non-congested. Additionally, it also shows that the system U-AoI first decreases and then keep unchanged with the increments of EH circuit's saturation level and the energy outage probability.

cs.IT↗

Optimal Design of SWIPT-Aware Fog Computing Networks

This paper studies a simultaneous wireless information and power transfer (SWIPT)-aware fog computing network, where a multiple antenna fog function integrated hybrid access point (F-HAP) transfers information and energy to multiple heterogeneous single-antenna sensors and also helps some of them fulfill computing tasks. By jointly optimizing energy and information beamforming designs at the F-HAP, the bandwidth allocation and the computation offloading distribution, an optimization problem is formulated to minimize the required energy under communication and computation requirements, as well as energy harvesting constraints. Two optimal designs, i.e., fixed offloading time (FOT) and optimized offloading time (OOT) designs, are proposed. As both designs get involved in solving non-convex problems, there are no known solutions to them. Therefore, for the FOT design, the semidefinite relaxation (SDR) is adopted to solve it. It is theoretically proved that the rank-one constraints are always satisfied, so the global optimal solution is guaranteed. For the OOT design, since its non-convexity is hard to deal with, a penalty dual decomposition (PDD)-based algorithm is proposed, which is able to achieve a suboptimal solution. The computational complexity for two designs are analyzed. Numerical results show that the partial offloading mode is superior to binary benchmark modes. It is also shown that if the system is with strong enough computing capability, the OOT design is suggested to achieve lower required energy; Otherwise, the FOT design is preferred to achieve a relatively low computation complexity.

cs.CY↗

Coalition Formation Games Based Sub-Channel Allocation for Device-to-Device Underlay mmWave Small Cells

Small cells in the millimeter wave band densely deployed underlying the macrocell have been regarded as one of promising candidates for the next generation mobile networks. In the user intensive region, device-to-device (D2D) communication in physical proximity can save power and improve spectral efficiency. In this paper, we focus on the optimal sub-channel allocation for access and D2D links in the scenario of densely deployed multiple mmWave small cells. The problem is modeled as a coalitional game to maximize the system sum rate of access and D2D links in the system. Then we propose a coalition formation game based algorithm for sub-channel allocation. Performance evaluation results demonstrate superior performance in terms of the system sum rate compared with other practical schemes.

cs.NI↗

Coalition Game based Full-duplex Concurrent Scheduling in Millimeter Wave Wireless Backhaul Network

With the development of self-interference (SI) cancelation technology, full-duplex (FD) communication becomes possible. FD communication can theoretically double the spectral efficiency. When the time slot (TS) resources are limited and the number of flows is large, the scheduling mechanism of the flows becomes more important. Therefore, the effectiveness of FD scheduling mechanism for the flows is studied in millimeter wave wireless backhaul network with the limited TS resources. We proposed a full duplex concurrent scheduling algorithm based on coalition game (FDCG) to maximize the number of flows with their QoS requirements satisfied. We transformed the problem of maximizing the number of flows with their QoS requirements satisfied into the problem of maximizing sum rate of concurrently scheduled flows in each slot. We obtained the scheduled flows with maximum sum rate in first slot by using coalition game.And then with certain restrictions, the maximum sum rate of concurrently scheduled flows can also be achieved in subsequent time slots. The simulation results show that the proposed FDCG algorithm can achieve superior performance in terms of the number of flows that meet their QoS requirements and system throughput compared with other three algorithms.

cs.NI↗

Relay-Assisted and QoS Aware Scheduling to Overcome Blockage in mmWave Backhaul Networks

In the scenario where small cells are densely deployed, the millimeter wave (mmWave) wireless backhaul network has been widely used. However, mmWave is easily blocked by obstacles, and how to forward the data of the blocked flows is still a significant challenge. To ensure backhauling capacity, the quality of service (QoS) requirements of flows should be satisfied. In this paper, we investigate the problem of optimal scheduling to maximize the number of flows satisfying their QoS requirements with relays exploited to overcome blockage. To achieve a practical solution, we propose a relay-assisted and QoS aware scheduling scheme for the backhaul networks, called RAQS. It consists of a relay selection algorithm and a transmission scheduling algorithm. The relay selection algorithm selects non-repeating relays with high link rates for the blocked flows, which helps to achieve the QoS requirements of flows as soon as possible. Then, according to the results of relay selection, the transmission scheduling algorithm exploits concurrent transmissions to satisfy the QoS requirements of flows as much as possible. Extensive simulations show RAQS can effectively overcome the blockage problem, and increase the number of completed flows and network throughput compared with other schemes. In particular, the impact of relay selection parameter is also investigated to further guide the relay selection.

cs.NI↗

QoS-aware Full-duplex Concurrent Scheduling for Millimeter Wave Wireless Backhaul Networks

The development of self-interference (SI) cancelation technology makes full-duplex (FD) communication possible. Considering the quality of service (QoS) of flows in small cells densely deployed scenario with limited time slot (TS) resources, this paper introduces the FD communication into the concurrent scheduling problem of millimeter-wave (mmWave) wireless backhaul network. We propose a QoS-aware FD concurrent scheduling algorithm to maximize the number of flows with their QoS requirements satisfied. Based on the contention graph, the algorithm makes full use of the FD condition. Both residual self-interference (RSI) and multi-user interference (MUI) are considered. Besides, it also fully considers the QoS requirements of flows and ensures the flows can be transmitted at high rates. Extensive simulations at 60GHz demonstrate that with high SI cancelation level and appropriate contention threshold, the proposed FD algorithm can achieve superior performance in terms of the number of flows with their QoS requirements satisfied and the system throughput compared with other stateof-of-the-art schemes.

cs.NI↗

Device-to-Device Communications Enabled Multicast Scheduling with the Multi-Level Codebook in mmWave Small Cells

With the exponential growth of mobile data, there are increasing interests to deploy small cells in millimeter wave (mmWave) bands to underlay the conventional homogeneous macrocell network as well as in exploiting device-to-device (D2D) communications to improve the efficiency of the multicast service that supports content-based mobile applications. To compensate for high propagation loss in the mmWave band, high-gain directional antennas have to be employed, while it is critical to optimize multicast service in order to improve the network performance. In this paper, an efficient multicast scheduling scheme is proposed for small cells in the mmWave band, called MD2D, where both D2D communications in close proximity and multi-level antenna codebook are utilized. Specifically, a user partition and multicast path planning algorithm is proposed to partition the users in the multicast group into subsets and to determine the transmission node for each subset, so as to achieve optimal utilization of D2D communications and multi-level antenna codebook. Then a multicast scheduling algorithm schedules the transmission for each subset. Furthermore, in order to optimize the network performance, the optimal choice of user partition thresholds is analyzed. Performance evaluation demonstrate that the MD2D achieves the best performance, in terms of network throughput and energy efficiency, compared with other existing schemes. MD2D improves the network throughput compared with the second-best scheme by about 27\%.

cs.NI↗

Mobility-aware Caching Scheduling for Fog Computing in mmWave Band

As an extension of cloud computing, fog computing at the edge of networks provides low latency, location awareness, and real-time interactions. At the same time, millimeter wave (mmWave) communications are able to provide directional multi-gigabit transmission rates with large available bandwidth. Based on the user mobile trajectories in a region, several activity hotspots that users pass by frequently can be obtained. By caching popular content at the edge nodes near the hotspots, users can download the cached content directly at a short distance, and the user experience can be significantly improved. Considering multiple hotspots in a region, how to efficiently schedule the transmission for the caching at edge nodes becomes a key problem. In this paper, we focus on the problem of mobility aware transmission scheduling for caching at edge nodes near hotspots, and utilize multi-hop relaying and concurrent transmissions to achieve better performance. After formulating the optimal scheduling problem as a stochastic nonlinear mixed integer program, we propose a mobility aware caching scheduling scheme, called MHRC (Multi-Hop Relaying based Caching), where multi-hop D2D paths are established for edge nodes, and concurrent transmissions are exploited in the scheduling of caching at edge nodes. Extensive performance evaluation demonstrates MHRC achieves more than 1x higher expected cached data amount compared with state-of-the-art schemes.

cs.NI↗

Joint Beamforming and Power Allocation in Downlink NOMA Multiuser MIMO Networks

In this paper, a novel joint design of beamforming and power allocation is proposed for a multi-cell multiuser multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) network. In this network, base stations (BSs) adopt coordinated multipoint (CoMP) for downlink transmission. We study a new scenario where the users are divided into two groups according to their quality-of-service (QoS) requirements, rather than their channel qualities as investigated in the literature. Our proposed joint design aims to maximize the sum-rate of the users in one group with the best-effort while guaranteeing the minimum required target rates of the users in the other group. The joint design is formulated as a non-convex NP-hard problem. To make the problem tractable, a series of transformations are adopted to simplify the design problem. Then, an iterative suboptimal resource allocation algorithm based on successive convex approximation is proposed. In each iteration, a rank-constrained optimization problem is solved optimally via semidefinite program relaxation. Numerical results reveal that the proposed scheme offers significant sum-rate gains compared to the existing schemes and converges fast to a suboptimal solution.

cs.IT↗

Short-Packet Downlink Transmission with Non-Orthogonal Multiple Access

This work introduces downlink non-orthogonal multiple access (NOMA) into short-packet communications. NOMA has great potential to improve fairness and spectral efficiency with respect to orthogonal multiple access (OMA) for low-latency downlink transmission, thus making it attractive for the emerging Internet of Things. We consider a two-user downlink NOMA system with finite blocklength constraints, in which the transmission rates and power allocation are optimized. To this end, we investigate the trade-off among the transmission rate, decoding error probability, and the transmission latency measured in blocklength. Then, a one-dimensional search algorithm is proposed to resolve the challenges mainly due to the achievable rate affected by the finite blocklength and the unguaranteed successive interference cancellation. We also analyze the performance of OMA as a benchmark to fully demonstrate the benefit of NOMA. Our simulation results show that NOMA significantly outperforms OMA in terms of achieving a higher effective throughput subject to the same finite blocklength constraint, or incurring a lower latency to achieve the same effective throughput target. Interestingly, we further find that with the finite blocklength, the advantage of NOMA relative to OMA is more prominent when the effective throughput targets at the two users become more comparable.

cs.IT↗