arXiv subjects

Ramy Amer

Publications and source records attributed to Ramy Amer.

At least 19 recordsLinked to original sources

arXiv2022

Adaptive Height Optimisation for Cellular-Connected UAVs using Reinforcement Learning

Providing reliable connectivity to cellular-connected UAV can be very challenging; their performance highly depends on the nature of the surrounding environment, such as density and heights of the ground BSs. On the other hand, tall buildings might block undesired interference signals from ground BSs, thereby improving the connectivity between the UAVs and their serving BSs. To address the connectivity of UAVs in such environments, this paper proposes a RL algorithm to dynamically optimise the height of a UAV as it moves through the environment, with the goal of increasing the throughput or spectrum efficiency that it experiences. The proposed solution is evaluated in two settings: using a series of generated environments where we vary the number of BS and building densities, and in a scenario using real-world data obtained from an experiment in Dublin, Ireland. Results show that our proposed RL-based solution improves UAVs QoS by 6% to 41%, depending on the scenario. We also conclude that, when flying at heights higher than the buildings, building density variation has no impact on UAV QoS. On the other hand, BS density can negatively impact UAV QoS, with higher numbers of BSs generating more interference and deteriorating UAV performance.

eess.SP↗

arXiv2021

REQIBA: Regression and Deep Q-Learning for Intelligent UAV Cellular User to Base Station Association

Unmanned Aerial Vehicles (UAVs) are emerging as important users of next-generation cellular networks. By operating in the sky, UAV users experience very different radio conditions than terrestrial users, due to factors such as strong Line-of-Sight (LoS) channels (and interference) and Base Station (BS) antenna misalignment. As a consequence, the UAVs may experience significant degradation to their received quality of service, particularly when they are moving and are subject to frequent handovers. The solution is to allow the UAV to be aware of its surrounding environment, and intelligently connect into the cellular network taking advantage of this awareness. In this paper we present REgression and deep Q-learning for Intelligent UAV cellular user to Base station Association (REQIBA), a solution that allows a UAV flying over an urban area to intelligently connect to underlying BSs, using information about the received signal powers, the BS locations, and the surrounding building topology. We demonstrate how REQIBA can as much as double the total UAV throughput, when compared to heuristic association schemes similar to those commonly used by terrestrial users. We also evaluate how environmental factors such as UAV height, building density, and throughput loss due to handovers impact the performance of our solution.

cs.IT↗

arXiv2020

Intelligent Base Station Association for UAV Cellular Users: A Supervised Learning Approach

Fifth Generation (5G) cellular networks are expected to provide cellular connectivity for vehicular users, including Unmanned Aerial Vehicles (UAVs). When flying in the air, these users experience strong, unobstructed channel conditions to a large number of Base Stations (BSs) on the ground. This creates very strong interference conditions for the UAV users, while at the same time offering them a large number of BSs to potentially associate with for cellular service. Therefore, to maximise the performance of the UAV-BS wireless link, the UAV user needs to be able to choose which BSs to connect to, based on the observed environmental conditions. This paper proposes a supervised learning-based association scheme, using which a UAV can intelligently associate with the most appropriate BS. We train a Neural Network (NN) to identify the most suitable BS from several candidate BSs, based on the received signal powers from the BSs, known distances to the BSs, as well as the known locations of potential interferers. We then compare the performance of the NN-based association scheme against strongest-signal and closest-neighbour association schemes, and demonstrate that the NN scheme significantly outperforms the simple heuristic schemes.

cs.IT↗

arXiv2020

Performance Analysis and Optimization of Cache-Assisted CoMP for Clustered D2D Networks

