arXiv subjects

Ekram Hossain

Publications and source records attributed to Ekram Hossain.

At least 127 records · Page 7Linked to original sources

arXiv2019

On the Effect of Temporal Correlation on Joint Success Probability and Distribution of Number of Interferers in Mobile UAV Networks

Unmanned aerial vehicle (UAV)-aided terrestrial cellular networks is being considered as one of the disruptive technologies that can address the beyond 5G (B5G)/6G requirements. With mobile UAVs, since locations of the serving UAVs and the interfering UAVs can vary over time, interference and other performance metrics become temporally correlated. In this letter, we analyze the effect of temporal correlation on the joint success probability and the distribution of the number of interferers for mobile UAV networks. The analytical results will be useful, for example, to design error recovery protocols in these networks.

cs.NI↗

arXiv2019

On Coverage Probability With Type-II HARQ in Large Uplink Cellular Networks

This letter studies uplink transmission in large-scale cellular networks with a Type-II hybrid automatic repeat request (HARQ) retransmission scheme, under which an unsuccessful transmission (if occurs) is combined with the corresponding retransmission through maximum-ratio combining (MRC) for decoding. Based on stochastic geometry analysis, the uplink coverage probabilities are characterized under a generalized power control scheme in the scenarios with quasi-static interference (QSI) and fast-varying interference (FVI), where the same or different interfering users are present during the transmission and retransmission phase, respectively. Our analytical expressions reveal some scaling properties of the coverage probabilities and can be used to evaluate the diversity gain of MRC (i.e., the ratio of the required signal-to-interference ratio (SIR) to achieve a target coverage probability with MRC to that without MRC). We show that the diversity gain of MRC is more remarkable in the scenario with QSI compared to that with FVI. Moreover, the diversity gain of MRC can be mostly exploited by adopting full channel-inversion power control.

cs.NI↗

arXiv2019

A Deep Q-Learning Method for Downlink Power Allocation in Multi-Cell Networks

Optimal resource allocation is a fundamental challenge for dense and heterogeneous wireless networks with massive wireless connections. Because of the non-convex nature of the optimization problem, it is computationally demanding to obtain the optimal resource allocation. Recently, deep reinforcement learning (DRL) has emerged as a promising technique in solving non-convex optimization problems. Unlike deep learning (DL), DRL does not require any optimal/ near-optimal training dataset which is either unavailable or computationally expensive in generating synthetic data. In this paper, we propose a novel centralized DRL based downlink power allocation scheme for a multi-cell system intending to maximize the total network throughput. Specifically, we apply a deep Q-learning (DQL) approach to achieve near-optimal power allocation policy. For benchmarking the proposed approach, we use a Genetic Algorithm (GA) to obtain near-optimal power allocation solution. Simulation results show that the proposed DRL-based power allocation scheme performs better compared to the conventional power allocation schemes in a multi-cell scenario.

cs.NI↗

arXiv2019

Machine Learning in IoT Security: Current Solutions and Future Challenges

The future Internet of Things (IoT) will have a deep economical, commercial and social impact on our lives. The participating nodes in IoT networks are usually resource-constrained, which makes them luring targets for cyber attacks. In this regard, extensive efforts have been made to address the security and privacy issues in IoT networks primarily through traditional cryptographic approaches. However, the unique characteristics of IoT nodes render the existing solutions insufficient to encompass the entire security spectrum of the IoT networks. This is, at least in part, because of the resource constraints, heterogeneity, massive real-time data generated by the IoT devices, and the extensively dynamic behavior of the networks. Therefore, Machine Learning (ML) and Deep Learning (DL) techniques, which are able to provide embedded intelligence in the IoT devices and networks, are leveraged to cope with different security problems. In this paper, we systematically review the security requirements, attack vectors, and the current security solutions for the IoT networks. We then shed light on the gaps in these security solutions that call for ML and DL approaches. We also discuss in detail the existing ML and DL solutions for addressing different security problems in IoT networks. At last, based on the detailed investigation of the existing solutions in the literature, we discuss the future research directions for ML- and DL-based IoT security.

