arXiv subjects

Mohamed-Slim Alouini

Publications and source records attributed to Mohamed-Slim Alouini.

At least 451 records · Page 25Linked to original sources

arXiv2019

Signal Shaping for Generalized Spatial Modulation and Generalized Quadrature Spatial Modulation

This paper investigates generic signal shaping methods for multiple-data-stream generalized spatial modulation (GenSM) and generalized quadrature spatial modulation (GenQSM) based on the maximizing the minimum Euclidean distance (MMED) criterion. Three cases with different channel state information at the transmitter (CSIT) are considered, including no CSIT, statistical CSIT and perfect CSIT. A unified optimization problem is formulated to find the optimal transmit vector set under size, power and sparsity constraints. We propose an optimization-based signal shaping (OBSS) approach by solving the formulated problem directly and a codebook-based signal shaping (CBSS) approach by finding sub-optimal solutions in discrete space. In the OBSS approach, we reformulate the original problem to optimize the signal constellations used for each transmit antenna combination (TAC). Both the size and entry of all signal constellations are optimized. Specifically, we suggest the use of a recursive design for size optimization. The entry optimization is formulated as a non-convex large-scale quadratically constrained quadratic programming (QCQP) problem and can be solved by existing optimization techniques with rather high complexity. To reduce the complexity, we propose the CBSS approach using a codebook generated by quadrature amplitude modulation (QAM) symbols and a low-complexity selection algorithm to choose the optimal transmit vector set. Simulation results show that the OBSS approach exhibits the optimal performance in comparison with existing benchmarks. However, the OBSS approach is impractical for large-size signal shaping and adaptive signal shaping with instantaneous CSIT due to the demand of high computational complexity. As a low-complexity approach, CBSS shows comparable performance and can be easily implemented in large-size systems.

eess.SP↗

arXiv2019

End-to-End Performance Analysis of Underwater Optical Wireless Relaying and Routing Techniques Under Location Uncertainty

On the contrary of low speed and high delay acoustic systems, underwater optical wireless communication (UOWC) can deliver a high speed and low latency service at the expense of short communication ranges. Therefore, multihop communication is of utmost importance to improve degree of connectivity and overall performance of underwater optical wireless networks (UOWNs). In this regard, this paper investigates relaying and routing techniques and provides their end-to-end (E2E) performance analysis under the location uncertainty. To achieve robust and reliable links, we first consider adaptive beamwidths and derive the divergence angles under the absence and presence of a pointing-acquisitioning-and-tracking (PAT) mechanism. Thereafter, important E2E performance metrics (e.g., data rate, bit error rate, transmission power, amplifier gain, etc.) are obtained for two potential relaying techniques; decode & forward (DF) and optical amplify & forward (AF). We develop centralized routing schemes for both relaying techniques to optimize E2E rate, bit error rate, and power consumption. Alternatively, a distributed routing protocol, namely Light Path Routing (LiPaR), is proposed by leveraging the range-beamwidth tradeoff of UOWCs. LiPaR is especially shown to be favorable when there is no PAT mechanism and available network information. In order to show the benefits of multihop communications, extensive simulations are conducted to compare different routing and relaying schemes under different network parameters and underwater environments.

cs.NI↗

arXiv2019

Eficient Monte Carlo Simulation of the Left Tail of Positive Gaussian Quadratic Forms

Estimating the left tail of quadratic forms in Gaussian random vectors is of major practical importance in many applications. In this paper, we propose an efficient and robust importance sampling estimator that is endowed with the bounded relative error property. This property significantly reduces the number of simulation runs required by the proposed estimator compared to naive Monte Carlo. Thus, our importance sampling estimator is especially useful when the probability of interest is very small. Selected simulation results are presented to illustrate the efficiency of our estimator compared to naive Monte Carlo in both central and non-central cases, as well as both real and complex settings.

stat.ME↗

arXiv2019

A New Relation Between Energy Efficiency and Spectral Efficiency in Wireless Communications Systems

