arXiv subjects

Jiandong Li

Publications and source records attributed to Jiandong Li.

At least 37 records · Page 2Linked to original sources

arXiv2021

A Promising Technology for 6G Wireless Networks: Intelligent Reflecting Surface

The intelligent information society, which is highly digitized, intelligence inspired and globally data driven, will be deployed in the next decade. The next 6G wireless communication networks are the key to achieve this grand blueprint, which is expected to connect everything, provide full dimensional wireless coverage and integrate all functions to support full-vertical applications. Recent research reveals that intelligent reflecting surface (IRS) with wireless environment control capability is a promising technology for 6G networks. Specifically, IRS can intelligently control the wavefront, e.g., the phase, amplitude, frequency, and even polarization by massive tunable elements, thus achieving fine-grained 3-D passive beamforming. In this paper, we first give a blueprint of the next 6G networks including the vision, typical scenarios and key performance indicators (KPIs). Then, we provide an overview of IRS including the new signal model, hardware architecture and competitive advantages in 6G networks. Besides, we discuss the potential application of IRS in the connectivity of 6G networks in detail, including intelligent and controllable wireless environment, ubiquitous connectivity, deep connectivity and holographic connectivity. At last, we summarize the challenges of IRS application and deployment in 6G networks. As a timely review of IRS, our summary will be of interest to both researchers and practitioners engaging in IRS for 6G networks.

cs.NI↗

arXiv2021

Joint Spatial Division and Coaxial Multiplexing for Downlink Multi-User OAM Wireless Backhaul

Orbital angular momentum (OAM) at radio frequency (RF) provides a novel approach of multiplexing a set of orthogonal modes on the same frequency channel to achieve high spectral efficiencies (SEs). However, the existing research on OAM wireless communications is mainly focused on pointto-point transmission in the line-of-sight (LoS) scenario. In this paper, we propose an overall scheme of the downlink multi-user OAM (MU-OAM) wireless backhaul based on uniform circular arrays (UCAs) for broadcasting networks, which can achieve the joint spatial division and coaxial multiplexing (JSDCM). A salient feature of the proposed downlink MU-OAM wireless backhaul systems is that the channel matrices are completely characterized by the position of each small base station (SBS), independent of the numbers of subcarriers and antennas, which avoids estimating large channel matrices required by the traditional downlink multi-user multiple-input multiple-output (MU-MIMO) wireless backhaul systems. Thereafter, we propose an OAM-based multiuser distance and angle of arrival (AoA) estimation method, which is able to simultaneously estimate the positions of multiple SBSs with a flexible number of training symbols. With the estimated distances and AoAs, a MU-OAM preprocessing scheme is applied to eliminate the co-mode and inter-mode interferences in the downlink MU-OAM channel. At last, the proposed methods are extended to the downlink MU-OAM-MIMO wireless backhaul system equipped with uniform concentric circular arrays (UCCAs), for which much higher spectral efficiency (SE) and energy efficiency (EE) than traditional MU-MIMO systems can be achieved. Both mathematical analysis and simulation results validate that the proposed scheme can effectively eliminate both interferences of the practical downlink MU-OAM channel and approaches the performance of the ideal MU-OAM channel.

cs.IT↗

arXiv2020

Multi-mode OAM Radio Waves: Generation, Angle of Arrival Estimation and Reception With UCAs

Orbital angular momentum (OAM) at radio frequency (RF) provides a novel approach of multiplexing a set of orthogonal modes on the same frequency channel to achieve high spectrum efficiencies. However, there are still big challenges in the multi-mode OAM generation, OAM antenna alignment and OAM signal reception. To solve these problems, we propose an overall scheme of the line-of-sight multi-carrier and multi-mode OAM (LoS MCMM-OAM) communication based on uniform circular arrays (UCAs). First, we verify that UCA can generate multi-mode OAM radio beam with both the RF analog synthesis method and the baseband digital synthesis method. Then, for the considered UCA-based LoS MCMM-OAM communication system, a distance and AoA estimation method is proposed based on the two-dimensional ESPRIT (2-D ESPRIT) algorithm. A salient feature of the proposed LoS MCMM-OAM and LoS MCMM-OAM-MIMO systems is that the channel matrices are completely characterized by three parameters, namely, the azimuth angle, the elevation angle and the distance, independent of the numbers of subcarriers and antennas, which significantly reduces the burden by avoiding estimating large channel matrices, as traditional MIMO-OFDM systems. After that, we propose an OAM reception scheme including the beam steering with the estimated AoA and the amplitude detection with the estimated distance. At last, the proposed methods are extended to the LoS MCMM-OAM-MIMO system equipped with uniform concentric circular arrays (UCCAs). Both mathematical analysis and simulation results validate that the proposed OAM reception scheme can eliminate the effect of the misalignment error of a practical OAM channel and approaches the performance of an ideally aligned OAM channel.

