arXiv subjects

Jiandong Li

Publications and source records attributed to Jiandong Li.

42 records · Page 3Linked to original sources

arXiv2015

Cognitive Learning of Statistical Primary Patterns via Bayesian Network

In cognitive radio (CR) technology, the trend of sensing is no longer to only detect the presence of active primary users. A large number of applications demand for more comprehensive knowledge on primary user behaviors in spatial, temporal, and frequency domains. To satisfy such requirements, we study the statistical relationship among primary users by introducing a Bayesian network (BN) based framework. How to learn such a BN structure is a long standing issue, not fully understood even in the statistical learning community. Besides, another key problem in this learning scenario is that the CR has to identify how many variables are in the BN, which is usually considered as prior knowledge in statistical learning applications. To solve such two issues simultaneously, this paper proposes a BN structure learning scheme consisting of an efficient structure learning algorithm and a blind variable identification scheme. The proposed approach incurs significantly lower computational complexity compared with previous ones, and is capable of determining the structure without assuming much prior knowledge about variables. With this result, cognitive users could efficiently understand the statistical pattern of primary networks, such that more efficient cognitive protocols could be designed across different network layers.

cs.LG↗

arXiv2014

Correlations of Interference and Link Successes in Heterogeneous Cellular Networks

In heterogeneous cellular networks (HCNs), the interference received at a user is correlated over time slots since it comes from the same set of randomly located BSs. This results in the correlations of link successes, thus affecting network performance. Under the assumptions of a K-tier Poisson network, strongest-candidate based BS association, and independent Rayleigh fading, we first quantify the correlation coefficients of interference. We observe that the interference correlation is independent of the number of tiers, BS density, SIR threshold, and transmit power. Then, we study the correlations of link successes in terms of the joint success probability over multiple time slots. We show that the joint success probability is decided by the success probability in a single time slot and a diversity polynomial, which represents the temporal interference correlation. Moreover, the parameters of HCNs have an important influence on the joint success probability by affecting the success probability in a single time slot. Particularly, we obtain the condition under which the joint success probability increases with the BS density and transmit power. We further show that the conditional success probability given prior successes only depends on the path loss exponent and the number of time slots.

cs.IT↗

arXiv2013

On the Performance of Cooperative Spectrum Sensing under Quantization

In cognitive radio, the cooperative spectrum sensing (CSS) plays a key role in determining the performance of secondary networks. However, there have not been feasible approaches that can analytically calculate the performance of CSS with regard to the multi-level quantization. In this paper, we not only show the cooperative false alarm probability and cooperative detection probability impacted by quantization, but also formulate them by two closed form expressions. These two expressions enable the calculation of cooperative false alarm probability and cooperative detection probability tractable efficiently, and provide a feasible approach for optimization of sensing performance. Additionally, to facilitate this calculation, we derive Normal approximation for evaluating the sensing performance conveniently. Furthermore, two optimization methods are proposed to achieve the high sensing performance under quantization.

cs.IT↗

arXiv2012

On the Achievability of Interference Alignment for Three-Cell Constant Cellular Interfering Networks

For a three-cell constant cellular interfering network, a new property of alignment is identified, i.e., interference alignment (IA) solution obtained in an user-cooperation scenario can also be applied in a non-cooperation environment. By using this property, an algorithm is proposed by jointly designing transmit and receive beamforming matrices. Analysis and numerical results show that more degree of freedom (DoF) can be achieved compared with conventional schemes in most cases.

cs.IT↗

arXiv2011

Distributed Interference Alignment with Low Overhead

Based on closed-form interference alignment (IA) solutions, a low overhead distributed interference alignment (LOIA) scheme is proposed in this paper for the $K$-user SISO interference channel, and extension to multiple antenna scenario is also considered. Compared with the iterative interference alignment (IIA) algorithm proposed by Gomadam et al., the overhead is greatly reduced. Simulation results show that the IIA algorithm is strictly suboptimal compared with our LOIA algorithm in the overhead-limited scenario.

cs.IT↗

arXiv2010

Group Based Interference Alignment

In the $K$-user single-input single-output (SISO) frequency-selective fading interference channel, it is shown that the maximal achievable multiplexing gain is almost surely $K/2$ by using interference alignment (IA). However, when the signaling dimensions are limited, allocating all the resources to all users simultaneously is not optimal. So, a group based interference alignment (GIA) scheme is proposed, and it is formulated as an unbounded knapsack problem. Optimal and greedy search algorithms are proposed to obtain group patterns. Analysis and numerical results show that the GIA scheme can obtain a higher multiplexing gain when the resources are limited.

cs.IT↗