Searcharxiv⌕ Search

arXiv subjects

Ekram Hossain

Publications and source records attributed to Ekram Hossain.

At least 163 records · Page 9Linked to original sources

Analysis of SINR Outage in Large-Scale Cellular Networks Using Campbell's Theorem and Cumulant Generating Functions

The signal-to-noise-plus-interference ratio (SINR) outage probability is one of the key performance parameters of a wireless cellular network, and its analytical as well as numerical evaluation has occupied many researchers. Recently, the introduction of stochastic geometric modeling of cellular networks has brought the outage problem to the forefront again. A popular and powerful approach is to exploit the available moment generating function (or Laplace transform) of received signal and interference, whenever it exists, by applying the Gil-Pelaez inversion formula. However, with the stochastic geometric modeling, the moment generating function may either be too complicated to exist in closed-form or at worst may not exist. Toward this end, in this paper, we study two alternate ways of evaluating the SINR outage. In the first case, we emphasize the significance of calculating cumulants over moments and exploit the fact that the cumulants of point processes are easily calculable using Campbell's theorem. The SINR outage is then analytically characterized by Charlier expansion based on Gaussian and Student's $t$-distributions and their associated Hermite and Krishnamoorthy polynomials. In the second case, we exploit the saddle point method, which gives a semi-analytical method of calculating the SINR outage, whenever the cumulant generating function of received signal and interference exists. For the purpose of demonstration, we apply these techniques on a downlink cellular network model where a typical user experiences a coordinated multi-point transmission, and the base stations are modeled by homogeneous Poisson point process. For the convenience of readers, we also provide a brief overview of moments, cumulants, their generating functions, and Campbell's theorem, without invoking measure theory. Numerical results illustrate the accuracy of the proposed mathematical approaches.

cs.IT↗

Distributed Cell Association for Energy Harvesting IoT Devices in Dense Small Cell Networks: A Mean-Field Multi-Armed Bandit Approach

The emerging Internet of Things (IoT)-driven ultra-dense small cell networks (UD-SCNs) will need to combat a variety of challenges. On one hand, massive number of devices sharing the limited wireless resources will render centralized control mechanisms infeasible due to the excessive cost of information acquisition and computations. On the other hand, to reduce energy consumption from fixed power grid and/or battery, many IoT devices may need to depend on the energy harvested from the ambient environment (e.g., from RF transmissions, environmental sources). However, due to the opportunistic nature of energy harvesting, this will introduce uncertainty in the network operation. In this article, we study the distributed cell association problem for energy harvesting IoT devices in UD-SCNs. After reviewing the state-of-the-art research on the cell association problem in small cell networks, we outline the major challenges for distributed cell association in IoT-driven UD-SCNs where the IoT devices will need to perform cell association in a distributed manner in presence of uncertainty (e.g., limited knowledge on channel/network) and limited computational capabilities. To this end, we propose an approach based on mean-field multi-armed bandit games to solve the uplink cell association problem for energy harvesting IoT devices in a UD-SCN. This approach is particularly suitable to analyze large multi-agent systems under uncertainty and lack of information. We provide some theoretical results as well as preliminary performance evaluation results for the proposed approach.

cs.NI↗

Distributed User Association in Energy Harvesting Small Cell Networks: A Probabilistic Model

We consider a distributed downlink user association problem in a small cell network, where small cells obtain the required energy for providing wireless services to users through ambient energy harvesting. Since energy harvesting is opportunistic in nature, the amount of harvested energy is a random variable, without any a priori known characteristics. Moreover, since users arrive in the network randomly and require different wireless services, the energy consumption is a random variable as well. In this paper, we propose a probabilistic framework to mathematically model and analyze the random behavior of energy harvesting and energy consumption in dense small cell networks. Furthermore, as acquiring (even statistical) channel and network knowledge is very costly in a distributed dense network, we develop a bandit-theoretical formulation for distributed user association when no information is available at users

cs.IT↗

On Feasibility of 5G-Grade Dedicated RF Charging Technology for Wireless-Powered Wearables

