arXiv subjects

Halim Yanikomeroglu

Publications and source records attributed to Halim Yanikomeroglu.

300 records · Page 17Linked to original sources

arXiv2016

A Novel Multiobjective Cell Switch-Off Framework for Cellular Networks

Cell Switch-Off (CSO) is recognized as a promising approach to reduce the energy consumption in next-generation cellular networks. However, CSO poses serious challenges not only from the resource allocation perspective but also from the implementation point of view. Indeed, CSO represents a difficult optimization problem due to its NP-complete nature. Moreover, there are a number of important practical limitations in the implementation of CSO schemes, such as the need for minimizing the real-time complexity and the number of on-off/off-on transitions and CSO-induced handovers. This article introduces a novel approach to CSO based on multiobjective optimization that makes use of the statistical description of the service demand (known by operators). In addition, downlink and uplink coverage criteria are included and a comparative analysis between different models to characterize intercell interference is also presented to shed light on their impact on CSO. The framework distinguishes itself from other proposals in two ways: 1) The number of on-off/off-on transitions as well as handovers are minimized, and 2) the computationally-heavy part of the algorithm is executed offline, which makes its implementation feasible. The results show that the proposed scheme achieves substantial energy savings in small cell deployments where service demand is not uniformly distributed, without compromising the Quality-of-Service (QoS) or requiring heavy real-time processing.

cs.NI↗

arXiv2016

Device-to-Device Communication Underlaying a Finite Cellular Network Region

Underlay in-band device-to-device (D2D) communication can improve the spectrum efficiency of cellular networks. However, the coexistence of D2D and cellular users causes inter-cell and intra-cell interference. The former can be effectively managed through inter-cell interference coordination and, therefore, is not considered in this work. Instead, we focus on the intra-cell interference and propose a D2D mode selection scheme to manage it inside a finite cellular network region. The potential D2D users are controlled by the base station (BS) to operate in D2D mode based on the average interference generated to the BS. Using stochastic geometry, we study the outage probability experienced at the BS and a D2D receiver, and spectrum reuse ratio, which quantifies the average fraction of successfully transmitting D2D users. The analysis shows that the outage probability at the D2D receiver varies for different locations. Additionally, without impairing the performance at the BS, if the path-loss exponent on the cellular link is slightly lower than that on the D2D link, the spectrum reuse ratio can have negligible decrease while the D2D users' average number of successful transmissions increases with increasing D2D node density. This indicates that an increasing level of D2D communication can be beneficial in future networks..

cs.IT↗

arXiv2016

The New Frontier in RAN Heterogeneity: Multi-tier Drone-Cells

In cellular networks, the locations of the radio access network (RAN) elements are determined mainly based on the long-term traffic behaviour. However, when the random and hard-to-predict spatio-temporal distribution of the traffic (load,demand) does not fully match the fixed locations of the RAN elements (supply), some performance degradation becomes inevitable. The concept of multi-tier cells (heterogeneous networks, HetNets) has been introduced in 4G networks to alleviate this mismatch. However, as the traffic distribution deviates more and more from the long-term average, even the HetNet architecture will have difficulty in coping up with the erratic supply-demand mismatch, unless the RAN is grossly over-engineered (which is a financially non-viable solution). In this article, we study the opportunistic utilization of low-altitude unmanned aerial platforms equipped with base stations (BSs), i.e., drone-BSs, in 5G networks. In particular, we envisage a multi-tier drone-cell network complementing the terrestrial HetNets. The variety of equipment, and non-rigid placement options allow utilizing multitier drone-cell networks to serve diversified demands. Hence, drone-cells bring the supply to where the demand is, which sets new frontiers for the heterogeneity in 5G networks. We investigate the advancements promised by drone-cells, and discuss the challenges associated with their operation and management. We propose a drone-cell management framework (DMF) benefiting from the synergy among software defined networking (SDN), network functions virtualization (NFV), and cloud-computing. We demonstrate DMF mechanisms via a case study, and numerically show that it can reduce the cost of utilizing drone-cells in multitenancy cellular networks.

