arXiv subjects

Hesham ElSawy

Publications and source records attributed to Hesham ElSawy.

At least 37 records · Page 2Linked to original sources

arXiv2021

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↗

arXiv2020

Grant-Free Opportunistic Uplink Transmission in Wireless-powered IoT: A Spatio-temporal Model

Ambient radio frequency (RF) energy harvesting is widely promoted as an enabler for wireless-power Internet of Things (IoT) networks. This paper jointly characterizes energy harvesting and packet transmissions in grant-free opportunistic uplink IoT networks energized via harvesting downlink energy. To do that, a joint queuing theory and stochastic geometry model is utilized to develop a spatio-temporal analytical model. Particularly, the harvested energy and packet transmission success probability are characterized using tools from stochastic geometry. {Moreover, each device is modeled using a two-dimensional discrete-time Markov chain (DTMC). Such two dimensions are utilized to jointly track the scavenged/depleted energy to/from the batteries along with the arrival/departure of packets to/from devices buffers over time. Consequently, the adopted queuing model represents the devices as spatially interacting queues. To that end, the network performance is assessed in light of the packet throughput, the average delay, and the average buffer size. The effect of base stations (BSs) densification is discussed and several design insights are provided. The results show that the parameters for uplink power control and opportunistic channel access should be jointly optimized to maximize average network packet throughput, and hence, minimize delay.

cs.IT↗

arXiv2020

Safeguarding the IoT from Malware Epidemics: A Percolation Theory Approach

The upcoming Internet of things (IoT) is foreseen to encompass massive numbers of connected devices, smart objects, and cyber-physical systems. Due to the large-scale and massive deployment of devices, it is deemed infeasible to safeguard 100% of the devices with state-of-the-art security countermeasures. Hence, large-scale IoT has inevitable loopholes for network intrusion and malware infiltration. Even worse, exploiting the high density of devices and direct wireless connectivity, malware infection can stealthily propagate through susceptible (i.e., unsecured) devices and form an epidemic outbreak without being noticed to security administration. A malware outbreak enables adversaries to compromise large population of devices, which can be exploited to launch versatile cyber and physical malicious attacks. In this context, we utilize spatial firewalls, to safeguard the IoT from malware outbreak. In particular, spatial firewalls are computationally capable devices equipped with state-of-the-art security and anti-malware programs that are spatially deployed across the network to filter the wireless traffic in order to detect and thwart malware propagation. Using tools from percolation theory, we prove that there exists a critical density of spatial firewalls beyond which malware outbreak is impossible. This, in turns, safeguards the IoT from malware epidemics regardless of the infection/treatment rates. To this end, a tractable upper bound for the critical density of spatial firewalls is obtained. Furthermore, we characterize the relative communications ranges of the spatial firewalls and IoT devices to ensure secure network connectivity. The percentage of devices secured by the firewalls is also characterized.

cs.CR↗

arXiv2020

Rate Adaptation and Latency in Heterogeneous IoT Networks

This paper studies the effect of rate adaptation in time slotted Internet of things (IoT) networks. For a given time slot duration and packets size, rate adaptation necessitates packet fragmentation to fit the time slot duration. Accounting for the quality and time resolution of the underlying traffic, this paper characterizes the tradeoff between transmission rate and packet latency in IoT networks. Using tools from stochastic geometry and queueing theory, a novel mathematical framework is developed for static and dynamic rate adaptation schemes. The results show that there is an optimal static rate that minimizes latency, which depends on the network parameters. Furthermore, the dynamic rate is shown to be resilient to different variations in the network parameters without sacrificing packet latency.

cs.IT↗

arXiv2020

Spatiotemporal Dependable Task Execution Services in MEC-enabled Wireless Systems

Multi-access Edge Computing (MEC) enables computation and energy-constrained devices to offload and execute their tasks on powerful servers. Due to the scarce nature of the spectral and computation resources, it is important to jointly consider i) contention-based communications for task offloading and ii) parallel computing and occupation of failure-prone MEC processing resources (virtual machines). The feasibility of task offloading and successful task execution with virtually no failures during the operation time needs to be investigated collectively from a combined point of view. To this end, this letter proposes a novel spatiotemporal framework that utilizes stochastic geometry and continuous time Markov chains to jointly characterize the communication and computation performance of dependable MEC-enabled wireless systems. Based on the designed framework, we evaluate the influence of various system parameters on different dependability metrics such as (i) computation resources availability, (ii) task execution retainability, and (iii) task execution capacity. Our findings showcase that there exists an optimal number of virtual machines for parallel computing at the MEC server to maximize the task execution capacity.