For decades, wireless energy transfer and harvesting remained of focused attention in the research community, but with limited practical applications. Recently, with the development of fifth-generation (5G) mobile technology, the concept of dedicated radio-frequency (RF) charging promises to support the growing market of wearable devices. In this work, we shed light on the potential of wireless RF power transfer by elaborating upon feasible system parameters and architecture, emphasizing the basic trade-offs behind omni-directional and directional out-of-band energy transmission, providing system-level performance evaluation, as well as discussing open challenges on the way to sustainable wireless-powered wearables. The key aspects highlighted in this article include system operation choices, user mobility effects, impact of network and user densities, as well as regulatory issues. Ultimately, our research targets to facilitate the integration of wireless RF charging technology into the emerging 5G ecosystem.

cs.NI↗

Ambient RF Energy Harvesting in Ultra-Dense Small Cell Networks: Performance and Trade-offs

In order to minimize electric grid power consumption, energy harvesting from ambient RF sources is considered as a promising technique for wireless charging of low-power devices. To illustrate the design considerations of RF-based ambient energy harvesting networks, this article first points out the primary challenges of implementing and operating such networks, including non-deterministic energy arrival patterns, energy harvesting mode selection, energy-aware cooperation among base stations (BSs), etc. A brief overview of the recent advancements and a summary of their shortcomings are then provided to highlight existing research gaps and possible future research directions. To this end, we investigate the feasibility of implementing RF-based ambient energy harvesting in ultra-dense small cell networks (SCNs) and examine the related trade-offs in terms of the energy efficiency and signal-to-interference-plus-noise ratio (SINR) outage probability of a typical user in the downlink. Numerical results demonstrate the significance of deploying a mixture of on-grid small base stations (SBSs)~(powered by electric grid) and off-grid SBSs~(powered by energy harvesting) and optimizing their corresponding proportions as a function of the intensity of active SBSs in the network.

cs.NI↗

Energy Efficiency in Massive MIMO-Based 5G Networks: Opportunities and Challenges

As we make progress towards the era of fifth generation (5G) communication networks, energy efficiency (EE) becomes an important design criterion because it guarantees sustainable evolution. In this regard, the massive multiple-input multiple-output (MIMO) technology, where the base stations (BSs) are equipped with a large number of antennas so as to achieve multiple orders of spectral and energy efficiency gains, will be a key technology enabler for 5G. In this article, we present a comprehensive discussion on state-of-the-art techniques which further enhance the EE gains offered by massive MIMO (MM). We begin with an overview of MM systems and discuss how realistic power consumption models can be developed for these systems. Thereby, we discuss and identify few shortcomings of some of the most prominent EE-maximization techniques present in the current literature. Then, we discuss "hybrid MM systems" operating in a 5G architecture, where MM operates in conjunction with other potential technology enablers, such as millimetre wave, heterogenous networks, and energy harvesting networks. Multiple opportunities and challenges arise in such a 5G architecture because these technologies benefit mutually from each other and their coexistence introduces several new constraints on the design of energy-efficient systems. Despite clear evidence that hybrid MM systems can achieve significantly higher EE gains than conventional MM systems, several open research problems continue to roadblock system designers from fully harnessing the EE gains offered by hybrid MM systems. Our discussions lead to the conclusion that hybrid MM systems offer a sustainable evolution towards 5G networks and are therefore an important research topic for future work.

cs.NI↗

Virtualization of 5G Cellular Networks as a Hierarchical Combinatorial Auction

