scispace - formally typeset
Search or ask a question

Showing papers in "IEEE Transactions on Wireless Communications in 2010"


Journal ArticleDOI
Thomas L. Marzetta1
TL;DR: A cellular base station serves a multiplicity of single-antenna terminals over the same time-frequency interval and a complete multi-cellular analysis yields a number of mathematically exact conclusions and points to a desirable direction towards which cellular wireless could evolve.
Abstract: A cellular base station serves a multiplicity of single-antenna terminals over the same time-frequency interval. Time-division duplex operation combined with reverse-link pilots enables the base station to estimate the reciprocal forward- and reverse-link channels. The conjugate-transpose of the channel estimates are used as a linear precoder and combiner respectively on the forward and reverse links. Propagation, unknown to both terminals and base station, comprises fast fading, log-normal shadow fading, and geometric attenuation. In the limit of an infinite number of antennas a complete multi-cellular analysis, which accounts for inter-cellular interference and the overhead and errors associated with channel-state information, yields a number of mathematically exact conclusions and points to a desirable direction towards which cellular wireless could evolve. In particular the effects of uncorrelated noise and fast fading vanish, throughput and the number of terminals are independent of the size of the cells, spectral efficiency is independent of bandwidth, and the required transmitted energy per bit vanishes. The only remaining impairment is inter-cellular interference caused by re-use of the pilot sequences in other cells (pilot contamination) which does not vanish with unlimited number of antennas.

6,248 citations


Journal ArticleDOI
TL;DR: Simulation results suggest that coordinating the beamforming vectors alone already provide appreciable performance improvements as compared to the conventional per-cell optimized network.
Abstract: In a conventional wireless cellular system, signal processing is performed on a per-cell basis; out-of-cell interference is treated as background noise. This paper considers the benefit of coordinating base-stations across multiple cells in a multi-antenna beamforming system, where multiple base-stations may jointly optimize their respective beamformers to improve the overall system performance. Consider a multicell downlink scenario where base-stations are equipped with multiple transmit antennas employing either linear beamforming or nonlinear dirty-paper coding, and where remote users are equipped with a single antenna each, but where multiple remote users may be active simultaneously in each cell. This paper focuses on the design criteria of minimizing either the total weighted transmitted power or the maximum per-antenna power across the base-stations subject to signal-to-interference-and-noise-ratio (SINR) constraints at the remote users. The main contribution of the paper is an efficient algorithm for finding the joint globally optimal beamformers across all base-stations. The proposed algorithm is based on a generalization of uplink-downlink duality to the multicell setting using the Lagrangian duality theory. An important feature is that it naturally leads to a distributed implementation in time-division duplex (TDD) systems. Simulation results suggest that coordinating the beamforming vectors alone already provide appreciable performance improvements as compared to the conventional per-cell optimized network.

719 citations


Journal ArticleDOI
TL;DR: A greedy policy is identified which, in low SNR regime, is throughput optimal and also minimizes mean delay and two energy management policies which minimize the mean delay in the queue are obtained.
Abstract: We study a sensor node with an energy harvesting source. The generated energy can be stored in a buffer. The sensor node periodically senses a random field and generates a packet. These packets are stored in a queue and transmitted using the energy available at that time. We obtain energy management policies that are throughput optimal, i.e., the data queue stays stable for the largest possible data rate. Next we obtain energy management policies which minimize the mean delay in the queue. We also compare performance of several easily implementable sub-optimal energy management policies. A greedy policy is identified which, in low SNR regime, is throughput optimal and also minimizes mean delay.

707 citations


Journal ArticleDOI
TL;DR: This paper investigates the performance of practical physical-layer network coding (PNC) schemes for two-way relay channels, and indicates that the opportunistic relaying scheme can significantly improve system performance, compared to a single relay network.
Abstract: This paper investigates the performance of practical physical-layer network coding (PNC) schemes for two-way relay channels. We first consider a network consisting of two source nodes and a single relay node, which is used to aid communication between the two source nodes. For this scenario, we investigate transmission over two, three or four time slots. We show that the two time slot PNC scheme offers a higher maximum sum-rate, but a lower sum-bit error rate (BER) than the four time slot transmission scheme for a number of practical scenarios. We also show that the three time slot PNC scheme offers a good compromise between the two and four time slot transmission schemes, and also achieves the best maximum sum-rate and/or sum-BER in certain practical scenarios. To facilitate comparison, we derive new closed-form expressions for the outage probability, maximum sum-rate and sum-BER. We also consider an opportunistic relaying scheme for a network with multiple relay nodes, where a single relay is chosen to maximize either the maximum sum-rate or minimize the sum-BER. Our results indicate that the opportunistic relaying scheme can significantly improve system performance, compared to a single relay network.

