arXiv subjects

Zihuai Lin

Publications and source records attributed to Zihuai Lin.

At least 55 records · Page 3Linked to original sources

arXiv2019

Fast Channel Estimation and Beam Tracking for Millimeter Wave Vehicular Communications

Millimeter wave (mmWave) has been claimed to be the only viable solution for high-bandwidth vehicular communications. However, frequent channel estimation and beamforming required to provide a satisfactory quality of service limits mmWave for vehicular communications. In this paper, we propose a novel channel estimation and beam tracking framework for mmWave communications in a vehicular network setting. For channel estimation, we propose an algorithm termed robust adaptive multi-feedback (RAF) that achieves comparable estimation performance as existing channel estimation algorithms, with a significantly smaller number of feedback bits. We derive upper and lower bounds on the probability of estimation error (PEE) of the RAF algorithm, given a number of channel estimations, whose accuracy is verified through Monte Carlo simulations. For beam tracking, we propose a new practical model for mmWave vehicular communications. In contrast to the prior works, the model is based on position, velocity, and channel coefficient, which allows a significant improvement of the tracking performance. Focused on the new beam tracking model, we re-derive the equations for Jacobian matrices, reducing the complexity for vehicular communications. An extensive number of simulations is conducted to show the superiority of our proposed channel estimation method and beam tracking algorithm in comparison with the existing algorithms and models. Our simulations suggest that the RAF algorithm can achieve the desired PEE, while on average, reducing the feedback overhead by 75.5% and the total channel estimation time by 14%. The beam tracking algorithm is also shown to significantly improve beam tracking performance, allowing more room for data transmission.

eess.SP↗

arXiv2018

Error-Control-Coding Assisted Imaging

Error-control-coding (ECC) techniques are widely used in modern digital communication systems to minimize the effect of noisy channels on the quality of received signals. Motivated by the fact that both communication and imaging can be considered as an information transfer process, in this paper we demonstrate that ECC could yield significant improvements in the image quality by reducing the effect of noise in the physical process of image acquisition. In the demonstrated approach, the object is encoded by ECC structured light fields generated by a digital-micromirror-device (DMD) while its image is obtained by decoding the received signal collected by a bucket-detector (BD). By applying a Luby Transform (LT) code as an example, our proof-of-concept experiment validates that the object image can be effectively reconstructed while errors induced by noisy reception can be significantly reduced. The demonstrated approach informs a new imaging technique: ECC assisted imaging, which can be scaled into applications such as remote sensing, spectroscopy and biomedical imaging.

eess.IV↗

arXiv2018

Short Block-length Codes for Ultra-Reliable Low-Latency Communications

This paper reviews the state of the art channel coding techniques for ultra-reliable low latency communication (URLLC). The stringent requirements of URLLC services, such as ultra-high reliability and low latency, have made it the most challenging feature of the fifth generation (5G) mobile systems. The problem is even more challenging for the services beyond the 5G promise, such as tele-surgery and factory automation, which require latencies less than 1ms and failure rate as low as $10^{-9}$. The very low latency requirements of URLLC do not allow traditional approaches such as re-transmission to be used to increase the reliability. On the other hand, to guarantee the delay requirements, the block length needs to be small, so conventional channel codes, originally designed and optimised for moderate-to-long block-lengths, show notable deficiencies for short blocks. This paper provides an overview on channel coding techniques for short block lengths and compares them in terms of performance and complexity. Several important research directions are identified and discussed in more detail with several possible solutions.

cs.IT↗

arXiv2018

Rate Adaptive Coded Digital Phase Modulation

In this paper, rate adaptive coded Digital Phase Modulation (DPM) schemes based on punctured ring convolutional codes are presented. We first present an upper bound on symbol error probability for punctured convolutional coded Continuous Phase Modulation (CPM) over rings with Maximum Likelihood Sequence Detection (MLSD). The bound is based on the transfer function technique, which is modified and generalized to punctured convolutional codes over rings. The novelty of this paper is the development of the analytical upper bound on the symbol error probability for the investigated system. This work provides a systematic way to analyze and design the rate adaptive ring convolutional coded CPM systems. The analysis method is very general. It may be applied to any trellis based coding schemes.