Caching at mobile devices and leveraging cooperative device-to-device (D2D) communications are two promising approaches to support massive content delivery over wireless networks while mitigating the effects of interference. To show the impact of cooperative communication on the performance of cache-enabled D2D networks, the notion of device clustering must be factored in to convey a realistic description of the network performance. In this regard, this paper develops a novel mathematical model, based on stochastic geometry and an optimization framework for cache-assisted coordinated multi-point (CoMP) transmissions with clustered devices. Devices are spatially distributed into disjoint clusters and are assumed to have a surplus memory to cache files from a known library, following a random probabilistic caching scheme. Desired contents that are not self-cached can be obtained via D2D CoMP transmissions from neighboring devices or, as a last resort, from the network. For this model, we analytically characterize the offloading gain and rate coverage probability as functions of the system parameters. An optimal caching strategy is then defined as the content placement scheme that maximizes the offloading gain. For a tractable optimization framework, we pursue two separate approaches to obtain a lower bound and a provably accurate approximation of the offloading gain, which allows us to obtain optimized caching strategies.

cs.IT↗

arXiv2020

Optimized Caching and Spectrum Partitioning for D2D enabled Cellular Systems with Clustered Devices

Caching at mobile devices and leveraging device- to-device (D2D) communication are two promising approaches to support massive content delivery over wireless networks. The analysis of cache-enabled wireless networks is usually carried out by assuming that devices are uniformly distributed, however, in social networks, mobile devices are intrinsically grouped into disjoint clusters. In this regards, this paper proposes a spatiotemporal mathematical model that tracks the service requests arrivals and account for the clustered devices geometry. Two kinds of devices are assumed, particularly, content clients and content providers. Content providers are assumed to have a surplus memory which is exploited to proactively cache contents from a known library, following a random probabilistic caching scheme. Content clients can retrieve a requested content from the nearest content provider in their proximity (cluster), or, as a last resort, the base station (BS). The developed spatiotemporal model is leveraged to formulate a joint optimization problem of the content caching and spectrum partitioning in order to minimize the average service delay. Due to the high complexity of the optimization problem, the caching and spectrum partitioning problems are decoupled and solved iteratively using the block coordinate descent (BCD) optimization technique. To this end, an optimal and suboptimal solutions are obtained for the bandwidth partitioning and probabilistic caching subproblems, respectively. Numerical results highlight the superiority of the proposed scheme over conventional caching schemes under equal and optimized bandwidth allocations. Particularly, it is shown that the average service delay is reduced by nearly 100% and 350%, compared to the Zipf and uniform caching schemes under equal bandwidth allocations, respectively.

cs.IT↗

arXiv2020

Optimizing Joint Probabilistic Caching and Channel Access for Clustered D2D Networks

Caching at mobile devices and leveraging device-to-device (D2D) communication are two promising approaches to support massive content delivery over wireless networks. Analysis of such D2D caching networks based on a physical interference model is usually carried out by assuming uniformly distributed devices. However, this approach does not capture the notion of device clustering. In this regard, this paper proposes a joint communication and caching optimization framework for clustered D2D networks. Devices are spatially distributed into disjoint clusters and are assumed to have a surplus memory that is utilized to proactively cache files, following a random probabilistic caching scheme. The cache offloading gain is maximized by jointly optimizing channel access and caching scheme. A closed-form caching solution is obtained and bisection search method is adopted to heuristically obtain the optimal channel access probability. Results show significant improvement in the offloading gain reaching up to 10% compared to the Zipf caching baseline.

cs.IT↗

arXiv2020

Performance Analysis of Mobile Cellular-Connected Drones under Practical Antenna Configurations

Providing seamless connectivity to unmanned aerial vehicle user equipments (UAV-UEs) is very challenging due to the encountered line-of-sight interference and reduced gains of down-tilted base station (BS) antennas. For instance, as the altitude of UAV-UEs increases, their cell association and handover procedure become driven by the side-lobes of the BS antennas. In this paper, the performance of cellular-connected UAV-UEs is studied under 3D practical antenna configurations. Two scenarios are studied: scenarios with static, hovering UAV- UEs and scenarios with mobile UAV-UEs. For both scenarios, the UAV-UE coverage probability is characterized as a function of the system parameters. The effects of the number of antenna elements on the UAV-UE coverage probability and handover rate of mobile UAV-UEs are then investigated. Results reveal that the UAV-UE coverage probability under a practical antenna pattern is worse than that under a simple antenna model. Moreover, vertically-mobile UAV-UEs are susceptible to altitude handover due to consecutive crossings of the nulls and peaks of the antenna side-lobes.

