arXiv subjects

Tao Jiang

Publications and source records attributed to Tao Jiang.

At least 307 records · Page 17Linked to original sources

arXiv2018

On Secure Transmission Design: An Information Leakage Perspective

Information leakage rate is an intuitive metric that reflects the level of security in a wireless communication system, however, there are few studies taking it into consideration. Existing work on information leakage rate has two major limitations due to the complicated expression for the leakage rate: 1) the analytical and numerical results give few insights into the trade-off between system throughput and information leakage rate; 2) and the corresponding optimal designs of transmission rates are not analytically tractable. To overcome such limitations and obtain an in-depth understanding of information leakage rate in secure wireless communications, we propose an approximation for the average information leakage rate in the fixed-rate transmission scheme. Different from the complicated expression for information leakage rate in the literature, our proposed approximation has a low-complexity expression, and hence, it is easy for further analysis. Based on our approximation, the corresponding approximate optimal transmission rates are obtained for two transmission schemes with different design objectives. Through analytical and numerical results, we find that for the system maximizing throughput subject to information leakage rate constraint, the throughput is an upward convex non-decreasing function of the security constraint and much too loose security constraint does not contribute to higher throughput; while for the system minimizing information leakage rate subject to throughput constraint, the average information leakage rate is a lower convex increasing function of the throughput constraint.

cs.CR↗

arXiv2018

Extremal problems on ordered and convex geometric hypergraphs

An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich history with applications to a variety of problems in combinatorial geometry. In this paper, we consider analogous extremal problems for uniform hypergraphs, and discover a general partitioning phenomenon which allows us to determine the order of magnitude of the extremal function for various ordered and convex geometric hypergraphs. A special case is the ordered $n$-vertex $r$-graph $F$ consisting of two disjoint sets $e$ and $f$ whose vertices alternate in the ordering. We show that for all $n \geq 2r + 1$, the maximum number of edges in an ordered $n$-vertex $r$-graph not containing $F$ is exactly \[ {n \choose r} - {n - r \choose r}.\] This could be considered as an ordered version of the Erdős-Ko-Rado Theorem, and generalizes earlier results of Capoyleas and Pach and Aronov-Dujmovič-Morin-Ooms-da Silveira.

math.CO↗

arXiv2018

Few-femtosecond Electron Beam with THz-frequency Wakefield-driven Compression

We propose and demonstrate a novel method to produce few-femtosecond electron beam with relatively low timing jitter. In this method a relativistic electron beam is compressed from about 150 fs (rms) to about 7 fs (rms, upper limit) with the wakefield at THz frequency produced by a leading drive beam in a dielectric tube. By imprinting the energy chirp in a passive way, we demonstrate through laser-driven THz streaking technique that no additional timing jitter with respect to an external laser is introduced in this bunch compression process, a prominent advantage over the conventional method using radio-frequency bunchers. We expect that this passive bunching technique may enable new opportunities in many ultrashort-beam based advanced applications such as ultrafast electron diffraction and plasma wakefield acceleration.

physics.acc-ph↗

arXiv2018

Virtual Carrier Sensing Based Random Access in Massive MIMO Systems

The 5th generation mobile communication systems aim to support massive access for future wireless applications. Unfortunately, wireless resource scarcity in random access (RA) is a fundamental bottleneck for enabling massive access. To address this problem, we propose a virtual carrier sensing (VCS) based RA scheme in massive MIMO systems. The essence of the proposed scheme lies in exploiting wireless spatial resources of uplink channels occupied by assigned user equipments (UEs) to increase channel resources for RA. With the proposed scheme, RA UEs are able to exploit the spatial resources that are approximately orthogonal to those of assigned UEs, thus sharing the uplink channel resource with assigned UEs without causing significant interference to them. Specifically, to ensure RA UEs avoid serious interference with assigned UEs, base station (BS) sends tailored virtual carriers to RA UEs on behalf of assigned UEs. RA UEs then conduct VCS to determine whether or not the uplink channel resource is available for RA. Closed-form approximations for probability of channel availability and uplink achievable rate with the proposed scheme are derived. Theoretical analysis and simulation results show that the proposed scheme is able to significantly increase channel resources of RA for massive access.

cs.IT↗

arXiv2018

Smoothed SVD-based Beamforming for FBMC/OQAM Systems Based on Frequency Spreading