eess.SP↗

arXiv2018

Privacy Preservation in Location-Based Services: A Novel Metric and Attack Model

Recent years have seen rising needs for location-based services in our everyday life. Aside from the many advantages provided by these services, they have caused serious concerns regarding the location privacy of users. An adversary such as an untrusted location-based server can monitor the queried locations by a user to infer critical information such as the user's home address, health conditions, shopping habits, etc. To address this issue, dummy-based algorithms have been developed to increase the anonymity of users, and thus, protecting their privacy. Unfortunately, the existing algorithms only consider a limited amount of side information known by an adversary which may face more serious challenges in practice. In this paper, we incorporate a new type of side information based on consecutive location changes of users and propose a new metric called transition-entropy to investigate the location privacy preservation, followed by two algorithms to improve the transition-entropy for a given dummy generation algorithm. Then, we develop an attack model based on the Viterbi algorithm which can significantly threaten the location privacy of the users. Next, in order to protect the users from Viterbi attack, we propose an algorithm called robust dummy generation (RDG) which can resist against the Viterbi attack while maintaining a high performance in terms of the privacy metrics introduced in the paper. All the algorithms are applied and analyzed on a real-life dataset.

cs.CR↗

arXiv2018

Performance Analysis for Practical Unmanned Aerial Vehicle Networks with LoS/NLoS Transmissions

In this paper, we provide a performance analysis for practical unmanned aerial vehicle (UAV)-enabled networks. By considering both line-of-sight (LoS) and non-line-of-sight (NLoS) transmissions between aerial base stations (BSs) and ground users, the coverage probability and the area spectral efficiency (ASE) are derived. Considering that there is no consensus on the path loss model for studying UAVs in the literature, in this paper, three path loss models, i.e., high-altitude model, low-altitude model and ultra-low-altitude model, are investigated and compared. Moreover, the lower bound of the network performance is obtained assuming that UAVs are hovering randomly according to homogeneous Poisson point process (HPPP), while the upper bound is derived assuming that UAVs can instantaneously move to the positions directly overhead ground users. From our analytical and simulation results for a practical UAV height of 50 meters, we find that the network performance of the high-altitude model and the low-altitude model exhibit similar trends, while that of the ultra-low-altitude model deviates significantly from the above two models. In addition, the optimal density of UAVs to maximize the coverage probability performance has also been investigated.

cs.NI↗

arXiv2018

Accumulate Then Transmit: Multi-user Scheduling in Full-Duplex Wireless-Powered IoT Systems

This paper develops and evaluates an accumulate-then-transmit framework for multi-user scheduling in a full-duplex (FD) wireless-powered Internet-of-Things system, consisting of multiple energy harvesting (EH) IoT devices (IoDs) and one FD hybrid access point (HAP). All IoDs have no embedded energy supply and thus need to perform EH before transmitting their data to the HAP. Thanks to its FD capability, the HAP can simultaneously receive data uplink and broadcast energy-bearing signals downlink to charge IoDs. The instantaneous channel information is assumed unavailable throughout this paper. To maximize the system average throughput, we design a new throughput-oriented scheduling scheme, in which a single IoD with the maximum weighted residual energy is selected to transmit information to the HAP, while the other IoDs harvest and accumulate energy from the signals broadcast by the HAP. However, similar to most of the existing throughput-oriented schemes, the proposed throughout-oriented scheme also leads to unfair inter-user throughput because IoDs with better channel performance will be granted more transmission opportunities. To strike a balance between the system throughput and user fairness, we then propose a fairness-oriented scheduling scheme based on the normalized accumulated energy. To evaluate the system performance, we model the dynamic charging/discharging processes of each IoD as a finite-state Markov Chain. Analytical expressions of the system outage probability and average throughput are derived over Rician fading channels for both proposed schemes. Simulation results validate the performance analysis and demonstrate the performance superiority of both proposed schemes over the existing schemes.

