Search

In wireless networks, the link connectivity may be intermittent due to shadowing, burstiness of data arrival, or uncoordinated resource allocation. In this paper, we model the intermittence of links as Bernoulli distributed random channel states, termed intermittence channel states, and study the impact of the corresponding channel state information at the transmitter (CSIT) in a two-user Gaussian broadcast channel (BC). Moreover, due to the heterogeneous timeliness of intermittence channel states, the CSIT considered in this paper is hybrid. More specifically, the CSIT of each link can be perfectly (causally or non-causally) available, delayed, or not available. When the links are connected, we adopt a general setting that the received signal-to-noise ratios can be different. Our contribution is the characterization of the capacity regions of intermittent Gaussian BC to within bounded gaps for all combinations of hybrid CSIT, except for scenario DN (delayed CSIT of receiver 1, no CSIT of receiver 2). For scenario DN, we propose an opportunistic physical layer network coding scheme that achieves a strictly larger degree-of-freedom (DoF) region than the no-CSIT DoF region. As a corollary, single-user CSIT is able to increase the sum DoF for intermittent Gaussian BC (also the capacity region for the erasure BC, as a by-product). This result is in sharp contrast to the recent negative result by Davoodi and Jafar, where it is shown that for fast-fading multiple-input single-output BC with continuous channel states, single-user CSIT does not help at all in terms of sum DoF. [ABSTRACT FROM AUTHOR]

The capacity of multiple-input multiple-output (MIMO) Rayleigh fading channels with full knowledge of channel state information (CSI) at both the transmitter and the receiver (CSI-TR) has been shown recently to scale at low signal-to-noise ratio (SNR) essentially as SNR log(1/SNR), independently of the number of transmit and receive antennas. In this paper, we investigate the ergodic capacity of MIMO Rayleigh fading channel with estimated channel state information at the transmitter (CSI-T) and possibly imperfect channel state information at the receiver (CSI-R). Our framework can be seen as a generalization of previous works as it can capture the perfect CSI-TR as a special case when the estimation error variance goes to zero. In this paper, we mainly focus on the low SNR regime, and we show that the capacity scales as $(1-\alpha)$ SNR log(1/SNR), where $\alpha$ is the estimation error variance. This characterization shows the loss of performance due to error estimation over the perfect channel state information at both the transmitter and the receiver. As a by-product of our new analysis, we show that our framework can be also extended to characterize the capacity of MIMO Rician fading channels at low SNR with possibly imperfect CSI-T and CSI-R. [ABSTRACT FROM AUTHOR]

This paper considers a wireless communication network consisting of multiple interfering multicast sessions. Different from a unicast system where each transmitter has only one receiver, in a multicast system, each transmitter has multiple receivers and broadcasts a common message to all of them. It is a well-known result for wireless unicast systems that the feasibility of a signal-to-interference-plus-noise power ratio (SINR) without power constraint is decided by the spectral radius of a nonnegative matrix. We generalize this result and obtain necessary and sufficient conditions for the feasibility of an SINR in a wireless multicast system with and without power constraint. The feasible SINR region and its geometric properties are studied. Besides, an iterative algorithm is proposed, which can efficiently check the feasibility condition and compute the boundary points of the feasible SINR region. [ABSTRACT FROM AUTHOR]

Visible light communication (VLC) based simultaneous positioning and orientating (SPAO), using received signal strength (RSS) measurements, is studied in this paper. RSS-based SPAO for VLCs of great challenge as it is essentially a non-convex optimization problem due to the nonlinear RSS model. To address this non-convexity challenge, a novel particle-assisted stochastic search (PASS) algorithm is proposed. The proposed PASS-based SPAO scheme does not require the knowledge of the height of receiver, the perfect alignment of transceiver orientations or inertial measurements. This is a huge technical improvement over the existing VLC localization solutions. The algorithmic convergence is established to justify the proposed PASS algorithm. In addition, a closed-form Cramer–Rao lower bound (CRLB) on localization error is derived and analyzed to gain insights into how the VLC-based SPAO performance is related to system configurations. It is shown that the receiver's position and orientation accuracy is linear with signal-to-noise ratio and direction information. In addition, the position accuracy decays with six powers of the transceiver distance, while the orientation accuracy decays with four powers of the transceiver distance. Finally, simulation results verify the performance gain of the proposed PASS algorithm for VLC-based SPAO. [ABSTRACT FROM AUTHOR]