eess.SP↗

arXiv2020

Access Points in the Air: Modeling and Optimization of Fixed-Wing UAV Network

Fixed-wing unmanned aerial vehicles (UAVs) are of great potential to serve as aerial access points (APs) owing to better aerodynamic performance and longer flight endurance. However, the inherent hovering feature of fixed-wing UAVs may result in discontinuity of connections and frequent handover of ground users (GUs). In this work, we model and evaluate the performance of a fixed-wing UAV network, where UAV APs provide coverage to GUs with millimeter wave backhaul. Firstly, it reveals that network spatial throughput (ST) is independent of the hover radius under real-time closest-UAV association, while linearly decreases with the hover radius if GUs are associated with the UAVs, whose hover center is the closest. Secondly, network ST is shown to be greatly degraded with the over-deployment of UAV APs due to the growing air-to-ground interference under excessive overlap of UAV cells. Finally, aiming to alleviate the interference, a projection area equivalence (PAE) rule is designed to tune the UAV beamwidth. Especially, network ST can be sustainably increased with growing UAV density and independent of UAV flight altitude if UAV beamwidth inversely grows with the square of UAV density under PAE.

cs.IT↗

arXiv2019

Orbital Angular Momentum Waves: Generation, Detection and Emerging Applications

Orbital angular momentum (OAM) has aroused a widespread interest in many fields, especially in telecommunications due to its potential for unleashing new capacity in the severely congested spectrum of commercial communication systems. Beams carrying OAM have a helical phase front and a field strength with a singularity along the axial center, which can be used for information transmission, imaging and particle manipulation. The number of orthogonal OAM modes in a single beam is theoretically infinite and each mode is an element of a complete orthogonal basis that can be employed for multiplexing different signals, thus greatly improving the spectrum efficiency. In this paper, we comprehensively summarize and compare the methods for generation and detection of optical OAM, radio OAM and acoustic OAM. Then, we represent the applications and technical challenges of OAM in communications, including free-space optical communications, optical fiber communications, radio communications and acoustic communications. To complete our survey, we also discuss the state of art of particle manipulation and target imaging with OAM beams.

physics.app-ph↗

arXiv2019

Optimal Dynamic Multi-Resource Management in Earth Observation Oriented Space Information Networks

Space information network (SIN) is an innovative networking architecture to achieve near-real-time mass data observation, processing and transmission over the globe. In the SIN environment, it is essential to coordinate multi-dimensional heterogeneous resources (i.e., observation resource, computation resource and transmission resource) to improve network performance. However, the time varying property of both the observation resource and transmission resource is not fully exploited in existing studies. Dynamic resource management according to instantaneous channel conditions has a potential to enhance network performance. To this end, in this paper, we study the multi-resource dynamic management problem, considering stochastic observation and transmission channel conditions in SINs. Specifically, we develop an aggregate optimization framework for observation scheduling, compression ratio selection and transmission scheduling, and formulate a flow optimization problem based on extended time expanded graph (ETEG) to maximize the sum network utility. Then, we equivalently transform the flow optimization problem on ETEG as a queue stability-related stochastic optimization problem. An online algorithm is proposed to solve the problem in a slot-by-slot manner by exploiting the Lyapunov optimization technique. Performance analysis shows that the proposed algorithm achieves close-to-optimal network utility while guaranteeing bounded queue occupancy. Extensive simulation results further validate the efficiency of the proposed algorithm and evaluate the impacts of various network parameters on the algorithm performance.

eess.SY↗

arXiv2018