cs.CR↗

arXiv2019

Generalized Coordinated Multipoint (GCoMP)-Enabled NOMA: Outage, Capacity, and Power Allocation

A novel generalized coordinated multi-point transmission (GCoMP)-enabled non-orthogonal multiple access (NOMA) scheme is proposed. In particular, the traditional joint transmission CoMP scheme is generalized to be applied for all user-equipments (UEs), i.e. both cell-centre and cell-edge users within the coverage area of cellular base stations (BSs). Furthermore, every BS applies NOMA for all UEs associated to it using the same frequency sub-band (i.e. all UEs associated to a BS forms a single NOMA cluster). To evaluate the proposed scheme, we derive a closed-form expression for the probability of outage for a UE with different orders of BS cooperation. Important insights on the proposed system are extracted by deriving an approximate (asymptotic) expressions for the probability of outage and outage capacity. Furthermore, an optimal transmission power allocation scheme that jointly allocates transmission power fractions from all cooperating BSs to all connected UEs is developed and investigated for the proposed system. Findings show that NOMA with a large number of UEs is feasible when the GCoMP technique is used over all UEs within the network coverage area. Also, the performance degradation caused by a large NOMA cluster size is significantly mitigated by increasing the number of cooperating BSs. In addition, for given feasible system parameters and a given NOMA cluster, the lower the available power budget, the higher is the number of BSs that apply NOMA for their cluster members and the lower the number of BSs that use water-filling for power allocation.

cs.IT↗

arXiv2019

Delta-OMA (D-OMA): A New Method for Massive Multiple Access in 6G

A new multiple access method, namely, delta-orthogonal multiple access (D-OMA) is introduced for massive access in future generation 6G cellular networks. D-OMA is based on the concept of distributed large coordinated multipoint transmission-enabled non-orthogonal multiple access (NOMA) using partially overlapping sub-bands for NOMA clusters. Performance of this scheme is demonstrated in terms of outage capacity for different degrees of overlapping of NOMA sub-bands. D-OMA can also be used for enhanced security provisioning in both uplink and downlink wireless access networks. Practical implementation issues and open challenges for optimizing D-OMA are also discussed.

cs.NI↗

arXiv2019

Large-Scale NOMA: Promises for Massive Machine-Type Communication

We investigate on large-scale deployment of non-orthogonal multiple access (NOMA) for improved spectral and power efficiency in cellular networks to provide massive wireless connectivity (e.g. for machine-type communication [mMTC]). First, we describe the basics of single-antenna NOMA technology and its extension to co-located multiple-antenna NOMA as well as coordinated multipoint transmission (CoMP)-enabled NOMA technologies. Then we discuss some of the practical challenges of large-scale deployment of NOMA such as the inter-NOMA-interference (INI), inter-cell interference, and hardware implementation complexity. To this end, we present one key enabling technique to overcome the challenges of large-scale deployment of NOMA. Generally speaking, for a feasible large-scale NOMA implementation, sophisticated diversity enhancing techniques can be used to compensate for the degradation in coding gain and to decrease the complexity resulting from excessive INI and increased level of required successive interference cancellation (SIC). Furthermore, to massively extend NOMA over the network coverage area, NOMA transmitters have to cooperate in a generalized manner to serve all nearby users simultaneously.

cs.NI↗

arXiv2018

Accuracy of Distance-Based Ranking of Users in the Analysis of NOMA Systems

