Showing papers in "IEEE Transactions on Communications in 2012"
TL;DR: In this article, the authors consider the optimal packet scheduling problem in a single-user EH wireless communication system, where both the data packets and the harvested energy are modeled to arrive at the source node randomly and the goal is to adaptively change the transmission rate according to the traffic load and available energy, such that the time by which all packets are delivered is minimized.
Abstract: We consider the optimal packet scheduling problem in a single-user energy harvesting wireless communication system. In this system, both the data packets and the harvested energy are modeled to arrive at the source node randomly. Our goal is to adaptively change the transmission rate according to the traffic load and available energy, such that the time by which all packets are delivered is minimized. Under a deterministic system setting, we assume that the energy harvesting times and harvested energy amounts are known before the transmission starts. For the data traffic arrivals, we consider two different scenarios. In the first scenario, we assume that all bits have arrived and are ready at the transmitter before the transmission starts. In the second scenario, we consider the case where packets arrive during the transmissions, with known arrival times and sizes. We develop optimal off-line scheduling policies which minimize the time by which all packets are delivered to the destination, under causality constraints on both data and energy arrivals.
867 citations
TL;DR: It is shown that Gaussian approximation for density evolution enables one to accurately predict the performance of polar codes and concatenated codes based on them.
Abstract: Polar codes are shown to be instances of both generalized concatenated codes and multilevel codes. It is shown that the performance of a polar code can be improved by representing it as a multilevel code and applying the multistage decoding algorithm with maximum likelihood decoding of outer codes. Additional performance improvement is obtained by replacing polar outer codes with other ones with better error correction performance. In some cases this also results in complexity reduction. It is shown that Gaussian approximation for density evolution enables one to accurately predict the performance of polar codes and concatenated codes based on them.
664 citations
TL;DR: A chunk-based resource allocation scheme, i.e. joint chunk, power and bit allocation, is proposed and analyzed by maximizing the throughput under a total transmit power constraint and the digital nature of bits/symbol/subcarrier is considered, the average throughput of the dynamic power allocation outperforms the fixed power allocation scheme.
Abstract: By grouping a number of adjacent subcarriers into a chunk, resource allocation can be carried out chunk by chunk in orthogonal frequency division multiple access (OFDMA) systems. Chunk-based resource allocation is an effective approach to reduce the complexity of resource allocation in OFDMA systems. In this paper, a chunk-based resource allocation scheme, i.e. joint chunk, power and bit allocation, is proposed and analyzed by maximizing the throughput under a total transmit power constraint. A scaling factor is introduced to achieve optimal allocation. Considering the digital nature of bits per symbol per subcarrier (bits/symbol/subcarrier), a digitization process is proposed to digitize the theoretically allocated bits/symbol/subcarrier to integer. System parameters, such as the power constraint, number of users, coherence bandwidth, number of subcarriers and number of chunks, are introduced and their impacts on the average throughput are studied. The performance of the dynamic power allocation scheme is compared with the fixed power allocation scheme. The numerical results show that the theoretical throughput of the fixed power allocation scheme is quite close to that of the dynamic power allocation scheme. However, when the digital nature of bits/symbol/subcarrier is considered, the average throughput of the dynamic power allocation outperforms the fixed power allocation scheme.
454 citations
TL;DR: This work presents a novel approach to mitigate ranging errors directly in the physical layer, and applies two classes of non-parametric regressors to form an estimate of the ranging error.
Abstract: Location-awareness is becoming increasingly important in wireless networks. Indoor localization can be enabled through wideband or ultra-wide bandwidth (UWB) transmission, due to its fine delay resolution and obstacle-penetration capabilities. A major hurdle is the presence of obstacles that block the line-of-sight (LOS) path between devices, affecting ranging performance and, in turn, localization accuracy. Many techniques have been proposed to address this issue, most of which make modifications to the localization algorithm. Since many localization algorithms work with distance or angle estimates, rather than received waveforms, information inherent in the wideband waveform is lost, leading to sub-optimal ranging error mitigation. To avoid this information loss, we present a novel approach to mitigate ranging errors directly in the physical layer. In contrast to existing techniques, which detect the non-line-of-sight (NLOS) condition, our approach directly mitigates the bias incurred in both LOS and non-LOS conditions. In particular, we apply two classes of non-parametric regressors to form an estimate of the ranging error. Our work is based on, and validated by, an extensive indoor measurement campaign with FCC-compliant UWB radios. The results show that the proposed regressors provide significant performance improvements in various practical localization scenarios, compared to conventional approaches.
305 citations
TL;DR: The model for clipping noise can be modeled according to the Bussgang theorem and the central limit theorem as attenuation of the data-carrying subcarriers at the receiver and addition of zero-mean complex-valued Gaussian noise to derive the electrical signal-to-noise ratio (SNR).
Abstract: In this paper, the impact of clipping noise on optical wireless communication (OWC) systems employing orthogonal frequency division multiplexing (OFDM) is investigated. The two existing optical OFDM (O-OFDM) transmission schemes, asymmetrically clipped optical OFDM (ACO-OFDM) and direct-current-biased optical OFDM (DCO-OFDM), are studied. Time domain signal clipping generally results from direct current (DC) biasing and/or from physical limitations of the transmitter front-end. These include insufficient forward biasing and the maximum power driving limit of the emitter. The clipping noise can be modeled according to the Bussgang theorem and the central limit theorem (CLT) as attenuation of the data-carrying subcarriers at the receiver and addition of zero-mean complex-valued Gaussian noise. Analytical expressions for the attenuation factor and the clipping noise variance are determined in closed-form and employed in the derivation of the electrical signal-to-noise ratio (SNR). The validity of the model is verified through a Monte Carlo bit-error ratio (BER) simulation. Finally, the BER performance of ACO-OFDM with DCO-OFDM is compared for different clipping levels and multi-level quadrature amplitude modulation (M-QAM) schemes.
291 citations
TL;DR: Simulation results not only illustrate that the proposed distributed algorithm converges to the optimal solution in a small number of iterations, but also demonstrate the potential performance gains achievable with full-duplex relaying protocols.
Abstract: In this paper, we formulate a joint optimization problem for resource allocation and scheduling in full-duplex multiple-input multiple-output orthogonal frequency division multiple access (MIMO-OFDMA) relaying systems with amplify-and-forward (AF) and decode-and-forward (DF) relaying protocols. Our problem formulation takes into account heterogeneous data rate requirements for delay sensitive and non-delay sensitive users. We also consider a theoretically optimal hybrid relaying scheme as a performance benchmark, which allows a dynamic selection between AF relaying and DF relaying protocols with full-duplex and half-duplex relays. We show that under some mild conditions the optimal transmitter precoding and receiver post-processing matrices jointly diagonalize the MIMO-OFDMA relay channels for all considered relaying protocols transforming the resource allocation and scheduling problem into a scalar optimization problem. Dual decomposition is employed to solve this optimization problem and a distributed iterative resource allocation and scheduling algorithm with closed-form power and subcarrier allocation is derived. Simulation results not only illustrate that the proposed distributed algorithm converges to the optimal solution in a small number of iterations, but also demonstrate the potential performance gains achievable with full-duplex relaying protocols.
238 citations
TL;DR: It is shown that it may be preferable, in terms of outage and symbol error probability, not to include links in the relay selection process that experience a sufficiently high maximum Doppler shift, since in those cases partial relay selection outperforms best relay selection.
Abstract: We study the effect of outdated channel state information on the outage and error rate performance of amplify-and-forward (AF) relay selection, where only one out of the set of available relays is activated. We consider two variations of AF relay selection, namely best relay selection and partial relay selection, when the selection is based upon outdated channel estimates. For both these variations, closed-form expressions for the outage probability are obtained, along with approximate expressions for the symbol error rate in the medium to high signal-to-noise-ratio (SNR) regime. The diversity gain and coding gain of the above schemes are also explicitly derived. Numerical results manifest that the outage performance of AF relay selection is highly dependent on the level of correlation between the actual channel conditions and their corresponding (outdated) estimates. This result has a significant impact on the deployment of relay selection in practical applications, implying that a high feedback rate may be required in practice in order to attain the full benefits of relay selection. It is further shown that it may be preferable, in terms of outage and symbol error probability, not to include links in the relay selection process that experience a sufficiently high maximum Doppler shift, since in those cases partial relay selection outperforms best relay selection.
233 citations
TL;DR: Simulation results show that the energy- efficient design greatly improves EE compared with the conventional spectral-efficient design and the low-complexity suboptimal approaches can achieve a promising tradeoff between performance and complexity.
Abstract: The widespread application of multimedia wireless services and requirements of ubiquitous access have triggered rapidly booming energy consumption at both the base station side and the user equipment (UE) side. Hence, energy-efficient design in wireless networks is very important and is becoming an inevitable trend. In this paper, we study the energy-efficient resource allocation in both downlink and uplink cellular networks with orthogonal frequency division multiple access (OFDMA). For the downlink transmission, the generalized energy efficiency (EE) is maximized while for the uplink case the minimum individual EE is maximized, both under certain prescribed per-UE quality-of-service (QoS) requirements. For both transmission scenarios, we first provide the optimal solution and then develop a suboptimal but low-complexity approach by exploring the inherent structure and property of the energy-efficient design. For the downlink case, by modifying the original problem, we also find a computationally efficient and numerically tractable upper bound on the EE, which indicates the performance limit and is demonstrated to be quite tight if the number of subcarriers is larger than that of UEs and motivates us to find a near-optimal approach relying on the quasiconcave relation between the modified EE and transmit power. Simulation results show that the energy-efficient design greatly improves EE compared with the conventional spectral-efficient design and the low-complexity suboptimal approaches can achieve a promising tradeoff between performance and complexity.
216 citations
TL;DR: This paper proposes an analytical model for evaluating Strict FFR and Soft Frequency Reuse (SFR) deployments based on the spatial Poisson point process and results both capture the non-uniformity of heterogeneous deployments and produce tractable expressions which can be used for system design with StrictFFR and SFR.
Abstract: Interference management techniques are critical to the performance of heterogeneous cellular networks, which will have dense and overlapping coverage areas, and experience high levels of interference. Fractional frequency reuse (FFR) is an attractive interference management technique due to its low complexity and overhead, and significant coverage improvement for low-percentile (cell-edge) users. Instead of relying on system simulations based on deterministic access point locations, this paper instead proposes an analytical model for evaluating Strict FFR and Soft Frequency Reuse (SFR) deployments based on the spatial Poisson point process. Our results both capture the non-uniformity of heterogeneous deployments and produce tractable expressions which can be used for system design with Strict FFR and SFR. We observe that the use of Strict FFR bands reserved for the users of each tier with the lowest average \sinr provides the highest gains in terms of coverage and rate, while the use of SFR allows for more efficient use of shared spectrum between the tiers, while still mitigating much of the interference. Additionally, in the context of multi-tier networks with closed access in some tiers, the proposed framework shows the impact of cross-tier interference on closed access FFR, and informs the selection of key FFR parameters in open access.
190 citations
TL;DR: A new detection scheme is proposed, which enables to reduce the noise at the Flip-OFDM receiver by almost 3dB, and the analytical performance of the noise filtering schemes is supported by the simulation results.
Abstract: Unipolar communications systems can transmit information using only real and positive signals. This includes a variety of physical channels ranging from optical (fiber or free-space), to RF wireless using amplitude modulation with non-coherent reception, to baseband single wire communications. Unipolar OFDM techniques can efficiently compensate frequency selective channel distortion in unipolar communication systems. One of the leading example of unipolar OFDM is asymmetric clipped optical OFDM (ACO-OFDM) originally proposed for optical communications. Flip-OFDM is an alternative approach that was proposed in a patent, but its performance and full potentials have never been investigated in the literature. In this paper, we first compare Flip-OFDM and ACO-OFDM, and show that both techniques have the same performance but different complexities. In particular, Flip-OFDM offers 50% saving in hardware complexity at the receiver over ACO-OFDM. We then propose a new detection scheme, which enables to reduce the noise at the Flip-OFDM receiver by almost 3dB. The analytical performance of the noise filtering schemes is supported by the simulation results.
189 citations
TL;DR: This work proposes a parametric sparse estimation technique based on finite rate of innovation (FRI) principles for MIMO communications, which is a generalization of conventional spectral estimation methods to multiple input signals with common support.
Abstract: We consider the problem of estimating sparse communication channels in the MIMO context. In small to medium bandwidth communications, as in the current standards for OFDM and CDMA communication systems (with bandwidth up to 20 MHz), such channels are individually sparse and at the same time share a common support set. Since the underlying physical channels are inherently continuous-time, we propose a parametric sparse estimation technique based on finite rate of innovation (FRI) principles. Parametric estimation is especially relevant to MIMO communications as it allows for a robust estimation and concise description of the channels. The core of the algorithm is a generalization of conventional spectral estimation methods to multiple input signals with common support. We show the application of our technique for channel estimation in OFDM (uniformly/contiguous DFT pilots) and CDMA downlink (Walsh-Hadamard coded schemes). In the presence of additive white Gaussian noise, theoretical lower bounds on the estimation of sparse common support (SCS) channel parameters in Rayleigh fading conditions are derived. Finally, an analytical spatial channel model is derived, and simulations on this model in the OFDM setting show the symbol error rate (SER) is reduced by a factor 2 (0 dB of SNR) to 5 (high SNR) compared to standard non-parametric methods - e.g. lowpass interpolation.
TL;DR: This paper proposes a linear precoder for the downlink of a multi-user MIMO system with multiple users that potentially act as eavesdroppers based on regularized channel inversion with a regularization parameter α and power allocation vector chosen in such a way that the achievable secrecy sum-rate is maximized.
Abstract: In this paper, we propose a linear precoder for the downlink of a multi-user MIMO system with multiple users that potentially act as eavesdroppers. The proposed precoder is based on regularized channel inversion (RCI) with a regularization parameter α and power allocation vector chosen in such a way that the achievable secrecy sum-rate is maximized. We consider the worst-case scenario for the multi-user MIMO system, where the transmitter assumes users cooperate to eavesdrop on other users. We derive the achievable secrecy sum-rate and obtain the closed-form expression for the optimal regularization parameter αLS of the precoder using large-system analysis. We show that the RCI precoder with αLS outperforms several other linear precoding schemes, and it achieves a secrecy sum-rate that has same scaling factor as the sum-rate achieved by the optimum RCI precoder without secrecy requirements. We propose a power allocation algorithm to maximize the secrecy sum-rate for fixed α. We then extend our algorithm to maximize the secrecy sum-rate by jointly optimizing α and the power allocation vector. The jointly optimized precoder outperforms RCI with αLS and equal power allocation by up to 20 percent at practical values of the signal-to-noise ratio and for 4 users and 4 transmit antennas.
TL;DR: New M-algorithm BCJR (M-BCJR) algorithms for low-complexity turbo equalization and application to severe intersymbol interference (ISI) introduced by faster than Nyquist signaling are proposed and compared to reduced-trellis VA and BCJR benchmarks.
Abstract: We propose new M-algorithm BCJR (M-BCJR) algorithms for low-complexity turbo equalization and apply them to severe intersymbol interference (ISI) introduced by faster than Nyquist signaling. These reduced-search detectors are evaluated in simple detection over the ISI channel and in iterative decoding of coded FTN transmissions. In the second case, accurate log likelihood ratios are essential and we introduce a 3-recursion M-BCJR that provides this. Focusing signal energy by a minimum phase conversion before the M-BCJR is also essential; we propose an improvement to this older idea. The new M-BCJRs are compared to reduced-trellis VA and BCJR benchmarks. The FTN signals carry 4-8 bits/Hz-s in a fixed spectrum, with severe ISI models as long as 32 taps. The combination of coded FTN and the reduced-complexity BCJR is an attractive narrowband coding method.
TL;DR: This paper considers an uplink OFDMA system where multiple users communicate to a central scheduler over frequency-selective channels with high energy efficiency, and derives energy optimal techniques in "closed forms" for per-user link adaptation and resource scheduling across users by considering time-averaged bits-per-Joule metrics.
Abstract: Energy-efficient wireless communication is very important for battery-constrained mobile devices. For mobile devices in a cellular system, uplink power consumption dominates the wireless power budget because of RF power requirements for reliable transmission over long distances. Our previous work in this area focused on optimizing energy efficiency by maximizing the instantaneous bits-per-Joule metric through iterative approaches, which resulted in significant energy savings for uplink cellular OFDMA transmissions. In this paper, we develop energy efficient schemes with significantly lower complexity when compared to iterative approaches, by considering time-averaged bits-per-Joule metrics. We consider an uplink OFDMA system where multiple users communicate to a central scheduler over frequency-selective channels with high energy efficiency. The scheduler allocates the system bandwidth among all users to optimize energy efficiency across the whole network. Using time-averaged metrics, we derive energy optimal techniques in "closed forms" for per-user link adaptation and resource scheduling across users. Simulation results show that the proposed schemes not only have low complexity but also perform close to the globally optimum solutions obtained through exhaustive search.
TL;DR: A novel generic framework for the capacity analysis of L-branch EGC/MRC over generalized fading channels is developed to derive new results for the gamma-shadowed generalized Nakagami-m fading model which can be a suitable model for the fading environments encountered by high frequency communications.
Abstract: Unified exact ergodic capacity results for L-branch coherent diversity combiners including equal-gain combining (EGC) and maximal-ratio combining (MRC) are not known. This paper develops a novel generic framework for the capacity analysis of L-branch EGC/MRC over generalized fading channels. The framework is used to derive new results for the gamma-shadowed generalized Nakagami-m fading model which can be a suitable model for the fading environments encountered by high frequency (60 GHz and above) communications. The mathematical formalism is illustrated with some selected numerical and simulation results confirming the correctness of our newly proposed framework.
TL;DR: Evaluating the performance of three direct-detection orthogonal frequency-division multiplexing schemes in combating multipath distortion in indoor optical wireless links, comparing them to unipolar M-ary pulse-amplitude modulation (M-PAM) with minimum mean-square error decision-feedback equalization (MMSE-DFE).
Abstract: We evaluate the performance of three direct-detection orthogonal frequency-division multiplexing (OFDM) schemes in combating multipath distortion in indoor optical wireless links, comparing them to unipolar M-ary pulse-amplitude modulation (M-PAM) with minimum mean-square error decision-feedback equalization (MMSE-DFE). The three OFDM techniques are DC-clipped OFDM and asymmetrically clipped optical OFDM (ACO-OFDM) and PAM-modulated discrete multitone (PAM-DMT). We describe an iterative procedure to achieve optimal power allocation for DC-OFDM. For each modulation method, we quantify the received electrical SNR required at a given bit rate on a given channel, considering an ensemble of 170 indoor wireless channels. When using the same symbol rate for all modulation methods, M-PAM with MMSE-DFE has better performance than any OFDM format over a range of spectral efficiencies, with the advantage of (M-PAM) increasing at high spectral efficiency. ACO-OFDM and PAM-DMT have practically identical performance at any spectral efficiency. They are the best OFDM formats at low spectral efficiency, whereas DC-OFDM is best at high spectral efficiency. When ACO-OFDM or PAM-DMT are allowed to use twice the symbol rate of M-PAM, these OFDM formats have better performance than M-PAM. When channel state information is unavailable at the transmitter, however, M-PAM significantly outperforms all OFDM formats. When using the same symbol rate for all modulation methods, M-PAM requires approximately three times more computational complexity per processor than all OFDM formats and 63% faster analog-to-digital converters, assuming oversampling ratios of 1.23 and 2 for ACO-OFDM and M-PAM, respectively. When OFDM uses twice the symbol rate of M-PAM, OFDM requires 23% faster analog-to-digital converters than M-PAM but OFDM requires approximately 40% less computational complexity than M-PAM per processor.
TL;DR: This paper addresses the analysis and design of WSNs with EH devices by focusing on conventional MAC protocols, namely TDMA, framed-ALOHA (FA) and dynamic-FA (DFA), and by accounting for the performance trade-offs and design issues arising due to EH.
Abstract: The design of Medium Access Control (MAC) protocols for wireless sensor networks (WSNs) has been conventionally tackled by assuming battery-powered devices and by adopting the network lifetime as the main performance criterion. While WSNs operated by energy-harvesting (EH) devices are not limited by network lifetime, they pose new design challenges due to the uncertain amount of energy that can be harvested from the environment. Novel design criteria are thus required to capture the trade-offs between the potentially infinite network lifetime and the uncertain energy availability. This paper addresses the analysis and design of WSNs with EH devices by focusing on conventional MAC protocols, namely TDMA, framed-ALOHA (FA) and dynamic-FA (DFA), and by accounting for the performance trade-offs and design issues arising due to EH. A novel metric, referred to as delivery probability, is introduced to measure the capability of a MAC protocol to deliver the measurement of any sensor in the network to the intended destination (or fusion center, FC). The interplay between delivery efficiency and time efficiency (i.e., the data collection rate at the FC), is investigated analytically using Markov models. Numerical results validate the analysis and emphasize the critical importance of accounting for both delivery probability and time efficiency in the design of EH-WSNs.
TL;DR: This paper proposes a novel and more generic closed-form approximation of the EE-SE trade-off for the multi-input multi-output (MIMO) Rayleigh fading channel which exhibits a greater accuracy for a wider range of SE values and antenna configurations.
Abstract: Along with spectral efficiency (SE), energy efficiency (EE) is becoming one of the key performance evaluation criteria for communication system. These two criteria, which are conflicting, can be linked through their trade-off. The EE-SE trade-off for the multi-input multi-output (MIMO) Rayleigh fading channel has been accurately approximated in the past but only in the low-SE regime. In this paper, we propose a novel and more generic closed-form approximation of this trade-off which exhibits a greater accuracy for a wider range of SE values and antenna configurations. Our expression has been here utilized for assessing analytically the EE gain of MIMO over single-input single-output (SISO) system for two different types of power consumption models (PCMs): the theoretical PCM, where only the transmit power is considered as consumed power; and a more realistic PCM accounting for the fixed consumed power and amplifier inefficiency. Our analysis unfolds the large mismatch between theoretical and practical MIMO vs. SISO EE gains; the EE gain increases both with the SE and the number of antennas in theory, which indicates that MIMO is a promising EE enabler; whereas it remains small and decreases with the number of transmit antennas when a realistic PCM is considered.
TL;DR: A general theoretical framework is presented for analyzing information transmission over Gaussian channels with memoryless transceiver distortion, which encompasses various nonlinear distortion models including transmit-side clipping, receive-side analog-to-digital conversion, and others.
Abstract: A general theoretical framework is presented for analyzing information transmission over Gaussian channels with memoryless transceiver distortion, which encompasses various nonlinear distortion models including transmit-side clipping, receive-side analog-to-digital conversion, and others. The framework is based on the so-called generalized mutual information (GMI), and the analysis in particular benefits from the setup of Gaussian codebook ensemble and nearest-neighbor decoding, for which it is established that the GMI takes a general form analogous to the channel capacity of undistorted Gaussian channels, with a reduced "effective" signal-to-noise ratio (SNR) that depends on the nominal SNR and the distortion model. When applied to specific distortion models, an array of results of engineering relevance is obtained. For channels with transmit-side distortion only, it is shown that a conventional approach, which treats the distorted signal as the sum of the original signal part and a uncorrelated distortion part, achieves the GMI. For channels with output quantization, closed-form expressions are obtained for the effective SNR and the GMI, and related optimization problems are formulated and solved for quantizer design. Finally, super-Nyquist sampling is analyzed within the general framework, and it is shown that sampling beyond the Nyquist rate increases the GMI for all SNR values. For example, with binary symmetric output quantization, information rates exceeding one bit per channel use are achievable by sampling the output at four times the Nyquist rate.
TL;DR: It is shown in both analytical and simulation results that desirable properties and satisfying performances can be achieved in the proposed TRDMA multi-user downlink system, which makesTRDMA a promising candidate for future energy-efficient low-complexity broadband wireless communications.
Abstract: The multi-path effect makes high speed broadband communications a very challenging task due to the severe inter-symbol interference (ISI). By concentrating energy in both the spatial and temporal domains, time-reversal (TR) transmission technique provides a great potential of low-complexity energy-efficient communications. In this paper, a novel concept of time-reversal division multiple access (TRDMA) is proposed as a wireless channel access method based on its high-resolution spatial focusing effect. It is proposed to use TR structure in multi-user downlink systems over multi-path channels, where signals of different users are separated solely by TRDMA. Both the single-transmit-antenna scheme and its enhanced version with multiple transmit antennas are developed and evaluated in this paper. The system performance is investigated in terms of its effective signal-to-interference-plus-noise ratio (SINR), the achievable sum rate and the achievable rates with outage. And some further discussions regarding its advantage over conventional rake receivers and the impact of spatial correlations between users are given at the end of this paper. It is shown in both analytical and simulation results that desirable properties and satisfying performances can be achieved in the proposed TRDMA multi-user downlink system, which makes TRDMA a promising candidate for future energy-efficient low-complexity broadband wireless communications.
TL;DR: It is shown that when ACO-OFDM is used in an IM/DD system, it can be adapted to calculate the information rate of the data-carrying odd frequency subcarriers, and conventional water filling techniques can be used for a frequency selective channel.
Abstract: In this paper we derive information theoretic results for asymmetrically clipped optical orthogonal frequency division multiplexing (ACO-OFDM) in an intensity modulated direct detection (IM/DD) optical communication system subject to a range of constraints. ACO-OFDM is a form of OFDM designed for IM/DD systems. It is an effective solution to intersymbol interference (ISI) caused by a dispersive channel and also requires less optical power than conventional optical modulation formats. Although the classical Shannon capacity formula cannot be applied directly to an IM/DD system, we show that when ACO-OFDM is used in an IM/DD system, it can be adapted to calculate the information rate of the data-carrying odd frequency subcarriers. As a result conventional water filling techniques can be used for a frequency selective channel. These results are applied to indoor wireless systems using realistic parameters for the transmitter, receiver and channel. The maximum rate at which data can be transmitted depends on the channel, the electrical bandwidth and the transmitted optical power. Even when there is no line of sight (LOS) path, when the electrical bandwidth is limited to 50 MHz and the average optical power is limited to 0.4 W, data rates of approximately 80 Mbit/s can theoretically be achieved.
TL;DR: The diversity gain of MIMO FSO systems in the presence of atmospheric fading and no misalignment is shown to be proportional to the number of transmitters and receivers, in particular the product MN.
Abstract: A novel statistical channel model for multiple-input multiple-output (MIMO) free-space optical (FSO) communication systems impaired by atmospheric and misalignment fading is developed A slow-fading channel model is considered and the outage probability is derived as a performance measure The diversity gain defined as the signal-to-noise ratio (SNR) exponent at high SNR is analyzed Interestingly in the presence of misalignment fading the diversity gain depends only on the misalignment variance and is independent of the number of transmitters M and receivers N Increasing the number of transmitters and receivers only results in a lower probability of outage for a given SNR, however, the rate of change is unaffected Contrary to this case, the diversity gain of MIMO FSO systems in the presence of atmospheric fading and no misalignment is shown to be proportional to the number of transmitters and receivers, in particular the product MN
TL;DR: For networks with orthogonal channels, it is shown that network codes based on maximum distance separable (MDS) codes can achieve the maximum diversity order of N+1, which is equivalent to achieving the Singleton bound for network error-correction codes.
Abstract: We investigate the design of network codes for multiple-user multiple-relay (MUMR) wireless networks with slow fading (quasi-static) channels. In these networks, M users have independent information to be transmitted to a common base station (BS) with the help of N relays, where M ≥ 2 and N ≥ 1 are arbitrary integers. We investigate such networks in terms of diversity order to measure asymptotic performance. For networks with orthogonal channels, we show that network codes based on maximum distance separable (MDS) codes can achieve the maximum diversity order of N+1. We further show that the MDS coding construction of network codes is also necessary to obtain full diversity for linear finite field network coding (FFNC). Then, we compare the performance of the FFNC approach with superposition coding (SC) at the relays. The results show that the FFNC based on MDS codes has better performance than SC in both the high rate and the high SNR regime. Further, we discuss networks without direct source-to-BS channels for N ≥ M. We show that the proposed FFNC can obtain the diversity order N-M+1, which is equivalent to achieving the Singleton bound for network error-correction codes. Finally, we study the network with nonorthogonal channels and show our codes can still achieve a diversity order of N+1, which cannot be achieved by a scheme based on SC.
TL;DR: This paper investigates the impact of using outdated channel estimates for relay selection and signal amplification on the performance of amplify-and-forward (AF) relays under partial relay selection (PRS) and opportunistic relay selection (-) and finds that up to an order of magnitude increase in the outage probability is caused.
Abstract: This paper investigates the impact of using outdated channel estimates for relay selection and signal amplification on the performance of amplify-and-forward (AF) relays under partial relay selection (PRS) and opportunistic relay selection (ORS). In practice, outdated channel state information (CSI) can occur due to feedback or scheduling delay. Both variable gain (VG) AF and fixed gain AF schemes are considered. Outage probability, the average bit error rate (BER) and simplified high signal-to-noise ratio approximations are derived. The effect of parameters such as the number of relays, the rank of chosen relay, and the correlation between the delayed and current channel state information are analyzed. Outdated CSI for computing relay gains in PRS causes about 2 dB loss. In ORS, a 3% reduction in correlation causes up to an order of magnitude increase in the outage probability.
TL;DR: This paper addresses the problem of computing the probability that r out of n interfering wireless signals are "captured," i.e., received with sufficiently large Signal to Interference plus Noise Ratio to correctly decode the signals by a receiver with multi-packet reception (MPR) and Successive Interference Cancellation (SIC) capabilities.
Abstract: In this paper, we address the problem of computing the probability that r out of n interfering wireless signals are "captured," i.e., received with sufficiently large Signal to Interference plus Noise Ratio (SINR) to correctly decode the signals by a receiver with multi-packet reception (MPR) and Successive Interference Cancellation (SIC) capabilities. We start by considering the simpler case of a pure MPR system without SIC, for which we provide an expression for the distribution of the number of captured packets, whose computational complexity scales with n and r. This analysis makes it possible to investigate the system throughput as a function of the MPR capabilities of the receiver. We then generalize the analysis to SIC systems. In addition to the exact expressions for the capture probability and the normalized system throughput, we also derive approximate expressions that are much easier to compute and provide accurate results in some practical scenarios. Finally, we present selected results for some case studies with the purpose of illustrating the potential of the proposed mathematical framework and validating the approximate methods.
TL;DR: The proposed RSU placement strategy needs the least number of RSUs to achieve the maximal aggregate throughput in the network, indicating that the scheme is indeed a cost effective yet highly efficient placement strategy for vehicular networks.
Abstract: In this paper, we study the Roadside Unit (RSU) placement problem in vehicular networks. We focus on the highway-like scenario in which there may be multiple lanes with exits or intersections along the road. In our model, each vehicle can access RSUs in two ways: 1) direct delivery, which occurs when the vehicle is in the transmission range of the RSUs, and 2) multi-hop relaying, which takes place when the vehicle is out of RSU transmission range. We account for both access patterns in our placement strategy and formulate this placement problem via an integer linear programming model such that the aggregate throughput in the network can be maximized. We also take into account the impact of wireless interference, vehicle population distribution, and vehicle speeds in the formulation. The performance of the proposed placement strategy is evaluated via ns-2 simulations together with VanetMobisim to generate vehicle mobility patterns. The results show that our strategy leads to the best performance as compared with the uniformly distributed placement and the hot spot placement. More importantly, our solution needs the least number of RSUs to achieve the maximal aggregate throughput in the network, indicating that our scheme is indeed a cost effective yet highly efficient placement strategy for vehicular networks.
TL;DR: The performance of two-way amplify-and-forward (AF) relaying networks, considering transmissions over independent but not necessarily identically distributed Rayleigh fading channels in the presence of a finite number of co-channel interferers, is studied.
Abstract: The performance of two-way amplify-and-forward (AF) relaying networks, considering transmissions over independent but not necessarily identically distributed Rayleigh fading channels in the presence of a finite number of co-channel interferers, is studied. Specifically, closed-form expressions for the cumulative distribution function (CDF) of the equivalent signal-to-interference-plus-noise ratio (SINR), the error probability, the outage probability and the system's achievable rate, are presented. Furthermore, an asymptotic expression for the probability density function (PDF) of the equivalent instantaneous SINR is derived, based on which simple and general asymptotic formulas for the error and outage probabilities are derived and analyzed. Numerical results are also provided, sustained by simulations which corroborate the exactness of the theoretical analysis.
TL;DR: In this article, the outage probability of all-optical relaying in lognormal fading for dual-hop and multi-hop transmission was analyzed. And the results show that all-Optical relays, while simpler from an implementation point of view, outperform electrical relays unless the number of relays is very large.
Abstract: Free-space optical (FSO) communication has recently gained a lot of interest for last-mile terrestrial applications. Some of its advantages include high data rates, ease of deployment, license-free operation, and high security. However, the weather-dependent optical wireless channel introduces attenuation and intensity variations known as scintillation which impose severe challenges for reliable data transmission. The distance dependence of both attenuation and scintillation motivates the use of relays as a means of improving the system performance and extending the range of communication. In this paper, we advocate the use of all-optical relays equipped with erbium-doped fiber amplifiers (EDFAs), which, in contrast to conventional FSO relays with electrical amplification, avoid optical-to-electrical and electrical-to-optical conversions. We develop accurate signal and noise models for fixed and variable gain all-optical and electrical relaying which include the effects of all relevant system parameters and types of noise. For performance evaluation, we analyze the outage probability of all-optical relaying in lognormal fading for dual-hop and multi-hop transmission. Our results show that all-optical relays, while simpler from an implementation point of view, outperform electrical relays unless the number of relays is very large. Moreover, for a fixed source-destination distance, performance improves as the number of hops (relays) increases up to a certain point beyond which adding more hops deteriorates performance.
TL;DR: The results show that system performance is dominated by the resource constraints and it improves slowly with increasing average SNR and larger Nakagami-m fading parameter on interference channels deteriorates system performance slightly, while opportunistic relay selection can be exploited to improve system performance significantly.
Abstract: Since the electromagnetic spectrum resource is becoming more and more scarce, improving spectral efficiency is becoming extremely important for the sustainable development of wireless communication systems and services. Integrating cooperative relaying techniques into spectrum-sharing cognitive radio systems sheds new light on higher spectral efficiency. In this paper, we analyze the end-to-end performance of cooperative amplify-and-forward (AF) relaying in spectrum-sharing systems. In order to achieve the optimal end-to-end performance, the transmit powers of the secondary source and the relays are optimized with respect to average interference power constraints at primary users and Nakagami-m fading parameters of interference channels (for mathematical tractability, the desired channels from secondary source to relay and from relay to secondary destination are assumed to be subject to Rayleigh fading). Also, both partial and opportunistic relay-selection strategies are exploited to further enhance system performance. Based on the exact distribution functions of the end-to-end signal-to-noise ratio (SNR) obtained herein, the outage probability, average symbol error probability, diversity order, and ergodic capacity of the system under study are analytically investigated. Our results show that system performance is dominated by the resource constraints and it improves slowly with increasing average SNR. Furthermore, larger Nakagami-m fading parameter on interference channels deteriorates system performance slightly. On the other hand, when interference power constraints are stringent, opportunistic relay selection can be exploited to improve system performance significantly. All analytical results are corroborated by simulation results and they are shown to be efficient tools for exact evaluation of system performance
TL;DR: Using the analysis, many aspects of the network performance are illuminated, and one can determine the influence of the choice of spreading factors, the effect of the receiver location within the finite network region, and the impact of both the fading parameters and the attenuation power laws.
Abstract: An ad hoc network with a finite spatial extent and number of nodes or mobiles is analyzed. The mobile locations may be drawn from any spatial distribution, and interference-avoidance protocols or protection against physical collisions among the mobiles may be modeled by placing an exclusion zone around each radio. The channel model accounts for the path loss, Nakagami fading, and shadowing of each received signal. The Nakagami m-parameter can vary among the mobiles, taking any positive value for each of the interference signals and any positive integer value for the desired signal. The analysis is governed by a new exact expression for the outage probability, defined to be the probability that the signal-to-interference-and-noise ratio (SINR) drops below a threshold, and is conditioned on the network geometry and shadowing factors, which have dynamics over much slower timescales than the fading. By averaging over many network and shadowing realizations, the average outage probability and transmission capacity are computed. Using the analysis, many aspects of the network performance are illuminated. For example, one can determine the influence of the choice of spreading factors, the effect of the receiver location within the finite network region, and the impact of both the fading parameters and the attenuation power laws.