508 citations


Journal ArticleDOI
TL;DR: The simulation results provide the available traded-off in using multiple antenna techniques for spectrum sensing and illustrates the robustness of the proposed GLR detectors compared to the traditional energy detector when there is some uncertainty in the given noise variance.
Abstract: In this paper, we consider the problem of spectrum sensing by using multiple antenna in cognitive radios when the noise and the primary user signal are assumed as independent complex zero-mean Gaussian random signals. The optimal multiple antenna spectrum sensing detector needs to know the channel gains, noise variance, and primary user signal variance. In practice some or all of these parameters may be unknown, so we derive the generalized likelihood ratio (GLR) detectors under these circumstances. The proposed GLR detector, in which all the parameters are unknown, is a blind and invariant detector with a low computational complexity. We also analytically compute the missed detection and false alarm probabilities for the proposed GLR detectors. The simulation results provide the available traded-off in using multiple antenna techniques for spectrum sensing and illustrates the robustness of the proposed GLR detectors compared to the traditional energy detector when there is some uncertainty in the given noise variance.

418 citations


Journal ArticleDOI
TL;DR: This work considers a cooperative system in which EH nodes volunteer to serve as amplify-and-forward relays whenever they have sufficient energy for transmission, and quantifies how the energy usage at an EH relay and, consequently, its availability for relaying, depends not only on the relay's energy harvesting process, but also on its transmit power setting and the other relays in the system.
Abstract: The use of energy harvesting (EH) nodes as cooperative relays is a promising and emerging solution in wireless systems such as wireless sensor networks. It harnesses the spatial diversity of a multi-relay network and addresses the vexing problem of a relay's batteries getting drained in forwarding information to the destination. We consider a cooperative system in which EH nodes volunteer to serve as amplify-and-forward relays whenever they have sufficient energy for transmission. For a general class of stationary and ergodic EH processes, we introduce the notion of energy constrained and energy unconstrained relays and analytically characterize the symbol error rate of the system. Further insight is gained by an asymptotic analysis that considers the cases where the signal-to-noise-ratio or the number of relays is large. Our analysis quantifies how the energy usage at an EH relay and, consequently, its availability for relaying, depends not only on the relay's energy harvesting process, but also on its transmit power setting and the other relays in the system. The optimal static transmit power setting at the EH relays is also determined. Altogether, our results demonstrate how a system that uses EH relays differs in significant ways from one that uses conventional cooperative relays.

341 citations


Journal ArticleDOI
TL;DR: Simulation results show that the proposed scheme outperforms the reference schemes, in which either coordination is not employed or employed in a static manner, in terms of cell edge throughput with a minimal impact on the network throughput and with some increase in complexity.
Abstract: Interference management has been a key concept for designing future high data-rate wireless systems that are required to employ dense reuse of spectrum. Static or semi-static interference coordination based schemes provide enhanced cell-edge performance but with severe penalty to the overall cell throughput. Furthermore, static resource planning makes these schemes unsuitable for applications in which frequency planning is difficult, such as femtocell networks. In this paper, we present a novel dynamic interference avoidance scheme that makes use of inter-cell coordination in order to prevent excessive inter-cell interference, especially for cell or sector edge users that are most affected by inter-cell interference, with minimal or no impact on the network throughput. The proposed scheme is comprised of a two-level algorithm - one at the base station level and the other at a central controller to which a group of neighboring base stations are connected. Simulation results show that the proposed scheme outperforms the reference schemes, in which either coordination is not employed (reuse of 1) or employed in a static manner (reuse of 3 and fractional frequency reuse), in terms of cell edge throughput with a minimal impact on the network throughput and with some increase in complexity.

320 citations


Journal ArticleDOI
TL;DR: This paper studies the joint allocation of three types of resources, namely, power, subcarriers and relay nodes, in multi-relay assisted dual-hop cooperative OFDM systems and proposes two suboptimal algorithms for the former to trade off performance for complexity.
Abstract: In this paper, we study the joint allocation of three types of resources, namely, power, subcarriers and relay nodes, in multi-relay assisted dual-hop cooperative OFDM systems. All the relays adopt the amplify-and-forward protocol and assist the transmission from the source to destination simultaneously but on orthogonal subcarriers. The objective is to maximize the system transmission rate subject to individual power constraints on each node or a total network power constraint. We formulate such a problem as a subcarrier-pair based resource allocation that seeks the joint optimization of subcarrier pairing, subcarrier-pair-to-relay assignment, and power allocation. Using a dual approach, we solve this problem efficiently in an asymptotically optimal manner. Specifically, for the optimization problem with individual power constraints, the computational complexity is polynomial in the number of subcarriers and relay nodes, whereas the complexity of the problem with a total power constraint is polynomial in the number of subcarriers.We further propose two suboptimal algorithms for the former to trade off performance for complexity. Simulation studies are conducted to evaluate the average transmission rate and outage probability of the proposed algorithms. The impact of relay location is also discussed.

