Searcharxiv⌕ Search

arXiv subjects

Hayssam Dahrouj

Publications and source records attributed to Hayssam Dahrouj.

At least 37 records · Page 2Linked to original sources

Distributed Resource Management in Downlink Cache-Enabled Multi-Cloud Radio Access Networks

In light of the premises of beyond fifth generation (B5G) networks, the need for better exploiting the capabilities of cloud-enabled networks arises, so as to cope with the large-scale interference resulting from the massive increase of data-hungry systems. A compound of several clouds, jointly managing inter-cloud and intra-cloud interference, constitutes a practical solution to account for the requirements of B5G networks. This paper considers a multi-cloud radio access network model (MC-RAN), where each cloud is connected to a distinct set of base stations (BSs) via limited capacity fronthaul links. The BSs are equipped with local cache storage and baseband processing capabilities, as a means to alleviate the fronthaul congestion problem. The paper then investigates the problem of jointly assigning users to clouds and determining their beamforming vectors so as to maximize the network-wide energy efficiency (EE) subject to fronthaul capacity and transmit power constraints. This paper solves such a mixed discrete-continuous, non-convex optimization problem using fractional programming (FP) and successive inner-convex approximation (SICA) techniques to deal with the non-convexity of the continuous part of the problem, and $l_0$-norm approximation to account for the binary association part. A highlight of the proposed algorithm is its capability of being implemented in a distributed fashion across the network's multiple clouds through a reasonable amount of information exchange. The numerical simulations illustrate the pronounced role the proposed algorithm plays in alleviating the interference of large-scale MC-RANs, especially in dense networks.

cs.IT↗

Weight Vector Tuning and Asymptotic Analysis of Binary Linear Classifiers

Unlike its intercept, a linear classifier's weight vector cannot be tuned by a simple grid search. Hence, this paper proposes weight vector tuning of a generic binary linear classifier through the parameterization of a decomposition of the discriminant by a scalar which controls the trade-off between conflicting informative and noisy terms. By varying this parameter, the original weight vector is modified in a meaningful way. Applying this method to a number of linear classifiers under a variety of data dimensionality and sample size settings reveals that the classification performance loss due to non-optimal native hyperparameters can be compensated for by weight vector tuning. This yields computational savings as the proposed tuning method reduces to tuning a scalar compared to tuning the native hyperparameter, which may involve repeated weight vector generation along with its burden of optimization, dimensionality reduction, etc., depending on the classifier. It is also found that weight vector tuning significantly improves the performance of Linear Discriminant Analysis (LDA) under high estimation noise. Proceeding from this second finding, an asymptotic study of the misclassification probability of the parameterized LDA classifier in the growth regime where the data dimensionality and sample size are comparable is conducted. Using random matrix theory, the misclassification probability is shown to converge to a quantity that is a function of the true statistics of the data. Additionally, an estimator of the misclassification probability is derived. Finally, computationally efficient tuning of the parameter using this estimator is demonstrated on real data.

stat.ML↗

Cloud-Enabled High-Altitude Platform Systems: Challenges and Opportunities

Augmenting ground-level communications with flying networks, such as the high-altitude platform system (HAPS), is among the major innovative initiatives of the next generation of wireless systems (6G). Given HAPS quasi-static positioning at the stratosphere, HAPS-to-ground and HAPS-to-air connectivity frameworks are expected to be prolific in terms of data acquisition and computing, especially given the mild weather and quasi-constant wind speed characteristics of the stratospheric layer. This paper explores the opportunities stemming from the realization of cloud-enabled HAPS in the context of telecommunications applications and services. The paper first advocates for the potential physical advantages of deploying HAPS as flying data-centers, also known as super-macro base stations. The paper then describes various cloud services that can be offered from the HAPS and the merits that can be achieved by this integration, such as enhancing the quality, speed, and range of the offered services. The proposed services span a wide range of fields, including satellites, Internet of Things (IoT), ad hoc networks (such as sensor; vehicular; and aerial networks), gaming, and social networks. For each service, the paper illustrates the methods that would be used by cloud providers to offload the service data to the HAPS and enable the cloud customers to consume the service. The paper further sheds light on the challenges that need to be addressed for realizing practical cloud-enabled HAPS, mainly, those related to high energy, processing power, quality of service (QoS), and security considerations. Finally, the paper discusses some open issues on the topic, namely, HAPS mobility and message routing, HAPS security via blockchain and machine learning, artificial intelligence-based resource allocation in cloud-enabled HAPS, and integration with vertical heterogeneous networks.