When designing wireless communication systems (WCS), spectral efficiency (SE) has been the main design performance metric. Recently, energy efficiency (EE) is attracting a huge interest due to the massive deployment of power limited WCS such as IoT devices, and stringent environmental concerns. For this reason, many works in the literature focused on optimizing the EE and highlighted the EE-SE relationship as a trade-off (meaning that increasing one decreases the other). In this article, after introducing the EE metric, we highlight a new perspective of the EE-SE relationship based on energy-efficient power control. In particular, we give insights about the EE-based performance of various transmission technologies and its impact on 5G future design. Via numerical results, we show that the corresponding power scheme allows an increase of both the SE as the EE with no trade-off. Finally, we present relevant open research problems.

cs.NI↗

arXiv2018

DC-Bias and Power Allocation in Cooperative VLC Networks for Joint Information and Energy Transfer

Visible light communications (VLC) have emerged as strong candidates for meeting the escalating demand for high data rates. Consider a VLC network, where multiple access-points (APs) serve both energy-harvesting users (EHUs), i.e., users which harvest energy from light intensity, and information-users (IUs), i.e., users which gather data information. In order to jointly balance the achievable sum-rate at the IUs and the energy harvested by the EHUs, the paper considers maximizing a network-wide utility, which consists of a weighted-sum of the IUs sum-rate and the EHUs harvested energy, subject to individual IU rate constraint, individual EHU harvested-energy constraint, and AP power constraints, so as to jointly determine the direct current (DC)-bias value at each AP, and the users powers. The paper solves such a difficult non-convex optimization problem using an iterative approach which relies on inner convex approximations, and compensates for the used approximations using proper outer-loop updates. The paper further considers solving the special cases of the problem, i.e., maximizing the sum-rate, and maximizing the total harvested-energy, both subject to the same constraints. Numerical results highlight the significant performance improvement of the proposed algorithms, and illustrate the impacts of the network parameters on the performance trade-off between the sum-rate and harvested-energy.

cs.IT↗

arXiv2018

On the Secrecy Performance of Generalized User Selection for Interference-Limited Multiuser Wireless Networks

We investigate the secrecy performance of a multiuser diversity scheme for an interference-limited wireless network with a base-station (BS), $N$ legitimate users and an eavesdropper, in the presence of a single dominant interferer. Assuming interference dominates noise power at the eavesdropper and at each legitimate user's receiver, the BS transmits information to the legitimate user with the $k$-th best (highest) signal-to-interference ratio. We derive a closed-form expression for the secrecy outage probability for an arbitrary $N$ and an asymptotic expression for a fixed $k$ and large $N$. Furthermore, we derive a closed form asymptotic expression for the ergodic secrecy capacity of the $k$-th best user and show that it scales like $O\left(\log(N)\right)$ for a fixed $k$ and large $N$.

cs.IT↗

arXiv2018

Ordered Sequence Detection and Barrier Signal Design for Digital Pulse Interval Modulation in Optical Wireless Communications

This paper proposes an ordered sequence detection (OSD) for digital pulse interval modulation (DPIM) in optical wireless communications. Leveraging the sparsity of DPIM sequences, OSD shows comparable performance to the optimal maximum likelihood sequence detection (MLSD) with much lower complexity. Compared with the widely adopted sample-by-sample optimal threshold detection (OTD), it considerably improves the bit error rate (BER) performance by mitigating error propagation. Moreover, this paper proposes a barrier signal-aided digital pulse interval modulation (BDPIM), where the last of every $K$ symbols is allocated with more power as an inserted barrier signal. BDPIM with OSD (BDPIM-OSD) can limit the error propagation between two adjacent barriers. To reduce the storing delay when using OSD to detect extremely large packets, we propose BDPIM with a combination of OTD and OSD (BDPIM-OTD-OSD), within which long sequences are cut into pieces and separately detected. Approximate upper bounds of the average BER performance of DPIM-OTD, DPIM-OSD, BDPIM-OSD and BDPIM-OTD-OSD are analyzed. Simulations are conducted to corroborate our analysis. Optimal parameter settings are also investigated in uncoded and coded systems by simulations. Simulation results show that the proposed OSD and BDPIM bring significant improvement in uncoded and coded systems over various channels.