cs.IT↗

arXiv2018

Optimal Base Station Antenna Downtilt in Downlink Cellular Networks

From very recent studies, the area spectral efficiency (ASE) performance of downlink (DL) cellular networks will continuously decrease and finally to zero with the network densification in a fully loaded ultra-dense network (UDN) when the absolute height difference between a base station (BS) antenna and a user equipment (UE) antenna is larger than zero, which is referred as the ASE Crash. We revisit this issue by considering the impact of the BS antenna downtilt on the downlink network capacity. In general, there exists a height difference between a BS and a UE in practical networks. It is common to utilize antenna downtilt to adjust the direction of the vertical antenna pattern, and thus increase received signal power or reduce inter-cell interference power to improve network performance. This paper focuses on investigating the relationship between the base station antenna downtilt and the downlink network capacity in terms of the coverage probability and the ASE. The analytical results of the coverage probability and the ASE are derived, and we find that there exists an optimal antenna downtilt to achieve the maximal coverage probability for each base station density. Moreover, we derive numerically solvable expressions for the optimal antenna downtilt, which is a function of the base station density. Our theoretical and numerical results show that after applying the optimal antenna downtilt, the network performance can be improved significantly. Specifically, with the optimal antenna downtilt, the ASE crash can be delayed by nearly one order of magnitude in terms of the base station density.

cs.NI↗

arXiv2018

RAF: Robust Adaptive Multi-Feedback Channel Estimation for Millimeter Wave MIMO Systems

Millimeter wave is a promising technology for the next generation of wireless systems. As it is well-known for its high path loss, the systems working in this spectrum tend to exploit the shorter wavelength to equip the transceivers with a large number of antennas to overcome the path loss issue. The large number of antennas leads to large channel matrices and consequently a challenging channel estimation problem. The channel estimation algorithms that have been proposed so far either neglect the probability of estimation error or require a high feedback overload from receivers to ensure the target probability of estimation error. In this paper, we propose a multi-stage adaptive channel estimation algorithm called robust adaptive multi-feedback (RAF). The algorithm is based on using the estimated channel coefficient to predict a lower bound for the required number of measurements. Our simulations demonstrate that compared with existing algorithms, RAF can achieve the desired probability of estimation error while on average reducing the feedback overhead by 75.5% and the total channel estimation time by 14%.

cs.IT↗

arXiv2017

What is the Optimal Network Deployment for a Fixed Density of Antennas?

In this paper, we answer a fundamental question: when the total number of antennas per square kilometer is fixed, what is the optimal network deployment? A denser network with a less number of antennas per base station (BS) or the opposite case. To evaluate network performance, we consider a practical network scenario with a fixed antennas density and multiuser multiple-input-multiple-output (MU-MIMO) operations for single-antenna users. The number of antennas in each BS is calculated by dividing the antenna density by the BS density. With the consideration of several practical network models, i.e., pilot contamination, a limited user equipment (UE) density and probabilistic line-of-sight (LoS)/non-line-of-sight (NLoS) path loss model, we evaluate the area spectral efficiency (ASE) performance. From our simulation results, we conclude that there exists an optimal BS density for a certain UE density to maximize the ASE performance when the antenna density is fixed. The intuition is that (i) by densifying the network with more BSs, we can achieve a receive power gain due to the smaller distance between the typical UE and its serving BS; (ii) by installing more antennas in each BS, we can achieve a beamforming gain for UEs using MU-MIMO, although such beamforming gain is degraded by pilot contamination; (iii) thus, a trade-off exists between the receive power gain and the beamforming gain, if we fix the antenna density in the network.

cs.NI↗

arXiv2017

Ultra-Dense Networks: Is There a Limit to Spatial Spectrum Reuse?

