arXiv subjects

Yong Zeng

Publications and source records attributed to Yong Zeng.

At least 181 records · Page 10Linked to original sources

arXiv2019

Accessing From The Sky: A Tutorial on UAV Communications for 5G and Beyond

Unmanned aerial vehicles (UAVs) have found numerous applications and are expected to bring fertile business opportunities in the next decade. Among various enabling technologies for UAVs, wireless communication is essential and has drawn significantly growing attention in recent years. Compared to the conventional terrestrial communications, UAVs' communications face new challenges due to their high altitude above the ground and great flexibility of movement in the three-dimensional (3D) space. Several critical issues arise, including the line-of-sight (LoS) dominant UAV-ground channels and resultant strong aerial-terrestrial network interference, the distinct communication quality of service (QoS) requirements for UAV control messages versus payload data, the stringent constraints imposed by the size, weight and power (SWAP) limitations of UAVs, as well as the exploitation of the new design degree of freedom (DoF) brought by the highly controllable 3D UAV mobility. In this paper, we give a tutorial overview of the recent advances in UAV communications to address the above issues, with an emphasis on how to integrate UAVs into the forthcoming fifth-generation (5G) and future cellular networks. In particular, we partition our discussions into two promising research and application frameworks of UAV communications, namely UAV-assisted wireless communications and cellular-connected UAVs,where UAVs serve as aerial communication platforms and users, respectively. Furthermore, we point out promising directions for future research and investigation.

eess.SP↗

arXiv2019

Challenges in Covert Wireless Communications with Active Warden on AWGN channels

Covert wireless communication or low probability of detection (LPD) communication that employs the noise or jamming signals as the cover to hide user's information can prevent a warden Willie from discovering user's transmission attempts. Previous work on this problem has typically assumed that the warden is static and has only one antenna, often neglecting an active warden who can dynamically adjust his/her location to make better statistic tests. In this paper, we analyze the effect of an active warden in covert wireless communications on AWGN channels and find that, having gathered samples at different places, the warden can easily detect Alice's transmission behavior via a trend test, and the square root law is invalid in this scenario. Furthermore, a more powerful warden with multiple antennas is harder to be deceived, and Willie's detection time can be greatly shortened.

cs.CR↗

arXiv2018

A Generic Receiver Architecture for MIMO Wireless Power Transfer with Non-Linear Energy Harvesting

This letter investigates a multiple-input multiple-output (MIMO) wireless power transfer (WPT) system under practical non-liner energy harvesting (EH) models. We propose a new generic energy receiver (ER) architecture consisting of $N$ receive antennas and $L$ rectifiers, for which one power splitter is inserted after each antenna to adaptively split the received radio frequency (RF) signals among the $L$ rectifiers for efficient non-linear RF-to-direct current (DC) conversion. With the proposed architecture, we maximize the total harvested DC power at the ER, by jointly optimizing the transmit energy beamforming at the energy transmitter (ET) and the power splitting ratios at the ER. Numerical results show that our proposed design by exploiting the nonlinearity of EH significantly improves the harvested DC power at the ER, as compared to two conventional designs.

eess.SP↗

arXiv2018

Wireless Communications with Programmable Metasurface: Transceiver Design and Experimental Results

Metasurfaces have drawn significant attentions due to their superior capability in tailoring electromagnetic waves with a wide frequency range, from microwave to visible light. Recently, programmable metasurfaces have demonstrated the ability of manipulating the amplitude or phase of electromagnetic waves in a programmable manner in real time, which renders them especially appealing in the applications of wireless communications. To practically demonstrate the feasibility of programmable metasurfaces in future communication systems, in this paper, we design and realize a novel metasurface-based wireless communication system. By exploiting the dynamically controllable property of programmable metasurface, we firstly introduce the fundamental principle of the metasurface-based wireless communication system design. We then present the design, implementation and experimental evaluation of the proposed metasurface-based wireless communication system with a prototype, which realizes single carrier quadrature phase shift keying (QPSK) transmission over the air. In the developed prototype, the phase of the reflected electromagnetic wave of programmable metasurface is directly manipulated in real time according to the baseband control signal, which achieves 2.048 Mbps data transfer rate with video streaming transmission over the air. Experimental result is provided to compare the performance of the proposed metasurface-based architecture against the conventional one. With the slight increase of the transmit power by 5 dB, the same bit error rate (BER) performance can be achieved as the conventional system in the absence of channel coding. Such a result is encouraging considering that the metasurface-based system has the advantages of low hardware cost and simple structure, thus leading to a promising new architecture for wireless communications.