Enabling device-to-device (D2D) communications in millimeter-wave (mm-wave) networks is of critical importance for the next-generation mobile networks to support very high data rates (multi-gigabits-per-second) for mobile devices. In this paper, we provide a fine-grained performance analysis of the mm-wave D2D communication networks. Specifically, we first establish a general and tractable framework to investigate the performance of mm-wave D2D networks using the Poisson bipolar model integrated with several features of the mm-wave band. To show what fraction of users in the network achieve target reliability if the required signal-to-interference-plus-noise ratio (SINR) (or QoS requirement) is given, we derive the meta distributions of the SINR and the data rate. Interestingly, in mm-wave D2D networks, the standard beta approximation for the meta distribution does not work very well when highly directional antenna arrays are used or the node density is small. To resolve this issue, we provide a modified approximation by using higher moments of the conditional SINR distribution, which is shown to be closer to the exact result. On this basis, we also derive the mean local delay and spatial outage capacity to provide a comprehensive investigation on the impact of mm-wave features on the performance of D2D communication. [ABSTRACT FROM AUTHOR]

Second order cone (SOC) restrictions have been widely employed in the design of wireless communication systems to recast precoding optimizations in convex form. This paper highlights the flexibility of this framework to handle various transmit power and interference limitations also in the multistream multiple-input multiple-output broadcast channel with imperfect channel state information at the transmitter. In particular, we propose an iterative solution for mean square error (MSE) balancing with such constraints via the Lagrangian dual formulation. The MSE balancing criteria, contrary to signal-to-interference plus-noise ratio and rate criteria, exhibit an interesting property when considering different targets for the receivers. Users with low target values are strictly prioritized in comparison to users with large MSE targets that can even be switched off. Therefore, only a subset of the receivers is served at the solution with stringent limitations for the precoders. An example of such stringent limitations are small power constraints and probabilistic interference temperature constraints that set a measurable threshold on the generated interference in a cognitive radio system. We provide four different approaches to approximate these probabilistic constraints with deterministic SOC constraints, and compare their accuracy. [ABSTRACT FROM PUBLISHER]

In emerging heterogeneous networks (HetNets), a wide range of the underlying performance evaluation problems is related to wireless interference characterization and can be reduced to investigating the distribution of a side length in a random triangle. In this paper, we address the task of calculating the side-length distribution in such a triangle determined by the known distributions of its two other sides and the distribution of the angle between them. No restrictions on the distributions of input random variables (RVs) are imposed except for their statistical independence. Our solution delivers a crucial building block for interference analysis in multitier and multiradio HetNets, including mobile device-to-device communication as one of the most extreme interference-limited cases. [ABSTRACT FROM AUTHOR]

In this paper, we study the codebook size design strategies in the multiple-input–multiple-output (MIMO) broadcast channel (BC) systems. We adopt the nonlinear Tomlinson–Harashima precoder (THP), which is designed by the imperfect channel direction information (CDI) acquired from the random vector quantization (RVQ) feedback mechanism. Under the limitation of the total feedback rate, we flexibly allocate the size of each user's codebook so that the overall channel capacity is maximized. Since the design problem is not convex, directly finding out the optimum allocation of codebook size is not attainable. However, by sophisticatedly using the discrete majorization theory, we can derive the codebook size allocation strategies for the high- and the low-signal-to-noise-ratio (SNR) regions. Interestingly, the results show that the equal size codebook is preferable in the low-SNR region, whereas the codebook allocates the whole available codebook size to a single user in the high-SNR region. Simulations certify the theoretical result of our design. [ABSTRACT FROM PUBLISHER]

This paper studies the throughput of spectrum sharing networks utilizing rate adaptation. We use some recent results on the achievable rates of finite block-length codes to analyze the secondary user (SU) throughput with a constraint on the primary user (PU) codeword drop probability. With codewords of finite length, we derive closed-form expressions for the SU activation probability and throughput. The results are obtained in different scenarios with perfect or no channel state information at the SU transmitter. As demonstrated numerically and analytically, using finite-length codewords and rate adaptation, there is considerable potential for the data transmission of unlicensed secondary users under different quality-of-service requirements of the licensed primary users. [ABSTRACT FROM PUBLISHER]

The cognitive radio (CR) system needs to optimally set the sensing period and sensing time, to efficiently utilize the channel while protecting a primary user (PU). The optimal sensing period for maximizing the effective throughput of the CR system depends on not only the on/off pattern of the PU and the sensing error probabilities but also the size of a data packet, the transmission rate, and the forward error correction capability. In this paper, we mathematically derive the optimal sensing period while taking all of these factors into account. On the basis of this optimal period, we design the sensing strategy under which the CR user has the breaks for sensing during a data packet transmission. With the proposed sensing strategy, the CR system can protect the PU very well while achieving the high effective throughput. [ABSTRACT FROM PUBLISHER]