The combination of singular value decomposition (SVD)-based beamforming and filter bank multicarrier with offset quadrature amplitude modulation (FBMC/OQAM) has not been successful to date. The difficulty of this combination is that, the beamformers may experience significant changes between adjacent subchannels, therefore destroy the orthogonality among FBMC/OQAM real-valued symbols, even under channels with moderate frequency selectivity. In this paper, we address this problem from two aspects: i) an SVD-FS-FBMC architecture is adopted to support beamforming with finer granularity in frequency domain, based on the frequency spreading FBMC (FS-FBMC) structure, i.e., beamforming on FS-FBMC tones rather than on subchannels; ii) criterion and methods are proposed to smooth the beamformers from tone to tone. The proposed finer beamforming and smoothing greatly improve the smoothness of beamformers, therefore effectively suppress the leaked ICI/ISI. Simulations are conducted under the scenario of IEEE 802.11n wireless LAN. Results show that the proposed SVD-FS-FBMC system shares close BER performance with its orthogonal frequency division multiplexing (OFDM) counterpart under the frequency selective channels.

eess.SP↗

arXiv2018

On Turán exponents of bipartite graphs

A long-standing conjecture of Erdős and Simonovits asserts that for every rational number $r\in (1,2)$ there exists a bipartite graph $H$ such that $\ex(n,H)=Θ(n^r)$. So far this conjecture is known to be true only for rationals of form $1+1/k$ and $2-1/k$, for integers $k\geq 2$. In this paper we add a new form of rationals for which the conjecture is true; $2-2/(2k+1)$, for $k\geq 2$. This in its turn also gives an affirmative answer to a question of Pinchasi and Sharir on cube-like graphs. Recently, a version of Erdős and Simonovits's conjecture where one replaces a single graph by a family, was confirmed by Bukh and Conlon. They proposed a construction of bipartite graphs which should satisfy Erdős and Simonovits's conjecture. Our result can also be viewed as a first step towards verifying Bukh and Conlon's conjecture. We also prove the an upper bound on the Turán's number of $θ$-graphs in an asymmetric setting and employ this result to obtain yet another new rational exponent for Turán exponents; $r=7/5$.

math.CO↗

arXiv2018

Success Probability of Grant-Free Random Access with Massive MIMO

Massive MIMO opens up new avenues for enabling highly efficient random access (RA) by offering abundance of spatial degrees of freedom. In this paper, we investigate the grant-free RA with massive MIMO and derive the analytic expressions of success probability of the grant-free RA for conjugate beamforming and zero-forcing beamforming techniques.With the derived analytic expressions, we further shed light on the impact of system parameters on the success probability. Simulation results verify the accuracy of the analyses. It is confirmed that the grant-free RA with massive MIMO is an attractive RA technique with low signaling overhead that could simultaneously accommodate a number of RA users, which is multiple times the number of RA channels, with close-to-one success probability. In addition, when the number of antennas in massive MIMO is sufficiently large, we show that the number of orthogonal preambles would dominate the success probability.

cs.IT↗

arXiv2018

Video Processing on the Edge for Multimedia IoT Systems

In this article, we first survey the current situation of video processing on the edge for multimedia Internet-of-Things (M-IoT) systems in three typical scenarios, i.e., smart cities, satellite networks, and Internet-of-Vehicles. By summarizing a general model of the edge video processing, the importance of developing an edge computing platform is highlighted. Then, we give a method of implementing cooperative video processing on an edge computing platform based on light-weighted virtualization technologies. Performance evaluation is conducted and some insightful observations can be obtained. Moreover, we summarize challenges and opportunities of realizing effective edge video processing for M-IoT systems.

cs.MM↗

arXiv2018

Lighting the Way to a Smart World: Lattice-Based Cryptography for Internet of Things

The Ukraine power grid cyberattacks remind us that the smart Internet of Things (IoT) can help us control our light-bulbs, but if under attacks it might also take us into darkness. Nowadays, many literatures have tried to address the concerns on IoT security, but few of them take into consideration the sever threats to IoT coming from the advances of quantum computing. As a promising candidate for the future post-quantum cryptography standard, lattice-based cryptography enjoys the advantages of strong security guarantees and high efficiency, which make it extremely suitable for IoT applications. In this paper, we summarize the advantages of lattice-based cryptography and the state of art of their implementations for IoT devices.

cs.CR↗

arXiv2018

A Wong-Zakai Approximation for Random Slow Manifolds with Application to Parameter Estimation

