arXiv subjects

Zhaoyang Zhang

Publications and source records attributed to Zhaoyang Zhang.

At least 343 records · Page 19Linked to original sources

arXiv2014

Exploiting Delay Correlation for Multi-Antenna-Assisted High Speed Train Communications

In High Speed Train Communications (HSTC), the most challenging issue is coping with the extremely fast fading channel. Compared with its static counterpart, channel estimation on the move consumes excessive energy and spectrum to achieve similar performance. To address this issue, we exploit the delay correlation inherent in the linear spatial-temporal structure of multi-antenna array, based on which the rapid fading channel may be approximated by a virtual slow-fading channel. Subsequently, error probability and spectral efficiency are re-examined for this staticized channel. In particular, we formulate the quantitative tradeoff between the two metrics of interest, by adjusting the pilot percentage in each frame. Numerical results verify the good performance of the proposed scheme and elucidate the tradeoff.

cs.IT↗

arXiv2014

Mobile Conductance in Sparse Networks and Mobility-Connectivity Tradeoff

In this paper, our recently proposed mobile-conductance based analytical framework is extended to the sparse settings, thus offering a unified tool for analyzing information spreading in mobile networks. A penalty factor is identified for information spreading in sparse networks as compared to the connected scenario, which is then intuitively interpreted and verified by simulations. With the analytical results obtained, the mobility-connectivity tradeoff is quantitatively analyzed to determine how much mobility may be exploited to make up for network connectivity deficiency.

cs.NI↗

arXiv2014

Gossip-based Information Spreading in Mobile Networks

Mobile networks receive increasing research interest recently due to their increasingly wide applications in various areas; mobile ad hoc networks (MANET) and Vehicular ad hoc networks (VANET) are two prominent examples. Mobility introduces challenges as well as opportunities: it is known to improve the network throughput as shown in [1]. In this paper, we analyze the effect of mobility on the information spreading based on gossip algorithms. Our contributions are twofold. Firstly, we propose a new performance metric, mobile conductance, which allows us to separate the details of mobility models from the study of mobile spreading time. Secondly, we explore the mobile conductances of several popular mobility models, and offer insights on the corresponding results. Large scale network simulation is conducted to verify our analysis.

cs.SI↗

arXiv2014

On the Capacity Region of Cognitive Multiple Access over White Space Channels

Opportunistically sharing the white spaces, or the temporarily unoccupied spectrum licensed to the primary user (PU), is a practical way to improve the spectrum utilization. In this paper, we consider the fundamental problem of rate regions achievable for multiple secondary users (SUs) which send their information to a common receiver over such a white space channel. In particular, the PU activities are treated as on/off side information, which can be obtained causally or non-causally by the SUs. The system is then modeled as a multi-switch channel and its achievable rate regions are characterized in some scenarios. Explicit forms of outer and inner bounds of the rate regions are derived by assuming additional side information, and they are shown to be tight in some special cases. An optimal rate and power allocation scheme that maximizes the sum rate is also proposed. The numerical results reveal the impacts of side information, channel correlation and PU activity on the achievable rates, and also verify the effectiveness of our rate and power allocation scheme. Our work may shed some light on the fundamental limit and design tradeoffs in practical cognitive radio systems.

cs.IT↗

arXiv2014

Soft Consistency Reconstruction: A Robust 1-bit Compressive Sensing Algorithm

A class of recovering algorithms for 1-bit compressive sensing (CS) named Soft Consistency Reconstructions (SCRs) are proposed. Recognizing that CS recovery is essentially an optimization problem, we endeavor to improve the characteristics of the objective function under noisy environments. With a family of re-designed consistency criteria, SCRs achieve remarkable counter-noise performance gain over the existing counterparts, thus acquiring the desired robustness in many real-world applications. The benefits of soft decisions are exemplified through structural analysis of the objective function, with intuition described for better understanding. As expected, through comparisons with existing methods in simulations, SCRs demonstrate preferable robustness against noise in low signal-to-noise ratio (SNR) regime, while maintaining comparable performance in high SNR regime.