We propose a power-efficient Tomlinson-Harashima precoder (THP) in the downlink of multi-user multiple-input single-output (MU-MISO) systems, where a transmit power reduction is achieved by means of interference optimization. The adopted approach is based on adaptively scaling the symbols of a number of users whose received signal-to-noise ratio (SNR) thresholds are known to the transmitter. By doing this, the interference can be better aligned to the symbols of interest, thus reducing the power required to cancel it. The scaling is performed by forming a constrained optimization problem, solved with existing well-known techniques, which entails an increase in the computational complexity at the base station. To quantify this trade-off in performance and complexity, a study of the impact in the signal processing load is carried out by means of a power efficiency analysis. The presented analytical and simulation results in this paper confirm that the proposed technique increases the power efficiency up to 100% with respect to previous THP-based approaches while, at the same time, maintaining the same average performance. [ABSTRACT FROM AUTHOR]

Interference alignment has emerged as a powerful tool in the analysis of multiuser networks. Despite considerable recent progress, the capacity region of the Gaussian $K$ -user interference channel is still unknown in general, in part due to the challenges associated with alignment on the signal scale using lattice codes. This paper develops a new framework for lattice interference alignment, based on the compute-and-forward approach. Within this framework, each receiver decodes by first recovering two or more linear combinations of the transmitted codewords with integer-valued coefficients and then solving these linear combinations for its desired codeword. For the special case of symmetric channel gains, this framework is used to derive the approximate sum capacity of the Gaussian interference channel, up to an explicitly defined outage set of the channel gains. The key contributions are the capacity lower bounds for the weak through strong interference regimes, where each receiver should jointly decode its own codeword along with part of the interfering codewords. As part of the analysis, it is shown that decoding K$ linear combinations of the codewords can approach the sum capacity of the K$ -user Gaussian multiple-access channel up to a gap of no more than bits. [ABSTRACT FROM PUBLISHER]

In this paper, we analyze a multiple-input multiple-output (MIMO) interference channel where nodes are randomly distributed on a plane as a spatial Poisson cluster point process. A Poisson cluster point process consists of clusters with fixed number of points randomly distributed as with the cluster centers distributed randomly on the plane. The nodes in each cluster use interference alignment (IA) to suppress intra-cluster interference but unlike most work on IA, we do not neglect inter-cluster interference. We also connect the accuracy of channel state information to the distance between the nodes, i.e., the quality of CSI degrades with increasing distance. Accounting for the training and feedback overhead, we derive the transmission capacity of this MIMO IA ad hoc network and then compare it to open-loop (interference-blind) spatial multiplexing. Finally, we present exemplary system setups where spatial multiplexing outperforms IA due to the imperfect channel state information or the non-aligned inter-cluster interference. [ABSTRACT FROM PUBLISHER]

In this paper, we study the effect of feedback on the two-user MIMO interference channel. The capacity region of the MIMO interference channel with feedback is characterized within a constant number of bits, where this constant is independent of the channel matrices. Further, it is shown that the capacity region of the MIMO interference channel with feedback and its reciprocal interference channel are within a constant number of bits. Finally, the generalized degrees of freedom region for the MIMO interference channel with feedback is characterized. [ABSTRACT FROM PUBLISHER]

In this paper, we focus on energy efficient routing in wireless ad hoc networks. We exploit modulo combining of continuous-time signals arriving at a receiving node from a number of synchronized transmitting nodes and introduce a cooperative physical layer network coding (CPLNC) scheme. To demonstrate the effectiveness of the proposed scheme in reducing energy consumption, we propose two routing algorithms that utilize CPLNC as a basic building block. Through analysis, we show that with sufficiently long packets, the proposed algorithms can achieve energy saving gains of up to 37% and 62% with respect to the conventional shortest-path routing algorithm in regular line and grid networks, respectively, using less number of hops. We incorporate CPLNC into two major energy efficient routing algorithms and derive threshold distances that enable the current node to intelligently decide whether it should use CPLNC or point to point transmission to the next hop. Simulation results confirm that the proposed and the modified algorithms based on CPLNC outperform their conventional counterparts in terms of achieving significant energy saving gains in networks of randomly distributed nodes. [ABSTRACT FROM AUTHOR]