We characterize the accuracy of analyzing the performance of a NOMA system where users are ranked according to their distances instead of instantaneous channel gains, i.e., product of distance-based path-loss and fading channel gains. Distance-based ranking is analytically tractable and can lead to important insights. However, it may not be appropriate in a multipath fading environment where a near user suffers from severe fading while a far user experiences weak fading. Since the ranking of users in a NOMA system has a direct impact on coverage probability analysis, impact of the traditional distance-based ranking, as opposed to instantaneous signal power-based ranking, needs to be understood. This will enable us to identify scenarios where distance-based ranking, which is easier to implement compared to instantaneous signal power-based ranking, is acceptable for system performance analysis. To this end, in this paper, we derive the probability of the event when distance-based ranking yields the same results as instantaneous signal power-based ranking, which is referred to as the accuracy probability. We characterize the probability of accuracy considering Nakagami-m fading channels and three different spatial distribution models of user locations in NOMA. We illustrate the impact of accuracy probability on uplink and downlink coverage probability.

cs.IT↗

arXiv2018

On Spectrum Sharing Among Micro-Operators in 5G

The growing demand in indoor small cell networks has given rise to the concept of micro-operators (MOs) for local service delivery. We model and analyze a spectrum sharing system involving such MOs where a buyer MO buys multiple licensed subbands provided by the regulator. Also, all small cell base stations (SBSs) owned by a buyer MO can utilize multiple licensed subbands at the same time which are also used by other MOs. A deterministic model in which the location of the SBSs are known can lead to unwieldy problem formulation, when the number of SBSs is large. Subsequently, we adopt a stochastic geometric model of the SBS deployment instead of a deterministic model. Assuming that the locations of the SBSs can be modeled as a homogeneous Poisson point process, we find the downlink signal-to-interference-plus-noise ratio (SINR) coverage probability and average data rate for a typical user (UE) served by the buyer MO in a spectrum sharing environment. In order to satisfy the QoS constraint, we provide a greedy algorithm to find how many licensed subbands and which subband for the buyer MO to purchase from the regulator. We also derive the coverage probability of the buyer MO for interference the limited system.

cs.NI↗

arXiv2018

Inter-Operator Infrastructure Sharing: Trade-offs and Market

We model the problem of infrastructure sharing among mobile network operators (MNOs) as a multiple-seller single-buyer market where the MNOs are able to share their own base stations (BSs) with each other. First, we use techniques from stochastic geometry to find the coverage probability of the infrastructure sharing system and analyze the trade-off between increasing the transmit power of a BS and the BS intensity of a buyer MNO required to achieve a given quality-of-service (QoS) in terms of the coverage probability. We also analyze the power consumption of the network per unit area (i.e., areal power consumption) and show that it is a piecewise continuous function composed of a linear and a convex functions. We show that when the transmit power of the BSs and/or the BS intensity of a network increases, the system becomes interference limited and the coverage probability tends to saturate at a certain value. As such, when the required QoS is set above this bound, an MNO can improve its coverage by buying infrastructure from other MNOs. Subsequently, we analyze the strategy of a buyer MNO on choosing how many MNOs and which MNOs to buy the infrastructure from. The optimal strategy of the buyer is given by greedy fractional knapsack algorithm. On the sellers' side, the pricing and the fraction of infrastructure to be sold are formulated using a Cournot oligopoly game.

cs.NI↗

arXiv2018

Level-Triggered Harvest-then-Consume Protocol with Two Bits or Less Energy State Information

We propose a variation of harvest-then-consume protocol with low complexity where the harvest and consume phases change when the battery energy level reaches certain thresholds. The proposed protocol allows us to control the possible energy outage during consumption phase. Assuming that the battery is perfect and that the energy arrival is a renewal process, we analyze the duty cycle and the operating cycle speed of the protocol. The proposed protocol also allows for limited battery energy state information. The cases when the system has two-bits, one-bit, and zero-bit of battery energy state information are studied in detail. Numerical simulations verify the obtained formulas.

cs.NI↗

arXiv2018

Approximation of Meta Distribution and Its Moments for Poisson Cellular Networks

The notion of meta distribution as the distribution of the conditional coverage probability (CCP) was introduced in \cite{Haenggi2015}. In this letter, we show how we can reconstruct the entire meta distribution only from its moments using Fourier-Jacobi expansion. As an example, we specifically consider Poisson cellular networks. We also provide a simple closed-form approximation for its moments, along with its error analysis. Lastly, we apply the approximation to obtain a power scaling law for downlink Poisson cellular networks.