306 citations


Journal ArticleDOI
TL;DR: In this paper, optimal multi-channel cooperative sensing strategies in cognitive radio networks are investigated and a polynomial-complexity algorithm is proposed to solve the problem optimally.
Abstract: In this paper, optimal multi-channel cooperative sensing strategies in cognitive radio networks are investigated. A cognitive radio network with multiple potential channels is considered. Secondary users cooperatively sense the channels and send the sensing results to a coordinator, in which energy detection with a soft decision rule is employed to estimate whether there are primary activities in the channels. An optimization problem is formulated, which maximizes the throughput of secondary users while keeping detection probability for each channel above a pre-defined threshold. In particular, two sensing modes are investigated: slotted-time sensing mode and continuous-time sensing mode. With a slotted-time sensing mode, the sensing time of each secondary user consists of a number of mini-slots, each of which can be used to sense one channel. The initial optimization problem is shown to be a nonconvex mixed-integer problem. A polynomial-complexity algorithm is proposed to solve the problem optimally. With a continuous-time sensing mode, the sensing time of each secondary user for a channel can be any arbitrary continuous value. The initial nonconvex problem is converted into a convex bilevel problem, which can be successfully solved by existing methods. Numerical results are presented to demonstrate the effectiveness of our proposed algorithms.

282 citations


Journal ArticleDOI
TL;DR: In this article, the authors show mathematically and through simulations that the best approach depends heavily on whether the multiple access scheme is orthogonal or non-orthogonal (CDMA).
Abstract: Femtocells are assuming an increasingly important role in the coverage and capacity of cellular networks. In contrast to existing cellular systems, femtocells are end-user deployed and controlled, randomly located, and rely on third party backhaul (e.g. DSL or cable modem). Femtocells can be configured to be either open access or closed access. Open access allows an arbitrary nearby cellular user to use the femtocell, whereas closed access restricts the use of the femtocell to users explicitly approved by the owner. Seemingly, the network operator would prefer an open access deployment since this provides an inexpensive way to expand their network capabilities, whereas the femtocell owner would prefer closed access, in order to keep the femtocell's capacity and backhaul to himself. We show mathematically and through simulations that the reality is more complicated for both parties, and that the best approach depends heavily on whether the multiple access scheme is orthogonal (TDMA or OFDMA, per subband) or non-orthogonal (CDMA). In a TDMA/OFDMA network, closed-access is typically preferable at high user densities, whereas in CDMA, open access can provide gains of more than 300% for the home user by reducing the near-far problem experienced by the femtocell. The results of this paper suggest that the interests of the femtocell owner and the network operator are more compatible than typically believed, and that CDMA femtocells should be configured for open access whereas OFDMA or TDMA femtocells should adapt to the cellular user density.

260 citations


Journal ArticleDOI
TL;DR: A policy with decoupled admission control and power allocation decisions is proposed that achieves asymptotic optimality for sufficiently large battery capacity to maximum transmission power ratio (explicit bounds are provided).
Abstract: We consider the problem of cross-layer resource allocation for wireless networks operating with rechargeable batteries under general arrival, channel state and recharge processes. The objective is to maximize total system utility, defined as a function of the long-term rate achieved per link, while satisfying energy and power constraints. A policy with decoupled admission control and power allocation decisions is proposed that achieves asymptotic optimality for sufficiently large battery capacity to maximum transmission power ratio (explicit bounds are provided). We present first a downlink resource allocation scenario; the analysis is then extended to multihop networks. The policy is evaluated via simulations and is seen to perform very well even in the non-asymptotic regime. This policy is particularly suitable for sensor networks, which typically satisfy the asymptotic conditions required by our methodology.