The aggressive spatial spectrum reuse (SSR) by network densification using smaller cells has successfully driven the wireless communication industry onward in the past decades. In our future journey toward ultra-dense networks (UDNs), a fundamental question needs to be answered. Is there a limit to SSR? In other words, when we deploy thousands or millions of small cell base stations (BSs) per square kilometer, is activating all BSs on the same time/frequency resource the best strategy? In this paper, we present theoretical analyses to answer such question. In particular, we find that both the signal and interference powers become bounded in practical UDNs with a non-zero BS-to-UE antenna height difference and a finite UE density, which leads to a constant capacity scaling law. As a result, there exists an optimal SSR density that can maximize the network capacity. Hence, the limit to SSR should be considered in the operation of future UDNs.

cs.NI↗

arXiv2017

Performance Impact of Idle Mode Capability on Dense Small Cell Networks

Very recent studies showed that in a fully loaded dense small cell network (SCN), the coverage probability performance will continuously decrease with the network densification. Such new results were captured in IEEE ComSoc Technology News with an alarming title of "Will Densification Be the Death of 5G?". In this paper, we revisit this issue from more practical views of realistic network deployment, such as a finite number of active base stations (BSs) and user equipments (UEs), a decreasing BS transmission power with the network densification, etc. Particularly, in dense SCNs, due to an oversupply of BSs with respect to UEs, a large number of BSs can be put into idle modes without signal transmission, if there is no active UE within their coverage areas. Setting those BSs into idle modes mitigates unnecessary inter-cell interference and reduces energy consumption. In this paper, we investigate the performance impact of such BS idle mode capability (IMC) on dense SCNs. Different from existing work, we consider a realistic path loss model incorporating both line-of-sight (LoS) and non-line-of-sight (NLoS) transmissions. Moreover, we obtain analytical results for the coverage probability, the area spectral efficiency (ASE) and the energy efficiency (EE) performance for SCNs with the BS IMC and show that the performance impact of the IMC on dense SCNs is significant. As the BS density surpasses the UE density in dense SCNs, the coverage probability will continuously increase toward one, addressing previous concerns on "the death of 5G". Finally, the performance improvement in terms of the EE performance is also investigated for dense SCNs using practical energy models developed in the Green-Touch project.

cs.IT↗

arXiv2017

What Is the True Value of Dynamic TDD: A MAC Layer Perspective

Small cell networks (SCNs) are envisioned to embrace dynamic time division duplexing (TDD) in order to tailor downlink (DL)/uplink (UL) subframe resources to quick variations and burstiness of DL/UL traffic. The study of dynamic TDD is particularly important because it provides valuable insights on the full duplex transmission technology, which has been identified as one of the candidate technologies for the 5th-generation (5G) networks. Up to now, the existing works on dynamic TDD have shown that the UL of dynamic TDD suffers from severe performance degradation due to the strong DL-to-UL interference in the physical (PHY) layer. This conclusion raises a fundamental question: Despite such obvious technology disadvantage, what is the true value of dynamic TDD? In this paper, we answer this question from a media access control (MAC) layer viewpoint and present analytical results on the DL/UL time resource utilization (TRU) of synchronous dynamic TDD, which has been widely adopted in the existing 4th-generation (4G) systems. Our analytical results shed new light on the dynamic TDD in future synchronous 5G networks.

cs.IT↗

arXiv2017

Ultra-Dense Networks: A New Look at the Proportional Fair Scheduler

In this paper, we theoretically study the proportional fair (PF) scheduler in the context of ultra-dense networks (UDNs). Analytical results are obtained for the coverage probability and the area spectral efficiency (ASE) performance of dense small cell networks (SCNs) with the PF scheduler employed at base stations (BSs). The key point of our analysis is that the typical user is no longer a random user as assumed in most studies in the literature. Instead, a user with the maximum PF metric is chosen by its serving BS as the typical user. By comparing the previous results of the round-robin (RR) scheduler with our new results of the PF scheduler, we quantify the loss of the multi-user diversity of the PF scheduler with the network densification, which casts a new look at the role of the PF scheduler in UDNs. Our conclusion is that the RR scheduler should be used in UDNs to simplify the radio resource management (RRM).

cs.NI↗

arXiv2017