Game-Theoretic Approaches for Wireless Communications with Unmanned Aerial Vehicles

Wireless communications with unmanned aerial vehicles (UAVs) offer a promising solution to provide cost-effective wireless connectivity and extend coverage. In recent years, the area of wireless communications for UAV system design and optimization has been receiving enormous attention from the research community. However, there are still existing challenges that are far from solved. To cope with those challenges, researchers have been exploring the applicability of game-theoretic approaches. This paper surveys the existing game-theoretic solutions and presents a number of novel solutions which are designed to optimize energy consumption, enhance network coverage, and improve connectivity in wireless communications with UAVs. We present main game components and the elements they represent in wireless communications with UAVs first and then give a classification of the current used game-theoretic approaches. We identify main problems in wireless communications with UAVs in which game theory has been used to find solutions. We provide a case to show the merits of applying game theory in wireless communication with UAVs. Finally, we discuss shortcomings of the traditional game-theoretic approaches and propose mean field game (MFG) as an appropriate method for solving novel technical problems in massive UAVs networks.

cs.NI↗

arXiv2017

Limitation of SDMA in Ultra-Dense Small Cell Networks

Benefitting from multi-user gain brought by multi-antenna techniques, space division multiple access (SDMA) is capable of significantly enhancing spatial throughput (ST) in wireless networks. Nevertheless, we show in this letter that, even when SDMA is applied, ST would diminish to be zero in ultra-dense networks (UDN), where small cell base stations (BSs) are fully densified. More importantly, we compare the performance of SDMA, single-user beamforming (SU-BF) (one user is served in each cell) and full SDMA (the number of served users equals the number of equipped antennas). Surprisingly, it is shown that SU-BF achieves the highest ST and critical density, beyond which ST starts to degrade, in UDN. The results in this work could shed light on the fundamental limitation of SDMA in UDN.

cs.IT↗

arXiv2017

MISO in Ultra-Dense Networks: Balancing the Tradeoff between User and System Performance

With over-deployed network infrastructures, network densification is shown to hinder the improvement of user experience and system performance. In this paper, we adopt multi-antenna techniques to overcome the bottleneck and investigate the performance of single-user beamforming, an effective method to enhance desired signal power, in small cell networks from the perspective of user coverage probability (CP) and network spatial throughput (ST). Pessimistically, it is proved that, even when multi-antenna techniques are applied, both CP and ST would be degraded and even asymptotically diminish to zero with the increasing base station (BS) density. Moreover, the results also reveal that the increase of ST is at the expense of the degradation of CP. Therefore, to balance the tradeoff between user and system performance, we further study the critical density, under which ST could be maximized under the CP constraint. Accordingly, the impact of key system parameters on critical density is quantified via the derived closed-form expression. Especially, the critical density is shown to be inversely proportional to the square of antenna height difference between BSs and users. Meanwhile, single-user beamforming, albeit incapable of improving CP and ST scaling laws, is shown to significantly increase the critical density, compared to the single-antenna regime.

cs.IT↗

arXiv2017

Network Densification in 5G: From the Short-Range Communications Perspective

Besides advanced telecommunications techniques, the most prominent evolution of wireless networks is the densification of network deployment. In particular, the increasing access points/users density and reduced cell size significantly enhance spatial reuse, thereby improving network capacity. Nevertheless, does network ultra-densification and over-deployment always boost the performance of wireless networks? Since the distance from transmitters to receivers is greatly reduced in dense networks, signal is more likely to be propagated from long- to short-range region. Without considering short-range propagation features, conventional understanding of the impact of network densification becomes doubtful. With this regard, it is imperative to reconsider the pros and cons brought by network densification. In this article, we first discuss the short-range propagation features in densely deployed network and verify through experimental results the validity of the proposed short-range propagation model. Considering short-range propagation, we further explore the fundamental impact of network densification on network capacity, aided by which a concrete interpretation of ultra-densification is presented from the network capacity perspective. Meanwhile, as short-range propagation makes interference more complicated and difficult to handle, we discuss possible approaches to further enhance network capacity in ultra-dense wireless networks. Moreover, key challenges are presented to suggest future directions.

cs.IT↗

arXiv2017

The Impact of Antenna Height Difference on the Performance of Downlink Cellular Networks