cs.NI↗

Analysis of Large Scale Aerial Terrestrial Networks with mmWave Backhauling

Service providers are considering the use of unmanned aerial vehicles (UAVs) to enhance wireless connectivity of cellular networks. To provide connectivity, UAVs have to be backhauled through terrestrial base stations (BSs) to the core network. In particular, we consider millimeter-wave (mmWave) backhauling in the downlink of a hybrid aerial-terrestrial network, where the backhaul links are subject to beamforming misalignment errors. In the proposed model, the user equipment (UE) can connect to either a ground BS or a UAV, where we differentiate between two transmission schemes according to the backhaul status. In one scheme, the UEs are served by the UAVs regardless of whether the backhaul links are good or not. In the other scheme, the UAVs are aware of the backhaul links status, and hence, only the subset of successfully backhauled UAVs can serve the UEs. Using stochastic geometry, the performance of the proposed model is assessed in terms of coverage probability and validated against Monte-Carlo simulations. Several insights are provided for determining some system parameters including the UAVs altitude and required number and the beamforming misalignment error of the backhaul link. The obtained results highlight the impact of the UAVs backhaul link on the UE experience.

cs.IT↗

Point-to-Point Communication in Integrated Satellite-Aerial Networks: State-of-the-art and Future Challenges

This paper overviews point-to-point (P2P) links for integrated satellite-aerial networks, which are envisioned to be among the key enablers of the sixth-generation (6G) of wireless networks vision. The paper first outlines the unique characteristics of such integrated large-scale complex networks, often denoted by spatial networks, and focuses on two particular space-air infrastructures, namely, satellites networks and high-altitude platforms (HAPs). The paper then classifies the connecting P2P communications links as satellite-to-satellite links at the same layer (SSLL), satellite-to-satellite links at different layers (SSLD), and HAP-to-HAP links (HHL). The paper overviews each layer of such spatial networks separately, and highlights the possible natures of the connecting links (i.e., radio-frequency or free-space optics) with a dedicated overview to the existing link-budget results. The paper, afterwards, presents the prospective merit of realizing such an integrated satellite-HAP network towards providing broadband services in under-served and remote areas. Finally, the paper sheds light on several future research directions in the context of spatial networks, namely large-scale network optimization, intelligent offloading, smart platforms, energy efficiency, multiple access schemes, and distributed spatial networks.

eess.SP↗

Ultra-Massive MIMO Systems at Terahertz Bands: Prospects and Challenges

Terahertz (THz)-band communications are currently being celebrated as a key technology that could fulfill the increasing demands for wireless data traffic in the upcoming sixth-generation (6G) of wireless communications. Many challenges, such as high propagation losses and power limitations, which result in short communication distances, have yet to be addressed for this technology to be realized. Ultra-massive multiple-input, multiple-output (UM-MIMO) antenna systems have emerged as practical means for combatting this distance problem, thereby increasing system capacity. Towards that end, graphene-based nano-antennas have recently been proposed, as they can be individually tuned and collectively controlled in compact UM-MIMO array-of-sub-arrays architectures. In this paper, we present a holistic overview of THz UM-MIMO systems. We assess recent advancements in transceiver design and channel modeling, and discuss the major challenges and shortcomings of such designs by deriving the relationship between communication range, array dimensions, and system performance. We further highlight several research advances that could enhance resource allocation at the THz band, including waveform designs, multi-carrier configurations, and spatial modulations. Based on this discussion, we highlight prospective use cases that can bring THz UM-MIMO into reality in the context of sensing, data centers, cell-free systems, and mid-range wireless communications.