eess.SP↗

arXiv2018

Overcoming Endurance Issue: UAV-Enabled Communications with Proactive Caching

Wireless communication enabled by unmanned aerial vehicles (UAVs) has emerged as an appealing technology for many application scenarios in future wireless systems. However, the limited endurance of UAVs greatly hinders the practical implementation of UAV-enabled communications. To overcome this issue, this paper proposes a novel scheme for UAV-enabled communications by utilizing the promising technique of proactive caching at the users. Specifically, we focus on content-centric communication systems, where a UAV is dispatched to serve a group of ground nodes (GNs) with random and asynchronous requests for files drawn from a given set. With the proposed scheme, at the beginning of each operation period, the UAV pro-actively transmits the files to a subset of selected GNs that cooperatively cache all the files in the set. As a result, when requested, a file can be retrieved by each GN either directly from its local cache or from its nearest neighbor that has cached the file via device-to-device (D2D) communications. It is revealed that there exists a fundamental trade-off between the file caching cost, which is the total time required for the UAV to transmit the files to their designated caching GNs, and the file retrieval cost, which is the average time required for serving one file request. To characterize this trade-off, we formulate an optimization problem to minimize the weighted sum of the two costs, via jointly designing the file caching policy, the UAV trajectory and communication scheduling. As the formulated problem is NP-hard in general, we propose efficient algorithms to find high-quality approximate solutions for it. Numerical results are provided to corroborate our study and show the great potential of proactive caching for overcoming the limited endurance issue in UAV-enabled communications.

cs.IT↗

arXiv2018

Multi-UAV Interference Coordination via Joint Trajectory and Power Control

In this paper, we consider an unmanned aerial vehicle-enabled interference channel (UAV-IC), where each of the $K$ UAVs communicates with its associated ground terminals (GTs) at the same time and over the same spectrum. To exploit the new degree of freedom of UAV mobility for interference coordination between the UAV-GT links, we formulate a joint trajectory and power control (TPC) problem for maximizing the aggregate sum rate of the UAV-IC for a given flight interval, under the practical constraints on the UAV flying speed, altitude, as well as collision avoidance. These constraints couple the TPC variables across different time slots and UAVs, leading to a challenging large-scale and non-convex optimization problem. By exploiting the problem structure, we show that the optimal TPC solution follows the fly-hover-fly strategy, based on which the problem can be handled by firstly finding an optimal hovering locations followed by solving a dimension-reduced TPC problem with given initial and hovering locations of UAVs. For the reduced TPC problem, we propose a successive convex approximation algorithm. To improve the computational efficiency, we further develop a parallel TPC algorithm that is effciently implementable over multi-core CPUs. We also propose a {segment-by-segment method} %virtual waypoint model which decomposes the TPC problem into sequential TPC subproblems each with a smaller problem dimension. Simulation results demonstrate the superior computation time efficiency of the proposed algorithms, and also show that the UAV-IC can yield higher network sum rate than the benchmark orthogonal schemes.

math.OC↗

arXiv2018

Applications of a formula on Beltrami flow

In this note, we obtain uniqueness results for Beltrami flow in both bounded and unbounded domain with nonempty boundary by establishing an elementary but useful formula involving operators $\divg$ and $\curl$. We also use this formula to deal with Maxwell and Stokes eigenvalue problems.

math.AP↗

arXiv2018

Asynchronous Mobile-Edge Computation Offloading: Energy-Efficient Resource Management