cs.IT↗

arXiv2014

Mobile Conductance and Gossip-based Information Spreading in Mobile Networks

In this paper, we propose a general analytical framework for information spreading in mobile networks based on a new performance metric, mobile conductance, which allows us to separate the details of mobility models from the study of mobile spreading time. We derive a general result for the information spreading time in mobile networks in terms of this new metric, and instantiate it through several popular mobility models. Large scale network simulation is conducted to verify our analysis.

cs.SI↗

arXiv2014

Energy Efficient Joint Source and Channel Sensing in Cognitive Radio Sensor Networks

A novel concept of Joint Source and Channel Sensing (JSCS) is introduced in the context of Cognitive Radio Sensor Networks (CRSN). Every sensor node has two basic tasks: application-oriented source sensing and ambient-oriented channel sensing. The former is to collect the application-specific source information and deliver it to the access point within some limit of distortion, while the latter is to find the vacant channels and provide spectrum access opportunities for the sensed source information. With in-depth exploration, we find that these two tasks are actually interrelated when taking into account the energy constraints. The main focus of this paper is to minimize the total power consumed by these two tasks while bounding the distortion of the application-specific source information. Firstly, we present a specific slotted sensing and transmission scheme, and establish the multi-task power consumption model. Secondly, we jointly analyze the interplay between these two sensing tasks, and then propose a proper sensing and power allocation scheme to minimize the total power consumption. Finally, Simulation results are given to validate the proposed scheme.

cs.IT↗

arXiv2014

Rateless-Coding-Assisted Multi-Packet Spreading over Mobile Networks

A novel Rateless-coding-assisted Multi-Packet Relaying (RMPR) protocol is proposed for large-size data spreading in mobile wireless networks. With this lightweight and robust protocol, the packet redundancy is reduced by a factor of $\sqrt n$, while the spreading time is reduced at least by a factor of $\ln (n)$. Closed-form bounds and explicit non-asymptotic results are presented, which are further validated through simulations. Besides, the packet duplication phenomenon in the network setting is analyzed for the first time.

cs.NI↗

arXiv2014

Distributed Spectrum-Aware Clustering in Cognitive Radio Sensor Networks

A novel Distributed Spectrum-Aware Clustering (DSAC) scheme is proposed in the context of Cognitive Radio Sensor Networks (CRSN). DSAC aims at forming energy efficient clusters in a self-organized fashion while restricting interference to Primary User (PU) systems. The spectrum-aware clustered structure is presented where the communications consist of intra-cluster aggregation and inter-cluster relaying. In order to save communication power, the optimal number of clusters is derived and the idea of groupwise constrained clustering is introduced to minimize intra-cluster distance under spectrum-aware constraint. In terms of practical implementation, DSAC demonstrates preferable scalability and stability because of its low complexity and quick convergence under dynamic PU activity. Finally, simulation results are given to validate the proposed scheme.

cs.NI↗

arXiv2014

Distributed Compressed Wideband Sensing in Cognitive Radio Sensor Networks

A novel distributed compressed wideband sensing scheme for Cognitive Radio Sensor Networks (CRSN) is proposed in this paper. Taking advantage of the distributive nature of CRSN, the proposed scheme deploys only one single narrowband sampler with ultra-low sampling rate at each nodes to accomplish the wideband spectrum sensing. First, the practical structure of the compressed sampler at each node is described in detail. Second, we show how the Fusion Center (FC) exploits the sampled signals with their spectrum randomly-aliased to detect the global wideband spectrum activity. Finally, the proposed scheme is validated through extensive simulations, which shows that it is particularly suitable for CRSN.

cs.NI↗

arXiv2014

Outage Probability of Dual-Hop Multiple Antenna AF Systems with Linear Processing in the Presence of Co-Channel Interference