eess.SP↗

Intelligent Surfaces for 6G Wireless Networks: A Survey of Optimization and Performance Analysis Techniques

This paper surveys the optimization frameworks and performance analysis methods for large intelligent surfaces (LIS), which have been emerging as strong candidates to support the sixth-generation wireless physical platforms (6G). Due to their ability to adjust the behavior of interacting electromagnetic (EM) waves through intelligent manipulations of the reflections phase shifts, LIS have shown promising merits at improving the spectral efficiency of wireless networks. In this context, researchers have been recently exploring LIS technology in depth as a means to achieve programmable, virtualized, and distributed wireless network infrastructures. From a system level perspective, LIS have also been proven to be a low-cost, green, sustainable, and energy-efficient solution for 6G systems. This paper provides a unique blend that surveys the principles of operation of LIS, together with their optimization and performance analysis frameworks. The paper first introduces the LIS technology and its physical working principle. Then, it presents various optimization frameworks that aim to optimize specific objectives, namely, maximizing energy efficiency, sum-rate, secrecy-rate, and coverage. The paper afterwards discusses various relevant performance analysis works including capacity analysis, the impact of hardware impairments on capacity, uplink/downlink data rate analysis, and outage probability. The paper further presents the impact of adopting the LIS technology for positioning applications. Finally, we identify numerous exciting open challenges for LIS-aided 6G wireless networks, including resource allocation problems, hybrid radio frequency/visible light communication (RF-VLC) systems, health considerations, and localization.

eess.SP↗

Viral Aerosol Concentration Characterization and Detection in Bounded Environments

Viral spread has been intermittently threatening human life over time. Characterizing the viral concentration and modelling the viral transmission are, therefore, considered major milestones for enhancing viral detection capabilities. This paper addresses the problem of viral aerosol detection based on the exhaled breath in a bounded environment, e.g., a bounded room. The paper models the exhaled breath as a cloud which is emitted through the room continuously, and analyzes the temporal-spatial virus concentration by accounting for partial absorption and reflection at each side of the room. The paper first derives a closed form expression of the temporal-spatial virus concentration. It then considers the deployment of a receiver composed of an air sampler and a bio-sensor to detect the viral existence of a specific virus. We, therefore, assess the detection capabilities of the proposed system via evaluating the viral miss-detection probability as a function of the sampling volume and the detection time-instance at the receiver side. Our numerical simulations verify the validity of the analytical results, and illustrate the ability of the proposed system to detect viruses in indoor environments. The results further characterize the impacts of several system parameters on the miss-detection probability.

eess.SP↗

Power Allocation and Link Selection for Multicell Cooperative NOMA Hybrid VLC/RF Systems

This paper proposes and optimizes a cooperative non-orthogonal multiple-access (Co-NOMA) scheme in the context of multicell visible light communications (VLC) networks, as a means to mitigate inter-cell interference in Co-NOMA-enabled systems. Consider a network with multiple VLC access points (APs), where each AP serves two users using light intensity. In each cell, the weak user (the cell edge user) can be served either directly by the VLC AP, or through the strong user that can decode the weak user's message and forward it through the radio-frequency (RF) link. The paper then considers the problem of maximizing the network throughput under quality-of-service (QoS) constraints by allocating the powers of the users' messages and APs' transmit powers, and determining the serving links of each weak user (i.e., VLC or hybrid VLC/RF). The paper solves such a non-convex problem by first finding closed form solutions of the joint users' powers and link selection for a fixed AP power allocation. The APs' transmit powers are then iteratively solved in an outer loop using the golden section method. Simulation results show how the proposed solution and scheme improve the system sum-rate and fairness as compared to conventional non-orthogonal multiple-access (NOMA) schemes.

cs.IT↗

CubeSat Communications: Recent Advances and Future Challenges