Virtualization has been seen as one of the main evolution trends in the forthcoming fifth generation (5G) cellular networks which enables the decoupling of infrastructure from the services it provides. In this case, the roles of infrastructure providers (InPs) and mobile virtual network operators (MVNOs) can be logically separated and the resources (e.g., subchannels, power, and antennas) of a base station owned by an InP can be transparently shared by multiple MVNOs, while each MVNO virtually owns the entire BS. Naturally, the issue of resource allocation arises. In particular, the InP is required to abstract the physical resources into isolated slices for each MVNO who then allocates the resources within the slice to its subscribed users. In this paper, we aim to address this two-level hierarchical resource allocation problem while satisfying the requirements of efficient resource allocation, strict inter-slice isolation, and the ability of intra-slice customization. To this end, we design a hierarchical combinatorial auction mechanism, based on which a truthful and sub-efficient resource allocation framework is provided. Specifically, winner determination problems (WDPs) are formulated for the InP and MVNOs, and computationally tractable algorithms are proposed to solve these WDPs. Also, pricing schemes are designed to ensure incentive compatibility. The designed mechanism can achieve social efficiency in each level even if each party involved acts selfishly. Numerical results show the effectiveness of the proposed scheme.

cs.GT↗

Low-Complexity SINR Feasibility Checking and Joint Power and Admission Control in Prioritized Multi-tier Cellular Networks

Next generation cellular networks will consist of multiple tiers of cells and users associated with different network tiers may have different priorities (e.g., macrocell-picocell-femtocell networks with macro tier prioritized over pico tier, which is again prioritized over femto tier). Designing efficient joint power and admission control (JPAC) algorithms for such networks under a co-channel deployment (i.e., underlay) scenario is of significant importance. Feasibility checking of a given target signal-to-noise-plus-interference ratio (SINR) vector is generally the most significant contributor to the complexity of JPAC algorithms in single/multi-tier underlay cellular networks. This is generally accomplished through iterative strategies whose complexity is either unpredictable or of O(M^3), when the well-known relationship between the SINR vector and the power vector is used, where $M$ is the number of users/links. In this paper, we derive a novel relationship between a given SINR vector and its corresponding uplink/downlink power vector based on which the feasibility checking can be performed with a complexity of O(B^3+M B), where B is the number of base stations. This is significantly less compared to O(M^3) in many cellular wireless networks since the number of base stations is generally much lower than the number of users/links in such networks. The developed novel relationship between the SINR and power vector not only substantially reduces the complexity of designing JPAC algorithms, but also provides insights into developing efficient but low-complexity power update strategies for prioritized multi-tier cellular networks. We propose two such algorithms and through simulations, we show that our proposed algorithms outperform the existing ones in prioritized cellular networks.

cs.NI↗

On Characterization of Feasible Interference Regions in Cognitive Radio Networks

In the state-of-the-art interference management schemes for underlay CRNs, it is considered that all PUs are protected if the cognitive interference for each primary receiving-point is lower than a maximum threshold, the so called interference temperature limit (ITL) for the corresponding receiving-point. This is assumed to be fixed and independent of ITL values for other primary receiving-points, which corresponds to a box-like FCIR. In this paper, we characterize the FCIR for {\em uplink} transmissions in cellular CRNs and for direct transmissions in ad-hoc CRNs. We show that the FCIR is in fact a polyhedron (i.e., the maximum feasible cognitive interference threshold for each primary receiving-point is not a constant, and it depends on that for the other primary receiving-points). Therefore, in practical interference management algorithms, it is not proper to consider a constant and independent ITL value for each of the primary receiving-points. This finding would significantly affect the design of practical interference management schemes for CRNs. To demonstrate this, based on the characterized FCIR, we propose two power control algorithms to find the maximum number of admitted SUs and the maximum aggregate throughput of the SUs in infeasible and feasible CRNs, respectively. For two distinct objectives, our proposed interference management schemes outperform the existing ones.

cs.NI↗

Distributed User Association in Energy Harvesting Small Cell Networks: A Competitive Market Model with Uncertainty