This paper considers a dual-hop amplify-and-forward (AF) relaying system where the relay is equipped with multiple antennas, while the source and the destination are equipped with a single antenna. Assuming that the relay is subjected to co-channel interference (CCI) and additive white Gaussian noise (AWGN) while the destination is corrupted by AWGN only, we propose three heuristic relay precoding schemes to combat the CCI, namely, 1) Maximum ratio combining/maximal ratio transmission (MRC/MRT), 2) Zero-forcing/MRT (ZF/MRT), 3) Minimum mean-square error/MRT (MMSE/MRT). We derive new exact outage expressions as well as simple high signal-to-noise ratio (SNR) outage approximations for all three schemes. Our findings suggest that both the MRC/MRT and the MMSE/MRT schemes achieve a full diversity of N, while the ZF/MRT scheme achieves a diversity order of N-M, where N is the number of relay antennas and M is the number of interferers. In addition, we show that the MMSE/MRT scheme always achieves the best outage performance, and the ZF/MRT scheme outperforms the MRC/MRT scheme in the low SNR regime, while becomes inferior to the MRC/MRT scheme in the high SNR regime. Finally, in the large N regime, we show that both the ZF/MRT and MMSE/MRT schemes are capable of completely eliminating the CCI, while perfect interference cancelation is not possible with the MRC/MRT scheme.

cs.IT↗

arXiv2013

Controlling multi-wave mixing signals via photonic band gap of electromagnetically induced absorption grating in atomic media

We experimentally demonstrate dressed multi-wave mixing (MWM) and the reflection of the probe beam due to electromagnetically induced absorption (EIA) grating can coexist in a five-level atomic ensemble. The reflection is derived from the photonic band gap (PBG) of EIA grating, which is much broader than the PBG of EIT grating. Therefore, EIA-type PBG can reflect more energy from probe than EIT-type PBG does, which can effectively affect the MWM signal. The EIA-type as well as EIT-type PBG can be controlled by multiple parameters including the frequency detunings, propagation angles and powers of the involved light fields. Also, the EIA-type PBG by considering both the linear and third-order nonlinear refractive indices is also investigated. The theoretical analysis agrees well with the experimental results. This investigation has potential applications in all-optical communication and information processing.

physics.optics↗

arXiv2013

Resource Allocation for Cost Minimization in Limited Feedback MU-MIMO Systems with Delay Guarantee

In this paper, we design a resource allocation framework for the delay-sensitive Multi-User MIMO (MU-MIMO) broadcast system with limited feedback. Considering the scarcity and interrelation of the transmit power and feedback bandwidth, it is imperative to optimize the two resources in a joint and efficient manner while meeting the delay-QoS requirement. Based on the effective bandwidth theory, we first obtain a closed-form expression of average violation probability with respect to a given delay requirement as a function of transmit power and codebook size of feedback channel. By minimizing the total resource cost, we derive an optimal joint resource allocation scheme, which can flexibly adjust the transmit power and feedback bandwidth according to the characteristics of the system. Moreover, through asymptotic analysis, some simple resource allocation schemes are presented. Finally, the theoretical claims are validated by numerical results.

cs.IT↗

arXiv2013

Adaptive Mode Selection in Multiuser MISO Cognitive Networks with Limited Cooperation and Feedback

In this paper, we consider a multiuser MISO downlink cognitive network coexisting with a primary network. With the purpose of exploiting the spatial degree of freedom to counteract the inter-network interference and intra-network (inter-user) interference simultaneously, we propose to perform zero-forcing beamforming (ZFBF) at the multi-antenna cognitive base station (BS) based on the instantaneous channel state information (CSI). The challenge of designing ZFBF in cognitive networks lies in how to obtain the interference CSI. To solve it, we introduce a limited inter-network cooperation protocol, namely the quantized CSI conveyance from the primary receiver to the cognitive BS via purchase. Clearly, the more the feedback amount, the better the performance, but the higher the feedback cost. In order to achieve a balance between the performance and feedback cost, we take the maximization of feedback utility function, defined as the difference of average sum rate and feedback cost while satisfying the interference constraint, as the optimization objective, and derive the transmission mode and feedback amount joint optimization scheme. Moreover, we quantitatively investigate the impact of CSI feedback delay and obtain the corresponding optimization scheme. Furthermore, through asymptotic analysis, we present some simple schemes. Finally, numerical results confirm the effectiveness of our theoretical claims.