cs.NI↗

arXiv2016

Efficient 3-D Placement of an Aerial Base Station in Next Generation Cellular Networks

Agility and resilience requirements of future cellular networks may not be fully satisfied by terrestrial base stations in cases of unexpected or temporary events. A promising solution is assisting the cellular network via low-altitude unmanned aerial vehicles equipped with base stations, i.e., drone-cells. Although drone-cells provide a quick deployment opportunity as aerial base stations, efficient placement becomes one of the key issues. In addition to mobility of the drone-cells in the vertical dimension as well as the horizontal dimension, the differences between the air-to-ground and terrestrial channels cause the placement of the drone-cells to diverge from placement of terrestrial base stations. In this paper, we first highlight the properties of the dronecell placement problem, and formulate it as a 3-D placement problem with the objective of maximizing the revenue of the network. After some mathematical manipulations, we formulate an equivalent quadratically-constrained mixed integer non-linear optimization problem and propose a computationally efficient numerical solution for this problem. We verify our analytical derivations with numerical simulations and enrich them with discussions which could serve as guidelines for researchers, mobile network operators, and policy makers.

math.OC↗

arXiv2015

Optimum Transmission Through the Multiple-Antenna Gaussian Multiple Access Channel

This paper studies the optimal points in the capacity region of Gaussian multiple access channels (GMACs) with constant fading, multiple antennas and various power constraints. The points of interest maximize general rate objectives that arise in practical communication scenarios. Achieving these points constitutes the task of jointly optimizing the time-sharing parameters, the input covariance matrices and the order of decoding used by the successive interference cancellation receiver. To approach this problem, Carathéodory's theorem is invoked to represent time-sharing and decoding orders jointly as a finite-dimensional matrix variable. This variable enables us to use variational inequalities to extend results pertaining to problems with linear rate objectives to more general, potentially nonconvex, problems, and to obtain a necessary and sufficient condition for the optimality of the transmission parameters in a wide range of problems. Using the insights gained from this condition, we develop and analyze the convergence of an algorithm for solving, otherwise daunting, GMAC-based optimization problems.

cs.IT↗

arXiv2015

Generalized Cross-Layer Designs for Generic Half-Duplex Multicarrier Wireless Networks with Frequency-Reuse

In this paper, joint designs of data routes and resource allocations are developed for generic half-duplex multicarrier wireless networks in which each subcarrier can be reused by multiple links. Two instances are considered. The first instance pertains to the general case in which each subcarrier can be timeshared by multiple links, whereas the second instance pertains to a special case in which time-sharing is not allowed and a subcarrier, once assigned to a set of links, is used by those links throughout the signalling interval. Novel frameworks are developed to optimize the joint design of data routes, subcarrier schedules and power allocations. These design problems are nonconvex and hence difficult to solve. To circumvent this difficulty, efficient techniques based on geometric programming are developed to obtain locally optimal solutions. Numerical results show that the designs developed in both instances yield performance that is superior to that of their counterparts in which frequency-reuse is not allowed.

cs.NI↗

arXiv2015

HetHetNets: Heterogeneous Traffic Distribution in Heterogeneous Wireless Cellular Networks

A recent approach in modeling and analysis of the supply and demand in heterogeneous wireless cellular networks has been the use of two independent Poisson point processes (PPPs) for the locations of base stations (BSs) and user equipments (UEs). This popular approach has two major shortcomings. First, although the PPP model may be a fitting one for the BS locations, it is less adequate for the UE locations mainly due to the fact that the model is not adjustable (tunable) to represent the severity of the heterogeneity (non-uniformity) in the UE locations. Besides, the independence assumption between the two PPPs does not capture the often-observed correlation between the UE and BS locations. This paper presents a novel heterogeneous spatial traffic modeling which allows statistical adjustment. Simple and non-parameterized, yet sufficiently accurate, measures for capturing the traffic characteristics in space are introduced. Only two statistical parameters related to the UE distribution, namely, the coefficient of variation (the normalized second-moment), of an appropriately defined inter-UE distance measure, and correlation coefficient (the normalized cross-moment) between UE and BS locations, are adjusted to control the degree of heterogeneity and the bias towards the BS locations, respectively. This model is used in heterogeneous wireless cellular networks (HetNets) to demonstrate the impact of heterogeneous and BS-correlated traffic on the network performance. This network is called HetHetNet since it has two types of heterogeneity: heterogeneity in the infrastructure (supply), and heterogeneity in the spatial traffic distribution (demand).

