arXiv subjects

Mohamed-Slim Alouini

Publications and source records attributed to Mohamed-Slim Alouini.

At least 559 records · Page 31Linked to original sources

arXiv2015

Distributed Cloud Association in Downlink Multicloud Radio Access Networks

This paper considers a multicloud radio access network (M-CRAN), wherein each cloud serves a cluster of base-stations (BS's) which are connected to the clouds through high capacity digital links. The network comprises several remote users, where each user can be connected to one (and only one) cloud. This paper studies the user-to-cloud-assignment problem by maximizing a network-wide utility subject to practical cloud connectivity constraints. The paper solves the problem by using an auction-based iterative algorithm, which can be implemented in a distributed fashion through a reasonable exchange of information between the clouds. The paper further proposes a centralized heuristic algorithm, with low computational complexity. Simulations results show that the proposed algorithms provide appreciable performance improvements as compared to the conventional cloud-less assignment solutions.

cs.IT↗

arXiv2015

MGF Approach to the Analysis of Generalized Two-Ray Fading Models

We analyze a class of Generalized Two-Ray (GTR) fading channels that consist of two line of sight (LOS) components with random phase plus a diffuse component. We derive a closed form expression for the moment generating function (MGF) of the signal-to-noise ratio (SNR) for this model, which greatly simplifies its analysis. This expression arises from the observation that the GTR fading model can be expressed in terms of a conditional underlying Rician distribution. We illustrate the approach to derive simple expressions for statistics and performance metrics of interest such as the amount of fading, the level crossing rate, the symbol error rate, and the ergodic capacity in GTR fading channels. We also show that the effect of considering a more general distribution for the phase difference between the LOS components has an impact on the average SNR.

cs.IT↗

arXiv2014

The random matrix regime of Maronna's M-estimator for observations corrupted by elliptical noises

This article studies the behavior of the Maronna robust scatter estimator $\hat{C}_N\in \mathbb{C}^{N\times N}$ of a sequence of observations $y_1,...,y_n$ which is composed of a $K$ dimensional signal drown in a heavy tailed noise, i.e $y_i=A_N s_i+x_i$ where $A_N \in \mathbb{C}^{N\times K}$ and $x_i$ is drawn from elliptical distribution. In particular, we prove that as the population dimension $N$, the number of observations $n$ and the rank of $A_N$ grow to infinity at the same pace and under some mild assumptions, the robust scatter matrix can be characterized by a random matrix $\hat{S}_N$ that follows a standard random model. Our analysis can be very useful for many applications of the fields of statistical inference and signal processing.

cs.IT↗

arXiv2014

Coordinated Hybrid Automatic Repeat Request; Extended Version

We develop a coordinated hybrid automatic repeat request (HARQ) approach. With the proposed scheme, if a user message is correctly decoded in the first HARQ rounds, its spectrum is allocated to other users, to improve the network outage probability and the users' fairness. The results, which are obtained for single- and multiple-antenna setups, demonstrate the efficiency of the proposed approach in different conditions. For instance, with a maximum of M retransmissions and single transmit/receive antennas, the diversity gain of a user increases from M to (J+1)(M-1)+1 where J is the number of users helping that user.

cs.IT↗

arXiv2014

Technical Report: Finger Replacement Schemes for RAKE Receivers in the Soft Handover Region with Multiple BSs over I.N.D. Fading Channels

A new finger replacement technique which is applicable for RAKE receivers in the soft handover (SHO) region has been proposed and studied in [1], [2] under the ideal assumption that the fading is both independent and identically distributed from path to path. To supplement our previous work, we present a general comprehensive framework for the performance assessment of the proposed finger replacement schemes operating over independent and non-identically distributed (i.n.d.) faded paths. To accomplish this object, we derive new closed-form expressions for the target key statistics which are composed of i.n.d. exponential random variables. With these new expressions, the performance analysis of various wireless communication systems over more practical environments can be possible.

cs.IT↗

arXiv2014

Consumption Factor Optimization for Multihop Relaying over Nakagami-m Fading channels

In this paper, the energy efficiency of multihop relaying over Nakagami-$m$ fading channels is investigated. The "consumption factor" is used as a metric to evaluate the energy efficiency, and it is derived in closed-form for both amplify-and-forward and decode-and-forward relaying. Then, based on the obtained expressions, we propose a power allocation strategy maximizing the consumption factor. In addition, two sub-optimal, low complexity, power allocation algorithms are proposed and analyzed, and the obtained power allocation schemes are compared, in terms of energy efficiency as well as other common performance metrics, to other power allocation schemes from the literature. Analytical and simulation results confirm the accuracy of our derivations, and assess the performance gains of the proposed approach.

cs.IT↗

arXiv2014

Coordinated Scheduling for the Downlink of Cloud Radio-Access Networks

This paper addresses the coordinated scheduling problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (C-RAN), where the cloud is only responsible for the scheduling policy and the synchronization of the transmit frames across the connected base-stations (BS). The transmitted frame of every BS consists of several time/frequency blocks, called power-zones (PZ), maintained at fixed transmit power. The paper considers the problem of scheduling users to PZs and BSs in a coordinated fashion across the network, by maximizing a network-wide utility under the practical constraint that each user cannot be served by more than one base-station, but can be served by one or more power-zone within each base-station frame. The paper solves the problem using a graph theoretical approach by introducing the scheduling graph in which each vertex represents an association of users, PZs and BSs. The problem is formulated as a maximum weight clique, in which the weight of each vertex is the benefit of the association represented by that vertex. The paper further presents heuristic algorithms with low computational complexity. Simulation results show the performance of the proposed algorithms and suggest that the heuristics perform near optimal in low shadowing environments

cs.IT↗

arXiv2014

A Fast Simulation Method for the Sum of Subexponential Distributions

Estimating the probability that a sum of random variables (RVs) exceeds a given threshold is a well-known challenging problem. Closed-form expression of the sum distribution is usually intractable and presents an open problem. A crude Monte Carlo (MC) simulation is the standard technique for the estimation of this type of probability. However, this approach is computationally expensive especially when dealing with rare events (i.e events with very small probabilities). Importance Sampling (IS) is an alternative approach which effectively improves the computational efficiency of the MC simulation. In this paper, we develop a general framework based on IS approach for the efficient estimation of the probability that the sum of independent and not necessarily identically distributed heavy-tailed RVs exceeds a given threshold. The proposed IS approach is based on constructing a new sampling distribution by twisting the hazard rate of the original underlying distribution of each component in the summation. A minmax approach is carried out for the determination of the twisting parameter, for any given threshold. Moreover, using this minmax optimal choice, the estimation of the probability of interest is shown to be asymptotically optimal as the threshold goes to infinity. We also offer some selected simulation results illustrating first the efficiency of the proposed IS approach compared to the naive MC simulation. The near-optimality of the minmax approach is then numerically analyzed.

cs.IT↗

arXiv2014

Extended Delivery Time Analysis for Non-work-preserving Packet Transmission in Cognitive Environment

Cognitive radio transceiver can opportunistically access the underutilized spectrum resource of primary systems for new wireless services. With interweave cognitive implementation, the secondary transmission may be interrupted by the primary user's transmission. To facilitate the packet delay analysis of such secondary transmission, we study the resulting extended delivery time that includes both transmission time and waiting time. In particular, we derive the exact distribution function of extended delivery time of a fixed-size secondary packet with non-work-preserving strategy i.e. interrupted packets will be retransmitted. Both continuous sensing and periodic sensing with and without missed detection cases are considered. Selected numerical and simulation results are presented for verifying the mathematical formulation. Finally, we apply the results to secondary queuing analysis with a generalized M/G/1 queue set-up. The analytical results will greatly facilitate the design of the secondary system for particular target application.

cs.IT↗

arXiv2014

Transmit Antenna Selection in Underlay Cognitive Radio Environment

Cognitive radio (CR) technology addresses the problem of spectrum under-utilization. In underlay CR mode, the secondary users are allowed to communicate provided that their transmission is not detrimental to primary user communication. Transmit antenna selection is one of the low-complexity methods to increase the capacity of wireless communication systems. In this article, we propose and analyze the performance benefit of a transmit antenna selection scheme for underlay secondary system that ensures the instantaneous interference caused by the secondary transmitter to the primary receiver is below a predetermined level. Closed-form expressions of the outage probability, amount of fading, and ergodic capacity for the secondary network are derived. Monte-carlo simulations are also carried out to confirm various mathematical results presented in this article.

cs.IT↗

arXiv2014

High SNR BER Comparison of Coherent and Differentially Coherent Modulation Schemes in Lognormal Fading Channels

Using an auxiliary random variable technique, we prove that binary differential phase-shift keying and binary phase-shift keying have the same asymptotic bit-error rate performance in lognormal fading channels. We also show that differential quaternary phase-shift keying is exactly 2.32 dB worse than quaternary phase-shift keying over the lognormal fading channels in high signal-to-noise ratio regimes.

cs.IT↗

arXiv2014

Delay Minimization for Instantly Decodable Network Coding in Persistent Channels with Feedback Intermittence

In this paper, we consider the problem of minimizing the multicast decoding delay of generalized instantly decodable network coding (G-IDNC) over persistent forward and feedback erasure channels with feedback intermittence. In such an environment, the sender does not always receive acknowledgement from the receivers after each transmission. Moreover, both the forward and feedback channels are subject to persistent erasures, which can be modelled by a two state (good and bad states) Markov chain known as Gilbert-Elliott channel (GEC). Due to such feedback imperfections, the sender is unable to determine subsequent instantly decodable packets combination for all receivers. Given this harsh channel and feedback model, we first derive expressions for the probability distributions of decoding delay increments and then employ these expressions in formulating the minimum decoding problem in such environment as a maximum weight clique problem in the G-IDNC graph. We also show that the problem formulations in simpler channel and feedback models are special cases of our generalized formulation. Since this problem is NP-hard, we design a greedy algorithm to solve it and compare it to blind approaches proposed in literature. Through extensive simulations, our adaptive algorithm is shown to outperform the blind approaches in all situations and to achieve significant improvement in the decoding delay, especially when the channel is highly persistent

cs.IT↗

arXiv2014

On Low-Complexity Full-diversity Detection In Multi-User MIMO Multiple-Access Channels

Multiple-input multiple-output (MIMO) techniques are becoming commonplace in recent wireless communication standards. This added dimension (i.e., space) can be efficiently used to mitigate the interference in the multi-user MIMO context. In this paper, we focus on the uplink of a MIMO multiple access channel (MAC) where perfect channel state information (CSI) is only available at the destination. We provide a new set of sufficient conditions for a wide range of space-time block codes (STBC)s to achieve full-diversity under \emph{partial interference cancellation group decoding} (PICGD) with or without successive interference cancellation (SIC) for completely blind users. Explicit interference cancellation (IC) schemes for two and three users are then provided and shown to satisfy the derived full-diversity criteria. Besides the complexity reduction due to the fact that the proposed IC schemes enable separate decoding of distinct users without sacrificing the diversity gain, further reduction of the decoding complexity may be obtained. In fact, thanks to the structure of the proposed schemes, the real and imaginary parts of each user's symbols may be decoupled without any loss of performance. Finally, our theoretical claims are corroborated by simulation results and the new IC scheme for two-user MIMO MAC is shown to outperform the recently proposed two-user IC scheme especially for high spectral efficiency while requiring significantly less decoding complexity.

cs.IT↗

arXiv2014

A Game-Theoretic Framework for Decentralized Cooperative Data Exchange using Network Coding

In this paper, we introduce a game theoretic framework for studying the problem of minimizing the delay of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this configuration, clients cooperate with each other to recover the erased packets without a central controller. Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. We model the session by self-interested players in a non-cooperative potential game. The utility functions are designed such that increasing individual payoff results in a collective behavior achieving both a desirable system performance in a shared network environment and the Nash bargaining solution. Three games are developed: the first aims to reduce the completion time, the second to reduce the maximum decoding delay and the third the sum decoding delay. We improve these formulations to include punishment policy upon collision occurrence and achieve the Nash bargaining solution. Through extensive simulations, our framework is tested against the best performance that could be found in the conventional point-to-multipoint (PMP) recovery process in numerous cases: first we simulate the problem with complete information. We, then, simulate with incomplete information and finally we test it in lossy feedback scenario. Numerical results show that our formulation with complete information largely outperforms the conventional PMP scheme in most situations and achieves a lower delay. They also show that the completion time formulation with incomplete information also outperforms the conventional PMP.

cs.IT↗

arXiv2014

Decoding Delay Controlled Reduction of Completion Time in Instantly Decodable Network Coding

For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution in persistent erasure channels. We first derive the decoding-delay-dependent expressions of the users' and overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we design two novel heuristics that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. We, then, extend our study to the limited feedback scenario. Simulation results show that our new algorithms achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.

cs.IT↗

arXiv2014

A Game Theoretic Approach to Minimize the Completion Time of Network Coded Cooperative Data Exchange

In this paper, we introduce a game theoretic framework for studying the problem of minimizing the completion time of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this configuration, clients cooperate with each other to recover the erased packets without a central controller. Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. We model the session by self-interested players in a non-cooperative potential game. The utility function is designed such that increasing individual payoff results in a collective behavior achieving both a desirable system performance in a shared network environment and the Pareto optimal solution. Through extensive simulations, our approach is compared to the best performance that could be found in the conventional point-to-multipoint (PMP) recovery process. Numerical results show that our formulation largely outperforms the conventional PMP scheme in most practical situations and achieves a lower delay.

cs.IT↗

arXiv2014

Performance Analysis of Hybrid ARQ with Incremental Redundancy over Amplify-and-Forward Dual-Hop Relay Channels

In this paper, we consider a three node relay network comprising a source, a relay, and a destination. The source transmits the message to the destination using hybrid automatic repeat request (HARQ) with incremental redundancy (IR). The relay overhears the transmitted message, amplifies it using a variable gain amplifier, and then forwards the message to the destination. This latter combines both the source and the relay message and tries to decode the information. In case of decoding failure, the destination sends a negative acknowledgement. A new replica of the message containing new parity bits is then transmitted in the subsequent HARQ round. This process continues until successful decoding occurs at the destination or a maximum number $M$ of rounds is reached. We study the performance of HARQ-IR over the considered relay channel from an information theoretic perspective. We derive exact expressions and bounds for the information outage probability, the average number of transmissions, and the average transmission rate. Moreover, we evaluate the delay experienced by Poisson arriving packets over the considered relay network. We also provide analytical expressions for the expected waiting time, the sojourn time, and the energy efficiency. The derived exact expressions are validated by Monte Carlo simulations.

cs.IT↗

arXiv2014

Completion Time Reduction in Instantly Decodable Network Coding Through Decoding Delay Control

For several years, the completion time and decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users' and overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we design a novel heuristic that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Simulation results show that this new algorithm achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.

cs.IT↗