cs.IT↗

arXiv2018

Battery Recharge Time of a Stochastic Linear and Non-Linear Energy Harvesting System

Systems harvesting energy from a stochastic source have been widely studied in the literature. However, we are not aware of any work that deals with the time it takes for a battery to recharge up to a given level, when the energy source is discrete stochastic. This letter aims to examine the recharge time of a perfect battery. We examine the cases when the energy arrival is a Poisson process, and more generally, a renewal process. We obtain formulas for the distribution of the recharge time as well as the expected value of the recharge time. Using these, we find the switching time of the system, which is then applied to the design of a harvest-then-transmit protocol for green communications. Monte-Carlo simulations verify the obtained formulas.

cs.IT↗

arXiv2018

Self-Sustainability of Energy Harvesting Systems: Concept, Analysis, and Design

Ambient energy harvesting is touted as a low cost solution to prolong the life of low-powered devices, reduce the carbon footprint, and make the system self-sustainable. Most research to date have focused either on the physical aspects of energy conversion process or on optimal consumption policy of the harvested energy at the system level. However, although intuitively understood, to the best of our knowledge, the idea of self-sustainability is yet to be made precise and studied as a performance metric. In this paper, we provide a mathematical definition of the concept of self-sustainability of an energy harvesting system, based on the complementary idea of eventual outage. In particular, we analyze the harvest-store-consume system with infinite battery capacity, stochastic energy arrivals, and fixed energy consumption rate. Using the random walk theory, we identify the necessary condition for the system to be self-sustainable. General formulas are given for the self-sustainability probability in the form of integral equations. Since these integral equations are difficult to solve analytically, an exponential upper bound for eventual outage probability is given using martingales. This bound guarantees that the eventual outage probability can be made arbitrarily small simply by increasing the initial battery energy. We also give an asymptotic formula for eventual outage. For the special case when the energy arrival follows a Poisson process, we are able to find the exact formulas for the eventual outage probability. We also show that the harvest-store-consume system is mathematically equivalent to a $GI/G/1$ queueing system, which allows us to easily find the outage probability, in case the necessary condition for self-sustainability is violated. Monte-Carlo simulations verify our analysis.

cs.IT↗

arXiv2018

Mobility-Aware Analysis of 5G and B5G Cellular Networks: A Tutorial

Providing network connectivity to mobile users is a key requirement for cellular wireless networks. User mobility impacts network performance as well as user perceived service quality. For efficient network dimensioning and optimization, it is therefore required to characterize the mobility-aware network performance metrics such as the handoff rate, handoff probability, sojourn time, direction switch rate, and users' throughput or coverage. This characterization is particularly challenging for heterogeneous, dense/ultra-dense, and random cellular networks such as the emerging 5G and beyond 5G (B5G) networks. In this article, we provide a tutorial on mobility-aware performance analysis of both the spatially random and non-random, single-tier and multi-tier cellular networks. We first provide a summary of the different mobility models which include purely random models, spatially correlated, and temporally correlated models. The differences among various mobility models, their statistical properties, and their pros and cons are presented. We then describe two main analytical approaches for mobility-aware performance analysis of both random and non-random cellular networks. For the first approach, we describe a general methodology and present several case studies for different cellular network tessellations such as square lattice, hexagon lattice, single-tier and multi-tier models in which base-stations (BSs) follow a homogeneous Poisson Point Process (PPP). For the second approach, we also outline the general methodology. In addition, we discuss some limitations/imperfections of the existing techniques and provide corrections to these imperfections. Finally, we point out specific 5G application scenarios where the impact of mobility would be significant and outline the challenges associated with mobility-aware analysis of those scenarios.

cs.NI↗

arXiv2018

Meta Distribution of the SIR in Large-Scale Uplink and Downlink NOMA Networks