Mobile-edge computation offloading (MECO) is an emerging technology for enhancing mobiles' computation capabilities and prolonging their battery lives, by offloading intensive computation from mobiles to nearby servers such as base stations. In this paper, we study the energy-efficient resource-management policy for the asynchronous MECO system, where the mobiles have heterogeneous input-data arrival time instants and computation deadlines. First, we consider the general case with arbitrary arrival-deadline orders. Based on the monomial energy-consumption model for data transmission, an optimization problem is formulated to minimize the total mobile-energy consumption under the time-sharing and computation-deadline constraints. The optimal resource-management policy for data partitioning (for offloading and local computing) and time division (for transmissions) is shown to be computed by using the block coordinate decent method. To gain further insights, we study the optimal resource-management design for two special cases. First, consider the case of identical arrival-deadline orders, i.e., a mobile with input data arriving earlier also needs to complete computation earlier. The optimization problem is reduced to two sequential problems corresponding to the optimal scheduling order and joint data-partitioning and time-division given the optimal order. It is found that the optimal time-division policy tends to balance the defined effective computing power among offloading mobiles via time sharing. Furthermore, this solution approach is extended to the case of reverse arrival-deadline orders. The corresponding time-division policy is derived by a proposed transformation-and-scheduling approach, which first determines the total offloading duration and data size for each mobile in the transformation phase and then specifies the offloading intervals for each mobile in the scheduling phase.

cs.IT↗

arXiv2018

Secrecy Energy Efficiency Maximization for UAV-Enabled Mobile Relaying

This paper investigates the secrecy energy efficiency (SEE) maximization problem for unmanned aerial vehicle enabled mobile relaying system, where a high-mobility UAV is exploited to assist delivering the confidential information from a ground source to a legitimate ground destination with the direct link blocked, in the presence of a potential eavesdropper. We aim to maximize SEE of the UAV by jointly optimizing the communication scheduling, power allocation, and UAV trajectory over a finite time horizon. The formulated problem is a mixed-integer non-convex optimization problem that is challenging to be solved optimally. To make the problem tractable, we decompose the problem into three subproblems, and propose an efficient iterative algorithm that alternately optimizes the subproblems. In addition, two special cases are considered as benchmarks in this paper. Simulation results show that the proposed design significantly improves the SEE of the UAV, as compared to the benchmarks

cs.IT↗

arXiv2018

Cyclical Multiple Access in UAV-Aided Communications: A Throughput-Delay Tradeoff

This letter studies a wireless system consisting of distributed ground terminals (GTs) communicating with an unmanned aerial vehicle (UAV) that serves as a mobile base station (BS). The UAV flies cyclically above the GTs at a fixed altitude, which results in a cyclical pattern of the strength of the UAV-GT channels. To exploit such periodic channel variations, we propose a new cyclical multiple access (CMA) scheme to schedule the communications between the UAV and GTs in a cyclical time-division manner based on the flying UAV's position. The time allocations to different GTs are optimized to maximize their minimum throughput. It is revealed that there is a fundamental tradeoff between throughput and access delay in the proposed CMA. Simulation results show significant throughput gains over the case of a static UAV BS in delay-tolerant applications.

cs.IT↗

arXiv2018

UAV-Aided Offloading for Cellular Hotspot

In conventional terrestrial cellular networks, mobile terminals (MTs) at the cell edge often pose a performance bottleneck due to their long distances from the serving ground base station (GBS), especially in hotspot period when the GBS is heavily loaded. This paper proposes a new hybrid network architecture by leveraging the use of unmanned aerial vehicle (UAV) as an aerial mobile base station, which flies cyclically along the cell edge to offload data traffic for cell-edge MTs. We aim to maximize the minimum throughput of all MTs by jointly optimizing the UAV's trajectory, bandwidth allocation and user partitioning. We first consider orthogonal spectrum sharing between the UAV and GBS, and then extend to spectrum reuse where the total bandwidth is shared by both the GBS and UAV with their mutual interference effectively avoided. Numerical results show that the proposed hybrid network with optimized spectrum sharing and cyclical multiple access design significantly improves the spatial throughput over the conventional GBS-only network; while the spectrum reuse scheme provides further throughput gains at the cost of slightly higher complexity for interference control. Moreover, compared to the conventional small-cell offloading scheme, the proposed UAV offloading scheme is shown to outperform in terms of throughput, besides saving the infrastructure cost.

cs.IT↗

arXiv2018

Cellular-Enabled UAV Communication: A Connectivity-Constrained Trajectory Optimization Perspective