Given the increasing number of space-related applications, research in the emerging space industry is becoming more and more attractive. One compelling area of current space research is the design of miniaturized satellites, known as CubeSats, which are enticing because of their numerous applications and low design-and-deployment cost. The new paradigm of connected space through CubeSats makes possible a wide range of applications, such as Earth remote sensing, space exploration, and rural connectivity. CubeSats further provide a complementary connectivity solution to the pervasive Internet of Things (IoT) networks, leading to a globally connected cyber-physical system. This paper presents a holistic overview of various aspects of CubeSat missions and provides a thorough review of the topic from both academic and industrial perspectives. We further present recent advances in the area of CubeSat communications, with an emphasis on constellation-and-coverage issues, channel modeling, modulation and coding, and networking. Finally, we identify several future research directions for CubeSat communications, including Internet of space things, low-power long-range networks, and machine learning for CubeSat resource allocation.

eess.SP↗

Asymptotic Analysis of an Ensemble of Randomly Projected Linear Discriminants

Datasets from the fields of bioinformatics, chemometrics, and face recognition are typically characterized by small samples of high-dimensional data. Among the many variants of linear discriminant analysis that have been proposed in order to rectify the issues associated with classification in such a setting, the classifier in [1], composed of an ensemble of randomly projected linear discriminants, seems especially promising; it is computationally efficient and, with the optimal projection dimension parameter setting, is competitive with the state-of-the-art. In this work, we seek to further understand the behavior of this classifier through asymptotic analysis. Under the assumption of a growth regime in which the dataset and projection dimensions grow at constant rates to each other, we use random matrix theory to derive asymptotic misclassification probabilities showing the effect of the ensemble as a regularization of the data sample covariance matrix. The asymptotic errors further help to identify situations in which the ensemble offers a performance advantage. We also develop a consistent estimator of the misclassification probability as an alternative to the computationally-costly cross-validation estimator, which is conventionally used for parameter tuning. Finally, we demonstrate the use of our estimator for tuning the projection dimension on both real and synthetic data.

stat.ML↗

A Tutorial on Clique Problems in Communications and Signal Processing

Since its first use by Euler on the problem of the seven bridges of Königsberg, graph theory has shown excellent abilities in solving and unveiling the properties of multiple discrete optimization problems. The study of the structure of some integer programs reveals equivalence with graph theory problems making a large body of the literature readily available for solving and characterizing the complexity of these problems. This tutorial presents a framework for utilizing a particular graph theory problem, known as the clique problem, for solving communications and signal processing problems. In particular, the paper aims to illustrate the structural properties of integer programs that can be formulated as clique problems through multiple examples in communications and signal processing. To that end, the first part of the tutorial provides various optimal and heuristic solutions for the maximum clique, maximum weight clique, and $k$-clique problems. The tutorial, further, illustrates the use of the clique formulation through numerous contemporary examples in communications and signal processing, mainly in maximum access for non-orthogonal multiple access networks, throughput maximization using index and instantly decodable network coding, collision-free radio frequency identification networks, and resource allocation in cloud-radio access networks. Finally, the tutorial sheds light on the recent advances of such applications, and provides technical insights on ways of dealing with mixed discrete-continuous optimization problems.

cs.IT↗

Stochastic Geometry Analysis of Hybrid Aerial Terrestrial Networks with mmWave Backhauling

To meet increasing data demands, service providers are considering the use of Unmanned aerial vehicles (UAVs) for delivering connectivity as aerial base stations (BSs). UAVs are especially important to provide connectivity in case of disasters and accidents which may cripple completely the existing terrestrial networks. However, in order to maintain the communication of UAVs with the core network, it is essential to provide them with wireless backhaul connection to terrestrial BSs. In this work, we use stochastic geometry to study the impact of millimeter-wave (mmWave) backhauling of UAVs in a hybrid aerial-terrestrial cellular network where the UAVs are added to assist terrestrial BSs in delivering reliable service to users (UEs). In the proposed model, the UE can associate to either a terrestrial BS or a UAV connected to a BS to get backhaul support. The performance of the proposed model is evaluated in terms of coverage probability and validated against intensive simulations. The obtained results unveil that the quality of the UAVs' mmWave backhaul link has a significant impact on the UE 's experience and the deployment of UAVs must be adjusted accordingly.