cs.NI↗

arXiv2014

Optimized Distributed Inter-cell Interference Coordination (ICIC) Scheme using Projected Subgradient and Network Flow Optimization

In this paper, we tackle the problem of multi-cell resource scheduling, where the objective is to maximize the weighted sum-rate through inter-cell interference coordination (ICIC). The blanking method is used to mitigate the inter-cell interference, where a resource is either used with a predetermined transmit power or not used at all, i.e., blanked. This problem is known to be strongly NP-hard, which means that it is not only hard to solve in polynomial time, but it is also hard to find an approximation algorithm with guaranteed optimality gap. In this work, we identify special scenarios where a polynomial-time algorithm can be constructed to solve this problem with theoretical guarantees. In particular, we define a dominant interference environment, in which for each user the received power from each interferer is significantly greater than the aggregate received power from all other weaker interferers. We show that the strongly NP-hard problem can be tightly relaxed to a linear programming problem in a dominant interference environment. Consequently, we propose a polynomial-time distributed algorithm that is based on the primal-decomposition, the projected-subgradient, and the network flow optimization methods. In comparison with baseline schemes, simulation results show that the proposed scheme achieves higher gains in aggregate throughput, cell-edge throughput, and outage probability.

cs.NI↗

arXiv2012

Separating the Effect of Independent Interference Sources with Rayleigh Faded Signal Link: Outage Analysis and Applications

We show that, for independent interfering sources and a signal link with exponentially distributed received power, the total probability of outage can be decomposed as a simple expression of the outages from the individual interfering sources. We give a mathematical proof of this result, and discuss some immediate implications, showing how it results in important simplifications to statistical outage analysis. We also discuss its application to two active topics of study: spectrum sharing, and sum of interference powers (e.g., lognormal) analysis.

cs.NI↗

arXiv2010

A New Formula for the BER of Binary Modulations with Dual-Branch Selection over Generalized-K Composite Fading Channels

Error performance is one of the main performance measures and derivation of its closed-form expression has proved to be quite involved for certain systems. In this letter, a unified closed-form expression, applicable to different binary modulation schemes, for the bit error rate of dual-branch selection diversity based systems undergoing independent but not necessarily identically distributed generalized-K fading is derived in terms of the extended generalized bivariate Meijer G-function.

cs.IT↗

arXiv2008

On the Performance of Selection Relaying

Interest in selection relaying is growing. The recent developments in this area have largely focused on information theoretic analyses such as outage performance. Some of these analyses are accurate only at high SNR regimes. In this paper error rate analyses that are sufficiently accurate over a wide range of SNR regimes are provided. The motivations for this work are that practical systems operate at far lower SNR values than those supported by the high SNR analysis. To enable designers to make informed decisions regarding network design and deployment, it is imperative that system performance is evaluated with a reasonable degree of accuracy over practical SNR regimes. Simulations have been used to corroborate the analytical results, as close agreement between the two is observed.

cs.IT↗

arXiv2008

A Simple Distributed Antenna Processing Scheme for Cooperative Diversity

In this letter the performance of multiple relay channels is analyzed for the situation in which multiple antennas are deployed only at the relays. The simple repetition-coded decodeand- forward protocol with two different antenna processing techniques at the relays is investigated. The antenna combining techniques are maximum ratio combining (MRC) for reception and transmit beamforming (TB) for transmission. It is shown that these distributed antenna combining techniques can exploit the full spatial diversity of the relay channels regardless of the number of relays and antennas at each relay, and offer significant power gain over distributed space-time coding techniques.

cs.IT↗