95 results on '"Ali Ghrayeb"'
Search Results
2. Power Allocation Optimization and Decoding Order Selection in Uplink C-NOMA Networks
- Author
-
Mohamed Elhattab, Mohamed Amine Arfaoui, Chadi Assi, Ali Ghrayeb, and Marwa Qaraqe
- Subjects
Modeling and Simulation ,Electrical and Electronic Engineering ,Computer Science Applications - Published
- 2023
3. Superposition-Based URLLC Traffic Scheduling in 5G and Beyond Wireless Networks
- Author
-
Mohammed Almekhlafi, Mohamed Amine Arfaoui, Chadi Assi, and Ali Ghrayeb
- Subjects
Electrical and Electronic Engineering - Published
- 2022
4. RIS-Assisted Joint Transmission in a Two-Cell Downlink NOMA Cellular System
- Author
-
Mohamed Elhattab, Mohamed Amine Arfaoui, Chadi Assi, and Ali Ghrayeb
- Subjects
Computer Networks and Communications ,Electrical and Electronic Engineering - Published
- 2022
5. Optimizing Age of Information Through Aerial Reconfigurable Intelligent Surfaces: A Deep Reinforcement Learning Approach
- Author
-
Mohamed Elhattab, Chadi Assi, Sanaa Sharafeddine, Ali Ghrayeb, and Moataz Samir
- Subjects
Signal Processing (eess.SP) ,Information Age ,Schedule ,Optimization problem ,Computer Networks and Communications ,Wireless network ,Computer science ,Reliability (computer networking) ,Real-time computing ,Aerospace Engineering ,020302 automobile design & engineering ,02 engineering and technology ,law.invention ,Base station ,0203 mechanical engineering ,Relay ,law ,Automotive Engineering ,FOS: Electrical engineering, electronic engineering, information engineering ,Reinforcement learning ,Electrical Engineering and Systems Science - Signal Processing ,Electrical and Electronic Engineering - Abstract
We investigate the benefits of integrating unmanned aerial vehicles (UAVs) with reconfigurable intelligent surface (RIS) elements to passively relay information sampled by Internet of Things devices (IoTDs) to the base station (BS). In order to maintain the freshness of relayed information, an optimization problem with the objective of minimizing the expected sum Age-of-Information (AoI) is formulated to optimize the altitude of the UAV, the communication schedule, and phases-shift of RIS elements. In the absence of prior knowledge of the activation pattern of the IoTDs, proximal policy optimization algorithm is developed to solve this mixed-integer non-convex optimization problem. Numerical results show that our proposed algorithm outperforms all others in terms of AoI.
- Published
- 2021
6. Measurements-Based Channel Models for Indoor LiFi Systems
- Author
-
Majid Safari, Harald Haas, Ali Ghrayeb, Iman Tavakkolnia, Mohamed Amine Arfaoui, Mohammad Dehghani Soltani, and Chadi Assi
- Subjects
Signal Processing (eess.SP) ,business.industry ,Computer science ,Orientation (computer vision) ,Applied Mathematics ,Gaussian ,020206 networking & telecommunications ,02 engineering and technology ,Topology ,Computer Science Applications ,symbols.namesake ,Signal-to-noise ratio ,FOS: Electrical engineering, electronic engineering, information engineering ,0202 electrical engineering, electronic engineering, information engineering ,symbols ,Optical wireless ,Wireless ,Graphical model ,Electrical Engineering and Systems Science - Signal Processing ,Electrical and Electronic Engineering ,business ,Communication channel - Abstract
Light-fidelity (LiFi) is a fully-networked bidirectional optical wireless communication (OWC) technology that is considered as a promising solution for high-speed indoor connectivity. Unlike in conventional radio frequency wireless systems, the OWC channel is not isotropic, meaning that the device orientation affects the channel gain significantly. However, due to the lack of proper channel models for LiFi systems, many studies have assumed that the receiver is vertically upward and randomly located within the coverage area, which is not a realistic assumption from a practical point of view. In this paper, novel realistic and measurement-based channel models for indoor LiFi systems are proposed. Precisely, the statistics of the channel gain are derived for the case of randomly oriented stationary and mobile users. For stationary users, two channel models are proposed, namely, the modified truncated Laplace (MTL) model and the modified Beta (MB) model. For mobile users, two channel models are proposed, namely, the sum of modified truncated Gaussian (SMTG) model and the sum of modified Beta (SMB) model. Based on the derived models, the impact of random orientation and spatial distribution of users is investigated, where we show that the aforementioned factors can strongly affect the channel gain and the system performance.
- Published
- 2021
7. Reconfigurable Intelligent Surface Assisted Coordinated Multipoint in Downlink NOMA Networks
- Author
-
Mohamed Elhattab, Chadi Assi, Ali Ghrayeb, and Mohamed Amine Arfaoui
- Subjects
business.industry ,Computer science ,020206 networking & telecommunications ,02 engineering and technology ,Spectral efficiency ,medicine.disease ,Interference (wave propagation) ,Computer Science Applications ,Noma ,User equipment ,Transmission (telecommunications) ,Modeling and Simulation ,Telecommunications link ,0202 electrical engineering, electronic engineering, information engineering ,medicine ,Electrical and Electronic Engineering ,business ,Computer network - Abstract
In this letter, we investigate the amalgamation between the reconfigurable intelligent surface (RIS) technology and the joint transmission coordinated multipoint (JT-CoMP) in order to enhance the performance of a cell-edge user equipment (UE) in a two-user non-orthogonal multiple access (NOMA) group without deteriorating the performance of the NOMA cell-center UE. The RIS is adopted to construct a strong combined channel gain at the cell-edge UE, while JT-CoMP is used to mitigate the effects of inter-cell interference (ICI). In this proposed framework, we derive first a closed-form expression for the ergodic rate of the cell-edge UE, and then we evaluate the network spectral efficiency. We validate the derived expression through Monte-Carlo simulations, where we demonstrate the efficacy of the proposed framework compared to other multiple access techniques proposed in the literature.
- Published
- 2021
8. Exploiting Antenna Diversity to Enhance Hybrid Cooperative Non-Orthogonal Multiple Access
- Author
-
Mohamed Amine Arfaoui, Phuc Dinh, Ali Ghrayeb, and Chadi Assi
- Subjects
Computer engineering ,Robustness (computer science) ,Computer science ,Modeling and Simulation ,Telecommunications link ,0202 electrical engineering, electronic engineering, information engineering ,020206 networking & telecommunications ,02 engineering and technology ,Non orthogonal ,Electrical and Electronic Engineering ,Antenna diversity ,5G ,Computer Science Applications - Abstract
Cooperative non-orthogonal multiple access (C-NOMA) is a novel multiple access technology that is considered as a promising solution for 5G and beyond. The technique has been proposed as a combination between NOMA and cooperative communications, such as device-to-device (D2D) communications. In this letter, we will address some limitations of the state-of-the-art C-NOMA model and promote an enhancement to the contemporary version. The improvement is based on an exhaustive exploitation of the antennas mounted at the users devices. Based on this, we revisit the rate analysis and the performance optimization of C-NOMA systems. Simulation results reveal the robustness of the proposed scheme in the presence of high self-interference (SI) and insightful comparisons with other previously proposed schemes in the literature are provided.
- Published
- 2020
9. Age of Information Aware Trajectory Planning of UAVs in Intelligent Transportation Systems: A Deep Learning Approach
- Author
-
Chadi Assi, Ali Ghrayeb, Dariush Ebrahimi, Moataz Samir, and Sanaa Sharafeddine
- Subjects
Optimization problem ,Computer Networks and Communications ,Data stream mining ,Computer science ,business.industry ,Distributed computing ,Deep learning ,Aerospace Engineering ,020302 automobile design & engineering ,02 engineering and technology ,Network dynamics ,Scheduling (computing) ,0203 mechanical engineering ,Automotive Engineering ,Reinforcement learning ,Markov decision process ,Artificial intelligence ,Electrical and Electronic Engineering ,business ,Intelligent transportation system - Abstract
Unmanned aerial vehicles (UAVs) are envisioned to play a key role in intelligent transportation systems to complement the communication infrastructure in future smart cities. UAV-assisted vehicular networking research typically adopts throughput and latency as the main performance metrics. These conventional metrics, however, are not adequate to reflect the freshness of the information, an attribute that has been recently identified as a critical requirement to enable services such as autonomous driving and accident prevention. In this paper, we consider a UAV-assisted single-hop vehicular network, wherein sensors (e.g., LiDARs and cameras) on vehicles generate time sensitive data streams, and UAVs are used to collect and process this data while maintaining a minimum age of information (AoI). We aim to jointly optimize the trajectories of UAVs and find scheduling policies to keep the information fresh under minimum throughput constraints. The formulated optimization problem is shown to be mixed integer non-linear program (MINLP) and generally hard to be solved. Motivated by the success of machine learning (ML) techniques particularly deep learning in solving complex problems with low complexity, we reformulate the trajectories and scheduling policies problem as a Markov decision process (MDP) where the system state space considers the vehicular network dynamics. Then, we develop deep reinforcement learning (DRL) to learn the vehicular environment and its dynamics in order to handle UAVs’ trajectory and scheduling policy. In particular, we leverage Deep Deterministic Policy Gradient (DDPG) for learning the trajectories of the deployed UAVs to efficiently minimize the Expected Weighted Sum AoI (EWSA). Simulations results demonstrate the effectiveness of the proposed design and show the deployed UAVs adapt their velocities during the data collection mission in order to minimize the AoI.
- Published
- 2020
10. A Framework for Unsupervised Planning of Cellular Networks Using Statistical Machine Learning
- Author
-
Nizar Bouguila, Mohaned Chraiti, Chadi Assi, Reinaldo A. Valenzuela, and Ali Ghrayeb
- Subjects
Radio access network ,Optimization problem ,business.industry ,Computer science ,020206 networking & telecommunications ,020302 automobile design & engineering ,Provisioning ,02 engineering and technology ,Machine learning ,computer.software_genre ,symbols.namesake ,Base station ,Network element ,Capacity planning ,0203 mechanical engineering ,0202 electrical engineering, electronic engineering, information engineering ,Cellular network ,symbols ,Wireless ,Leverage (statistics) ,Artificial intelligence ,Electrical and Electronic Engineering ,business ,computer ,Gibbs sampling - Abstract
The wireless industry is moving towards developing smart cellular architectures that dynamically adjust the use of the network elements according to the service demand, and automating their operations in order to minimize both capital expenditure (CAPEX) and operation expenditure (OPEX). This involves developing efficient and unsupervised radio access network (RAN) planning, which has a direct impact on the system performance and CAPEX. This intelligent cellular planning aims at providing the base stations (BSs) configurations (e.g., coverage, user associations and antenna radiation pattern) that minimize the number of deployed BSs and meet the requirements in terms of coverage and capacity. The cellular planning optimization problem has been shown to be complex and non-scalable. Moreover, most of the existing cellular planning techniques result in an over or under provisioning architecture. Motivated by the above, we propose in this paper a novel and efficient unsupervised planning process. We make use of statistical machine learning (SML) to solve the problem at hand. The core idea of SML is that the planning parameters are treated as random variables. The parameters that maximize the corresponding joint probability distribution, conditioned on observations of users’ positions, are learned or inferred using Gibbs sampling theory and Bayes’ theory. To apply this theory to the planning problem, we make significant efforts to properly formulate the problem to be able to incorporate the constraints into the inference process and extract the planning parameters from the inferred model. Through several numerical examples, we compare the performance of the proposed approach to clustering-based and optimization-based existing planning approaches, and demonstrate the efficacy of our approach. We also demonstrate how our approach can leverage existing cellular infrastructures into the new design.
- Published
- 2020
11. Secrecy Performance of the MIMO VLC Wiretap Channel With Randomly Located Eavesdropper
- Author
-
Chadi Assi, Mohamed Amine Arfaoui, and Ali Ghrayeb
- Subjects
Computer science ,Applied Mathematics ,Transmitter ,MIMO ,Visible light communication ,020206 networking & telecommunications ,02 engineering and technology ,Topology ,Precoding ,Computer Science Applications ,0202 electrical engineering, electronic engineering, information engineering ,Probability distribution ,Electrical and Electronic Engineering ,Computer Science::Cryptography and Security ,Computer Science::Information Theory ,Communication channel - Abstract
We study in this paper the secrecy performance of the multiple-input multiple-output (MIMO) visible light communication (VLC) wiretap channel. The underlying system model comprises three nodes: one transmitter, equipped with multiple fixtures of LEDs, one legitimate receiver and one eavesdropper, each equipped with multiple photo-diodes (PDs). The VLC channel is modeled as a real-valued amplitude-constrained Gaussian channel and the eavesdropper is assumed to be randomly located in the coverage area. We propose a low-complexity precoding scheme that aims at enhancing the secrecy performance of the system. Specifically, assuming discrete input signaling, we derive an average achievable secrecy rate for the underlying system in a closed-form, and the derived expression is a function of the precoding matrix and the input distribution using stochastic geometry. Then, we propose a low-complexity design of the precoding matrix based on the generalized singular value decomposition (GSVD) of the channel matrices of the system. We examine the resulting average achievable secrecy rate using the truncated discrete generalized normal (TDGN) distribution, which is the best-known discrete distribution available in the literature. Finally, we validate the proposed scheme through extensive simulations and we demonstrate its superiority when compared to other schemes reported in the literature.
- Published
- 2020
12. UAV Trajectory Planning for Data Collection from Time-Constrained IoT Devices
- Author
-
Ali Ghrayeb, Chadi Assi, Sanaa Sharafeddine, Tri Minh Nguyen, and Moataz Samir
- Subjects
Optimization problem ,Wireless network ,Computer science ,business.industry ,Applied Mathematics ,Quality of service ,Real-time computing ,020206 networking & telecommunications ,02 engineering and technology ,Computer Science Applications ,Upload ,0202 electrical engineering, electronic engineering, information engineering ,Wireless ,Resource management ,Electrical and Electronic Engineering ,Greedy algorithm ,business - Abstract
The global evolution of wireless technologies and intelligent sensing devices are transforming the realization of smart cities. Among the myriad of use cases, there is a need to support applications whereby low-resource IoT devices need to upload their sensor data to a remote control centre by target hard deadlines; otherwise, the data becomes outdated and loses its value, for example, in emergency or industrial control scenarios. In addition, the IoT devices can be either located in remote areas with limited wireless coverage or in dense areas with relatively low quality of service. This motivates the utilization of UAVs to offload traffic from existing wireless networks by collecting data from time-constrained IoT devices with performance guarantees. To this end, we jointly optimize the trajectory of a UAV and the radio resource allocation to maximize the number of served IoT devices, where each device has its own target data upload deadline. The formulated optimization problem is shown to be mixed integer non-convex and generally NP-hard. To solve it, we first propose the high-complexity branch, reduce and bound (BRB) algorithm to find the global optimal solution for relatively small scale scenarios. Then, we develop an effective sub-optimal algorithm based on successive convex approximation in order to obtain results for larger networks. Next, we propose an extension algorithm to further minimize the UAV’s flight distance for cases where the initial and final UAV locations are known a priori. We demonstrate the favourable characteristics of the algorithms via extensive simulations and analysis as a function of various system parameters, with benchmarking against two greedy algorithms based on distance and deadline metrics.
- Published
- 2020
13. Latency and Reliability-Aware Workload Assignment in IoT Networks With Mobile Edge Clouds
- Author
-
Ali Ghrayeb, Chadi Assi, Sanaa Sharafeddine, and Nouha Kherraf
- Subjects
Mobile edge computing ,Computer Networks and Communications ,End user ,business.industry ,Computer science ,Quality of service ,Distributed computing ,020206 networking & telecommunications ,Cloud computing ,Workload ,02 engineering and technology ,Scalability ,0202 electrical engineering, electronic engineering, information engineering ,Electrical and Electronic Engineering ,Latency (engineering) ,business ,5G - Abstract
Along with the dramatic increase in the number of IoT devices, different IoT services with heterogeneous QoS requirements are evolving with the aim of making the current society smarter and more connected. In order to deliver such services to the end users, the network infrastructure has to accommodate the tremendous workload generated by the smart devices and their heterogeneous and stringent latency and reliability requirements. This would only be possible with the emergence of ultra reliable low latency communications (uRLLC) promised by 5G. Mobile Edge Computing (MEC) has emerged as an enabling technology to help with the realization of such services by bringing the remote computing and storage capabilities of the cloud closer to the users. However, integrating uRLLC with MEC would require the network operator to efficiently map the generated workloads to MEC nodes along with resolving the trade-off between the latency and reliability requirements. Thus, we study in this paper the problem of Workload Assignment (WA) and formulate it as a Mixed Integer Program (MIP) to decide on the assignment of the workloads to the available MEC nodes. Due to the complexity of the WA problem, we decompose the problem into two subproblems; Reliability Aware Candidate Selection (RACS) and Latency Aware Workload Assignment (LAWA-MIP). We evaluate the performance of the decomposition approach and propose a more scalable approach; Tabu meta-heuristic (WA-Tabu). Through extensive numerical evaluation, we analyze the performance and show the efficiency of our proposed approach under different system parameters.
- Published
- 2019
14. A Spectrally Efficient Uplink Transmission Scheme Exploiting Similarity Among Short Bit Blocks
- Author
-
Mohaned Chraiti, Chadi Assi, and Ali Ghrayeb
- Subjects
Computer science ,Process (computing) ,020206 networking & telecommunications ,02 engineering and technology ,Spectral efficiency ,Base station ,Similarity (network science) ,Control channel ,Block (telecommunications) ,Telecommunications link ,0202 electrical engineering, electronic engineering, information engineering ,Overhead (computing) ,Electrical and Electronic Engineering ,Algorithm ,Computer Science::Information Theory - Abstract
Next-generation cellular systems are anticipated to support 100 times higher data rates (ultra-high rate) compared with the fourth generation (4G) of cellular systems. It is, therefore, necessary to develop novel spectrally efficient uplink/downlink techniques. Multiple techniques have been proposed, including the so-called non-orthogonal multiple access (NOMA) technique. However, the spectral efficiency gains achieved by NOMA over OMA techniques have been shown to be modest. Recently, we proposed a spectrally efficient technique for the downlink channel, which involves exploiting similarities among users’ short bit blocks, where we showed that spectral efficiency gains of up to three times that of OMA schemes can be achieved. However, the technique cannot be extended to the uplink scenario because users are not aware of each other’s bit block. To this end, we propose in this paper a spectrally efficient scheme for the uplink channel, where we exploit the similarity between the short bit blocks of the uplink and downlink sequences corresponding to one user. The downlink bit sequences are those received by a user from the base station (BS). It is assumed that the BS keeps track of the bit sequences transmitted on the downlink channel to different users. The uplink and downlink bit sequences, which are assumed to be uncorrelated, are divided into bit blocks of short lengths, and then, the similarity between those blocks is extracted. Once each user determines its similarity index (i.e., the number of similar bit blocks) between its own bit sequence and its respective downlink bit sequence, this information is communicated with the BS, which will, in turn, select the user with the largest similarity index to transmit during that resource block. The same process repeats every resource block where the user with the maximum similarity index is always selected. We propose a simple overhead exchange algorithm that facilitates the exchange of the information on the similarity indexes between the users and the BS, where we assume that this exchange of information is done through a control channel. The performance of the proposed scheme and the overhead exchange algorithm is investigated analytically and by Monte Carlo simulations. Among the parameters that we incorporate into the analysis are the user density, the length of bit blocks used to check the similarity index, and the channel correlation. We show that spectral efficiency gains of approximately two times that of OMA schemes can be achieved.
- Published
- 2019
15. CoMP-Assisted NOMA and Cooperative NOMA in Indoor VLC Cellular Systems
- Author
-
Mohamed Amine Arfaoui, Ali Ghrayeb, Chadi Assi, and Marwa Qaraqe
- Subjects
Signal Processing (eess.SP) ,FOS: Electrical engineering, electronic engineering, information engineering ,Electrical and Electronic Engineering ,Electrical Engineering and Systems Science - Signal Processing - Abstract
In this paper, we investigate the dynamic power allocation for a visible light communication (VLC) cellular system consisting of two coordinating attocells, each equipped with one access-point (AP). The coordinated multipoint (CoMP) between the two cells is introduced to assist users experiencing high inter-cell-interference (ICI). Specifically, the coordinated zero-forcing (ZF) precoding is used to cancel the ICI at the users located near the centers of the cells, whereas the joint transmission (JT) is employed to eliminate the ICI at the users located at the edge of both cells and to improve their receptions as well. Furthermore, two multiple access techniques are invoked within each cell, namely, non-orthogonal-multiple-access (NOMA) and cooperative non-orthogonal-multiple-access (C-NOMA). Hence, two multiple access techniques are proposed for the considered multi-user multi-cell system, namely, the CoMP-assisted NOMA scheme and the CoMP-assisted C-NOMA scheme. For each scheme, two power allocation frameworks are formulated each as an optimization problem, where the objective of the former is maximizing the network sum data rate while guaranteeing a certain quality-of-service (QoS) for each user, whereas the goal of the latter is to maximize the minimum data rate among all coexisting users. The formulated optimization problems are not convex, and hence, difficult to be solved directly unless using heuristic methods, which comes at the expense of high computational complexity.
- Published
- 2021
16. Optimized Provisioning of Edge Computing Resources With Heterogeneous Workload in IoT Networks
- Author
-
Sanaa Sharafeddine, Nouha Kherraf, Ali Ghrayeb, Chadi Assi, and Hyame Assem Alameddine
- Subjects
Computer Networks and Communications ,Computer science ,business.industry ,Wireless network ,Distributed computing ,020206 networking & telecommunications ,Workload ,Cloud computing ,Provisioning ,02 engineering and technology ,Server ,0202 electrical engineering, electronic engineering, information engineering ,Enhanced Data Rates for GSM Evolution ,Electrical and Electronic Engineering ,business ,Dimensioning ,Edge computing - Abstract
The proliferation of smart connected Internet of Things (IoT) devices is bringing tremendous challenges in meeting the performance requirement of their supported real-time applications due to their limited resources in terms of computing, storage, and battery life. In addition, the considerable amount of data they generate brings extra burden to the existing wireless network infrastructure. By enabling distributed computing and storage capabilities at the edge of the network, multi-access edge computing (MEC) serves delay sensitive, computationally intensive applications. Managing the heterogeneity of the workload generated by IoT devices, especially in terms of computing and delay requirements, while being cognizant of the cost to network operators, requires an efficient dimensioning of the MEC-enabled network infrastructure. Hence, in this paper, we study and formulate the problem of MEC resource provisioning and workload assignment for IoT services (RPWA) as a mixed integer program to jointly decide on the number and the location of edge servers and applications to deploy, in addition to the workload assignment. Given its complexity, we propose a decomposition approach to solve it which consists of decomposing RPWA into the delay aware load assignment sub-problem and the mobile edge servers dimensioning sub-problem. We analyze the effectiveness of the proposed algorithm through extensive simulations and highlight valuable performance trends and trade-offs as a function of various system parameters.
- Published
- 2019
17. Maximum Likelihood Joint Angle and Delay Estimation from Multipath and Multicarrier Transmissions with Application to Indoor Localization over IEEE 802.11ac Radio
- Author
-
Faouzi Bellili, Sofiene Affes, Souheib Ben Amor, and Ali Ghrayeb
- Subjects
Optimization problem ,Computer Networks and Communications ,Computer science ,Maximum likelihood ,Estimator ,020206 networking & telecommunications ,02 engineering and technology ,Upper and lower bounds ,Signal-to-noise ratio ,IEEE 802.11ac ,0202 electrical engineering, electronic engineering, information engineering ,Electrical and Electronic Engineering ,Algorithm ,Cramér–Rao bound ,Software ,Importance sampling ,Multipath propagation ,Communication channel - Abstract
In this paper, we tackle the problem of joint angle and delays estimation (JADE) of multiple reflections of a known signal impinging on multiple receiving antennae. Based on the importance sampling (IS) concept, we propose a new non-iterative maximum likelihood (ML) estimator that enjoys guaranteed global optimality and enhanced high-resolution capabilities for both single- and multi-carrier models. The new ML approach succeeds in transforming the original multi-dimensional optimization problem into multiple two-dimensional ones thereby resulting in huge computational savings. Moreover, it does not suffer from the off-grid problems that are inherent to most existing JADE techniques. By exploiting the sparsity feature of a carefully designed pseudo-pdf that is intrinsic to the new estimator, we also propose a novel approach that enables the accurate detection of the unknown number of paths over a wide range of practical signal-to-noise ratios (SNRs). Computer simulations show the distinct advantage of the new ML estimator over state-of-the art JADE techniques both in the single- and multi-carrier scenarios. Most remarkably, they suggest that the proposed IS-based ML JADE is statistically efficient as it almost reaches the Camer-Rao lower bound (CRLB) even in the adverse conditions of low SNR levels. Using real-world channel measurements collected from four access points (APs) with IEEE 802.11ac standard’s setup parameters in an indoor environment, we also show that the proposed ML estimator achieves a localization performance below 15 cm accuracy.
- Published
- 2019
18. Artificial Noise-Based Beamforming for the MISO VLC Wiretap Channel
- Author
-
Zouheir Rezki, Hajar Zaid, Anas Chaaban, Mohamed-Slim Alouini, Ali Ghrayeb, and Mohamed Amine Arfaoui
- Subjects
Beamforming ,021110 strategic, defence & security studies ,Computer science ,Transmitter ,0211 other engineering and technologies ,Visible light communication ,020206 networking & telecommunications ,02 engineering and technology ,Transmission (telecommunications) ,0202 electrical engineering, electronic engineering, information engineering ,Artificial noise ,Electrical and Electronic Engineering ,Algorithm ,Randomness ,Computer Science::Cryptography and Security ,Computer Science::Information Theory ,Communication channel - Abstract
This paper investigates the secrecy performance of the multiple-input single-output visible light communication (VLC) wiretap channel. The considered system model comprises three nodes: a transmitter (Alice) equipped with multiple fixtures of LEDs, a legitimate receiver (Bob), and an eavesdropper (Eve), each equipped with one photo-diode. The VLC channel is modeled as a real-valued amplitude-constrained Gaussian channel. Eve is assumed to be randomly located in the same area as Bob. Due to this, artificial noise-based beamforming is adopted as a transmission strategy in order to degrade Eve’s signal-to-noise ratio. Assuming discrete input signaling, we derive an achievable secrecy rate in a closed-form expression as a function of the beamforming vectors and the input distribution. We investigate the average secrecy performance of the system using stochastic geometry to account for the location randomness of Eve. We also adopt the truncated discrete generalized normal (TDGN) as a discrete input distribution. We present several examples through which we confirm the accuracy of the analytical results via Monte Carlo simulations. The results also demonstrate that the TDGN distribution, albeit being not optimal, yields performance close to the secrecy capacity.
- Published
- 2019
19. Secrecy Performance of Multi-User MISO VLC Broadcast Channels With Confidential Messages
- Author
-
Chadi Assi, Mohamed Amine Arfaoui, and Ali Ghrayeb
- Subjects
business.industry ,Computer science ,Applied Mathematics ,Transmitter ,Visible light communication ,020206 networking & telecommunications ,02 engineering and technology ,Multi-user ,01 natural sciences ,Precoding ,Computer Science Applications ,010309 optics ,0103 physical sciences ,Secrecy ,0202 electrical engineering, electronic engineering, information engineering ,Wireless ,Electrical and Electronic Engineering ,business ,Algorithm ,Communication channel - Abstract
We study, in this paper, the secrecy performance of a multi-user (MU) multiple-input single-output visible light communication broadcast channel with confidential messages. The underlying system model comprises $K +1$ nodes: a transmitter (Alice) equipped with $N$ fixtures of LEDs and $K$ spatially dispersed users, each equipped with a single photo-diode. The MU channel is modeled as deterministic and real-valued and assumed to be perfectly known to Alice, since all users are assumed to be active. We consider typical secrecy performance measures, namely, the max–min fairness, the harmonic mean, the proportional fairness, and the weighted fairness. For each performance measure, we derive an achievable secrecy rate for the system as a function of the precoding matrix. As such, we propose algorithms that yield the best precoding matrix for the derived secrecy rates, where we analyze their convergence and computational complexity. In contrast, what has been considered in the literature so far is zero-forcing (ZF) precoding, which is suboptimal. We present several numerical examples through which we demonstrate the substantial improvements in the secrecy performance achieved by the proposed techniques compared with those achieved by the conventional ZF. However, this comes at a slight increase in the complexity of the proposed techniques compared with ZF.
- Published
- 2018
20. A NOMA Scheme for a Two-User MISO Downlink Channel With Unknown CSIT
- Author
-
Mohaned Chraiti, Ali Ghrayeb, and Chadi Assi
- Subjects
Computer science ,050801 communication & media studies ,Data_CODINGANDINFORMATIONTHEORY ,02 engineering and technology ,Interference (wave propagation) ,Noma ,0508 media and communications ,Telecommunications link ,0202 electrical engineering, electronic engineering, information engineering ,medicine ,Overhead (computing) ,Electrical and Electronic Engineering ,Interference alignment ,Computer Science::Information Theory ,Applied Mathematics ,05 social sciences ,Transmitter ,Bandwidth (signal processing) ,020206 networking & telecommunications ,medicine.disease ,Power (physics) ,Computer Science Applications ,Single antenna interference cancellation ,Computer engineering ,Channel state information ,Algorithm ,5G - Abstract
The notion of non-orthogonal multiple access (NOMA) for 5G essentially relies on the availability of the channel state information at the transmitter (CSIT). Such knowledge is used to judiciously allocate power among users to make their signals separable at their respective receivers while employing successive interference cancellation (SIC). Feeding back the CSI from the users to the BS (transmitter) is obviously bandwidth consuming. Reducing such an overhead is of great importance and has been of interest in recent years. Furthermore, existing NOMA techniques become inapplicable when the CSI is unavailable at the BS. In this case, the BS has only the option of allocating power among users blindly, including equal power splitting, which has been shown to yield poor performance in terms of outage probability and error probability. This motivates us to develop a NOMA scheme that does not require CSI knowledge at the BS. We make use of a nonlinear interference alignment technique that we have proposed recently, namely, interference dissolution, to develop the proposed NOMA scheme, which allows the BS to communicate with two users simultaneously while keeping signals perfectly separable at their respective receivers. We develop the proposed scheme for multiple-input single-output and single-input single-output downlink channels. We analyze the proposed technique analytically in terms of the achievable degrees-of-freedom and achievable rate per user. We show that the proposed NOMA scheme outperforms existing NOMA techniques in terms of the outage probability and error probability.
- Published
- 2018
21. Reconfigurable Intelligent Surface Enabled Full-Duplex/Half-Duplex Cooperative Non-Orthogonal Multiple Access
- Author
-
Mohamed Elhattab, Chadi Assi, Ali Ghrayeb, and Mohamed Amine Arfaoui
- Subjects
Beamforming ,Signal Processing (eess.SP) ,Computer science ,Applied Mathematics ,Data_CODINGANDINFORMATIONTHEORY ,Transmitter power output ,Power budget ,Computer Science Applications ,Power (physics) ,law.invention ,Base station ,Single antenna interference cancellation ,Relay ,law ,Electronic engineering ,FOS: Electrical engineering, electronic engineering, information engineering ,Electrical and Electronic Engineering ,Electrical Engineering and Systems Science - Signal Processing ,Power control ,Computer Science::Information Theory - Abstract
This paper investigates the downlink transmission of reconfigurable intelligent surface (RIS)-aided cooperative non-orthogonal-multiple-access (C-NOMA), where both half-duplex (HD) and full-duplex (FD) relaying modes are considered. The system model consists of one base station (BS), two users and one RIS. The goal is to minimize the total transmit power at both the BS and at the user-cooperating relay for each relaying mode by jointly optimizing the power allocation coefficients at the BS, the transmit power coefficient at the relay user, and the passive beamforming at the RIS, subject to power budget constraints, the successive interference cancellation constraint and the minimum required quality-of-service at both cellular users. To address the high-coupled optimization variables, an efficient algorithm is proposed by invoking an alternating optimization approach that decomposes the original problem into a power allocation sub-problem and a passive beamforming sub-problem, which are solved alternately. For the power allocation sub-problem, the optimal closed-form expressions for the power allocation coefficients are derived. Meanwhile, with the aid of difference-of-convex rank-one representation and successive convex approximation, an efficient solution for the passive beamforming is obtained. The simulation results validate the accuracy of the derived power control closed-form expressions and demonstrate the gain in the total transmit power brought by integrating the RIS in C-NOMA networks.
- Published
- 2021
22. Joint Resource Allocation and Phase Shift Optimization for RIS-Aided eMBB/URLLC Traffic Multiplexing
- Author
-
Mohamed Amine Arfaoui, Mohammed Almekhlafi, Ali Ghrayeb, Chadi Assi, and Mohamed Elhattab
- Subjects
Signal Processing (eess.SP) ,Mathematical optimization ,Optimization problem ,Network packet ,Computer science ,Reliability (computer networking) ,Multiplexing ,Base station ,Cellular network ,FOS: Electrical engineering, electronic engineering, information engineering ,Resource allocation ,Electrical Engineering and Systems Science - Signal Processing ,Electrical and Electronic Engineering ,Time complexity - Abstract
This paper studies the coexistence of enhanced mobile broadband (eMBB) and ultra-reliable and low-latency communication (URLLC) services in a cellular network that is assisted by a reconfigurable intelligent surface (RIS). The system model consists of one base station (BS) and one RIS that is deployed to enhance the performance of both eMBB and URLLC in terms of the achievable data rate and reliability, respectively. We formulate two optimization problems, a time slot basis eMBB allocation problem and a mini-time slot basis URLLC allocation problem. The eMBB allocation problem aims at maximizing the eMBB sum rate by jointly optimizing the power allocation at the BS and the RIS phase-shift matrix while satisfying the eMBB rate constraint. On the other hand, the URLLC allocation problem is formulated as a multi-objective problem with the goal of maximizing the URLLC admitted packets and minimizing the eMBB rate loss. This is achieved by jointly optimizing the power and frequency allocations along with the RIS phase-shift matrix. In order to avoid the violation in the URLLC latency requirements, we propose a novel framework in which the RIS phase-shift matrix that enhances the URLLC reliability is proactively designed at the beginning of the time slot. For the sake of solving the URLLC allocation problem, two algorithms are proposed, namely, an optimization-based URLLC allocation algorithm and a heuristic algorithm. The simulation results show that the heuristic algorithm has a low time complexity, which makes it practical for real-time and efficient multiplexing between eMBB and URLLC traffic. In addition, using only 60 RIS elements, we observe that the proposed scheme achieves around 99.99\% URLLC packets admission rate compared to 95.6\% when there is no RIS, while also achieving up to 70\% enhancement on the eMBB sum rate.
- Published
- 2021
- Full Text
- View/download PDF
23. Physical Layer Security for Visible Light Communication Systems:A Survey
- Author
-
Majid Safari, Harald Haas, Ali Ghrayeb, Mohamed Amine Arfaoui, Chadi Assi, Mohammad Dehghani Soltani, and Iman Tavakkolnia
- Subjects
Signal Processing (eess.SP) ,visible light communication ,Computer science ,Visible light communication ,5G and beyond ,050801 communication & media studies ,Context (language use) ,02 engineering and technology ,Precoding ,secrecy rates ,multiple-input multiple-output ,0508 media and communications ,Broadcasting (networking) ,0202 electrical engineering, electronic engineering, information engineering ,FOS: Electrical engineering, electronic engineering, information engineering ,Electrical and Electronic Engineering ,Electrical Engineering and Systems Science - Signal Processing ,Network architecture ,business.industry ,Wireless network ,05 social sciences ,eavesdropping ,Physical layer ,physical layer security ,020206 networking & telecommunications ,Internet-of-Things ,Transmission (telecommunications) ,light-fidelity ,business ,Computer network - Abstract
Due to the dramatic increase in high data rate services and in order to meet the demands of the fifth-generation (5G) networks, researchers from both academia and industry are exploring advanced transmission techniques, new network architectures and new frequency spectrum such as the visible light and the millimeter wave (mmWave) spectra. Visible light communication (VLC) particularly is an emerging technology that has been introduced as a promising solution for 5G and beyond, owing to the large unexploited spectrum, which translates to significantly high data rates. Although VLC systems are more immune against interference and less susceptible to security vulnerabilities since light does not penetrate through walls, security issues arise naturally in VLC channels due to their open and broadcasting nature, compared to fiber-optic systems. In addition, since VLC is considered to be an enabling technology for 5G, and security is one of the 5G fundamental requirements, security issues should be carefully addressed and resolved in the VLC context. On the other hand, due to the success of physical layer security (PLS) in improving the security of radio-frequency (RF) wireless networks, extending such PLS techniques to VLC systems has been of great interest. Only two survey papers on security in VLC have been published in the literature. However, a comparative and unified survey on PLS for VLC from information theoretic and signal processing point of views is still missing. This paper covers almost all aspects of PLS for VLC, including different channel models, input distributions, network configurations, precoding/signaling strategies, and secrecy capacity and information rates. Furthermore, we propose a number of timely and open research directions for PLS-VLC systems, including the application of measurement-based indoor and outdoor channel models, incorporating user mobility and device orientation into the channel model, and combining VLC and RF systems to realize the potential of such technologies.
- Published
- 2020
24. A Low-Complexity Framework for Joint User Pairing and Power Control for Cooperative NOMA in 5G and Beyond Cellular Networks
- Author
-
Chadi Assi, Phuc Huu, Ali Ghrayeb, Mohamed Amine Arfaoui, and Sanaa Sharafeddine
- Subjects
Signal Processing (eess.SP) ,FOS: Computer and information sciences ,Mathematical optimization ,Optimization problem ,Computer science ,Information Theory (cs.IT) ,Computer Science - Information Theory ,020302 automobile design & engineering ,020206 networking & telecommunications ,02 engineering and technology ,Communications system ,Base station ,0203 mechanical engineering ,Single antenna interference cancellation ,Hungarian algorithm ,Pairing ,Telecommunications link ,0202 electrical engineering, electronic engineering, information engineering ,Cellular network ,FOS: Electrical engineering, electronic engineering, information engineering ,Electrical and Electronic Engineering ,Electrical Engineering and Systems Science - Signal Processing ,Computer Science::Information Theory ,Communication channel ,Power control - Abstract
This paper investigates the performance of cooperative non-orthogonal multiple access (C-NOMA) in a cellular downlink system. The system model consists of a base station (BS) serving multiple users, where users with good channel quality can assist the transmissions between the BS and users with poor channel quality through either half-duplex (HD) or full-duplex (FD) device-to-device (D2D) communications. We formulate and solve a novel optimization problem that jointly determines the optimal D2D user pairing and the optimal power control scheme, where the objective is maximizing the achievable sum rate of the whole system while guaranteeing a certain quality of service (QoS) for all users. The formulated problem is a mixed-integer non-linear program (MINLP) which is generally NPhard. To overcome this issue, we reconstruct the original problem into a bi-level optimization problem that can be decomposed into two sub-problems to be solved independently. The outer problem is a linear assignment problem which can be efficiently handled by the well-known Hungarian method. The inner problem is still a non-convex optimization problem for which finding the optimal solution is challenging. However, we derive the optimal power control policies for both the HD and the FD schemes in closedform expressions, which makes the computational complexity of the inner problems polynomial for every possible pairing configurations. These findings solve ultimately the original MILNP in a timely manner that makes it suitable for real-time and low latency applications. Our simulation results show that the proposed framework outperforms a variety of proposed schemes in the literature and that it can obtain the optimal pairing and power control policies for a network with 100 users in a negligible computational time.
- Published
- 2020
25. A Downlink Puncturing Scheme for Simultaneous Transmission of URLLC and eMBB Traffic by Exploiting Data Similarity
- Author
-
Chadi Assi, Ali Ghrayeb, Mohaned Chraiti, Mohamed Hamood, Amira Alloum, and Amine Arfaoui
- Subjects
Scheme (programming language) ,Signal Processing (eess.SP) ,Computer Networks and Communications ,Computer science ,Aerospace Engineering ,Puncturing ,Similarity (network science) ,Transmission (telecommunications) ,Automotive Engineering ,Telecommunications link ,FOS: Electrical engineering, electronic engineering, information engineering ,Electrical Engineering and Systems Science - Signal Processing ,Electrical and Electronic Engineering ,computer ,Algorithm ,computer.programming_language - Abstract
Ultra Reliable and Low Latency Communications (URLLC) is deemed to be an essential service in 5G systems and beyond to accommodate a wide range of emerging applications with stringent latency and reliability requirements. Coexistence of URLLC alongside other service categories calls for developing spectrally efficient multiplexing techniques. Specifically, coupling URLLC and conventional enhanced Mobile BroadBand (eMBB) through superposition/puncturing naturally arises as a promising option due to the tolerance of the latter in terms of latency and reliability. The idea here is to transmit URLLC packets over resources occupied by ongoing eMBB transmissions while minimizing the impact on the eMBB transmissions. In this paper, we propose a novel downlink URLLC-eMBB multiplexing technique that exploits possible similarities among URLLC and eMBB symbols, with the objective of reducing the size of the punctured eMBB symbols. We propose that the base station scans the eMBB traffic' symbol sequences and punctures those that have the highest symbol similarity with that of the URLLC users to be served. As the eMBB and URLLC may use different constellation sizes, we introduce the concept of symbol region similarity to accommodate the different constellations. We assess the performance of the proposed scheme analytically, where we derive closed-form expressions for the symbol error rate (SER) of the eMBB and URLLC services. {We also derive an expression for the eMBB loss function due to puncturing in terms of the eMBB SER}. We demonstrate through numerical and simulation results the efficacy of the proposed scheme where we show that 1) the eMBB spectral efficiency is improved by puncturing fewer symbols, 2) the SER and reliability performance of eMBB are improved, and 3) the URLLC data is accommodated within the specified delay constraint while maintaining its reliability.
- Published
- 2020
- Full Text
- View/download PDF
26. Invoking Deep Learning for Joint Estimation of Indoor LiFi User Position and Orientation
- Author
-
Harald Haas, Ali Ghrayeb, Majid Safari, Chadi Assi, Iman Tavakkolnia, Mohamed Amine Arfaoui, and Mohammad Dehghani Soltani
- Subjects
Signal Processing (eess.SP) ,Computer Networks and Communications ,Computer science ,TK ,02 engineering and technology ,01 natural sciences ,Convolutional neural network ,010309 optics ,position estimation ,020210 optoelectronics & photonics ,0103 physical sciences ,0202 electrical engineering, electronic engineering, information engineering ,FOS: Electrical engineering, electronic engineering, information engineering ,Wireless ,Electrical and Electronic Engineering ,Electrical Engineering and Systems Science - Signal Processing ,visible light ,Artificial neural network ,Artificial neural networks ,business.industry ,Deep learning ,deep learning ,orientation estimation ,Multilayer perceptron ,Bit error rate ,Optical wireless ,Artificial intelligence ,business ,Algorithm ,Communication channel ,LiFi - Abstract
Light-fidelity (LiFi) is a fully-networked bidirectional optical wireless communication (OWC) technology that is considered as a promising solution for high-speed indoor connectivity. In this paper, the joint estimation of user 3D position and user equipment (UE) orientation in indoor LiFi systems with unknown emission power is investigated. Existing solutions for this problem assume either ideal LiFi system settings or perfect knowledge of the UE states, rendering them unsuitable for realistic LiFi systems. In addition, these solutions consider the non-line-of-sight (NLOS) links of the LiFi channel gain as a source of deterioration for the estimation performance instead of harnessing these components in improving the position and the orientation estimation performance. This is mainly due to the lack of appropriate estimation techniques that can extract the position and orientation information hidden in these components. In this paper, and against the above limitations, the UE is assumed to be connected with at least one access point (AP), i.e., at least one active LiFi link. Fingerprinting is employed as an estimation technique and the received signal-to-noise ratio (SNR) is used as an estimation metric, where both the line-of-sight (LOS) and NLOS components of the LiFi channel are considered. Motivated by the success of deep learning techniques in solving several complex estimation and prediction problems, we employ two deep artificial neural network (ANN) models, one based on the multilayer perceptron (MLP) and the second on the convolutional neural network (CNN), that can map efficiently the instantaneous received SNR with the user 3D position and the UE orientation. Through numerous examples, we investigate the performance of the proposed schemes in terms of the average estimation error, precision, computational time, and the bit error rate. We also compare this performance to that of the k-nearest neighbours (KNN) scheme, which is widely used in solving wireless localization problems. It is demonstrated that the proposed schemes achieve significant gains and are superior to the KNN scheme.
- Published
- 2020
- Full Text
- View/download PDF
27. Self-Energized UAV-Assisted scheme for cooperative wireless relay networks
- Author
-
Dushantha Nalin K. Jayakody, Ali Ghrayeb, Tharindu D. Ponnimbaduge Perera, and Mazen O. Hasna
- Subjects
Decode-and-forward protocols ,Computer Networks and Communications ,Energy management ,Computer science ,Real-time computing ,Cooperative relay communications ,Aerospace Engineering ,Throughput ,Unmanned aerial vehicles (UAV) ,law.invention ,Base station ,RF energy harvesting ,Relay ,law ,Inductive power transmission ,Wireless ,Maximum power transfer theorem ,Information transmission ,Wireless power transfer ,Electrical and Electronic Engineering ,Radio transmission ,RF wireless ,Cooperative communication ,Information and power transfers ,business.industry ,Energy harvesting ,Node (networking) ,Wireless power transfer (WPT) ,Finite difference method ,Transmission (telecommunications) ,Single antenna interference cancellation ,Mobile telecommunication systems ,Energy transfer ,Automotive Engineering ,Antennas ,business ,End-to-end outage probabilities - Abstract
Unmanned aerial vehicles (UAVs) have recently been envisaged as an enabling technology of 5G. UAVs act as an intermediate relay node to facilitate uninterrupted, high quality communication between information sources and their destination. However, UAV energy management has been a major issue of consideration due to limited power supply, affecting flight duration. Thus, we introduce in this paper a unified energy management framework by resorting to wireless power transfer (WPT), simultaneous wireless information and power transfer (SWIPT) and self-interference (SI) energy harvesting (EH) schemes, in cooperative relay communications. In our new technique, UAVs are deployed as relays equipped with a decode and forward protocol and EH capability operating in a full-duplex (FD) mode. The UAV assists information transmission between a terrestrial base station and a user. The UAV's transmission capability is powered exclusively by the energy harvested from WPT, radio frequency signal transmitted from the source via time-switching SWIPT protocol and SI exploitation. We improve the overall system throughput by the use of FD based UAV-assisted cooperative system. In this proposed system, we formulate two optimization problems to minimize end-to-end outage probability, subject to UAV's power profile and trajectory for a DF relay scheme, respectively. The KKT conditions have been used to obtain closed-form solutions for the two formulated problems. Numerical simulation results validate all the theoretical results. We demonstrate that the performance of our proposed unified EH scheme outperforms that of existing techniques in the literature. Ministry of Human Resource Development Scopus
- Published
- 2020
28. Precoding-Aided Spatial Modulation for the Wiretap Channel with Relay Selection and Cooperative Jamming
- Author
-
Zied Bouida, Mazen Omar Hasna, Mohamed Ibnkahla, Harald Haas, Ali Ghrayeb, and Athanasios Stavridis
- Subjects
Article Subject ,Computer Networks and Communications ,Computer science ,Fading channels ,Cooperative jamming ,Jamming ,02 engineering and technology ,lcsh:Technology ,Precoding ,Cooperative networks ,lcsh:Telecommunication ,law.invention ,Communication channels (information theory) ,Spatial modulations ,0203 mechanical engineering ,Secrecy outage probabilities ,Relay ,law ,lcsh:TK5101-6720 ,0202 electrical engineering, electronic engineering, information engineering ,Wire-tap channels ,Physical layer security ,Electrical and Electronic Engineering ,Cooperative communication ,Modulation ,lcsh:T ,business.industry ,Node (networking) ,020302 automobile design & engineering ,020206 networking & telecommunications ,Network layers ,Spatial modulation ,Bit error rate ,Power allocations ,Closed-form expression ,business ,Information Systems ,Computer network ,Communication channel - Abstract
We propose in this paper a physical-layer security (PLS) scheme for dual-hop cooperative networks in an effort to enhance the communications secrecy. The underlying model comprises a transmitting node (Alice), a legitimate node (Bob), and an eavesdropper (Eve). It is assumed that there is no direct link between Alice and Bob, and the communication between them is done through trusted relays over two phases. In the first phase, precoding-aided spatial modulation (PSM) is employed, owing to its low interception probability, while simultaneously transmitting a jamming signal from Bob. In the second phase, the selected relay detects and transmits the intended signal, whereas the remaining relays transmit the jamming signal received from Bob. We analyze the performance of the proposed scheme in terms of the ergodic secrecy capacity (ESC), the secrecy outage probability (SOP), and the bit error rate (BER) at Bob and Eve. We obtain closed-form expressions for the ESC and SOP and we derive very tight upper-bounds for the BER. We also optimize the performance with respect to the power allocation among the participating relays in the second phase. We provide examples with numerical and simulation results through which we demonstrate the effectiveness of the proposed scheme. Qatar Foundation; Qatar National Research Fund Scopus
- Published
- 2018
29. Secrecy Rate Closed-Form Expressions for the SISO VLC Wiretap Channel With Discrete Input Signaling
- Author
-
Mohamed Amine Arfaoui, Chadi Assi, and Ali Ghrayeb
- Subjects
Computer science ,Entropy (statistical thermodynamics) ,010401 analytical chemistry ,020206 networking & telecommunications ,Probability density function ,02 engineering and technology ,Topology ,01 natural sciences ,0104 chemical sciences ,Computer Science Applications ,Entropy (classical thermodynamics) ,Capacity planning ,Modeling and Simulation ,Secrecy ,0202 electrical engineering, electronic engineering, information engineering ,Entropy (information theory) ,Probability distribution ,Electrical and Electronic Engineering ,Entropy (energy dispersal) ,Entropy (arrow of time) ,Computer Science::Cryptography and Security ,Computer Science::Information Theory ,Communication channel ,Entropy (order and disorder) - Abstract
We study in this letter the secrecy performance of a degraded single-input single-output visible-light communication wiretap channel. It has been shown in the literature that the secrecy capacity-achieving input distribution for this system is discrete with a finite support set. However, neither the secrecy capacity nor its achieving distribution has been derived in closed-form. In this letter, we derive in closed-form the achievable secrecy rate as a function of the discrete input distribution. We propose a class of discrete input distributions in an effort to enhance the achievable secrecy rate and approach the secrecy capacity. We also derive expressions for the achievable secrecy rate for different scenarios including the one in which the locations of the terminals are randomly located. We provide several examples that demonstrate the accuracy of the derived expressions and show the substantial secrecy rate improvements provided by the proposed scheme over existing ones.
- Published
- 2018
30. Achieving Full Secure Degrees-of-Freedom for the MISO Wiretap Channel With an Unknown Eavesdropper
- Author
-
Mohaned Chraiti, Ali Ghrayeb, and Chadi Assi
- Subjects
Computer science ,0211 other engineering and technologies ,050801 communication & media studies ,02 engineering and technology ,Topology ,Precoding ,Channel capacity ,0508 media and communications ,Secrecy ,0202 electrical engineering, electronic engineering, information engineering ,Wireless ,Electrical and Electronic Engineering ,Computer Science::Cryptography and Security ,Computer Science::Information Theory ,021110 strategic, defence & security studies ,business.industry ,Applied Mathematics ,05 social sciences ,Transmitter ,020206 networking & telecommunications ,Mutual information ,Quantum Physics ,Computer Science Applications ,Channel state information ,Artificial noise ,business ,Telecommunications ,Coding (social sciences) ,Communication channel - Abstract
In this paper, we study the achievable secure degrees-of-freedom (sdof) for the multiple-input single-output (MISO) wiretap channel with an unknown eavesdropper. It is assumed that the eavesdropper’s (Eve’s) channel state information (CSI) is unknown to the transmitter (Alice) and legitimate receiver (Bob). Recent studies have shown that the achievable sdof in the sense of strong secrecy is zero when Eve’s number of antennas is equal to or more than Bob’s number of antennas, which is the scenario considered in this paper. To this end, we propose a novel precoding technique and a coding strategy that together achieve full sdof in the sense of strong secrecy without knowing Eve’s CSI and without using artificial noise. The proposed precoding method uses the CSI of the Alice-Bob channel in a nonlinear fashion, which makes the transmitted symbols undecodable at Eve. The proposed coding scheme is based on the channel resolvability concept and ensures strong secrecy. Achieving full sdof with an unknown Eve’s CSI is significant, because it is contrary to what is believed about the achievable sdof for the MISO wiretap channel in the sense of strong secrecy. We also show that the proposed scheme achieves near Alice-Bob’s channel capacity in the sense of strong secrecy with a probability approaching one at finite signal-to-noise ratio.
- Published
- 2017
31. Maximum Likelihood Time Delay Estimation From Single- and Multi-Carrier DSSS Multipath MIMO Transmissions for Future 5G Networks
- Author
-
Faouzi Bellili, Ahmed Masmoudi, Ali Ghrayeb, and Sofiene Affes
- Subjects
Computer science ,Applied Mathematics ,Maximum likelihood ,MIMO ,020206 networking & telecommunications ,020302 automobile design & engineering ,02 engineering and technology ,Direct-sequence spread spectrum ,Multiplexing ,Upper and lower bounds ,Computer Science Applications ,Spread spectrum ,0203 mechanical engineering ,Statistics ,Expectation–maximization algorithm ,0202 electrical engineering, electronic engineering, information engineering ,Electrical and Electronic Engineering ,Likelihood function ,Algorithm ,Cramér–Rao bound ,Multipath propagation ,Communication channel - Abstract
In this paper, we address the problem of time delay estimation (TDE) from single-carrier (SC) or multi-carrier (MC) direct-sequence spread spectrum (DSSS) multipath transmissions in the presence of multiple transmit and/or receive antennas that will characterize future 5G radio interface technologies (RITs), such as coded-domain nonorthogonal multiple access. We derive for the first time a closed-form expression for the Cramer-Rao lower bound (CRLB) and develop two maximum likelihood (ML) multipath TDEs for SC DSSS single-input multiple-output (SIMO) in the non-data-aided (NDA) case. The first TDE, based on iterative expectation maximization (EM), provides accurate estimates whenever a good initial guess of the parameters is available at the receiver. The second TDE implements the ML criterion in a non-iterative way and finds the global maximum of the compressed likelihood function using the importance sampling (IS) technique without requiring any initialization. We also extend both the SC DSSS SIMO CRLB and the two new SC DSSS SIMO ML NDA TDEs to MC DSSS RITs and to multiple-input multiple-output structures with any diversity versus multiplexing pre-coding type before generalizing them all to the data-aided (DA) case. Simulations suggest that the EM TDE is suitable for large observation in space, time, and/or frequency, whereas the IS TDE is preferred in the opposite case of very short data records. Moreover, we show in the NDA case, both analytically and by simulations, that spatial (transmit and receive), temporal, and frequency samples interchangeably have the same impact on estimation accuracy and performance bound regardless of the channel correlation type and amount present in each dimension. Furthermore, we are able to properly cope with such channel correlations that do indeed arise in practice and, hence, become very challenging both in estimation and CRLB derivation in the DA case, but that have been so far overlooked in previous works.
- Published
- 2017
32. A Minorization–Maximization Algorithm for Maximizing the Secrecy Rate of the MIMOME Wiretap Channel
- Author
-
Mudassir Masood, Issa Khalil, Mazen O. Hasna, Prabhu Babu, and Ali Ghrayeb
- Subjects
Beamforming ,secrecy rate maximization ,Optimization problem ,minorization-maximization ,Computer science ,Transmitter ,physical layer security ,Physical layer ,020302 automobile design & engineering ,020206 networking & telecommunications ,Jamming ,Data_CODINGANDINFORMATIONTHEORY ,02 engineering and technology ,Computer Science Applications ,0203 mechanical engineering ,Modeling and Simulation ,0202 electrical engineering, electronic engineering, information engineering ,Benchmark (computing) ,Artificial noise ,MIMOME ,Electrical and Electronic Engineering ,Algorithm ,Computer Science::Cryptography and Security ,Computer Science::Information Theory ,Communication channel - Abstract
We consider physical layer security in a multi-input multi-output multi-eavesdropper wiretap channel and present an exact solution to the problem of secrecy rate maximization. A system model with multiple multi-antenna eavesdroppers and multiple multi-antenna full-duplex receivers is considered, which is general enough such that models existing in the literature may be considered as special cases. In particular, we perform joint beamforming and artificial noise optimization in an effort to maximize the achievable secrecy rate. The optimization is performed in the presence of artificial noise generated by both transmitter and legitimate receivers. The resulting optimization problem is non-convex and difficult to solve. We develop a minorization-maximization algorithm to solve the problem exactly and the results can therefore be used to benchmark existing methods. Numerical results are presented to demonstrate the efficacy of the proposed approach. This work was made possible by NPRP grant NPRP 8-052-2-029 from the Qatar National Research Fund (a member of Qatar Foundation). Scopus
- Published
- 2017
33. Bidirectional Optical Spatial Modulation for Mobile Users: Toward a Practical Design for LiFi Systems
- Author
-
Harald Haas, Ali Ghrayeb, Majid Safari, Mohamed Amine Arfaoui, Iman Tavakkolnia, Chadi Assi, Mazen O. Hasna, and Mohammad Dehghani Soltani
- Subjects
Signal Processing (eess.SP) ,Mobility model ,Computer Networks and Communications ,Computer science ,Transmitter ,020206 networking & telecommunications ,02 engineering and technology ,Spectral efficiency ,Spatial modulation ,mobility ,Spatial multiplexing ,blockage ,optical wireless communication (OWC) ,spatial modulation (SM) ,random orientation ,User equipment ,FOS: Electrical engineering, electronic engineering, information engineering ,0202 electrical engineering, electronic engineering, information engineering ,Benchmark (computing) ,Electronic engineering ,Cellular network ,Light fidelity (LiFi) ,Electrical and Electronic Engineering ,Electrical Engineering and Systems Science - Signal Processing ,Efficient energy use - Abstract
Among the challenges of realizing the full potential of light-fidelity (LiFi) cellular networks are user mobility, random device orientation and blockage. We study the impact of those challenges on the performance of LiFi in an indoor environment using measurement-based channel models. We adopt spatial modulation (SM), which has been shown to be energy efficient in many applications, including LiFi. We consider two configurations for placing the photodiodes (PDs) on the user equipment (UE). The first one is referred to as the screen receiver (SR) whereby all the PDs are located on one face of the UE, whereas the other one is a multi-directional receiver (MDR), in which the PDs are located on different sides of the UE. The latter configuration was motivated by the fact that SR exhibited poor performance in the presence of random device orientation and blockage. We show that MDR outperforms SR by over $10$ dB at BER of $3.8\times10^{-3}$. Moreover, an adaptive access point (AP) selection scheme for SM is considered where the number of APs are chosen adaptively in an effort to achieve the lowest energy requirement for a target BER and spectral efficiency. The user performance with random orientation and blockage in the whole room is evaluated for sitting and walking activities. For the latter, we invoke the orientation-based random waypoint (ORWP) mobility model. We also study the performance of the underlying system on the uplink channel where the same techniques are used for the downlink channel. Specifically, as the transmitted uplink power is constrained, the energy efficiency of SM is evaluated analytically. It is shown that the multi-directional transmitter (MDT) with adaptive SM is highly energy efficient. As a benchmark, we compare the performance of the proposed framework to that of the conventional spatial multiplexing system, and demonstrate the superiority of the proposed one., 30 pages, 14 figures, Journal paper
- Published
- 2019
34. Reconfigurable Antenna-Based Space-Shift Keying for Spectrum Sharing Systems Under Rician Fading
- Author
-
Khalid A. Qaraqe, Hassan El-Sallabi, Ali Ghrayeb, Mohamed Abdallah, and Zied Bouida
- Subjects
Reconfigurable antenna ,020302 automobile design & engineering ,020206 networking & telecommunications ,Context (language use) ,Keying ,02 engineering and technology ,law.invention ,0203 mechanical engineering ,Transmission (telecommunications) ,law ,Rician fading ,0202 electrical engineering, electronic engineering, information engineering ,Bit error rate ,Electronic engineering ,Electrical and Electronic Engineering ,Antenna (radio) ,Throughput (business) ,Mathematics - Abstract
Based on the concept of reconfigurable antennas (RAs), space-shift keying (SSK)-RA has been recently proposed as a novel transmission scheme to improve the performance of SSK. In this context, it has been shown that RAs’ reconfigurable properties can be used as additional degrees of freedom to enhance the throughput, implementation complexity, and error performance of SSK. In this paper, we study the implementation of SSK-RA within underlay cognitive radio systems in an effort to improve the performance of the secondary user while verifying the constraints set by the primary user (PU). Taking advantage of the interplay between RAs and the propagation channels for both the secondary and interference links, we propose an RA-based scheme with beam-direction reconfiguration aiming at improving the secondary system’s performance while verifying an outage interference constraint to the PU. In this paper, we analyze the performance of the proposed scheme in Rician fading channels and provide simulation examples confirming these analytical results. The proposed schemes are shown to offer enhanced bit error rate performance and lower implementation complexity when compared with conventional antenna-based spectrum sharing systems.
- Published
- 2016
35. Using Resampling to Combat Doppler Scaling in UWA Channels With Single-Carrier Modulation and Frequency-Domain Equalization
- Author
-
Ali Ghrayeb and Saed Daoud
- Subjects
010505 oceanography ,Computer Networks and Communications ,Orthogonal frequency-division multiplexing ,Equalization (audio) ,Aerospace Engineering ,020206 networking & telecommunications ,02 engineering and technology ,Interference (wave propagation) ,01 natural sciences ,Multiplexing ,Intersymbol interference ,symbols.namesake ,Frequency domain ,Resampling ,Automotive Engineering ,0202 electrical engineering, electronic engineering, information engineering ,symbols ,Electronic engineering ,Electrical and Electronic Engineering ,Doppler effect ,Algorithm ,0105 earth and related environmental sciences ,Mathematics - Abstract
In this paper, we study the performance of single carrier (SC) modulation with frequency-domain equalization (FDE) over underwater acoustic (UWA) channels. The underlying channels are time-varying intersymbol interference (ISI) channels, where time variation arises from the relative motion between the transceivers, which induces one or more Doppler scaling factors. We study two scenarios: a point-to-point (P2P) system, where each cluster of paths has its own distinct Doppler scaling factor, and a multiple access (MAC) system, where $M$ users communicate with a multiple-antenna common receiver in which each user has its own Doppler scaling factor. First, the maximum likelihood (ML) receiver is derived for both scenarios, and it is shown that a preprocessing stage is necessary to reduce the time variation; this is referred to as multiple resampling (MR). The proposed receiver consists of multiple branches where each branch corresponds to a cluster/user and performs frequency shifting and resampling followed by an integrator. Since the output of the MR stage is contaminated by ISI for P2P systems and ISI and interuser interference for MAC systems, an additional equalization stage is necessary, which is ideally the ML sequence detector (MLSD). Since the complexity of MLSD exponentially grows with the number of symbols per block, the alphabet size, and the number of users, a linear minimum-mean-square-error FDE equalizer is used instead. To further reduce the complexity, instead of resampling the received signal multiple times by different scaling factors, it is resampled only by one scaling factor, which is a function of all Doppler scaling factors. The resulting suboptimal preprocessing scheme is called single resampling (SR). Simulation results for uncoded systems show that MR outperforms its SR counterpart at the expense of some additional hardware complexity. Moreover, it is shown that SC-FDE is more resilient than orthogonal frequency-division multiplexing (OFDM) to the Doppler scaling effect in UWA channels at lower overall complexity for the MR case, whereas both have the same overall complexity for the SR case.
- Published
- 2016
36. On the Achievable Secrecy Diversity of Cooperative Networks with Untrusted Relays
- Author
-
Chadi Assi, Mazen O. Hasna, Mohaned Chraiti, and Ali Ghrayeb
- Subjects
FOS: Computer and information sciences ,Interference alignment ,Engineering ,Computer Science - Cryptography and Security ,Reliability (computer networking) ,Computer Science - Information Theory ,Jamming ,02 engineering and technology ,Data_CODINGANDINFORMATIONTHEORY ,Computer security ,computer.software_genre ,Cooperative networks ,Untrusted relays ,0203 mechanical engineering ,Secure communication ,Alice and Bob ,secrecy diversity ,Secrecy ,0202 electrical engineering, electronic engineering, information engineering ,Cooperative relaying ,Electrical and Electronic Engineering ,Achievable secrecy rates ,Cooperative communication ,business.industry ,Information Theory (cs.IT) ,Antenna transmitters ,Transmitter ,020206 networking & telecommunications ,020302 automobile design & engineering ,Cooperative diversity ,Artificial noise ,Antennas ,Numerical methods ,business ,Communication reliabilities ,computer ,Cryptography and Security (cs.CR) ,Computer network - Abstract
Cooperative relaying is often deployed to enhance the communication reliability (i.e., diversity order) and consequently the end-to-end achievable rate. However, this raises several security concerns when the relays are untrusted, since they may have access to the relayed message. In this paper, we study the achievable secrecy diversity order of cooperative networks with untrusted relays. In particular, we consider a network with an N -antenna transmitter (Alice), K single-antenna relays, and a single-antenna destination (Bob). We consider the general scenario, where there is no relation between N and K , and therefore, K can be larger than N. Alice and Bob are assumed to be far away from each other, and all communication is done through the relays, i.e., there is no direct link. Providing secure communication while enhancing the diversity order has been shown to be very challenging. In fact, it has been shown in the literature that the maximum achievable secrecy diversity order for the adopted system model is one (while using artificial noise jamming). In this paper, we adopt a nonlinear interference alignment scheme that we have proposed recently to transmit the signals from Alice to Bob. We analyze the proposed scheme in terms of the achievable secrecy rate and secrecy diversity order. Assuming Gaussian inputs, we derive an explicit expression for the achievable secrecy rate and show analytically that a secrecy diversity order of up to \min (N,K)-1 can be achieved using the proposed technique. We provide several numerical examples to validate the obtained analytical results and demonstrate the superiority of the proposed technique to its counterparts that exist in the literature. Qatar Foundation;Qatar National Research Fund;Natural Sciences and Engineering Research Council of Canada;Concordia University Scopus
- Published
- 2018
37. Distributed Beamforming for Two-Way DF Relay Cognitive Networks Under Primary–Secondary Mutual Interference
- Author
-
Ali Afana, Sofiene Affes, Ali Ghrayeb, and Vahid Asghari
- Subjects
Beamforming ,Engineering ,WSDMA ,Computer Networks and Communications ,business.industry ,Aerospace Engineering ,Interference (wave propagation) ,law.invention ,Cognitive radio ,Relay ,law ,Linear network coding ,Automotive Engineering ,Bit error rate ,Electronic engineering ,Electrical and Electronic Engineering ,business ,Rayleigh fading - Abstract
In this paper, we consider collaborative beamforming for a cooperative two-way relay spectrum-sharing system where a pair of secondary transceivers communicates via a set of secondary decode-and-forward (DF) relays in the presence of multiple primary transceivers. Among the available relays, only those that receive the signals reliably participate in the cooperative beamforming process and use network coding to simultaneously transmit the weighted signals to the transceivers. Two practical two-way relaying strategies are investigated, namely, DF- xor ing and DF-superposition. The former is based on bitwise-level xor ing of the detected signals at the relays, whereas the latter is based on symbolwise-level addition at the relays. For each relaying strategy, we derive general optimal beamforming vectors at the relays to keep the interference inflicted on the primary receivers to a predefined threshold. Employing zero-forcing beamforming as a special case, we present an analytical framework of the performance of the secondary system considering the effect of the primary–secondary mutual cochannel interference (CCI). In particular, we derive closed-form expressions for the outage probability, bit error rate (BER), and achievable sum rates over independent and identically distributed Rayleigh fading channels. Numerical results demonstrate the effectiveness of beamforming in compensating for the cognitive system performance loss due to CCI in addition to mitigating the interference to the primary receivers. Simulation results also show that, when the received signals at the relays are equally weighted, DF- xor always outperforms both DF-superposition and amplify-and-forward (AF) relaying.
- Published
- 2015
38. Adaptive Spatial Modulation for Spectrum Sharing Systems With Limited Feedback
- Author
-
Ali Ghrayeb, Khalid A. Qaraqe, and Zied Bouida
- Subjects
Computer science ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,Transmitter ,Link adaptation ,Spectral efficiency ,Transmitter power output ,Interference (wave propagation) ,Spatial modulation ,Cognitive radio ,Channel state information ,Modulation ,Electronic engineering ,Bit error rate ,Electrical and Electronic Engineering ,Computer Science::Information Theory - Abstract
We have recently introduced adaptive spatial modulation (ASM) for multiple antenna systems, with the aim of improving the energy efficiency through spatial modulation (SM) and improving the average spectral efficiency (ASE) through adaptive modulation (AM). In this paper, we extend ASM to cognitive radio (CR) systems in an effort to improve the secondary system's performance in terms of energy efficiency and ASE. To this end, we propose two ASM schemes, one referred to as fixed power scheme (FPS) and the other as adaptive power scheme (APS). In both schemes, the secondary transmitter (ST) has limited knowledge of the channel state information (CSI) of the interference link. The difference between the two schemes, however, lies in the way the limited CSI is used to adapt the transmit power and/or modulation. As a benchmark, we also consider the scenario where the ST has perfect knowledge of the CSI of the interference link. For all cases, we analyze the performance in terms of ASE, average delay, and bit error rate (BER). We show that the proposed schemes offer tradeoffs in terms of the previously mentioned performance metrics, thus offering different options for applying ASM to CR systems. We also provide several simulation examples through which we corroborate the analytical results.
- Published
- 2015
39. A Framework for Evaluating the Best Achievable Performance by Distributed Lifetime-Efficient Routing Schemes in Wireless Sensor Networks
- Author
-
Jalal Habibi, Ali Ghrayeb, and Amir G. Aghdam
- Subjects
Mathematical optimization ,Dynamic Source Routing ,Linear programming ,Computer science ,Applied Mathematics ,Distributed computing ,020208 electrical & electronic engineering ,Wireless Routing Protocol ,020206 networking & telecommunications ,02 engineering and technology ,Energy consumption ,Network topology ,Computer Science Applications ,Energy conservation ,Key distribution in wireless sensor networks ,Computer Science::Networking and Internet Architecture ,0202 electrical engineering, electronic engineering, information engineering ,Electrical and Electronic Engineering ,Routing (electronic design automation) ,Wireless sensor network ,Efficient energy use - Abstract
This paper is concerned with energy-efficient routing in wireless sensor networks. Most of the existing routing schemes assign energy-related costs to network links and obtain the shortest paths for the nodes to balance the flowing traffic within the network and increase its lifetime. However, the optimal link cost values and the maximum achievable lifetime are not known for the majority of the existing schemes. A framework is provided in this work to analytically derive the best achievable performance that can be obtained by any distributed routing algorithm based on the shortest-path approach. Given a network configuration and an energy consumption model, the presented framework provides the optimal link cost assignment which yields the maximum lifetime in a distributed shortest-path routing strategy. The results are extended to the case of variable link cost assignment as well. A heuristic algorithm is also developed to obtain approximate solutions to the best performance problem with limited computational complexity. In particular, the proposed framework provides the optimal route selection as a benchmark to evaluate the energy efficiency of existing routing algorithms.
- Published
- 2015
40. Adaptive Transmission Schemes for MISO Spectrum Sharing Systems: Tradeoffs and Performance Analysis
- Author
-
Khalid A. Qaraqe, Ali Ghrayeb, Zied Bouida, and Mohamed-Slim Alouini
- Subjects
Eb/N0 ,Transmission (telecommunications) ,Maximum ratio transmission ,Control theory ,Applied Mathematics ,Electronic engineering ,Link adaptation ,Electrical and Electronic Engineering ,Spectrum sharing ,Computer Science Applications ,Mathematics - Published
- 2014
41. Distributed Beamforming for Spectrum-Sharing Systems With AF Cooperative Two-Way Relaying
- Author
-
Vahid Asghari, Ali Ghrayeb, Ali Afana, and Sofiene Affes
- Subjects
Independent and identically distributed random variables ,Beamforming ,Engineering ,business.industry ,Cumulative distribution function ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,Data_CODINGANDINFORMATIONTHEORY ,Spectral efficiency ,Moment-generating function ,Cognitive radio ,Transmission (telecommunications) ,Electronic engineering ,Electrical and Electronic Engineering ,business ,Rayleigh fading - Abstract
We consider in this paper distributed beamforming for two-way cognitive radio networks in an effort to improve the spectrum efficiency and enhance the performance of the cognitive (secondary) system. In particular, we consider a spectrum sharing system where a set of amplify-and-forward (AF) relays are employed to help a pair of secondary transceivers in the presence of multiple licensed (primary) users. The set of relays participate in the beamforming process, where the optimal beamformer weights are obtained via a linear optimization method. For this system, we investigate the transmission protocols over two and three time-slots. To study and compare the performance tradeoffs between the two transmission protocols, for both of them, we derive closed-form expressions for the cumulative distribution function (CDF) and the moment generating function (MGF) of the equivalent end-to-end signal-to-noise ratio (SNR) at the secondary receiver. We analyze the performance of the proposed methods where closed-form expressions for the user outage probability and the average error probability are derived for independent and identically distributed Rayleigh fading channels. Numerical results demonstrate the efficacy of beamforming in enhancing the secondary system performance in addition to mitigating the interference to the primary users. In addition, our results show that the three time-slot protocol outperforms the two time-slot protocol in certain scenarios where it offers a good compromise between bandwidth efficiency and system performance.
- Published
- 2014
42. Distributed Channel Coding for Underwater Acoustic Cooperative Networks
- Author
-
Ali Ghrayeb and Amir Minayi Jalil
- Subjects
Block code ,Engineering ,business.industry ,Concatenated error correction code ,Data_CODINGANDINFORMATIONTHEORY ,Linear code ,Computer engineering ,Channel state information ,Convolutional code ,Electronic engineering ,Fading ,Forward error correction ,Electrical and Electronic Engineering ,business ,Decoding methods ,Computer Science::Information Theory - Abstract
Multiuser cooperative schemes usually rely on relay selection or channel selection to avoid deep fading and achieve diversity while maintaining acceptable spectral efficiency. In some applications such as underwater acoustic communications, the low speed of the acoustic wave results in a very long delay between the channel state information (CSI) measurement time and the relay assignment time, which leads to a severely outdated CSI. To remedy this, we propose distributed coding schemes that aim at achieving good diversity-multiplexing trade-off (DMT) for multiuser scenarios where CSI is not available for resource allocation. We consider a network with multiple source nodes, multiple relay nodes, and a single destination. We first introduce a distributed linear block coding scheme, including Reed-Solomon codes, where each relay implements a column of the generator matrix of the code, and soft decision decoding is employed to retrieve the information at the destination side. We derive the end-to-end error performance of this scheme and show that the achievable diversity equals the minimum Hamming distance of the underlying code, while its DMT outperforms that of existing schemes. We extend the proposed scheme to distributed convolutional codes, and show that achieving higher diversity orders is also possible.
- Published
- 2014
43. On the Performance of Cooperative Relaying Spectrum-Sharing Systems with Collaborative Distributed Beamforming
- Author
-
Vahid Asghari, Ali Ghrayeb, Sofiene Affes, and Ali Afana
- Subjects
Beamforming ,WSDMA ,Engineering ,business.industry ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,Data_CODINGANDINFORMATIONTHEORY ,Moment-generating function ,Cooperative diversity ,law.invention ,Cognitive radio ,Relay ,law ,Computer Science::Networking and Internet Architecture ,Electronic engineering ,Electrical and Electronic Engineering ,business ,Algorithm ,Quadrature amplitude modulation ,Computer Science::Information Theory ,Rayleigh fading - Abstract
In this paper, we use joint distributed beamforming and cooperative relaying in cognitive radio relay networks in an effort to enhance the spectrum efficiency and improve the performance of the cognitive (secondary) system. In particular, we consider a spectrum sharing system where a set of potential relays are employed to help a pair of secondary users in the presence of a licensed (primary) user. Among the available relays, only the reliable ones participate in the beamforming process, where the beamformer weights are obtained based on a linear optimization method. We investigate two well-known strategies, namely, selection decode-and-forward (SDF) and amplify-and-forward (AF) relaying in conjunction with distributed optimal beamforming. However, given the complexity of the performance analysis with optimal beamforming, we use zero forcing beamforming (ZFB), and compare both approaches through simulations. In this context, for SDF, we derive expressions for the probability density function (PDF) of the received signal-to-interference noise ratio (SINR) at the relays as well as at the secondary destination. As for the AF scheme, we obtain the exact expression for the cumulative distribution function (CDF) and the moment generating function (MGF) of the equivalent end-to-end SNR at the secondary destination. For both schemes, we derive closed-form expressions for the outage probability and bit error rate (BER) over independent and identically distributed Rayleigh fading channels for binary phase shift keying (BPSK) and M-ary quadrature amplitude modulation (M-QAM) schemes. Numerical results demonstrate the efficacy of the proposed scheme in improving the outage and BER performance of the secondary system while limiting the interference to the primary system. In addition, the results show the effectiveness of the combination of the cooperative diversity and distributed beamforming in compensating for the loss in the secondary system's performance due to the primary user's co-channel interference (CCI).
- Published
- 2014
44. Energy-Efficient Cooperative Routing in Wireless Sensor Networks: A Mixed-Integer Optimization Framework and Explicit Solution
- Author
-
Jalal Habibi, Ali Ghrayeb, and Amir G. Aghdam
- Subjects
Engineering ,Mathematical optimization ,Optimization problem ,business.industry ,Cooperative diversity ,law.invention ,Key distribution in wireless sensor networks ,Relay ,law ,Electrical and Electronic Engineering ,business ,Wireless sensor network ,Integer programming ,Efficient energy use ,Data transmission - Abstract
This paper presents an optimization framework for a wireless sensor network whereby, in a given route, the optimal relay selection and power allocation are performed subject to signal-to-noise ratio constraints. The proposed approach determines whether a direct transmission is preferred for a given configuration of nodes, or a cooperative transmission. In the latter case, for each node, data transmission to the destination node is performed in two consecutive phases: broadcasting and relaying. The proposed strategy provides the best set of relays, the optimal broadcasting power and the optimal power values for the cooperative transmission phase. Once the minimum-energy transmission policy is obtained, the optimal routes from every node to a sink node are built-up using cooperative transmission blocks. We also present a low-complexity implementation approach of the proposed framework and provide an explicit solution to the optimization problem at hand by invoking the theory of multi-parametric programming. This technique provides the optimal solution as a function of measurable parameters in an off-line manner, and hence the on-line computational tasks are reduced to finding the parameters and evaluating simple functions. The proposed efficient approach has many potential applications in real-world problems and, to the best of the authors' knowledge, it has not been applied to communication problems before. Simulations are presented to demonstrate the efficacy of the approach.
- Published
- 2013
45. On Hierarchical Network Coding Versus Opportunistic User Selection for Two-Way Relay Channels with Asymmetric Data Rates
- Author
-
Ali Ghrayeb, Mazen O. Hasna, and Xuehua Zhang
- Subjects
Computer science ,Co-operative diversity ,Complex networks ,Throughput ,Electric relays ,Data_CODINGANDINFORMATIONTHEORY ,law.invention ,Communication channels (information theory) ,Network coding ,Hierarchical modulation ,Relay ,law ,Computer Science::Networking and Internet Architecture ,Quadrature amplitude modulation ,Electrical and Electronic Engineering ,Computer Science::Information Theory ,Channel code ,business.industry ,Decode-and-forward relaying ,Relay control systems ,Two-way relay channels ,Modulation ,Linear network coding ,Bit error rate ,Data rates ,business ,Algorithm ,Relay channel ,Communication channel ,Computer network - Abstract
We address in this paper the challenge of coping with asymmetric data rates in two-way relay channels. We consider a relay network comprising two sources and one relay. The sources communicate at different rates through the relay. That is, we assume that one source uses M 1 -QAM (quadrature amplitude modulation) and the other uses M 1 /M 2 -QAM hierarchical modulation where M 1 ≠ M 2 . For the underlying network, we consider two decode-and-forward (DF) relaying schemes. One scheme combines hierarchical zero padding and network coding (HZPNC) at the relay. The novelty of this scheme lies in the way the two signals (that have different lengths) are network-coded at the relay. The other scheme is referred to as opportunistic user selection (OUS) where the user with a better end-to-end channel quality is given priority for transmission. We analyze both schemes where we derive closedform expressions for the end-to-end (E2E) bit error rate (BER). Since the two schemes offer a trade-off between performance and throughput, we analyze and compare both schemes in terms of channel access probability and average throughput. We show that HZPNC offers better throughput and fairness for both users, whereas OUS offers better performance. We also compare the performance of HZPNC with existing schemes including the original zero padding, nesting constellation modulation and superposition modulation. We show through examples the superiority of the proposed HZPNC scheme in terms of performance and/or reduced complexity. Scopus
- Published
- 2013
46. Iterative Compressive Estimation and Decoding for Network-Channel-Coded Two-Way Relay Sparse ISI Channels
- Author
-
Mazen O. Hasna, Sinh Le Hong Nguyen, and Ali Ghrayeb
- Subjects
Training pilots ,Channel network ,Transmitted signal ,Computer science ,Received signals ,Channel estimation ,Data_CODINGANDINFORMATIONTHEORY ,law.invention ,Relay ,law ,Intersymbol interference channels ,Composite channel ,Electrical and Electronic Engineering ,Signal reconstruction ,Computer Science::Information Theory ,Analog network coding ,business.industry ,Intersymbol interference ,Two sources ,Compressive sensing ,Iterative decoding ,Two-way relay channels ,Computer Science Applications ,Two-way relay ,Compressed sensing ,Time slots ,Modeling and Simulation ,Linear network coding ,Relay node ,Bit error rate ,Decoding scheme ,ISI channels ,Underlying systems ,business ,Estimation ,Algorithm ,Relay channel ,Decoding methods ,Computer network ,Communication channel - Abstract
We propose an iterative compressive channel estimation and decoding scheme for network-channel-coded two-way relay sparse intersymbol interference channels. The underlying system model comprises two source nodes and one relay node. In the first time slot, the two sources simultaneously transmit their independent training pilots along with the channel-coded data. In the second time slot, the relay applies analog network coding to the sum of the received signals and broadcasts the result to the two sources. Each source then uses iterative compressive sensing (CS) based estimation and decoding to estimate the composite channels and recover the transmitted signal. We analyze the performance of our proposed CS-based scheme and demonstrate its efficacy over existing ones Qatar Foundation; Qatar National Research Fund Scopus
- Published
- 2012
47. An Adaptive Transmission Scheme for Two-Way Relaying with Asymmetric Data Rates
- Author
-
Ali Ghrayeb, Mazen O. Hasna, and Xuehua Zhang
- Subjects
Computer Networks and Communications ,Computer science ,Cooperative diversity ,Aerospace Engineering ,Throughput ,02 engineering and technology ,Data_CODINGANDINFORMATIONTHEORY ,law.invention ,two-way communication ,0203 mechanical engineering ,Relay ,law ,decode-and-forward (DF) ,0202 electrical engineering, electronic engineering, information engineering ,Computer Science::Networking and Internet Architecture ,Electrical and Electronic Engineering ,Throughput (business) ,Computer Science::Information Theory ,business.industry ,hierarchical network coding ,020206 networking & telecommunications ,020302 automobile design & engineering ,Hierarchical modulation ,Antenna diversity ,Transmission (telecommunications) ,Modulation ,Linear network coding ,Automotive Engineering ,Bit error rate ,network coding (NC) ,opportunistic user selection (OUS) ,business ,Computer network ,Communication channel - Abstract
In this paper, we address the problem of asymmetric data rates in two-way communication systems. In particular, we propose an adaptive transmission scheme that combines network coding (NC) and opportunistic user selection (OUS) with a threshold that determines which transmission mode to use. The underlying system model comprises two source nodes communicating with each other through a relay node. The source nodes are assumed to have different data rate requirements; therefore, they employ different modulation schemes. As per the proposed scheme, if the end-to-end (E2E) signal-to-noise ratio (SNR) of both users are above a specified threshold, both sources transmit over orthogonal channels, and the relay node uses hierarchical modulation and NC to relay the combined signals to both sources in the third time slot. Otherwise, the user with the better E2E SNR transmits, whereas the other user remains silent. The advantage of the proposed scheme is that it compromises between throughput and reliability. That is, when both users transmit, the throughput improves, whereas when the better user transmits, multiuser diversity is achieved. Assuming asymmetric channels, we derive exact closed-form expressions for the E2E bit error rate (BER), access probability, and throughput for this scheme and compare its performance with existing schemes. We also investigate the asymptotic performance of the proposed scheme at high SNRs where we derive the achievable diversity order for both users. We show through analytical and simulation results that the proposed scheme improves the overall system throughput, the fairness between the two users, and the transmission reliability. This all comes while achieving full spatial diversity for both users. Scopus
- Published
- 2016
48. Power Adaptation for Joint Switched Diversity and Adaptive Modulation Schemes in Spectrum Sharing Systems
- Author
-
Khalid A. Qaraqe, Ali Ghrayeb, Zied Bouida, Mohamed-Slim Alouini, and Kamel Tourki
- Subjects
Transmitter ,Link adaptation ,Data_CODINGANDINFORMATIONTHEORY ,Transmitter power output ,Computer Science Applications ,Transmit diversity ,Channel state information ,Control theory ,Modeling and Simulation ,Bit error rate ,Fading ,Electrical and Electronic Engineering ,Computer Science::Information Theory ,Mathematics ,Diversity scheme - Abstract
Under the scenario of an underlay cognitive radio network, we propose in this paper an adaptive scheme using transmit power adaptation, switched transmit diversity, and adaptive modulation in order to improve the performance of existing switching efficient schemes (SES) and bandwidth efficient schemes (BES). Taking advantage of the channel reciprocity principle, we assume that the channel state information (CSI) of the interference link is available to the secondary transmitter. This information is then used by the secondary transmitter to adapt its transmit power, modulation constellation size, and used transmit branch. The goal of this joint adaptation is to minimize the average number of switched branches and the average system delay given the fading channel conditions, the required error rate performance, and a peak interference constraint to the primary receiver. We analyze the proposed scheme in terms of the average number of branch switching, average delay, and we provide a closed-form expression of the average bit error rate (BER). We demonstrate through numerical examples that the proposed scheme provides a compromise between the SES and the BES schemes.
- Published
- 2012
49. Joint Optimal Threshold-Based Relaying and ML Detection in Cooperative Networks
- Author
-
Mazen O. Hasna, Ali Ghrayeb, and Xiang Nian Zeng
- Subjects
Optimization ,Computer science ,threshold-based relaying ,Real-time computing ,ML detectors ,ML detections ,Signaltonoise ratio (SNR) ,Cooperative networks ,law.invention ,Signal-to-noise ratio ,Relay ,law ,Detection methods ,Wireless ,Decode-and-forward ,Electrical and Electronic Engineering ,Computer Science::Information Theory ,Bit error rate (BER) performance ,Half-duplex ,business.industry ,Detector ,Detection scheme ,Detectors ,Maximum-likelihood detection ,Binary phase shift keying ,Computer Science Applications ,Optimal threshold ,Error propagation ,Thresholding ,Modeling and Simulation ,Relay node ,Bit error rate ,Log likelihood ,Node (circuits) ,business ,Algorithm ,Phase-shift keying - Abstract
This paper proposes two detection schemes for cooperative networks comprising a source, a relay and a destination. The relay is assumed to operate in a half-duplex mode and it employs decode-and-forward (DF) relaying. The proposed schemes involve combining threshold-based relaying and maximum likelihood (ML) detection at the destination. We consider both signal-to-noise ratio (SNR)-based and log-likelihood (LLR)-based thresholding. Assuming binary phase shift keying (BPSK), we first derive the ML detector as a function of the threshold used at the relay node. Then, we obtain the optimal thresholds by minimizing the end-to-end bit error rate performance. In deriving the ML performance, we follow an approach that is different from existing approaches and is more straightforward. We compare the performance of the proposed schemes and show that they significantly outperform all existing counterpart detection methods. Qatar Foundation; Qatar National Research Fund Scopus
- Published
- 2012
50. Joint Relay Assignment and Power Allocation for Multicast Cooperative Networks
- Author
-
Ali Ghrayeb, Mohammad Faisal Uddin, and Chadi Assi
- Subjects
Multicast ,Branch and bound ,business.industry ,Computer science ,Distributed computing ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,Computer Science Applications ,law.invention ,Relay ,law ,Modeling and Simulation ,Convex optimization ,Computer Science::Networking and Internet Architecture ,Wireless ,Xcast ,Electrical and Electronic Engineering ,Unicast ,business ,Computer Science::Information Theory - Abstract
We investigate the joint problem of relay selection and optimal sharing of relay power in wireless cellular networks with multicast traffic. We first present a mixed Boolean-convex optimization model and solve this combinatorial problem optimally using branch and bound technique. We then show that obtaining the optimal solution is computationally infeasible for large network sizes and, unlike the case of unicast traffic, a water filling method does not yield near optimal solutions in multicast scenarios. We thus adopt an algorithm based on sequential fixing which substantially reduces the computation time and achieves near optimal solutions.
- Published
- 2012
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.