Journal ArticleDOI
TL;DR: This paper proposes novel transceiver schemes for the MIMO interference channel based on the mean square error (MSE) criterion and shows that the joint design of transmit precoding matrices and receiving filter matrices with both objectives can be realized through efficient iterative algorithms.
Abstract: Interference alignment (IA) has evolved as a powerful technique in the information theoretic framework for achieving the optimal degrees of freedom of interference channel. In practical systems, the design of specific interference alignment schemes is subject to various criteria and constraints. In this paper, we propose novel transceiver schemes for the MIMO interference channel based on the mean square error (MSE) criterion. Our objective is to optimize the system performance under a given and feasible degree of freedom. Both the total MSE and the maximum per-user MSE are chosen to be the objective functions to minimize. We show that the joint design of transmit precoding matrices and receiving filter matrices with both objectives can be realized through efficient iterative algorithms. The convergence of the proposed algorithms is proven as well. Simulation results show that the proposed schemes outperform the existing IA schemes in terms of BER performance. Considering the imperfection of channel state information (CSI), we also extend the MSE-based transceiver schemes for the MIMO interference channel with CSI estimation error. The robustness of the proposed algorithms is confirmed by simulations.

Journal ArticleDOI
TL;DR: A novel hybrid adaptive antenna array which consists of analogue subarrays followed by a digital beamformer is presented in this paper to overcome the digital implementation difficulty.
Abstract: Owing to the excessive demand on signal processing and space constraint, a full digital implementation of a large adaptive antenna array at millimeter wave frequencies is very challenging. Targeted at long range high data rate point-to-point link in the 70/80 GHz bands, a novel hybrid adaptive antenna array which consists of analogue subarrays followed by a digital beamformer is presented in this paper to overcome the digital implementation difficulty. Two subarray configurations, the interleaved subarray and the side-by-side subarray, are proposed, and two Doppler resilient adaptive angle-of-arrival estimation and beamforming algorithms, the differential beam tracking (DBT) and the differential beam search (DBS), are developed. Simulation results on the DBT and DBS performance are provided using a 64 element hybrid planar array of four 4 by 4 element subarrays with the two subarray configurations, respectively. Recursive mean square error (MSE) bounds of the developed algorithms are also analyzed and compared with simulated MSEs.

Journal ArticleDOI
TL;DR: A novel iterative algorithm is presented which attempts to solve the Karush-Kuhn-Tucker (KKT) conditions of the non-convex primal problem at hand and results are provided to assess the performance of the proposed algorithm.
Abstract: We consider a multi-cell wireless network with universal frequency reuse and treat the problem of co-channel interference mitigation in the downlink channel. Assuming that each base station serves multiple single-antenna mobiles via space-division multiple-access, we jointly optimize the linear beam-vectors across a set of coordinated cells and resource slots: the objective function to be maximized is the instantaneous weighted sum-rate subject to per-base-station power constraints. After deriving the general structure of the optimal beam-vectors, a novel iterative algorithm is presented which attempts to solve the Karush-Kuhn-Tucker conditions of the non-convex problem at hand. The proposed algorithm admits a distributed implementation which we illustrate. Also, various approaches to choose the initial beam-vectors are considered, one of which maximizes the signal-to-leakage-plus-noise ratio. Finally, simulation results are provided to assess the performance of the proposed algorithm.

Journal ArticleDOI
TL;DR: The concept of exclusive region (ER) is introduced to allow concurrent transmissions to explore the spatial multiplexing gain of wireless networks and REX, a randomized ER based scheduling scheme, is proposed to decide a set of senders that can transmit simultaneously.
Abstract: Millimeter-wave (mmWave) transmissions are promising technologies for high data rate (multi-Gbps) Wireless Personal Area Networks (WPANs). In this paper, we first introduce the concept of exclusive region (ER) to allow concurrent transmissions to explore the spatial multiplexing gain of wireless networks. Considering the unique characteristics of mmWave communications and the use of omni-directional or directional antennae, we derive the ER conditions which ensure that concurrent transmissions can always outperform serial TDMA transmissions in a mmWave WPAN. We then propose REX, a randomized ER based scheduling scheme, to decide a set of senders that can transmit simultaneously. In addition, the expected number of flows that can be scheduled for concurrent transmissions is obtained analytically. Extensive simulations are conducted to validate the analysis and demonstrate the effectiveness and efficiency of the proposed REX scheduling scheme. The results should provide important guidelines for future deployment of mmWave based WPANs.