cs.IT↗

arXiv2020

Prioritized Multi-stream Traffic in Uplink IoT Networks: Spatially Interacting Vacation Queues

Massive Internet of Things (IoT) is foreseen to introduce plethora of applications for a fully connected world. Heterogeneous traffic is envisaged, where packets generated at each IoT device should be differentiated and served according to their priority. This paper develops a novel priority-aware spatiotemporal mathematical model to characterize massive IoT networks with uplink prioritized multistream traffic (PMT). Particularly, stochastic geometry is utilized to account for the macroscopic network wide mutual interference between the coexisting IoT devices. Discrete time Markov chains (DTMCs) are employed to track the microscopic evolution of packets within each priority stream at each device. To alleviate the curse of dimensionality, we decompose the prioritized queueing model at each device to a single-queue system with server vacation. To this end, the IoT network with PMT is modeled as spatially interacting vacation queues. Interactions between queues, in terms of the packet departure probabilities, occur due to mutual interference. Service vacations occur to lower priority packets to address higher priority packets. Based on the proposed model, dedicated and shared channel access strategies for different priority classes are presented and compared. The results show that shared access provides better performance when considering the transmission success probability, queues overflow probability and latency.

cs.IT↗

arXiv2020

Characterizing IoT Networks with Asynchronous Time-Sensitive Periodic Traffic

This paper develops a novel spatiotemporal model for large-scale IoT networks with asynchronous periodic traffic and hard-packet deadlines. A static marked Poisson bipolar point process is utilized to model the spatial locations of the IoT devices, where the marks mimic the relative time-offsets of traffic duty cycles at different devices. At each device, an absorbing Markov chain is utilized to capture the temporal evolution of packets from generation until either successful delivery or deadline expiry. The temporal evolution of packets is defined in terms of the Aloha transmission/backoff states. From the network perspective, the meta distribution of the transmission success probability is used to characterize the mutual interference among of the coexisting devices. To this end, the network performance is characterized in terms of the probabilities of meeting/missing the delivery deadlines and transmission latency. The results unveil counter-intuitive superior performance of strict packet deadlines in terms of transmission success and latency.

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

A Spatiotemporal Framework for Information Freshness in IoT Uplink Networks

Timely message delivery is a key enabler for Internet of Things (IoT) and cyber-physical systems to support wide range of context-dependent applications. Conventional time-related metrics, such as delay, fails to characterize the timeliness of the system update or to capture the freshness of information from application perspective. Age of information (AoI) is a time.evolving measure of information freshness that has received considerable attention during the past years. In the foreseen large scale and dense IoT networks, joint temporal (i.e., queue aware) and spatial (i.e., mutual interference aware) characterization of the AoI is required. In this work we provide a spatiotemporal framework that captures the peak AoI for large scale IoT uplink network. To this end, the paper quantifies the peak AoI for large scale cellular network with Bernoulli uplink traffic. Simulation results are conducted to validate the proposed model and show the effect of traffic load and decoding threshold. Insights are driven to characterize the network stability frontiers and the location-dependent performance within the network.

cs.IT↗

arXiv2019

A Spatiotemporal Model for Peak AoI in Uplink IoT Networks: Time Vs Event-triggered Traffic

Timely message delivery is a key enabler for Internet of Things (IoT) and cyber-physical systems to support wide range of context-dependent applications. Conventional time-related metrics (e.g. delay and jitter) fails to characterize the timeliness of the system update. Age of information (AoI) is a time-evolving metric that accounts for the packet inter-arrival and waiting times to assess the freshness of information. In the foreseen large-scale IoT networks, mutual interference imposes a delicate relation between traffic generation patterns and transmission delays. To this end, we provide a spatiotemporal framework that captures the peak AoI (PAoI) for large scale IoT uplink network under time-triggered (TT) and event triggered (ET) traffic. Tools from stochastic geometry and queueing theory are utilized to account for the macroscopic and microscopic network scales. Simulations are conducted to validate the proposed mathematical framework and assess the effect of traffic load on PAoI. The results unveil a counter-intuitive superiority of the ET traffic over the TT in terms of PAoI, which is due to the involved temporal interference correlations. Insights regarding the network stability frontiers and the location-dependent performance are presented. Key design recommendations regarding the traffic load and decoding thresholds are highlighted.