eess.SP↗

arXiv2018

Line-of-Sight and Pilot Contamination Effects on Correlated Multi-cell Massive MIMO Systems

This work considers the uplink (UL) of a multi-cell massive MIMO system with $L$ cells, having each $K$ mono-antenna users communicating with an $N-$antennas base station (BS). The channel model involves Rician fading with distinct per-user Rician factors and channel correlation matrices and takes into account pilot contamination and imperfect CSI. The objective is to evaluate the performances of such systems with different single-cell and multi-cell detection methods. In the former, we investigate MRC and single-cell MMSE (S-MMSE); as to the latter, we are interested in multi-cell MMSE (M-MMSE) that was recently shown to provide unbounded rates in Rayleigh fading. The analysis is led assuming the infinite $N$ limit and yields informative closed-form approximations that are substantiated by a selection of numerical results for finite system dimensions. Accordingly, these expressions are accurate and provide relevant insights into the effects of the different system parameters on the overall performances.

cs.IT↗

arXiv2018

Effective Capacity for Renewal Service Processes with Applications to HARQ Systems

Considering the widespread use of effective capacity in cross-layer design and the extensive existence of renewal service processes in communication networks, this paper thoroughly investigates the effective capacity for renewal processes. Based on Z-transform, we derive exact analytical expressions for the effective capacity at a given quality of service (QoS) exponent for both the renewal processes with constant reward and with variable rewards. Unlike prior literature that the effective capacity is approximated with no many insightful discussions, our expression is simple and reveals further meaningful results, such as the monotonicity and bounds of effective capacity. The analytical results are then applied to evaluate the cross-layer throughput for diverse hybrid automatic repeat request (HARQ) systems, including fixed-rate HARQ (FR-HARQ, e.g., Type I HARQ, HARQ with chase combining (HARQ-CC) and HARQ with incremental redundancy (HARQ-IR)), variable-rate HARQ (VR-HARQ) and cross-packet HARQ (XP-HARQ). Numerical results corroborate the analytical ones and prove the superiority of our proposed approach. Furthermore, targeting at maximizing the effective capacity via the optimal rate selection, it is revealed that VR-HARQ and XP-HARQ attain almost the same performance, and both of them perform better than FR-HARQ.

cs.IT↗

arXiv2018

Design and Provision of Traffic Grooming for Optical Wireless Data Center Networks

Traditional wired data center networks (DCNs) suffer from cabling complexity, lack flexibility, and are limited by the speed of digital switches. In this paper, we alternatively develop a top-down traffic grooming (TG) approach to the design and provisioning of mission-critical optical wireless DCNs. While switches are modeled as hybrid optoelectronic cross-connects, links are modeled as wavelength division multiplexing (WDM) capable free-space optic (FSO) channels. Using the standard TG terminology, we formulate the optimal mixed-integer TG problem considering the virtual topology, flow conversation, connection topology, non-bifurcation, and capacity constraints. Thereafter, we develop a fast yet efficient sub-optimal solution which grooms mice flows (MFs) and mission-critical flows (CFs) and forward on predetermined rack-to-rack (R2R) lightpaths. On the other hand, elephant flows (EFs) are forwarded over dedicated server-to-server (S2S) express lightpaths whose routes and capacity are dynamically determined based on the availability of wavelength and capacity. To prioritize the CFs, we consider low and high priority queues and analyze the delay characteristics such as waiting times, maximum hop counts, and blocking probability. As a result of grooming the sub-wavelength traffic and adjusting the wavelength capacities, numerical results show that the proposed solutions can achieve significant performance enhancement by utilizing the bandwidth more efficiently, completing the flows faster than delay sensitivity requirements, and avoiding the traffic congestion by treating EFs and MFs separately.