Journal ArticleDOI
TL;DR: The proposed Pi protocol is a practical incentive protocol, called Pi, such that when a source node sends a bundle message, it also attaches some incentive on the bundle, which is not only attractive but also fair to all participating DTN nodes.
Abstract: Delay Tolerant Networks (DTNs) are a class of networks characterized by lack of guaranteed connectivity, typically low frequency of encounters between DTN nodes and long propagation delays within the network. As a result, the message propagation process in DTNs follows a store-carryand- forward manner, and the in-transit bundle messages can be opportunistically routed towards the destinations through intermittent connections under the hypothesis that each individual DTN node is willing to help with forwarding. Unfortunately, there may exist some selfish nodes, especially in a cooperative network like DTN, and the presence of selfish DTN nodes could cause catastrophic damage to any well designed opportunistic routing scheme and jeopardize the whole network. In this paper, to address the selfishness problem in DTNs, we propose a practical incentive protocol, called Pi, such that when a source node sends a bundle message, it also attaches some incentive on the bundle, which is not only attractive but also fair to all participating DTN nodes. With the fair incentive, the selfish DTN nodes could be stimulated to help with forwarding bundles to achieve better packet delivery performance. In addition, the proposed Pi protocol can also thwart various attacks, which could be launched by selfish DTN nodes, such as free ride attack, layer removing and adding attacks. Extensive simulation results demonstrate the effectiveness of the proposed Pi protocol in terms of high delivery ratio and lower average delay.

Journal ArticleDOI
TL;DR: A simple cross-CC packet scheduling algorithm is proposed that improves the coverage performance and the resource allocation fairness among users, as compared to independent scheduling per CC.
Abstract: -In this paper we focus on resource allocation for next generation wireless communication systems with aggregation of multiple Component Carriers (CCs), i.e., how to assign the CCs to each user, and how to multiplex multiple users in each CC. We first investigate two carrier load balancing methods for allocating the CCs to the users- Round Robin (RR) and Mobile Hashing (MH) balancing by means of a simple theoretical formulation, as well as system level simulations. At Layer-2 we propose a simple cross-CC packet scheduling algorithm that improves the coverage performance and the resource allocation fairness among users, as compared to independent scheduling per CC. The Long Term Evolution (LTE)-Advanced is selected for the case study of a multi-carrier system. In such a system, RR provides better performance than MH balancing, and the proposed simple scheduling algorithm is shown to be effective in providing up to 90% coverage gain with no loss of the overall cell throughput, as compared to independent scheduling per CC.

Journal ArticleDOI
TL;DR: This paper addresses the physical-layer security issue of a secondary user (SU) in a spectrum-sharing cognitive radio network (CRN) from an information-theoretic perspective and proves that beamforming is the optimal strategy for the secure MISO CR channel.
Abstract: In this paper, we address the physical-layer security issue of a secondary user (SU) in a spectrum-sharing cognitive radio network (CRN) from an information-theoretic perspective. Specially, we consider a secure multiple-input single-output (MISO) cognitive radio channel, where a multi-antenna SU transmitter (SU-Tx) sends confidential information to a legitimate SU receiver (SU-Rx) in the presence of an eavesdropper and on the licensed band of a primary user (PU). The secrecy capacity of the channel is characterized, which is a quasiconvex optimization problem of finding the capacity-achieving transmit covariance matrix under the joint transmit power and interference power constraints. Two numerical approaches are proposed to derive the optimal transmit covariance matrix. The first approach recasts the original quasiconvex problem into a single convex semidefinite program (SDP) by exploring its inherent convexity; while the second one explores the relationship between the secure CRN and the conventional CRN and transforms the original problem into a sequence of optimization problems associated with the conventional CRN, which helps to prove that beamforming is the optimal strategy for the secure MISO CR channel. In addition, to reduce the computational complexity, three suboptimal schemes are presented, namely, scaled secret beamforming (SSB), projected secret beamforming (PSB) and projected cognitive beamforming (PCB). Lastly, computer simulation results show that the three suboptimal schemes can approach the secrecy capacity well under certain conditions.

Journal ArticleDOI
TL;DR: Simulation results show that the proposed iterative algorithm outperforms other existing methods in terms of sum rate and the proposed non-iterative method approaches a local optimal solution at high signal-to-noise ratio with reduced complexity.
Abstract: This paper studies linear precoding and decoding schemes for K-user interference channel systems. It was shown by Cadambe and Jafar that the interference alignment (IA) algorithm achieves a theoretical bound on degrees of freedom (DOF) for interference channel systems. Based on this, we first introduce a non-iterative solution for the precoding and decoding scheme. To this end, we determine the orthonormal basis vectors of each user's precoding matrix to achieve the maximum DOF, then we optimize precoding matrices in the IA method according to two different decoding schemes with respect to individual rate. Second, an iterative processing algorithm is proposed which maximizes the weighted sum rate. Deriving the gradient of the weighted sum rate and applying the gradient descent method, the proposed scheme identifies a local-optimal solution iteratively. Simulation results show that the proposed iterative algorithm outperforms other existing methods in terms of sum rate. Also, we exhibit that the proposed non-iterative method approaches a local optimal solution at high signal-to-noise ratio with reduced complexity.