cs.IT↗

arXiv2019

Mobility in the Sky: Performance and Mobility Analysis for Cellular-Connected UAVs

Providing connectivity to unmanned aerial vehicle-user equipments such as drones or flying taxis is a major challenge for tomorrow cellular systems. In this paper, the use of coordinated multi-point transmission for providing seamless connectivity to UAV user equipments is investigated. In particular, a network of clustered ground base stations that cooperatively serve a number of UAVUEs is considered. Two scenarios are studied: scenarios with static, hovering UAV user equipments and scenarios with mobile UAV-UEs. Under a maximum ratio transmission, a novel framework is developed and leveraged to derive upper and lower bounds on the UAV-UE coverage probability for both scenarios. Using the derived results, the effects of various system parameters such as collaboration distance, UAVUE altitude, and UAV-UE velocity on the achievable performance are studied. Results reveal that, for both static and mobile UAV user equipments, when the BS antennas are tilted downwards, the coverage probability of a high-altitude UAV-UE is upper bounded by that of ground users regardless of the transmission scheme. Moreover, for low signal-to-interference-ratio thresholds, it is shown that CoMP transmission can improve the coverage probability of UAV user equipments, e.g., from 28% under the nearest association scheme to 60% for a collaboration distance of 200m.

cs.IT↗

arXiv2019

Towards a Connected Sky: Performance of Beamforming with Down-tilted Antennas for Ground and UAV User Co-existence

Providing connectivity to aerial users such as cellular connected unmanned aerial vehicles is a key challenge for future cellular systems. In this paper, the use of conjugate beamforming for simultaneous content delivery to an AU coexisting with multiple ground users is investigated. In particular, a content delivery network of uniformly distributed massive MIMO enabled ground base stations serving both aerial and ground users through spatial multiplexing is considered. For this model, the successful content delivery probability is derived as a function of the system parameters. The effects of various system parameters such as antenna down-tilt angle, AU altitude, number of scheduled users, and number of antennas on the achievable performance are then investigated. Results reveal that whenever the AU altitude is below the BS height, the antennas down-tilt angles yield an inherent tradeoff between the performance of the AU and the GUs. However, if the AU altitude exceeds the BS height, down-tilting the BS antennas with a considerably large angle improves the performance of both the AU and the GUs.

eess.SP↗

arXiv2019

On the Reliability of Wireless Virtual Reality at Terahertz (THz) Frequencies

Guaranteeing ultra reliable low latency communications (URLLC) with high data rates for virtual reality (VR) services is a key challenge to enable a dual VR perception: visual and haptic. In this paper, a terahertz (THz) cellular network is considered to provide high-rate VR services, thus enabling a successful visual perception. For this network, guaranteeing URLLC with high rates requires overcoming the uncertainty stemming from the THz channel. To this end, the achievable reliability and latency of VR services over THz links are characterized. In particular, a novel expression for the probability distribution function of the transmission delay is derived as a function of the system parameters. Subsequently, the end-to-end (E2E) delay distribution that takes into account both processing and transmission delay is found and a tractable expression of the reliability of the system is derived as a function of the THz network parameters such as the molecular absorption loss and noise, the transmitted power, and the distance between the VR user and its respective small base station (SBS). Numerical results show the effects of various system parameters such as the bandwidth and the region of non-negligible interference on the reliability of the system. In particular, the results show that THz can deliver rates up to 16.4 Gbps and a reliability of 99.999% (with a delay threshold of 30 ms) provided that the impact of the molecular absorption on the THz links, which substantially limits the communication range of the SBS, is alleviated by densifying the network accordingly.

cs.IT↗

arXiv2018

Caching to the Sky: Performance Analysis of Cache-Assisted CoMP for Cellular-Connected UAVs