We consider a distributed user association problem in the downlink of a small cell network, where small cells obtain the required energy for providing wireless services to users through ambient energy harvesting. Since energy harvesting is opportunistic in nature, the amount of harvested energy is a random variable, without a priori known characteristics. We model the network as a competitive market with uncertainty, where self-interested small cells, modeled as consumers, are willing to maximize their utility scores by selecting users, represented by commodities. The utility scores of small cells depend on the amount of harvested energy, formulated as natures' state. Under this model, the problem is to assign users to small cells, so that the aggregate network utility is maximized. The solution is the general equilibrium under uncertainty, also called Arrow-Debreu equilibrium. We show that in our setting, such equilibrium not only exists, but also is unique and is Pareto optimal in the sense of expected aggregate network utility. We use the Walras' tatonnement process with some modifications in order to implement the equilibrium efficiently.

cs.GT↗

Downlink Power Control in Two-Tier Cellular Networks with Energy-Harvesting Small Cells as Stochastic Games

Energy harvesting in cellular networks is an emerging technique to enhance the sustainability of power-constrained wireless devices. This paper considers the co-channel deployment of a macrocell overlaid with small cells. The small cell base stations (SBSs) harvest energy from environmental sources whereas the macrocell base station (MBS) uses conventional power supply. Given a stochastic energy arrival process for the SBSs, we derive a power control policy for the downlink transmission of both MBS and SBSs such that they can achieve their objectives (e.g., maintain the signal-to-interference-plus-noise ratio (SINR) at an acceptable level) on a given transmission channel. We consider a centralized energy harvesting mechanism for SBSs, i.e., there is a central energy storage (CES) where energy is harvested and then distributed to the SBSs. When the number of SBSs is small, the game between the CES and the MBS is modeled as a single-controller stochastic game and the equilibrium policies are obtained as a solution of a quadratic programming problem. However, when the number of SBSs tends to infinity (i.e., a highly dense network), the centralized scheme becomes infeasible, and therefore, we use a mean field stochastic game to obtain a distributed power control policy for each SBS. By solving a system of partial differential equations, we derive the power control policy of SBSs given the knowledge of mean field distribution and the available harvested energy levels in the batteries of the SBSs.

cs.NI↗

Saddle Point Approximation for Outage Probability Using Cumulant Generating Functions

This letter proposes the use of saddle point approximation (SPA) to evaluate the outage probability of wireless cellular networks. Unlike traditional numerical integration-based approaches, the SPA approach relies on cumulant generating functions (CGFs) and eliminates the need for explicit numerical integration. The approach is generic and can be applied to a wide variety of distributions, given that their CGFs exist. We illustrate the usefulness of SPA on channel fading distributions such as Nakagami-$m$, Nakagami-$q$ (Hoyt), and Rician distributions. Numerical results validate the accuracy of the proposed SPA approach.

cs.IT↗

Integral Approximations for Coverage Probability

This letter gives approximations to an integral appearing in the formula for downlink coverage probability of a typical user in Poisson point process (PPP) based stochastic geometry frameworks of the form $\int_0^\infty \exp\{ - (Ax + B x^{α/2}) \} \ud x$. Four different approximations are studied. For systems that are interference-limited or noise-limited, conditions are identified when the approximations are valid. For intermediate cases, we recommend the use of Laplace approximation. Numerical results validate the accuracy of the approximations.

cs.IT↗

Multi-armed Bandits with Application to 5G Small Cells

Due to the pervasive demand for mobile services, next generation wireless networks are expected to be able to deliver high date rates while wireless resources become more and more scarce. This requires the next generation wireless networks to move towards new networking paradigms that are able to efficiently support resource-demanding applications such as personalized mobile services. Examples of such paradigms foreseen for the emerging fifth generation (5G) cellular networks include very densely deployed small cells and device-to-device communications. For 5G networks, it will be imperative to search for spectrum and energy-efficient solutions to the resource allocation problems that i) are amenable to distributed implementation, ii) are capable of dealing with uncertainty and lack of information, and iii) can cope with users' selfishness. The core objective of this article is to investigate and to establish the potential of multi-armed bandit (MAB) framework to address this challenge. In particular, we provide a brief tutorial on bandit problems, including different variations and solution approaches. Furthermore, we discuss recent applications as well as future research directions. In addition, we provide a detailed example of using an MAB model for energy-efficient small cell planning in 5G networks.

cs.LG↗