Journal ArticleDOI
TL;DR: TCSM exhibits significant performance enhancements in the presence of realistic channel conditions such as Rician fading and spatial correlation (SC) and the complexity of the proposed scheme is shown to be 80% less than the V-BLAST complexity.
Abstract: Trellis coded modulation (TCM) is a well known scheme that reduces power requirements without any bandwidth expansion. In TCM, only certain sequences of successive constellation points are allowed (mapping by set partitioning). The novel idea in this paper is to apply the TCM concept to the antenna constellation points of spatial modulation (SM). The aim is to enhance SM performance in correlated channel conditions. SM considers the multiple transmit antennas as additional constellation points and maps a first part of a block of information bits to the transmit antenna indices. Therefore, spatial multiplexing gains are retained and spectral efficiency is boosted. The second part of the block of information bits is mapped to a complex symbol using conventional digital modulation schemes. At any particular time instant, only one antenna is active. The receiver estimates the transmitted symbol and the active antenna index and uses the two estimates to retrieve the original block of data bits. In this paper, TCM partitions the entire set of transmit antennas into sub-sets such that the spacing between antennas within a particular sub-set is maximized. The scheme is called trellis coded spatial modulation (TCSM). Tight analytical performance bounds over correlated fading channels are proposed in this paper. In addition, the performance and complexity of TCSM is compared to the performance of SM, coded V-BLAST (vertical Bell Labs layered space-time) applying near optimum sphere decoder algorithm, and Alamouti scheme combined with TCM. Also, the performance of all schemes with turbo coded modulation is presented. It is shown that under the same spectral efficiency, TCSM exhibits significant performance enhancements in the presence of realistic channel conditions such as Rician fading and spatial correlation (SC). In addition, the complexity of the proposed scheme is shown to be 80% less than the V-BLAST complexity.

Journal ArticleDOI
TL;DR: This paper investigates how to generate RIP (restricted isometry property) preserving measurements of sensor readings by taking multi-hop communication cost into account and discovers that a simple form of measurement matrix has good RIP, and the data gathering scheme that realizes this measurement matrix can further reduce the communication cost of CDG for both chain-type and tree-type topology.
Abstract: We proposed compressive data gathering (CDG) that leverages compressive sampling (CS) principle to efficiently reduce communication cost and prolong network lifetime for large scale monitoring sensor networks The network capacity has been proven to increase proportionally to the sparsity of sensor readings In this paper, we further address two key problems in the CDG framework First, we investigate how to generate RIP (restricted isometry property) preserving measurements of sensor readings by taking multi-hop communication cost into account Excitingly, we discover that a simple form of measurement matrix [I R] has good RIP, and the data gathering scheme that realizes this measurement matrix can further reduce the communication cost of CDG for both chain-type and tree-type topology Second, although the sparsity of sensor readings is pervasive, it might be rather complicated to fully exploit it Owing to the inherent flexibility of CS principle, the proposed CDG framework is able to utilize various sparsity patterns despite of a simple and unified data gathering process In particular, we present approaches for adapting CS decoder to utilize cross-domain sparsity (eg temporal-frequency and spatial-frequency) We carry out simulation experiments over both synthesized and real sensor data The results confirm that CDG can preserve sensor data fidelity at a reduced communication cost

Journal ArticleDOI
TL;DR: The approach introduced in this paper can be used to well-approximate the distribution of the sum of independent generalized-K random variables by a gamma distribution; the need for such results arises in various emerging distributed communication technologies and systems such as coordinated multipoint transmission and reception schemes.
Abstract: In wireless channels, multipath fading and shadowing occur simultaneously leading to the phenomenon referred to as composite fading. The use of the Nakagami probability density function (PDF) to model multipath fading and the Gamma PDF to model shadowing has led to the generalized-K model for composite fading. However, further derivations using the generalized K PDF are quite involved due to the computational and analytical difficulties associated with the arising special functions. In this paper, the approximation of the generalized-K PDF by a Gamma PDF using the moment matching method is explored. Subsequently, an adjustable form of the expressions obtained by matching the first two positive moments, to overcome the arising numerical and/or analytical limitations of higher order moment matching, is proposed. The optimal values of the adjustment factor for different integer and non-integer values of the multipath fading and shadowing parameters are given. Moreover, the approach introduced in this paper can be used to well-approximate the distribution of the sum of independent generalized-K random variables by a gamma distribution; the need for such results arises in various emerging distributed communication technologies and systems such as coordinated multipoint transmission and reception schemes including distributed antenna systems and cooperative relay networks.