Providing connectivity to aerial users, such as cellular-connected unmanned aerial vehicles (UAVs) or flying taxis, is a key challenge for tomorrow's cellular systems. In this paper, the use of coordinated multi-point (CoMP) transmission along with caching for providing seamless connectivity to aerial users is investigated. In particular, a network of clustered cache-enabled small base stations (SBSs) serving aerial users is considered in which a requested content by an aerial user is cooperatively transmitted from collaborative ground SBSs. For this network, a novel upper bound expression on the coverage probability is derived as a function of the system parameters. The effects of various system parameters such as collaboration distance and content availability on the achievable performance are then investigated. Results reveal that, when the antennas of the SBSs are tilted downwards, the coverage probability of a high-altitude aerial user is upper bounded by that of a ground user regardless of the transmission scheme. Moreover, it is shown that for a low signal-to-interference-ratio (SIR) threshold, CoMP transmission improves the coverage probability for aerial users from 10% to 70% under a collaboration distance of 200 m.

eess.SP↗

arXiv2018

Cooperative Transmission and Probabilistic Caching for Clustered D2D Networks

In this paper, we aim at maximizing the cache offloading gain for a clustered \ac{D2D} caching network by exploiting probabilistic caching and cooperative transmission among the cluster devices. Devices with surplus memory probabilistically cache a content from a known library. A requested content is either brought from the device's local cache, cooperatively transmitted from catering devices, or downloaded from the macro base station as a last resort. Using stochastic geometry, we derive a closed-form expression for the offloading gain and formulate the offloading maximization problem. In order to simplify the objective function and obtain analytically tractable expressions, we derive a lower bound on the offloading gain, for which a suboptimal solution is obtained when considering a special case. Results reveal that the obtained suboptimal solution can achieve up to 12% increase in the offloading gain compared to the Zipf's caching technique. Besides, we show that the spatial scaling parameters of the network, e.g., the density of clusters and distance between devices in the same cluster, play a crucial role in identifying the tradeoff between the content diversity gain and the cooperative transmission gain.

eess.SP↗

arXiv2018

Optimizing Joint Probabilistic Caching and Communication for Clustered D2D Networks

Caching at mobile devices and leveraging device-to-device (D2D) communication are two promising approaches to support massive content delivery over wireless networks. The analysis of such D2D caching networks based on a physical interference model is usually carried out by assuming that devices are uniformly distributed. However, this approach does not fully consider and characterize the fact that devices are usually grouped into clusters. Motivated by this fact, this paper presents a comprehensive performance analysis and joint communication and caching optimization for a clustered D2D network. Devices are distributed according to a Thomas cluster process (TCP) and are assumed to have a surplus memory which is exploited to proactively cache files from a known library, following a random probabilistic caching scheme. Devices can retrieve the requested files from their caches, from neighbouring devices in their proximity (cluster), or from the base station as a last resort. Three key performance metrics are optimized in this paper, namely, the offloading gain, energy consumption, and latency.

eess.SP↗

arXiv2018

Techniques for Cooperative Cognitive Radio Networks

The frequency spectrum is an essential resource for wireless communication. Special sections of the spectrum are used for military purposes, governments sell some frequency bands to broadcasting and mobile communications companies for commercial use, others such as ISM (Industrial, Science and Medical) bands are available for the public free of charge. As the spectrum becomes overcrowded, there seem to be two possible solutions: pushing the frequency limits higher to frequencies of 60 GHz and above, or reaggregating the densely used licensed frequency bands. The new Cognitive Radio (CR) approach comes with the feasible solution to spectrum scarcity. Secondary utilization of a licensed spectrum band can enhance the spectrum usage and introduce a reliable solution to its dearth. In such a cognitive radio network, secondary users can access the spectrum under the constraint that a minimum quality of service is guaranteed for the licensed primary users. In this thesis, we focus on spectrum sharing techniques in cognitive radio network where there is a number of secondary users sharing unoccupied spectrum holes. More specifically, we introduce two collaborative cognitive radio networks in which the secondary user cooperate with the primary user to deliver the data of the primary user.