Capable of significantly reducing cell size and enhancing spatial reuse, network densification is shown to be one of the most dominant approaches to expand network capacity. Due to the scarcity of available spectrum resources, nevertheless, the over-deployment of network infrastructures, e.g., cellular base stations (BSs), would strengthen the inter-cell interference as well, thus in turn deteriorating the system performance. On this account, we investigate the performance of downlink cellular networks in terms of user coverage probability (CP) and network spatial throughput (ST), aiming to shed light on the limitation of network densification. Notably, it is shown that both CP and ST would be degraded and even diminish to be zero when BS density is sufficiently large, provided that practical antenna height difference (AHD) between BSs and users is involved to characterize pathloss. Moreover, the results also reveal that the increase of network ST is at the expense of the degradation of CP. Therefore, to balance the tradeoff between user and network performance, we further study the critical density, under which ST could be maximized under the CP constraint. Through a special case study, it follows that the critical density is inversely proportional to the square of AHD. The results in this work could provide helpful guideline towards the application of network densification in the next-generation wireless networks.

cs.IT↗

arXiv2017

Effects of Base-Station Spatial Interdependence on Interference Correlation and Network Performance

The spatial-and-temporal correlation of interference has been well studied in Poisson networks where the interfering base stations (BSs) are independent of each other. However, there exists spatial interdependence including attraction and repulsion among the BSs in practical wireless networks, affecting the interference distribution and hence the network performance. In view of this, by modeling the network as a Poisson clustered process, we quantify the effects of spatial interdependence among BSs on the interference correlation and analytically prove that BS clustering increases the level of interference correlation. In particular, it is shown that the level increases as the attraction between the BSs increases. Furthermore, we study the effects of spatial interdependence among BSs on network performance with a retransmission scheme via considering heterogeneous cellular networks in which small-cell BSs exhibit a clustered topology in practice. It is shown that the interference correlation degrades the network performance and the degradation increases as the attraction between BSs increases. Finally, a correlation-aware retransmission scheme is proposed to improve the network performance by taking advantage of the interference correlation and avoiding the blind retransmissions.

cs.IT↗

arXiv2016

Modeling and Analysis of SCMA Enhanced D2D and Cellular Hybrid Network

Sparse code multiple access (SCMA) has been recently proposed for the future wireless networks, which allows non-orthogonal spectrum resource sharing and enables system overloading. In this paper, we apply SCMA into device-to-device (D2D) communication and cellular hybrid network, targeting at using the overload feature of SCMA to support massive device connectivity and expand network capacity. Particularly, we develop a stochastic geometry based framework to model and analyze SCMA, considering underlaid and overlaid mode. Based on the results, we analytically compare SCMA with orthogonal frequency-division multiple access (OFDMA) using area spectral efficiency (ASE) and quantify closed-form ASE gain of SCMA over OFDMA. Notably, it is shown that system ASE can be significantly improved using SCMA and the ASE gain scales linearly with the SCMA codeword dimension. Besides, we endow D2D users with an activated probability to balance cross-tier interference in the underlaid mode and derive the optimal activated probability. Meanwhile, we study resource allocation in the overlaid mode and obtain the optimal codebook allocation rule. It is interestingly found that the optimal SCMA codebook allocation rule is independent of cellular network parameters when cellular users are densely deployed. The results are helpful in the implementation of SCMA in the hybrid system.

cs.IT↗

arXiv2016

Effect of Densification on Cellular Network Performance with Bounded Pathloss Model

In this paper, we investigate how network densification influences the performance of downlink cellular network in terms of coverage probability (CP) and area spectral efficiency (ASE). Instead of the simplified unbounded pathloss model (UPM), we apply a more realistic bounded pathloss model (BPM) to model the decay of signal power caused by pathloss. It is shown that network densification indeed degrades CP when the base station (BS) density $λ$ is sufficiently large. This is inconsistent with the result derived using UPM that CP is independent of $λ$. Moreover, we shed light on the impact of ultra-dense deployment of BSs on the ASE scaling law. Specifically, it is proved that the cellular network ASE scales with rate $λe^{-κλ}$, i.e., first increases with $λ$ and then diminishes to be zero as $λ$ goes to infinity.