We develop an analytical framework to derive the meta distribution and moments of the conditional success probability (CSP), which is defined as {success probability for a given realization of the transmitters}, in large-scale co-channel uplink and downlink non-orthogonal multiple access (NOMA) networks with one NOMA cluster per cell. The moments of CSP translate to various network performance metrics such as the standard success or signal-to-interference ratio (SIR) coverage probability (which is the $1$-st moment), the mean local delay (which is the $-1$-st moment in a static network setting), and the meta distribution (which is the complementary cumulative distribution function of the conditional success probability and can be approximated by using the $1$-st and $2$-nd moments). For uplink NOMA, to make the framework tractable, we propose two point process models for the spatial locations of the interferers by utilizing the base station (BS)/user pair correlation function. We validate the proposed models by comparing the second moment measure of each model with that of the actual point process for the inter-cluster (or inter-cell) interferers obtained via simulations. For downlink NOMA, we derive closed-form solutions for the moments of the CSP, success (or coverage) probability, average local delay, and meta distribution for the users. As an application of the developed analytical framework, we use the closed-form expressions to optimize the power allocations for downlink NOMA users in order to maximize the success probability of a given NOMA user with and without latency constraints. Closed-form optimal solutions for the transmit powers are obtained for two-user NOMA scenario. We note that maximizing the success probability with latency constraints can significantly impact the optimal power solutions for low SIR thresholds and favour orthogonal multiple access (OMA).

cs.IT↗

arXiv2018

Edge Caching in Delay-Constrained Virtualized Cellular Networks: Analysis and Market

Caching of popular contents at cellular base stations, i.e., edge caching, in order to eliminate duplicate transmission through the backhaul can reduce the latency of data delivery in $5$G networks. However, since caching can only reduce the backhaul delay, techniques such as base station densification will also need to be used to reduce the fronthaul delay. In this paper, using results from stochastic geometry, we first model the effects of base station densification and cache size on the latency of the system. We then derive a tight approximation for the cache hit probability. To optimize the network cost due to the deployment of base station (BS) and cache storage, a minimization problem for the product of the BS intensity and cache size is formulated under probabilistic delay constraint, which is converted into a geometric program and solved analytically. The results are then used to analyze the economics of a cache-enabled virtualized cellular network where the network infrastructure, i.e., BSs and cache storage, owned by an infrastructure provider (InP) is shared among multiple mobile network operators (MNOs). For the pricing between the InP and the MNOs, we formulate a Stackelberg game with the InP as the leader and multiple MNOs as the followers. In this virtualized scenario, the common cost of renting the infrastructure is shared in a fair manner among the MNOs by using the Shapely value. An efficient algorithm is provided to divide the rent among MNOs.

cs.IT↗

arXiv2018

Machine Learning Methods for User Positioning With Uplink RSS in Distributed Massive MIMO

We consider a machine learning approach based on Gaussian process regression (GP) to position users in a distributed massive multiple-input multiple-output (MIMO) system with the uplink received signal strength (RSS) data. We focus on the scenario where noise-free RSS is available for training, but only noisy RSS is available for testing purposes. To estimate the test user locations and their 2σ error-bars, we adopt two state-of-the-art GP methods, namely, the conventional GP (CGP) and the numerical approximation GP (NaGP) methods. We find that the CGP method, which treats the noisy test RSS vectors as noise-free, provides unrealistically small 2σ error-bars on the estimated locations. To alleviate this concern, we derive the true predictive distribution for the test user locations and then employ the NaGP method to numerically approximate it as a Gaussian with the same first and second order moments. We also derive a Bayesian Cramer-Rao lower bound (BCRLB) on the achievable root- mean-squared-error (RMSE) performance of the two GP methods. Simulation studies reveal that: (i) the NaGP method indeed provides realistic 2σ error-bars on the estimated locations, (ii) operation in massive MIMO regime improves the RMSE performance, and (iii) the achieved RMSE performances are very close to the derived BCRLB.

cs.NI↗