We study a Wong-Zakai approximation for the random slow manifold of a slow-fast stochastic dynamical system. We first deduce the existence of the random slow manifold about an approximation system driven by an integrated Ornstein-Uhlenbeck (O-U) process. Then we compute the slow manifold of the approximation system, in order to gain insights of the long time dynamics of the original stochastic system. By restricting this approximation system to its slow manifold, we thus get a reduced slow random system. This reduced slow random system is used to accurately estimate a system parameter of the original system. An example is presented to illustrate this approximation.

math.DS↗

arXiv2018

Terahertz streaking of few-femtosecond relativistic electron beams

Streaking of photoelectrons with optical lasers has been widely used for temporal characterization of attosecond extreme ultraviolet pulses. Recently, this technique has been adapted to characterize femtosecond x-ray pulses in free-electron lasers with the streaking imprinted by farinfrared and Terahertz (THz) pulses. Here, we report successful implementation of THz streaking for time-stamping of an ultrashort relativistic electron beam of which the energy is several orders of magnitude higher than photoelectrons. Such ability is especially important for MeV ultrafast electron diffraction (UED) applications where electron beams with a few femtosecond pulse width may be obtained with longitudinal compression while the arrival time may fluctuate at a much larger time scale. Using this laser-driven THz streaking technique, the arrival time of an ultrashort electron beam with 6 fs (rms) pulse width has been determined with 1.5 fs (rms) accuracy. Furthermore, we have proposed and demonstrated a non-invasive method for correction of the timing jitter with femtosecond accuracy through measurement of the compressed beam energy, which may allow one to advance UED towards sub-10 fs frontier far beyond the ~100 fs (rms) jitter.

physics.acc-ph↗

arXiv2018

Configurations and Diagnosis for Ultra-Dense Heterogeneous Networks: From Empirical Measurements to Technical Solutions

The intense demands for higher data rates and ubiquitous network coverage have raised the stakes on developing new network topology and architecture to meet these ever-increasing demands in a cost-effective manner. The telecommunication industry and international standardization bodies have placed considerable attention to the deployment of ultra-dense heterogeneous small-scale cells over existing cellular systems. Those small-scale cells, although provide higher data rates and better indoor coverage by reducing the distance between base stations (BSs) and end users, have raised severe configuration concerns. As the deployments are becoming irregular and flexible, inappropriate configurations occur frequently and undermine the network reliability and service quality. We envision that the fine-grained characterization of user traffic is a key pillar to diagnosing inappropriate configurations. In this article, we investigate the fine-grained traffic patterns of mobile users by analyzing the network data containing millions of subscribers and covering thousands of cells in a large metropolitan area. We characterize traffic patterns and mobility behaviors of users and geospatial properties of cells, and discuss how the heterogeneity of these characteristics affects network configurations and diagnosis in future ultra-dense small cells. Based on these observations from our measurements, we investigate possible models and corresponding challenges, and propose a heterogeneity-aware scheme that takes into account the disparity of user mobility behaviors and geospatial properties among small cells.

cs.NI↗

arXiv2018

Tight paths in convex geometric hypergraphs

In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generalization of early results of Hopf and Pannwitz, Sutherland, Kupitz and Perles for convex geometric graphs, as well as the classical Erdős-Gallai Theorem for graphs. As a consequence, we obtain the first substantial improvement on the Turán problem for tight paths in uniform hypergraphs.

math.CO↗

arXiv2018

Imaging nanoscale spatial modulation of a relativistic electron beam with a MeV ultrafast electron microscope

Accelerator-based MeV ultrafast electron microscope (MUEM) has been proposed as a promising tool to study structural dynamics at the nanometer spatial scale and picosecond temporal scale. Here we report experimental tests of a prototype MUEM where high quality images with nanoscale fine structures were recorded with a pulsed 3 MeV picosecond electron beam. The temporal and spatial resolution of the MUEM operating in single-shot mode is about 4 ps (FWHM) and 100 nm (FWHM), corresponding to a temporal-spatial resolution of 4e-19 s*m, about 2 orders of magnitude higher than that achieved with state-of-the-art single-shot keV UEM. Using this instrument we offer the demonstration of visualizing the nanoscale periodic spatial modulation of an electron beam, which may be converted into longitudinal density modulation through emittance exchange to enable production of high-power coherent radiation at short wavelengths. Our results mark a great step towards single-shot nanometer-resolution MUEMs and compact intense x-ray sources that may have wide applications in many areas of science.

physics.acc-ph↗

arXiv2018

Coulomb-driven relativistic electron beam compression