Journal ArticleDOI
TL;DR: A unified algorithm which computes the optimal linear transceivers jointly at the source node and the relay nodes for amplify-and-forward (AF) protocols and proves the global optimality of the maximum sum-rate scheme under an asymptotically large antenna assumption.
Abstract: This paper considers both one-way and two-way relaying systems with multiple relays between two terminal nodes where all nodes have multiple-input multiple-output (MIMO) antennas. We propose a unified algorithm which computes the optimal linear transceivers jointly at the source node and the relay nodes for amplify-and-forward (AF) protocols. First, optimization designs based on the sum-rate and the mean-square error (MSE) criteria are formulated for the two-way AF relaying channel. Due to non-convexity of the given problems, the proposed schemes iteratively identify local-optimal source and relay filters by deriving the gradients of the cost functions for a gradient descent algorithm. Then, the proposed algorithm can optimize a one-way multiple relay system as a special case of the two-way channel. Finally, we prove the global optimality of the maximum sum-rate scheme under an asymptotically large antenna assumption. From simulation results, it is confirmed that the proposed methods yield the near optimum result for the MIMO multiple relay channel even with a moderate number of antennas. Consequently, we show that the proposed algorithm outperforms conventional schemes in terms of the sum-rate and the error performance for both one-way and two-way protocols.

Journal ArticleDOI
TL;DR: In this article, the authors investigate schemes to identify the malicious users based on outlier detection techniques for a cooperative sensing system employing energy detection at the sensors, considering constraints imposed by the CR scenario such as the lack of information about the primary signal propagation environment and the small size of the sensing data samples.
Abstract: Reliable detection of primary users (PUs) is an important task for cognitive radio (CR) systems. Cooperation among a few spectrum sensors has been shown to offer significant gain in the performance of the CR spectrum-sensing system by countering the shadow-fading effects. We consider a parallel fusion network in which the sensors send their sensing information to an access point which makes the final decision regarding presence or absence of the PU signal. It has been shown in the literature that the presence of malicious users sending false sensing data can severely degrade the performance of such a cooperative sensing system. In this paper, we investigate schemes to identify the malicious users based on outlier detection techniques for a cooperative sensing system employing energy detection at the sensors. We take into consideration constraints imposed by the CR scenario such as the lack of information about the primary signal propagation environment and the small size of the sensing data samples. Considering partial information of the PU activity, we propose a novel method to identify the malicious users. We further propose malicious user detection schemes that take into consideration the spatial information of the CR sensors. The performance of the proposed schemes are studied using simulations.

Journal ArticleDOI
TL;DR: It is argued that, in the context of most modern wireless systems and for the operating points of interest, transmission techniques that utilize all available spatial degrees of freedom for multiplexing outperform techniques that explicitly sacrifice spatial multipleXing for diversity.
Abstract: A contemporary perspective on transmit antenna diversity and spatial multiplexing is provided. It is argued that, in the context of most modern wireless systems and for the operating points of interest, transmission techniques that utilize all available spatial degrees of freedom for multiplexing outperform techniques that explicitly sacrifice spatial multiplexing for diversity. Reaching this conclusion, however, requires that the channel and some key system features be adequately modeled and that suitable performance metrics be adopted; failure to do so may bring about starkly different conclusions. As a specific example, this contrast is illustrated using the 3GPP long-term evolution system design.

Journal ArticleDOI
TL;DR: The proposed new and improved energy detector for random signals in Gaussian noise is proposed by replacing the squaring operation of the signal amplitude in the conventional energy detector with an arbitrary positive power operation, which confirms that the conventionalenergy detector based on the generalized likelihood ratio test is not optimum in terms of the detection performance.
Abstract: New and improved energy detector for random signals in Gaussian noise is proposed by replacing the squaring operation of the signal amplitude in the conventional energy detector with an arbitrary positive power operation. Numerical results show that the best power operation depends on the probability of false alarm, the probability of detection, the average signal-to-noise ratio or the sample size. By choosing the optimum power operation according to different system settings, new energy detectors with better detection performances can be derived. These results give useful guidance on how to improve the performances of current wireless systems using the energy detector. It also confirms that the conventional energy detector based on the generalized likelihood ratio test using the generalized likelihood function is not optimum in terms of the detection performance.