Will the Area Spectral Efficiency Monotonically Grow as Small Cells Go Dense?

In this paper, we introduce a sophisticated path loss model into the stochastic geometry analysis incorporating both line-of-sight (LoS) and non-line-of-sight (NLoS) transmissions to study their performance impact in small cell networks (SCNs). Analytical results are obtained on the coverage probability and the area spectral efficiency (ASE) assuming both a general path loss model and a special case of path loss model recommended by the 3rd Generation Partnership Project (3GPP) standards. The performance impact of LoS and NLoS transmissions in SCNs in terms of the coverage probability and the ASE is shown to be significant both quantitatively and qualitatively, compared with previous work that does not differentiate LoS and NLoS transmissions. Particularly, our analysis demonstrates that when the density of small cells is larger than a threshold, the network coverage probability will decrease as small cells become denser, which in turn makes the ASE suffer from a slow growth or even a notable decrease. For practical regime of small cell density, the performance results derived from our analysis are distinctively different from previous results, and shed new insights on the design and deployment of future dense/ultra-dense SCNs.

cs.NI↗

arXiv2017

Approximation of Uplink Inter-Cell Interference in FDMA Small Cell Networks

In this paper, for the first time, we analytically prove that the uplink (UL) inter-cell interference in frequency division multiple access (FDMA) small cell networks (SCNs) can be well approximated by a lognormal distribution under a certain condition. The lognormal approximation is vital because it allows tractable network performance analysis with closed-form expressions. The derived condition, under which the lognormal approximation applies, does not pose particular requirements on the shapes/sizes of user equipment (UE) distribution areas as in previous works. Instead, our results show that if a path loss related random variable (RV) associated with the UE distribution area, has a low ratio of the 3rd absolute moment to the variance, the lognormal approximation will hold. Analytical and simulation results show that the derived condition can be readily satisfied in future dense/ultra-dense SCNs, indicating that our conclusions are very useful for network performance analysis of the 5th generation (5G) systems with more general cell deployment beyond the widely used Poisson deployment.

cs.NI↗

arXiv2017

Study on the Idle Mode Capability with LoS and NLoS Transmissions

In this paper, we study the impact of the base station (BS) idle mode capability (IMC) on the network performance in dense small cell networks (SCNs). Different from existing works, we consider a sophisticated path loss model incorporating both line-of-sight (LoS) and non-line-of-sight (NLoS) transmissions. Analytical results are obtained for the coverage probability and the area spectral efficiency (ASE) performance for SCNs with IMCs at the BSs. The upper bound, the lower bound and the approximate expression of the activated BS density are also derived. The performance impact of the IMC is shown to be significant. As the BS density surpasses the UE density, thus creating a surplus of BSs, the coverage probability will continuously increase toward one. For the practical regime of the BS density, the results derived from our analysis are distinctively different from existing results, and thus shed new light on the deployment and the operation of future dense SCNs.

cs.NI↗

arXiv2017

DNA-GA: A New Approach of Network Performance Analysis

In this paper, we propose a new approach of network performance analysis, which is based on our previous works on the deterministic network analysis using the Gaussian approximation (DNA-GA). First, we extend our previous works to a signal-to-interference ratio (SIR) analysis, which makes our DNA-GA analysis a formal microscopic analysis tool. Second, we show two approaches for upgrading the DNA-GA analysis to a macroscopic analysis tool. Finally, we perform a comparison between the proposed DNA-GA analysis and the existing macroscopic analysis based on stochastic geometry. Our results show that the DNA-GA analysis possesses a few special features: (i) shadow fading is naturally considered in the DNAGA analysis; (ii) the DNA-GA analysis can handle non-uniform user distributions and any type of multi-path fading; (iii) the shape and/or the size of cell coverage areas in the DNA-GA analysis can be made arbitrary for the treatment of hotspot network scenarios. Thus, DNA-GA analysis is very useful for the network performance analysis of the 5th generation (5G) systems with general cell deployment and user distribution, both on a microscopic level and on a macroscopic level.

cs.IT↗