cs.IT↗

arXiv2016

Analysis of Interference Correlation in Non-Poisson Networks

The correlation of interference has been well quantified in Poisson networks where the interferers are independent of each other. However, there exists dependence among the base stations (BSs) in wireless networks. In view of this, we quantify the interference correlation in non-Poisson networks where the interferers are distributed as a Matern cluster process (MCP) and a second-order cluster process (SOCP). Interestingly, it is found that the correlation coefficient of interference for the Matern cluster networks, $ζ_{MCP}$, is equal to that for second-order cluster networks, $ζ_{SOCP}$. Furthermore, they are greater than their counterpart for the Poisson networks. This shows that clustering in interferers enhances the interference correlation. In addition, we show that the correlation coefficients $ζ_{MCP}$ and $ζ_{SOCP}$ increase as the average number of points in each cluster, $c$, grows, but decrease with the increase in the cluster radius, $R$. More importantly, we point that the effects of clustering on interference correlation can be neglected as $\frac{c}{π^{2}R^{2}}\rightarrow0$. Finally, the analytical results are validated by simulations.

cs.IT↗

arXiv2015

Globally Optimal Joint Uplink Base Station Association and Beamforming

The joint base station (BS) association and beamforming problem has been studied extensively in recent years, yet the computational complexity for even the simplest SISO case has not been fully characterized. In this paper, we consider the problems for an uplink SISO/SIMO cellular network under the max-min fairness criterion. We first prove that the problems for both the SISO and SIMO scenarios are polynomial time solvable. Secondly, we present a fixed point based binary search (BS-FP) algorithm for both SISO and SIMO scenarios whereby a QoS (Quality of Service) constrained subproblem is solved at each step by a fixed point method. Thirdly, we propose a normalized fixed point (NFP) iterative algorithm to directly solve the original problem and prove its geometric convergence to global optima. Although it is not known whether the NFP algorithm is a polynomial time algorithm, empirically it converges to the global optima orders of magnitude faster than the polynomial time algorithms, making it suitable for applications in huge-scale networks.

cs.IT↗

arXiv2015

On throughput capacity for a class of buffer-limited MANETs

Available throughput performance studies for mobile ad hoc networks (MANETs) suffer from two major limitations: they mainly focus on the scaling law study of throughput, while the exact throughput of such networks remains largely unknown; they usually consider the infinite buffer scenarios, which are not applicable to the practical networks with limited buffer. As a step to address these limitations, this paper develops a general framework for the exact throughput capacity study of a class of buffer-limited MANETs with the two-hop relay. We first provide analysis to reveal how the throughput capacity of such a MANET is determined by its relay-buffer blocking probability (RBP). Based on the Embedded Markov Chain Theory and Queuing Theory, a novel theoretical framework is then developed to enable the RBP and closed-form expression for exact throughput capacity to be derived. We further conduct case studies under two typical transmission scheduling schemes to illustrate the applicability of our framework and to explore the corresponding capacity optimization as well as capacity scaling law. Finally, extensive simulation and numerical results are provided to validate the efficiency of our framework and to show the impacts brought by the buffer constraint.

cs.IT↗

arXiv2015

End-to-end delay modeling in buffer-limited MANETs: a general theoretical framework

This paper focuses on a class of important two-hop relay mobile ad hoc networks (MANETs) with limited-buffer constraint and any mobility model that leads to the uniform distribution of the locations of nodes in steady state, and develops a general theoretical framework for the end-to-end (E2E) delay modeling there. We first combine the theories of Fixed-Point, Quasi-Birth-and-Death process and embedded Markov chain to model the limiting distribution of the occupancy states of a relay buffer, and then apply the absorbing Markov chain theory to characterize the packet delivery process, such that a complete theoretical framework is developed for the E2E delay analysis. With the help of this framework, we derive a general and exact expression for the E2E delay based on the modeling of both packet queuing delay and delivery delay. To demonstrate the application of our framework, case studies are further provided under two network scenarios with different MAC protocols to show how the E2E delay can be analytically determined for a given network scenario. Finally, we present extensive simulation and numerical results to illustrate the efficiency of our delay analysis as well as the impacts of network parameters on delay performance.

cs.IT↗