cs.IT↗

arXiv2019

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↗

arXiv2019

Aeronautical Data Aggregation and Field Estimation in IoT Networks: Hovering & Traveling Time Dilemma of UAVs

The next era of information revolution will rely on aggregating big data from massive numbers of devices that are widely scattered in our environment. Most of these devices are expected to be of low-complexity, low-cost, and limited power supply, which impose stringent constraints on the network operation. In this regard, this paper investigates aerial data aggregation and field estimation from a finite spatial field via an unmanned aerial vehicle (UAV). Instead of fusing, relaying, and routing the data across the wireless nodes to fixed locations access points, a UAV flies over the field and collects the required data for two prominent missions; data aggregation and field estimation. To accomplish these tasks, the field of interest is divided into several subregions over which the UAV hovers to collect samples from the underlying nodes. To this end, we formulate and solve an optimization problem to minimize total hovering and traveling time of each mission. While the former requires the collection of a prescribed average number of samples from the field, the latter ensures for a given field spatial correlation model that the average mean-squared estimation error of the field value is no more than a predetermined threshold at any point. These goals are fulfilled by optimizing the number of subregions, the area of each subregion, the hovering locations, the hovering time at each location, and the trajectory traversed between hovering locations. The proposed formulation is shown to be np-hard mixed integer problem, and hence, a decoupled heuristic solution is proposed. The results show that there exists an optimal number of subregions that balance the tradeoff between hovering and traveling times such that the total time for collecting the required samples is minimized.

cs.NI↗

arXiv2019

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↗

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

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

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

cs.IT↗

arXiv2018

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

A network model is considered where Poisson distributed base stations transmit to $N$ power-domain non-orthogonal multiple access (NOMA) users (UEs) each {that employ successive interference cancellation (SIC) for decoding}. We propose three models for the clustering of NOMA UEs and consider two different ordering techniques for the NOMA UEs: mean signal power-based and instantaneous signal-to-intercell-interference-and-noise-ratio-based. For each technique, we present a signal-to-interference-and-noise ratio analysis for the coverage of the typical UE. We plot the rate region for the two-user case and show that neither ordering technique is consistently superior to the other. We propose two efficient algorithms for finding a feasible resource allocation that maximize the cell sum rate $\mathcal{R}_{\rm tot}$, for general $N$, constrained to: 1) a minimum throughput $\mathcal{T}$ for each UE, 2) identical throughput for all UEs. We show the existence of: 1) an optimum $N$ that maximizes the constrained $\mathcal{R}_{\rm tot}$ given a set of network parameters, 2) a critical SIC level necessary for NOMA to outperform orthogonal multiple access. The results highlight the importance in choosing the network parameters $N$, the constraints, and the ordering technique to balance the $\mathcal{R}_{\rm tot}$ and fairness requirements. We also show that interference-aware UE clustering can significantly improve performance.

cs.IT↗

arXiv2018

Self-Organized Scheduling Request for Uplink 5G Networks: A D2D Clustering Approach

In one of the several manifestations, the future cellular networks are required to accommodate a massive number of devices; several orders of magnitude compared to today's networks. At the same time, the future cellular networks will have to fulfill stringent latency constraints. To that end, one problem that is posed as a potential showstopper is extreme congestion for requesting uplink scheduling over the physical random access channel (PRACH). Indeed, such congestion drags along scheduling delay problems. In this paper, the use of self-organized device-to-device (D2D) clustering is advocated for mitigating PRACH congestion. To this end, the paper proposes two D2D clustering schemes, namely; Random-Based Clustering (RBC) and Channel-Gain-Based Clustering (CGBC). Accordingly, this paper sheds light on random access within the proposed D2D clustering schemes and presents a case study based on a stochastic geometry framework. For the sake of objective evaluation, the D2D clustering is benchmarked by the conventional scheduling request procedure. Accordingly, the paper offers insights into useful scenarios that minimize the scheduling delay for each clustering scheme. Finally, the paper discusses the implementation algorithm and some potential implementation issues and remedies.

cs.IT↗