cs.NI↗

arXiv2018

Distributed Cluster Formation and Power-Bandwidth Allocation for Imperfect NOMA in DL-HetNets

In this paper, we consider an non-ideal successive interference cancellation (SIC) receiver based imperfect non-orthogonal multiple access (NOMA) schemes whose performance is limited by three factors: 1) Power disparity \& sensitivity constraints (PDSCs), 2) Intra-cluster interference (ICRI), and 3) Intercell-interference (ICI). By quantifying the residual interference with a fractional error factor (FEF), we show that NOMA cannot always perform better than orthogonal multiple access (OMA) especially under certain receiver sensitivity and FEF levels. Assuming the existence of an offline/online ICI management scheme, the proposed solution accounts for the ICI which is shown to deteriorate the NOMA performance particularly when it becomes significant compared to the ICRI. Then, a distributed cluster formation (CF) and power-bandwidth allocation (PBA) approach are proposed for downlink (DL) heterogeneous networks (HetNets) operating on the imperfect NOMA. We develop a hierarchically distributed solution methodology where BSs independently form clusters and distributively determine the power-bandwidth allowance of each cluster. A generic CF scheme is obtained by creating a multi-partite graph (MPG) via partitioning user equipments (UEs) with respect to their channel gains since NOMA performance is primarily determined by the channel gain disparity of cluster members. A sequential weighted bi-partite matching method is proposed for solving the resulted weighted multi-partite matching problem. Thereafter, we present a hierarchically distributed PBA approach which consists of the primary master, secondary masters, and slave problems...

cs.NI↗

arXiv2018

Wireless Data Center Networks: Advances, Challenges, and Opportunities

Data center networks (DCNs) are essential infrastructures to embrace the era of highly diversified massive amount of data generated by emerging technological applications. In order to store and process such a data deluge, today's DCNs have to deploy enormous length of wires to interconnect a plethora of servers and switches. Unfortunately, wired DCNs with uniform and inflexible link capacities expose several drawbacks such as high cabling cost and complexity, low space utilization, and lack of bandwidth efficiency. Wireless DCNs (WDCNs) have emerged as a promising solution to reduce the time, effort, and cost spent on deploying and maintaining the wires. Thanks to its reconfigurability and flexibility, WDCNs can deliver higher throughputs by efficiently utilizing the bandwidth and mitigate the chronic DCN problems of oversubscription and hotspots. Moreover, wireless links enhance the fault-tolerance and energy efficiency by eliminating the need for error-prone power-hungry switches. Accordingly, this paper first compares virtues and drawbacks of millimeter wave (mmWave), terahertz (THz), and optical wireless communications as potential candidates. Thereafter, an in-depth discussion on advances and challenges in WDCNs is provided including physical and virtual topology design, quality of service (QoS) provisioning, flow classification, data grooming, and load balancing. Finally, exciting research opportunities are presented to promote the prospects of WDCNs.

cs.NI↗

arXiv2018

On the Capacity of Fading Channels with Peak and Average Power Constraints at Low SNR

The capacity of fading channels under peak and average power constraints in the low-SNR regime is investigated. We show that the capacity scales essentially as ${C \approx A \ \text{SNR} \int_{1- \frac{1}{A}}^1 F^{-1}\left(t\right)dt}$, where $A$ is the peak to average power ratio (PAPR), and $F(\cdot)$ is the cumulative distribution function of the fading channel. We also prove that an On-Off power scheme is sufficient to asymptotically achieve the capacity. Furthermore, by considering the variable PAPR scenario, we generalize the scalability of the capacity and derive the asymptotic expression for the capacity in the low-SNR regime.

eess.SP↗

arXiv2018

On Distributed Routing in Underwater Optical Wireless Sensor Networks