Integrating the unmanned aerial vehicles (UAVs) into the cellular network is envisioned to be a promising technology to significantly enhance the communication performance of both UAVs and existing terrestrial users. In this paper, we first provide an overview on the two main paradigms in cellular UAV communications, i.e., cellular-enabled UAV communication with UAVs as new aerial users served by the ground base stations (GBSs), and UAV-assisted cellular communication with UAVs as new aerial communication platforms serving the terrestrial users. Then, we focus on the former paradigm and study a new UAV trajectory design problem subject to practical communication connectivity constraints with the GBSs. Specifically, we consider a cellular-connected UAV in the mission of flying from an initial location to a final location, during which it needs to maintain reliable communication with the cellular network by associating with one GBS at each time instant. We aim to minimize the UAV's mission completion time by optimizing its trajectory, subject to a quality-of-connectivity constraint of the GBS-UAV link specified by a minimum receive signal-to-noise ratio target. To tackle this challenging non-convex problem, we first propose a graph connectivity based method to verify its feasibility. Next, by examining the GBS-UAV association sequence over time, we obtain useful structural results on the optimal UAV trajectory, based on which two efficient methods are proposed to find high-quality approximate trajectory solutions by leveraging graph theory and convex optimization techniques. The proposed methods are analytically shown to be capable of achieving a flexible trade-off between complexity and performance, and yielding a solution that is arbitrarily close to the optimal solution in polynomial time. Finally, we make concluding remarks and point out some promising directions for future work.

cs.IT↗

arXiv2018

UAV-Enabled Radio Access Network: Multi-Mode Communication and Trajectory Design

In this paper, we consider an unmanned aerial vehicle (UAV)-enabled radio access network (RAN) with the UAV acting as an aerial platform to communicate with a set of ground users (GUs) in a variety of modes of practical interest, including data collection in the uplink, data transmission in the downlink, and data relaying between GUs involving both the uplink and downlink. Under this general framework, two UAV operation scenarios are considered: periodic operation, where the UAV serves the GUs in a periodic manner by following a certain trajectory repeatedly, and one-time operation where the UAV serves the GUs with one single fly and then leaves for another mission. In each scenario, we aim to minimize the UAV periodic flight duration or mission completion time, while satisfying the target rate requirement of each GU via a joint UAV trajectory and communication resource allocation design approach. Iterative algorithms are proposed to find efficient locally optimal solutions by utilizing successive convex optimization and block coordinate descent techniques. Moreover, as the quality of the solutions obtained by the proposed algorithms critically depends on the initial UAV trajectory adopted, we propose new methods to design the initial trajectories for both operation scenarios by leveraging the existing results for solving the classic Traveling Salesman Problem (TSP) and Pickup-and-Delivery Problem (PDP). Numerical results show that the proposed trajectory initialization designs lead to significant performance gains compared to the benchmark initialization based on circular trajectory.

cs.IT↗

arXiv2018

Covert Wireless Communications with Active Eavesdropper on AWGN Channels

Covert wireless communication can prevent an adversary from knowing the existence of user's transmission, thus provide stronger security protection. In AWGN channels, a square root law was obtained and the result shows that Alice can reliably and covertly transmit $\mathcal{O}(\sqrt{n})$ bits to Bob in n channel uses in the presence of a passive eavesdropper (Willie). However, existing work presupposes that Willie is static and only samples the channels at a fixed place. If Willie can dynamically adjust the testing distance between him and Alice according to his sampling values, his detection probability of error can be reduced significantly via a trend test. We found that, if Alice has no prior knowledge about Willie, she cannot hide her transmission behavior in the presence of an active Willie, and the square root law does not hold in this situation. We then proposed a novel countermeasure to deal with the active Willie. Through randomized transmission scheduling, Willie cannot detect Alice's transmission attempts if Alice can set her transmission probability below a threshold. Additionally, we systematically evaluated the security properties of covert communications in a dense wireless network, and proposed a density-based routing scheme to deal with multi-hop covert communication in a wireless network. As the network grows denser, Willie's uncertainty increases, and finally resulting in a "shadow" network to Willie.

cs.IT↗

arXiv2018

Trajectory Design for Distributed Estimation in UAV Enabled Wireless Sensor Network

In this paper, we study an unmanned aerial vehicle(UAV)-enabled wireless sensor network, where a UAV is dispatched to collect the sensed data from distributed sensor nodes (SNs) for estimating an unknown parameter. It is revealed that in order to minimize the mean square error (MSE) for the estimation, the UAV should collect the data from as many SNs as possible, based on which an optimization problem is formulated to design the UAV's trajectory subject to its practical mobility constraints. Although the problem is non-convex and NP-hard, we show that the optimal UAV trajectory consists of connected line segments only. With this simplification, an efficient suboptimal solution is proposed by leveraging the classic traveling salesman problem (TSP) method and applying convex optimization techniques. Simulation results show that the proposed trajectory design achieves significant performance gains in terms of the number of SNs whose data are successfully collected, as compared to other benchmark schemes.