cs.IT↗

User Pairing, Link Selection and Power Allocation for Cooperative NOMA Hybrid VLC/RF Systems

Despite the promising high-data rate features of visible light communications (VLC), they still suffer from unbalanced services due to blockages and channel fluctuation among users. This paper introduces and evaluates a new transmission scheme which adopts cooperative non-orthogonal multiple access (Co-NOMA) in hybrid VLC/radio-frequency (RF) systems, so as to improve both system sum-rate and fairness. Consider a network consisting of one VLC access point (AP) and multiple strong and weak users, where each weak user is paired with a strong user. Each weak user can be served either directly by the VLC AP, or via the strong user which converts light information received through the VLC link, and forwards the information to the weak user via the RF link. The paper then maximizes a network-wide weighted sum-rate, so as to jointly determine the strong-weak user-pairs, the serving link of each weak user (i.e., either direct VLC or hybrid VLC/RF), and the power of each user message, subject to user connectivity and transmit power constraints. The paper tackles such a mixed-integer non-convex optimization problem using an iterative approach. Simulations show that the proposed scheme significantly improves the VLC network performance (i.e., sum-rate and fairness) as compared to the conventional NOMA scheme.

cs.IT↗

Interference Mitigation via Rate-Splitting and Common Message Decoding in Cloud Radio Access Networks

Cloud-radio access networks (C-RAN) help overcoming the scarcity of radio resources by enabling dense deployment of base-stations (BSs), and connecting them to a central-processor (CP). This paper considers the downlink of a C-RAN, where the cloud is connected to the BSs via limited-capacity backhaul links. The paper proposes splitting the message of each user into two parts, a private part decodable at the intended user only, and a common part which can be decoded at a subset of users, as a means to enable large-scale interference management in CRAN. To this end, the paper optimizes a transmission scheme that combines rate splitting (RS), common message decoding (CMD), clustering and coordinated beamforming. The paper focuses on maximizing the weighted sum-rate subject to per-BS backhaul capacity and transmit power constraints, so as to jointly determine the RS-CMD mode of transmission, the cluster of BSs serving private and common messages of each user, and the associated beamforming vectors of each user private and common messages. The paper proposes solving such a complicated non-convex optimization problem using $l_0$-norm relaxation techniques, followed by inner-convex approximations (ICA), so as to achieve stationary solutions to the relaxed non-convex problem. Numerical results show that the proposed method provides significant performance gain as compared to conventional interference mitigation techniques in CRAN which treat interference as noise (TIN).

cs.IT↗

Interference Management in NOMA-based Fog-Radio Access Networks via Joint Scheduling and Power Adaptation

Non-Orthogonal Multiple Access (NOMA) and Fog Radio Access Networks (FRAN) are promising candidates within the 5G and beyond systems. This work examines the benefit of adopting NOMA in an FRAN architecture with constrained capacity fronthaul. The paper proposes methods for optimizing joint scheduling and power adaptation in the downlink of a NOMA-based FRAN with multiple resource blocks (RB). We consider a mixed-integer optimization problem which maximizes a network-wide rate-based utility function subject to fronthaul-capacity constraints, so as to determine i) the user-to-RB assignment, ii) the allocated power to each RB, and iii) the power split levels of the NOMA users in each RB. The paper proposes a feasible decoupled solution for such non-convex optimization problem using a three-step hybrid centralized/distributed approach. The proposed solution complies with FRAN operation that aims to partially shift the network control to the FAPs, so as to overcome delays due to fronthaul rate constraints. The paper proposes and compares two distinct methods for solving the assignment problem, namely the Hungarian method, and the Multiple Choice Knapsack method. The power allocation and the NOMA power split optimization, on the other hand, are solved using the alternating direction method of multipliers (ADMM). Simulations results illustrate the advantages of the proposed methods compared to different baseline schemes including the conventional Orthogonal Multiple Access (OMA), for different utility functions and different network environments.

cs.NI↗

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

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

cs.IT↗

On Distributed Routing in Underwater Optical Wireless Sensor Networks

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

cs.NI↗