cs.IT↗

arXiv2013

Wireless Energy and Information Transfer Tradeoff for Limited Feedback Multi-Antenna Systems with Energy Beamforming

In this paper, we consider a multi-antenna system where the receiver should harvest energy from the transmitter by wireless energy transfer to support its wireless information transmission. In order to maximize the harvesting energy, we propose to perform adaptive energy beamforming according to the instantaneous channel state information (CSI). To help the transmitter to obtain the CSI for energy beamforming, we further propose a win-win CSI quantization feedback strategy, so as to improve the efficiencies of both power and information transmission. The focus of this paper is on the tradeoff of wireless energy and information transfer by adjusting the transfer duration with a total duration constraint. Through revealing the relationship between transmit power, transfer duration and feedback amount, we derive two wireless energy and information transfer tradeoff schemes by maximizing an upper bound and an approximate lower bound of the average information transmission rate, respectively. Moreover, the impact of imperfect CSI at the receiver is investigated and the corresponding wireless energy and information transfer tradeoff scheme is also given. Finally, numerical results validate the effectiveness of the proposed schemes.

cs.IT↗

arXiv2012

Outage Probability of Dual-Hop Multiple Antenna AF Relaying Systems with Interference

This paper presents an analytical investigation on the outage performance of dual-hop multiple antenna amplify-and-forward relaying systems in the presence of interference. For both the fixed-gain and variable-gain relaying schemes, exact analytical expressions for the outage probability of the systems are derived. Moreover, simple outage probability approximations at the high signal to noise ratio regime are provided, and the diversity order achieved by the systems are characterized. Our results suggest that variable-gain relaying systems always outperform the corresponding fixed-gain relaying systems. In addition, the fixed-gain relaying schemes only achieve diversity order of one, while the achievable diversity order of the variable-gain relaying scheme depends on the location of the multiple antennas.

cs.IT↗

arXiv2011

Weight Distributions of Regular Low-Density Parity-Check Codes over Finite Fields

The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approximation of the average weight distribution is derived for the small-weight case, and a series of fundamental qualitative properties of the asymptotic growth rate of the average weight distribution are proved. Based on this analysis, a general result, including all previous results as special cases, is established for the minimum distance of individual codes in a regular LDPC code ensemble.

cs.IT↗

arXiv2010

A Non-Cooperative Method for Path Loss Estimation in Femtocell Networks

A macrocell superposed by indoor deployed femtocells forms a geography-overlapped and spectrum-shared two tier network, which can efficiently improve coverage and enhance system capacity. It is important for reducing inter-tier co-channel interference that any femtocell user (FU) can select suitable access channel according to the path losses between itself and the macrocell users (MUs). Path loss should be estimated non-cooperatively since information exchange is difficult between macrocell and femtocells. In this paper, a novel method is proposed for FU to estimate the path loss between itself and any MU independently. According to the adaptive modulation and coding (AMC) mode information broadcasted by the macrocell base station (BS), FU first estimates the path loss between BS and a MU by using Maximum a Posteriori (MAP) method. The probability distribution function (PDF) and statistics of the transmission power of the MU is then derived. According to the sequence of received powers from the MU, FU estimates the path loss between itself and the MU by using minimum mean square error (MMSE) method. Simulation results show that the proposed method can efficiently estimate the path loss between any FU and any MU in all kinds of conditions.

cs.NI↗