eess.SP↗

arXiv2018

On Minimizing Energy Consumption for D2D Clustered Caching Networks

We formulate and solve the energy minimization problem for a clustered device-to-device (D2D) network with cache-enabled mobile devices. Devices are distributed according to a Poisson cluster process (PCP) and are assumed to have a surplus memory which is exploited to proactively cache files from a library. Devices can retrieve the requested files from their caches, from neighboring devices in their proximity (cluster), or from the base station as a last resort. We minimize the energy consumption of the proposed network under a random prob- abilistic caching scheme, where files are independently cached according to a specific probability distribution. A closed-form expression for the D2D coverage probability is obtained. The energy consumption problem is then formulated as a function of the caching distribution, and the optimal probabilistic caching distribution is obtained. Results reveal that the proposed caching distribution reduces energy consumption up to 33% as compared to caching popular files scheme.

cs.DC↗

arXiv2018

Inter-cluster Cooperation for Wireless D2D Caching Networks

Proactive wireless caching and device to device (D2D) communication have emerged as promising techniques for enhancing users' quality of service and network performance. In this paper, we propose a new architecture for D2D caching with inter-cluster cooperation. We study a cellular network in which users cache popular files and share them with other users either in their proximity via D2D communication or with remote users using cellular transmission. We characterize the network average delay per request from a queuing perspective. Specifically, we formulate the delay minimization problem and show that it is NP-hard. Furthermore, we prove that the delay minimization problem is equivalent to the minimization of a non-increasing monotone supermodular function subject to a uniform partition matroid constraint. A computationally efficient greedy algorithm is proposed which is proven to be locally optimal within a factor 0.63 of the optimum. We analyze the average per request throughput for different caching schemes and conduct the scaling analysis for the average sum throughput. We show how throughput scaling depends on video content popularity when the number of files grows asymptotically large. Simulation results show a delay reduction of 45% to 80% compared to a D2D caching system without inter-cluster cooperation.

cs.NI↗

arXiv2017

Delay Analysis for Wireless D2D Caching with Inter-cluster Cooperation

Proactive wireless caching and D2D communication have emerged as promising techniques for enhancing users' quality of service and network performance. In this paper, we propose a new architecture for D2D caching with inter-cluster cooperation. We study a cellular network in which users cache popular files and share them with other users either in their proximity via D2D communication or with remote users using cellular transmission. We characterize the network average delay per request from a queuing perspective. Specifically, we formulate the delay minimization problem and show that it is NP-hard. Furthermore, we prove that the delay minimization problem is equivalent to minimization of a non-increasing monotone super modular function subject to a partition matroid constraint. A computationally efficient greedy algorithm is proposed which is proven to be locally optimal within a factor 2 of the optimum. Simulation results show more than 45% delay reduction compared to a D2D caching system without inter-cluster cooperation.

cs.IT↗

arXiv2016

Cooperation and Underlay Mode Selection in Cognitive Radio Network

In this research, we proposes a new method for cooperation and underlay mode selection in cognitive radio networks. We characterize the maximum achievable throughput of our proposed method of hybrid spectrum sharing. Hybrid spectrum sharing is assumed where the Secondary User (SU) can access the Primary User (PU) channel in two modes, underlay mode or cooperative mode with admission control. In addition to access the channel in the overlay mode, secondary user is allowed to occupy the channel currently occupied by the primary user but with small transmission power. Adding the underlay access modes attains more opportunities to the secondary user to transmit data. It is proposed that the secondary user can only exploits the underlay access when the channel of the primary user direct link is good or predicted to be in non-outage state. Therefore, the secondary user could switch between underlay spectrum sharing and cooperation with the primary user. Hybrid access is regulated through monitoring the state of the primary link. By observing the simulation results, the proposed model attains noticeable improvement in the system performance in terms of maximum secondary user throughput than the conventional cooperation and non-cooperation schemes.

cs.NI↗