Journal ArticleDOI
TL;DR: This paper analyzes the performance of an energy detector over wireless channels with composite multipath fading and shadowing effects using the K and K_G channel models to find cases with diversity receptions including maximal ratio combining (MRC) and selection combining (SC).
Abstract: This paper analyzes the performance of an energy detector over wireless channels with composite multipath fading and shadowing effects. These effects are modeled by using the K and K_G channel models. Closed-form average detection probabilities are derived for both K and K_G channel models for the no-diversity reception case. A simple approximation is also derived for large values of energy threshold in the energy detector. The analysis is then extended to cases with diversity receptions including maximal ratio combining (MRC) and selection combining (SC). Analytical results are verified by Monte Carlo simulation and by numerical methods. Receiver operating characteristic (ROC) curves are presented for different degrees of multipath fading and shadowing. Finally, the Rayleigh-lognormal distribution and the K distribution are numerically compared, and the validity of the K channel model for representing the impact of shadowing on the performance of energy detection is affirmed.

Journal ArticleDOI
TL;DR: This paper considers a spectrum underlay network, where an OFDM-based cognitive radio (CR) system is allowed to share the subcarriers of an OFDMA-based primary system for simultaneous transmission, and shows that the CR system can achieve a significant rate gain under RLC as compared to IPC.
Abstract: This paper considers a spectrum underlay network, where an OFDM-based cognitive radio (CR) system is allowed to share the subcarriers of an OFDMA-based primary system for simultaneous transmission. Instead of using the conventional interference power constraint (IPC) to protect the primary users (PUs) in the primary system, a new criterion referred to as rate loss constraint (RLC), in the form of an upper bound on the maximum rate loss of each PU due to the CR transmission, is proposed for primary transmission protection. Assuming the channel state information (CSI) of the PU link, the CR link, and their mutual interference links is available to the CR, the optimal power allocation strategy to maximize the achievable rate of the CR system is derived under RLC together with CR?s transmit power constraint. It is shown that the CR system can achieve a significant rate gain under RLC as compared to IPC. Furthermore, the relationship between RLC and IPC is investigated, and it is shown that the rate gain is obtained by exploiting the additional CSI of the PU link. A more general case referred to as hybrid protection to PUs is then studied, by taking into account that some PU links? CSI is not available at CR.

Journal ArticleDOI
TL;DR: This paper comprehensively analyze the AUC of an energy detector with no-diversity reception and with several popular diversity schemes, and derives the average AUC for diversity reception cases including maximal ratio combining (MRC), square-law combining (SLC) and selection combining (SC).
Abstract: A simple figure of merit to describe the performance of an energy detector is desirable. The area under the receiver operating characteristic (ROC) curve, denoted (AUC), is such a measure, which varies between 1/2 and 1. If the detector's performance is no better than flipping a coin, then the AUC is 1/2 , and it increases to one as the detector performance improves. However, in the wireless literature, the AUC measure has gone unnoticed. In this paper, to address this gap, we comprehensively analyze the AUC of an energy detector with no-diversity reception and with several popular diversity schemes. The channel model is assumed to be Nakagami-m fading. First, the average AUC is derived for the case of no-diversity reception. Second, the average AUC is derived for diversity reception cases including maximal ratio combining (MRC), square-law combining (SLC) and selection combining (SC). Further, for Rayleigh fading channels, the impacts of channel estimation errors and fading correlations are analyzed. High SNR (signal-to-noise ratio) approximations and the detection diversity gain are also derived. The analytical results are verified by numerical computations and by Monte-Carlo simulations.

Journal ArticleDOI
TL;DR: A cooperative localization algorithm is proposed that considers the existence of obstacles in mobility-assisted wireless sensor networks (WSNs) and an optimal movement scheduling method with mobile elements (MEs) is proposed to address limitations of static WSNs in node localization.
Abstract: In this paper, a cooperative localization algorithm is proposed that considers the existence of obstacles in mobility-assisted wireless sensor networks (WSNs). An optimal movement scheduling method with mobile elements (MEs) is proposed to address limitations of static WSNs in node localization. In this scheme, a mobile anchor node cooperates with static sensor nodes and moves actively to refine location performance. It takes advantage of cooperation between MEs and static sensors while, at the same time, taking into account the relay node availability to make the best use of beacon signals. For achieving high localization accuracy and coverage, a novel convex position estimation algorithm is proposed, which can effectively solve the problem when infeasible points occur because of the effects of radio irregularity and obstacles. This method is the only rangefree based convex method to solve the localization problem when the feasible set of localization inequalities is empty. Simulation results demonstrate the effectiveness of this algorithm.