Underwater optical wireless communication (UOWC) is becoming an attractive technology for underwater wireless sensor networks (UWSNs) since it offers high-speed communication links. Although UOWC overcomes the drawbacks of acoustic and radio frequency communication channels such as high latency and low data rate, yet, it has its own limitations. One of the major limitations of UOWC is its limited transmission range which demands to develop a multi-hop network with efficient routing protocols. Currently, the routing protocols for UOWSNs are centralized having high complexity and large end-to-end delay. In this article, first, we present the existing routing protocols for UOWSNs. Based on the existing protocols, we then propose distributed routing protocols to address the problems of high complexity and large end-to-end delay. Numerical results have been provided to show that the proposed routing protocol is superior to the existing protocols in terms of complexity and end-to-end delay. Finally, we have presented open research directions in UOWSNs.

cs.NI↗

arXiv2018

On the Throughput of Large-but-Finite MIMO Networks using Schedulers

This paper studies the sum throughput of the {multi-user} multiple-input-single-output (MISO) networks in the cases with large but finite number of transmit antennas and users. Considering continuous and bursty communication scenarios with different users' data request probabilities, we derive quasi-closed-form expressions for the maximum achievable throughput of the networks using optimal schedulers. The results are obtained in various cases with different levels of interference cancellation. Also, we develop an efficient scheduling scheme using genetic algorithms (GAs), and evaluate the effect of different parameters, such as channel/precoding models, number of antennas/users, scheduling costs and power amplifiers' efficiency, on the system performance. Finally, we use the recent results on the achievable rates of finite block-length codes to analyze the system performance in the cases with short packets. As demonstrated, the proposed GA-based scheduler reaches (almost) the same throughput as in the exhaustive search-based optimal scheduler, with substantially less implementation complexity. Moreover, the power amplifiers' inefficiency and the scheduling delay affect the performance of the scheduling-based systems significantly.

cs.IT↗

arXiv2018

Different Power Adaption Methods on Fluctuating Two-Ray Fading Channels

In this letter, we consider a typical scenario where the transmitter employs different power adaption methods, including the optimal rate and power algorithm, optimal rate adaption, channel inversion and truncated channel inversion, to enhance the ergodic capacity (EC) with an average transmit power constraint over fluctuating two-way fading channels. In particular, we derive exact closed-form expressions for the EC under different power adaption methods, as well as corresponding asymptotic formulas for the EC valid in the high signal-to-noise ratio (SNR) region. Finally, we compare the performance of the EC under different power adaption methods, and this also validates the accuracy of our derived expressions for the exact and asymptotic EC.

eess.SP↗

arXiv2018

Meta Distribution of Downlink Non-Orthogonal Multiple Access (NOMA) in Poisson Networks

We study the meta distribution (MD) of the coverage probability (CP) in downlink non-orthogonal-multiple-access (NOMA) networks. Two schemes are assessed based on the location of the NOMA users: 1) anywhere in the network, 2) cell-center users only. The moments of the MD for both schemes are derived and the MD is approximated via the beta distribution. Closed-form moments are derived for the first scheme; for the second scheme exact and approximate moments, to simplify the integral calculation, are derived. We show that restricting NOMA to cell-center users provides significantly higher mean, lower variance and better percentile performance for the CP.

cs.IT↗

arXiv2018

Communication Through Breath: Aerosol Transmission

Exhaled breath can be used in retrieving information and creating innovative communication systems. It contains several volatile organic compounds (VOCs) and biological entities that can act as health biomarkers. For instance, the breath of infected human contains a nonnegligible amount of pathogenic aerosol that can spread or remain suspended in the atmosphere. Therefore, the exhaled breath can be exploited as a source's message in a communication setup to remotely scan the bio-information via an aerosol transmission channel. An overview of the basic configuration is presented along with a description of system components with a particular emphasis on channel modeling. Furthermore, the challenges that arise in theoretical analysis and system development are highlighted. Finally, several open issues are discussed to concretize the proposed communication concept.

eess.SP↗