Coulomb interaction between charged particles is a well-known phenomenon in many areas of researches. In general the Coulomb repulsion force broadens the pulse width of an electron bunch and limits the temporal resolution of many scientific facilities such as ultrafast electron diffraction and x-ray free-electron lasers. Here we demonstrate a scheme that actually makes use of Coulomb force to compress a relativistic electron beam. Furthermore, we show that the Coulomb-driven bunch compression process does not introduce additional timing jitter, which is in sharp contrast to the conventional radio-frequency buncher technique. Our work not only leads to enhanced temporal resolution in electron beam based ultrafast instruments that may provide new opportunities in probing material systems far from equilibrium, but also opens a promising direction for advanced beam manipulation through self-field interactions.

physics.acc-ph↗

arXiv2018

Hybrid Precoding Based on Non-Uniform Quantization Codebook to Reduce Feedback Overhead in Millimeter Wave MIMO Systems

In this paper, we focus on the design of the hybrid analog/digital precoding in millimeter wave multiple-input multiple-output (MIMO) systems. To reduce the feedback overhead, we propose two non-uniform quantization (NUQ) codebook based hybrid precoding schemes for two main hybrid precoding implementations, i.e., the full-connected structure and the sub-connected structure. Specifically, we firstly group the angles of the arrive/departure (AOAs/AODs) of the scattering paths into several spatial lobes by exploiting the sparseness property of the millimeter wave in the angular domain, which divides the total angular domain into effective spatial lobes' coverage angles and ineffective coverage angles. Then, we map the quantization bits non-uniformly to different coverage angles and construct NUQ codebooks, where high numbers of quantization bits are employed for the effective coverage angles to quantize AoAs/AoDs and zero quantization bit is employed for ineffective coverage angles. Finally, two low-complexity hybrid analog/digital precoding schemes are proposed based on NUQ codebooks. Simulation results demonstrate that, the proposed two NUQ codebook based hybrid precoding schemes achieve near-optimal spectral efficiencies and show the superiority in reducing the feedback overhead compared with the uniform quantization (UQ) codebook based works, e.g., at least 12.5% feedback overhead could be reduced for a system with 144/36 transmitting/receiving antennas.

cs.IT↗

arXiv2018

FDM-Structured Preamble Optimization for Channel Estimation in MIMO-OQAM/FBMC Systems

In this paper, we consider the problem of preamble design in multiple-input multiple-output (MIMO) systems employing offset quadrature amplitude modulation based filter bank multicarrier (OQAM/FBMC) and propose a preamble optimization method for the frequency division multiplexing (FDM)-structured preamble. Specifically, we formulate an optimization problem to determine the frequency division multiplexed preambles, where the objective is to minimize the mean square error (MSE) of the channel estimation, subject to the constraint on the transmit energy. For two transmit antennas, we find the relationship between preambles and the intrinsic interference from neighboring symbols to achieve the minimum channel estimation MSE, and derive the optimal closed-form solution. For more than two transmit antennas, the constrained preamble optimization problem is nonconvex quadratic. Therefore, we convert the original optimization problem into a quadratically constrained quadratic program (QCQP) and obtain the suboptimal solution by relaxing the nonconvex constraint. Simulation results demonstrate that, in terms of MSE and bit error rate (BER) performances, the proposed method outperforms the conventional FDM preamble design method at all signal-to-noise ratio (SNR) regimes and outperforms the interference approximation method-complex (IAM-C) preamble design method at low to medium SNR regimes with lower preamble overhead.

cs.IT↗

arXiv2018

Securing On-Body IoT Devices By Exploiting Creeping Wave Propagation

On-body devices are an intrinsic part of the Internet-of-Things (IoT) vision to provide human-centric services. These on-body IoT devices are largely embedded devices that lack a sophisticated user interface to facilitate traditional Pre-Shared Key based security protocols. Motivated by this real-world security vulnerability, this paper proposes SecureTag, a system designed to add defense in depth against active attacks by integrating physical layer (PHY) information with upper-layer protocols. The underpinning of SecureTag is a signal processing technique that extracts the peculiar propagation characteristics of creeping waves to discern on-body devices. Upon overhearing a suspicious transmission, SecureTag initiates a PHY-based challenge-response protocol to mitigate attacks. We implement our system on different commercial off-the-shelf (COTS) wearables and a smartphone. Extensive experiments are conducted in a lab, apartments, malls, and outdoor areas, involving 12 volunteer subjects of different age groups, to demonstrate the robustness of our system. Results show that our system can mitigate 96.13% of active attack attempts while triggering false alarms on merely 5.64% of legitimate traffic.

cs.NI↗