cs.IT↗

arXiv2018

Cellular-Connected UAV: Potentials, Challenges and Promising Technologies

Enabling high-rate, low-latency and ultra-reliable wireless communications between unmanned aerial vehicles (UAVs) and their associated ground pilots/users is of paramount importance to realize their large-scale usage in the future. To achieve this goal, cellular-connected UAV, whereby UAVs for various applications are integrated into the cellular network as new aerial users, is a promising technology that has drawn significant attention recently. Compared to the conventional cellular communication with terrestrial users, cellular-connected UAV communication possesses substantially different characteristics that bring in new research challenges as well as opportunities. In this article, we provide an overview of this emerging technology, by firstly discussing its potential benefits, unique communication and spectrum requirements, as well as new design considerations. We then introduce promising technologies to enable the future generation of three-dimensional (3D) heterogeneous wireless networks with coexisting aerial and ground users. Last, we present simulation results to corroborate our discussions and highlight key directions for future research.

cs.IT↗

arXiv2018

Energy Minimization for Wireless Communication with Rotary-Wing UAV

This paper studies unmanned aerial vehicle (UAV) enabled wireless communication, where a rotarywing UAV is dispatched to send/collect data to/from multiple ground nodes (GNs). We aim to minimize the total UAV energy consumption, including both propulsion energy and communication related energy, while satisfying the communication throughput requirement of each GN. To this end, we first derive an analytical propulsion power consumption model for rotary-wing UAVs, and then formulate the energy minimization problem by jointly optimizing the UAV trajectory and communication time allocation among GNs, as well as the total mission completion time. The problem is difficult to be optimally solved, as it is non-convex and involves infinitely many variables over time. To tackle this problem, we first consider the simple fly-hover-communicate design, where the UAV successively visits a set of hovering locations and communicates with one corresponding GN when hovering at each location. For this design, we propose an efficient algorithm to optimize the hovering locations and durations, as well as the flying trajectory connecting these hovering locations, by leveraging the travelling salesman problem (TSP) and convex optimization techniques. Next, we consider the general case where the UAV communicates also when flying. We propose a new path discretization method to transform the original problem into a discretized equivalent with a finite number of optimization variables, for which we obtain a locally optimal solution by applying the successive convex approximation (SCA) technique. Numerical results show the significant performance gains of the proposed designs over benchmark schemes, in achieving energy-efficient communication with rotary-wing UAVs.

cs.IT↗

arXiv2018

The Sound and the Fury: Hiding Communications in Noisy Wireless Networks with Interference Uncertainty

Covert communication can prevent the adversary from knowing that a wireless transmission has occurred. In the additive white Gaussian noise channels, a square root law is obtained and the result shows that Alice can reliably and covertly transmit $\mathcal{O}(\sqrt{n})$ bits to Bob in $n$ channel uses. If additional "friendly" node near the adversary can inject artificial noise to aid Alice in hiding her transmission attempt, covert throughput can be improved, i.e., Alice can covertly transmit $\mathcal{O}(\min\{n,λ^{α/2}\sqrt{n}\})$ bits to Bob over $n$ uses of the channel ($λ$ is the density of friendly nodes and $α$ is the path loss exponent of wireless channels). In this paper, we consider the covert communication in a noisy wireless network, where Bob and the adversary Willie not only experience the background noise, but also the aggregated interference from other transmitters. Our results show that uncertainty in interference experienced by Willie is beneficial to Alice. When the distance between Alice and Willie $d_{a,w}=ω(n^{δ/4})$ ($δ=2/α$ is stability exponent), Alice can reliably and covertly transmit $\mathcal{O}(\log_2\sqrt{n})$ bits to Bob in $n$ channel uses. Although the covert throughput is lower than the square root law and the friendly jamming scheme, the spatial throughput is higher. From the network perspective, the communications are hidden in "the sound and the fury" of noisy wireless networks, and what Willie sees is merely a "shadow" wireless network. He knows for certain that some nodes are transmitting, but he cannot catch anyone red-handed.

cs.IT↗