In this paper, a new power/rate control scheme is proposed to increase the network throughputs of carrier-sense-multiple-access-with-collision-avoidance (CSMA/CA)-based wireless ad hoc networks with multiple transmission rates. The design principle of the scheme is to utilize the space–time resource efficiently. For this purpose, a new measure that evaluates the space–time resource consumption per bit transmission is introduced. Simulation results show that the proposed scheme is effective in improving network throughputs under the two-ray ground reflection model and the Ricean model. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate the secrecy rate of finite-alphabet communications over multiple-input–multiple-output–multiple-antenna eavesdropper (MIMOME) channels. Traditional precoding designs based on Gaussian input assumption may lead to substantial secrecy rate loss when the Gaussian input is replaced by practical finite-alphabet input. To address this issue, we investigate linear precoding designs to directly maximize the secrecy rate for MIMOME systems under the constraint of finite-alphabet input. By exploiting the theory of Karush–Kuhn–Tucker (KKT) analysis and matrix calculus, we first present necessary conditions of the optimal precoding design when instantaneous channel-state information (CSI) of the eavesdropper is known at the transmitter. In this light, an iterative algorithm for finding the optimal precoding matrix is developed, utilizing a gradient decent method with backtracking line search. Moreover, we find that the beamforming design in MIMONE systems, which is a secrecy-capacity-achieving approach for Gaussian signaling, no longer provides the maximum secrecy rate for finite-alphabet input data. This case is substantially different from the Gaussian input case. In addition, we derive the closed-form results on the precoding matrix, which maximizes the secrecy rate in the low signal-to-noise ratio (SNR) region, and reveal the optimal precoding structure in the high-SNR region. A novel jamming signal generation method that draws on the CSI of the eavesdropper to additionally increase the secrecy rate is further proposed. The precoding design with only statistical CSI of the eavesdropper available at the transmitter is also considered. Numerical results show that the proposed designs provide significant gains over recent precoding designs through a power control policy and the precoding design with the Gaussian input assumption in various scenarios. [ABSTRACT FROM PUBLISHER]

This paper studies the achievable secure rate per source–destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes with intensities \lambda and \lambdae, respectively. It is shown that, as long as \lambdae/\lambda=o\left((\log n)^{-2}\right), almost all of the nodes achieve a perfectly secure rate of \Omega\left(1\over\sqrtn\right) for the extended and dense network models. Therefore, under these assumptions, securing the network does not entail a loss in the per-node throughput. The achievability argument is based on a novel multihop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Second, an ergodic fading model with n source–destination pairs and ne eavesdroppers is considered. Employing the ergodic interference alignment scheme with an appropriate secrecy precoding, each user is shown to achieve a constant positive secret rate for sufficiently large n. Remarkably, the scheme does not require eavesdropper CSI (only the statistical knowledge is assumed) and the secure throughput per node increases as we add more legitimate users to the network in this setting. Finally, the effect of eavesdropper collusion on the performance of the proposed schemes is characterized. [ABSTRACT FROM PUBLISHER]

This paper is concerned with the performance analysis of the maximum eigenmode beamforming (MEB) scheme with equal power allocation (EPA) over practically coded multiple-input multiple-output (MIMO) multiple-access channels (MACs). Both the scenarios of perfect and imperfect channel state information (CSI) at the transmitters (CSIT) are considered. Analytical and numerical results show that MEB with EPA can achieve significant power savings and is less sensitive to CSIT error than other alternatives. [ABSTRACT FROM PUBLISHER]

This paper presents a practical virtual multiple-input–multiple-output (MIMO) system that implements bit-interleaved coded modulation (BICM) and compress-and-forward (CF) cooperation. A minimum mean square error (MMSE) receiver is considered since it has low complexity and allows good performance when combined with BICM techniques. A closed-form upper bound for the system error probability is derived, and based on this we prove that the smallest singular value of the cooperative channel matrix determines the system error performance. Accordingly, an adaptive modulation and cooperation scheme is proposed, which uses the smallest singular value as the threshold strategy. Depending on the instantaneous channel conditions, the system could therefore adapt to choose a suitable modulation type for transmission and an appropriate quantization rate to perform CF cooperation. It is shown that the adaptive modulation and cooperation scheme not only enables the system to achieve comparable performance to the case with fixed quantization rates but eliminates unnecessary complexity for quantization operations and conference link communication as well. [ABSTRACT FROM PUBLISHER]

Interference alignment (IA) is a transmission technique for exploiting all available degrees of freedom in the frequency- or time-selective interference channel with an arbitrary number of users. Most prior work on IA, however, neglects interference from other nodes in the network that are not participating in the alignment operation. This paper proposes three generalizations of IA for the multiple-antenna interference channel with multiple users that account for colored noise, which models uncoordinated interference. First, a minimum interference-plus-noise leakage (INL) algorithm is presented and shown to be equivalent to previous subspace methods when noise is spatially white or negligible. This algorithm results in orthonormal precoders that are desirable for practical implementation with limited feedback. A joint minimum mean square error design that jointly optimizes the transmit precoders and receive spatial filters is then proposed, whereas previous designs neglect the receive spatial filter. Finally, a maximum signal-to-interference-plus-noise ratio (SINR) algorithm is developed and proven to converge, unlike previous maximum SINR algorithms. The sum throughput of these algorithms is simulated in the context of a network with uncoordinated cochannel interferers that are not participating in the alignment protocol. It is found that a network with cochannel interference can benefit from employing precoders that are designed to consider that interference, but in extreme cases, such as when only one receiver has a large amount of interference, ignoring that the cochannel interference is advantageous. [ABSTRACT FROM PUBLISHER]