Distributed Resource Allocation for Relay-Aided Device-to-Device Communication Under Channel Uncertainties: A Stable Matching Approach

Wireless device-to-device (D2D) communication underlaying cellular network is a promising concept to improve user experience and resource utilization. Unlike traditional D2D communication where two mobile devices in the proximity establish a direct local link bypassing the base station, in this work we focus on relay-aided D2D communication. Relay-aided transmission could enhance the performance of D2D communication when D2D user equipments (UEs) are far apart from each other and/or the quality of D2D link is not good enough for direct communication. Considering the uncertainties in wireless links, we model and analyze the performance of a relay-aided D2D communication network, where the relay nodes serve both the cellular and D2D users. In particular, we formulate the radio resource allocation problem in a two-hop network to guarantee the data rate of the UEs while protecting other receiving nodes from interference. Utilizing time sharing strategy, we provide a centralized solution under bounded channel uncertainty. With a view to reducing the computational burden at relay nodes, we propose a distributed solution approach using stable matching to allocate radio resources in an efficient and computationally inexpensive way. Numerical results show that the performance of the proposed method is close to the centralized optimal solution and there is a distance margin beyond which relaying of D2D traffic improves network performance.

cs.NI↗

Cognitive and Energy Harvesting-Based D2D Communication in Cellular Networks: Stochastic Geometry Modeling and Analysis

While cognitive radio enables spectrum-efficient wireless communication, radio frequency (RF) energy harvesting from ambient interference is an enabler for energy-efficient wireless communication. In this paper, we model and analyze cognitive and energy harvesting-based D2D communication in cellular networks. The cognitive D2D transmitters harvest energy from ambient interference and use one of the channels allocated to cellular users (in uplink or downlink), which is referred to as the D2D channel, to communicate with the corresponding receivers. We investigate two spectrum access policies for cellular communication in the uplink or downlink, namely, random spectrum access (RSA) policy and prioritized spectrum access (PSA) policy. In RSA, any of the available channels including the channel used by the D2D transmitters can be selected randomly for cellular communication, while in PSA the D2D channel is used only when all of the other channels are occupied. A D2D transmitter can communicate successfully with its receiver only when it harvests enough energy to perform channel inversion toward the receiver, the D2D channel is free, and the $\mathsf{SINR}$ at the receiver is above the required threshold; otherwise, an outage occurs for the D2D communication. We use tools from stochastic geometry to evaluate the performance of the proposed communication system model with general path-loss exponent in terms of outage probability for D2D and cellular users. We show that energy harvesting can be a reliable alternative to power cognitive D2D transmitters while achieving acceptable performance. Under the same $\mathsf{SINR}$ outage requirements as for the non-cognitive case, cognitive channel access improves the outage probability for D2D users for both the spectrum access policies.

cs.NI↗

5G Cellular: Key Enabling Technologies and Research Challenges

The evolving fifth generation (5G) cellular wireless networks are envisioned to provide higher data rates, enhanced end-user quality-of-experience (QoE), reduced end-to-end latency, and lower energy consumption. This article presents several emerging technologies, which will enable and define the 5G mobile communications standards. The major research problems, which these new technologies breed, as well as the measurement and test challenges for 5G systems are also highlighted.

cs.NI↗

Distributed Resource Allocation in D2D-Enabled Multi-tier Cellular Networks: An Auction Approach

Future wireless networks are expected to be highly heterogeneous with the co-existence of macrocells and small cells as well as provide support for device-to-device (D2D) communication. In such muti-tier heterogeneous systems centralized radio resource allocation and interference management schemes will not be scalable. In this work, we propose an auction-based distributed solution to allocate radio resources in a muti-tier heterogeneous network. We provide the bound of achievable data rate and show that the complexity of the proposed scheme is linear with number of transmitter nodes and the available resources. The signaling issues (e.g., information exchange over control channels) for the proposed distributed solution is also discussed. Numerical results show the effectiveness of proposed solution in comparison with a centralized resource allocation scheme.

cs.NI↗