arXiv subjects

Halim Yanikomeroglu

Publications and source records attributed to Halim Yanikomeroglu.

At least 289 records · Page 16Linked to original sources

arXiv2018

Underlay Drone Cell for Temporary Events: Impact of Drone Height and Aerial Channel Environments

Providing seamless connection to a large number of devices is one of the biggest challenges for the Internet of Things (IoT) networks. Using a drone as an aerial base station (ABS) to provide coverage to devices or users on ground is envisaged as a promising solution for IoT networks. In this paper, we consider a communication network with an underlay ABS to provide coverage for a temporary event, such as a sporting event or a concert in a stadium. Using stochastic geometry, we propose a general analytical framework to compute the uplink and downlink coverage probabilities for both the aerial and the terrestrial cellular system. Our framework is valid for any aerial channel model for which the probabilistic functions of line-of-sight (LOS) and non-line-of-sight (NLOS) links are specified. The accuracy of the analytical results is verified by Monte Carlo simulations considering two commonly adopted aerial channel models. Our results show the non-trivial impact of the different aerial channel environments (i.e., suburban, urban, dense urban and high-rise urban) on the uplink and downlink coverage probabilities and provide design guidelines for best ABS deployment height.

cs.IT↗

arXiv2018

When IoT Keeps People in the Loop: A Path Towards a New Global Utility

While the Internet of Things (IoT) has made significant progress along the lines of supporting individual machine-type applications, it is only recently that the importance of people as an integral component of the overall IoT infrastructure has started to be fully recognized. Several powerful concepts have emerged to facilitate this vision, whether involving the human context whenever required or directly impacting user behavior and decisions. As these become the stepping stones to develop the IoT into a novel people-centric utility, this paper outlines a path to materialize this decisive transformation. We begin by reviewing the latest progress in human-aware wireless networking, then classify the attractive human-machine applications and summarize the enabling IoT radio technologies. We continue with a unique system-level performance characterization of a representative urban IoT scenario and quantify the benefits of keeping people in the loop on various levels. Our comprehensive numerical results confirm the significant gains that have been made available with tighter user involvement, and also corroborate the development of efficient incentivization mechanisms, thereby opening the door to future commoditization of the global people-centric IoT utility.

cs.NI↗

arXiv2018

Spatial Configuration of Agile Wireless Networks with Drone-BSs and User-in-the-loop

Agile networking can reduce over-engineering, costs, and energy waste. Towards that end, it is vital to exploit all degrees of freedom of wireless networks efficiently, so that service quality is not sacrificed. In order to reap the benefits of flexible networking, we propose a spatial network configuration scheme (SNC), which can result in efficient networking; both from the perspective of network capacity, and profitability. First, SNC utilizes the drone-base-stations (drone-BSs) to configure access points. Drone-BSs are shifting paradigms of heterogeneous wireless networks by providing radically flexible deployment opportunities. On the other hand, their limited endurance and potential high cost increase the importance of utilizing drone-BSs efficiently. Therefore, secondly, user mobility is exploited via user-in-the-loop (UIL), which aims at influencing users' mobility by offering incentives. The proposed uncoordinated SNC is a computationally efficient method, yet, it may be insufficient to exploit the synergy between drone-BSs and UIL. Hence, we propose joint SNC, which increases the performance gain along with the computational cost. Finally, semi-joint SNC combines benefits of joint SNC, with computational efficiency. Numerical results show that semi-joint SNC is two orders of magnitude times faster than joint SNC, and more than 15 percent profit can be obtained compared to conventional systems.

cs.NI↗

arXiv2018

Uplink Coverage Performance of an Underlay Drone Cell for Temporary Events

Using a drone as an aerial base station (ABS) to provide coverage to users on the ground is envisaged as a promising solution for beyond fifth generation (beyond-5G) wireless networks. While the literature to date has examined downlink cellular networks with ABSs, we consider an uplink cellular network with an ABS. Specifically, we analyze the use of an underlay ABS to provide coverage for a temporary event, such as a sporting event or a concert in a stadium. Using stochastic geometry, we derive the analytical expressions for the uplink coverage probability of the terrestrial base station (TBS) and the ABS. The results are expressed in terms of (i) the Laplace transforms of the interference power distribution at the TBS and the ABS and (ii) the distance distribution between the ABS and an independently and uniformly distributed (i.u.d.) ABS-supported user equipment and between the ABS and an i.u.d. TBS-supported user equipment. The accuracy of the analytical results is verified by Monte Carlo simulations. Our results show that varying the ABS height leads to a trade-off between the uplink coverage probability of the TBS and the ABS. In addition, assuming a quality of service of 90% at the TBS, an uplink coverage probability of the ABS of over 85% can be achieved, with the ABS deployed at or below its optimal height of typically between 250-500 m for the considered setup.

cs.IT↗

arXiv2018

On the Number and 3D Placement of Drone Base Stations in Wireless Cellular Networks

Using drone base stations (drone-BSs) in wireless networks has started attracting attention. Drone-BSs can assist the ground BSs in both capacity and coverage enhancement. One of the important problems about integrating drone-BSs to cellular networks is the management of their placement to satisfy the dynamic system requirements. In this paper, we propose a method to find the positions of drone-BSs in an area with different user densities using a heuristic algorithm. The goal is to find the minimum number of drone-BSs and their 3D placement so that all the users are served. Our simulation results show that the proposed approach can satisfy the quality-of-service requirements of the network.

cs.NI↗

arXiv2018

Efficient 3D Aerial Base Station Placement Considering Users Mobility by Reinforcement Learning

This paper considers an aerial base station (aerial-BS) assisted terrestrial network where user mobility is taken into account. User movement changes the network dynamically which may result in performance loss. To avoid this loss, guarantee a minimum quality-of-service (QoS) and possibly increase the QoS, we add an aerial-BS to the network. For a fair comparison between the conventional terrestrial network and the aerial-BS assisted one, we keep the total number of BSs identical in both networks. Obtaining the best performance in such networks highly depends on the optimal placement of the aerial-BS. To this end, an algorithm which can rely on general and realistic assumptions and can decide where to go based on the past experiences is required. The proposed approach for this goal is based on a discounted reward reinforcement learning which is known as Q-learning. Simulation results show this method provides an effective placement strategy which increases the QoS of wireless networks when it is needed and promises to find the optimum position of the aerial-BS in discrete environments.

cs.NI↗

arXiv2018

Performance Analysis of Low Latency Multiple Full-Duplex Selective Decode and Forward Relays

In order to follow up with mission-critical applications, new features need to be carried to satisfy a reliable communication with reduced latency. With this regard, this paper proposes a low latency cooperative transmission scheme, where multiple full-duplex relays, simultaneously, assist the communication between a source node and a destination node. First, we present the communication model of the proposed transmission scheme. Then, we derive the outage probability closed-form for two cases: asynchronous transmission (where all relays have different processing delay) and synchronous transmissions (where all relays have the same processing delay). Finally, using simulations, we confirm the theoretical results and compare the proposed multi-relays transmission scheme with relay selection schemes.

cs.IT↗

arXiv2017

Design of Non-orthogonal Multiple Access Enhanced Backscatter Communication

Backscatter communication (BackCom), which allows a backscatter node (BN) to communicate with the reader by modulating and reflecting the incident continuous wave from the reader, is considered as a promising solution to power the future Internet-of-Things. In this paper, we consider a single BackCom system, where multiple BNs are served by a reader. We propose to use the power-domain non-orthogonal multiple access (NOMA), i.e., multiplexing the BNs in different regions or with different backscattered power levels, to enhance the spectrum efficiency of the BackCom system. To better exploit power-domain NOMA, we propose to set the reflection coefficients for multiplexed BNs to be different. Based on this considered model, we develop the reflection coefficient selection criteria. To illustrate the enhanced system with the proposed criteria, we analyze the performance of BackCom system in terms of the average number of bits that can be successfully decoded by the reader for two-node pairing case and the average number of successful BNs for the general multiplexing case. Our results shows that NOMA achieves much better performance gain in the BackCom system as compared to its performance gain in the conventional system, which highlights the importance of applying NOMA to the BackCom system.

cs.IT↗

arXiv2017

User Association and Bandwidth Allocation for Terrestrial and Aerial Base Stations with Backhaul Considerations

Drone base stations (DBSs) can enhance network coverage and area capacity by moving supply towards demand when required. This degree of freedom could be especially useful for future applications with extreme demands, such as ultra reliable and low latency communications (uRLLC). However, deployment of DBSs can face several challenges. One issue is finding the 3D placement of such BSs to satisfy dynamic requirements of the system. Second, the availability of reliable wireless backhaul links and the related resource allocation are principal issues that should be considered. Finally, association of the users with BSs becomes an involved problem due to mobility of DBSs. In this paper, we consider a macro-BS (MBS) and several DBSs that rely on the wireless links to the MBS for backhauling. Considering regular and uRLLC users, we propose an algorithm to find efficient 3D locations of DBSs in addition to the user-BS associations and wireless backhaul bandwidth allocations to maximize the sum logarithmic rate of the users. To this end, a decomposition method is employed to first find the user-BS association and bandwidth allocations. Then DBS locations are updated using a heuristic particle swarm optimization algorithm. Simulation results show the effectiveness of the proposed method and provide useful insights on the effects of traffic distributions and antenna beamwidth.

cs.NI↗

arXiv2017

3D Placement of an Unmanned Aerial Vehicle Base Station for Maximum Coverage of Users with Different QoS Requirements

The need for a rapid-to-deploy solution for providing wireless cellular services can be realized by unmanned aerial vehicle base stations (UAV-BSs). To the best of our knowledge, this letter is the first in literature that studies a novel 3D UAV-BS placement that maximizes the number of covered users with different Quality-of-Service requirements. We model the placement problem as a multiple circles placement problem and propose an optimal placement algorithm that utilizes an exhaustive search (ES) over a one-dimensional parameter in a closed region. We also propose a low-complexity algorithm, namely, maximal weighted area (MWA) algorithm to tackle the placement problem. Numerical simulations are presented showing that the MWA algorithm performs very close to the ES algorithm with a significant complexity reduction.

cs.IT↗

arXiv2017

Enabling Sphere Decoding for SCMA

In this paper, we propose a reduced-complexity optimal modified sphere decoding (MSD) detection scheme for SCMA. As SCMA systems are characterized by a number of resource elements (REs) that are less than the number of the supported users, the channel matrix is rank-deficient, and sphere decoding (SD) cannot be directly applied. Inspired by the Tikhonov regularization, we formulate a new full-rank detection problem that it is equivalent to the original rank-deficient detection problem for constellation points with constant modulus and an important subset of non-constant modulus constellations. By exploiting the SCMA structure, the computational complexity of MSD is reduced compared with the conventional SD. We also employ list MSD to facilitate channel coding. Simulation results demonstrate that in uncoded SCMA systems the proposed MSD achieves the performance of the optimal maximum likelihood (ML) detection. Additionally, the proposed MSD benefits from a lower average complexity compared with MPA.

cs.IT↗

arXiv2017

Polar Codes for SCMA Systems

In this paper, we design and compare multilevel polar coding (MLPC) and bit-interleaved polar coded modulation (BIPCM) for uplink sparse code multiple access (SCMA) systems that operate over fast and block fading channels. Both successive cancellation (SC) and successive cancellation list (SCL) decoding algorithms are considered. Simulation results show that, with either decoder, BIPCM performs better than its MLPC counterpart. Also, both BIPCM and MLPC exhibit a performance advantage over LTE turbo-coded and WiMAX LDPC SCMA systems when the SCL technique is used for decoding.

cs.IT↗

arXiv2017

3D Placement of an Unmanned Aerial Vehicle Base Station (UAV-BS) for Energy-Efficient Maximal Coverage

Unmanned Aerial Vehicle mounted base stations (UAV-BSs) can provide wireless services in a variety of scenarios. In this letter, we propose an optimal placement algorithm for UAV-BSs that maximizes the number of covered users using the minimum transmit power. We decouple the UAV-BS deployment problem in the vertical and horizontal dimensions without any loss of optimality. Furthermore, we model the UAV-BS deployment in the horizontal dimension as a circle placement problem and a smallest enclosing circle problem. Simulations are conducted to evaluate the performance of the proposed method for different spatial distributions of the users.

cs.IT↗

arXiv2017

FSO-based Vertical Backhaul/Fronthaul Framework for 5G+ Wireless Networks

The presence of a super high rate, but also cost-efficient, easy-to-deploy, and scalable, backhaul/fronthaul framework is essential in the upcoming fifth-generation (5G) wireless networks \& beyond. Motivated by the mounting interest in the unmanned flying platforms of various types including unmanned aerial vehicles (UAVs), drones, balloons, and high-altitude/medium-altitude/low-altitude platforms (HAPs/MAPs/LAPs), which we refer to as the networked flying platforms (NFPs), for providing communications services and the recent advances in free-space optics (FSO), this article investigates the feasibility of a novel vertical backhaul/fronthaul framework where the NFPs transport the backhaul/fronthaul traffic between the access and core networks via point-to-point FSO links. The performance of the proposed innovative approach is investigated under different weather conditions and a broad range of system parameters. Simulation results demonstrate that the FSO-based vertical backhaul/fronthaul framework can offer data rates higher than the baseline alternatives, and thus can be considered as a promising solution to the emerging backhaul/fronthaul requirements of the 5G+ wireless networks, particularly in the presence of ultra-dense heterogeneous small cells. The paper also presents the challenges that accompany such a novel framework and provides some key ideas towards overcoming these challenges.

cs.NI↗

arXiv2017

Massive Machine Type Communication with Data Aggregation and Resource Scheduling

To enable massive machine type communication (mMTC), data aggregation is a promising approach to reduce the congestion caused by a massive number of machine type devices (MTDs). In this work, we consider a two-phase cellular-based mMTC network where MTDs transmit to aggregators (i.e., aggregation phase) and the aggregated data is then relayed to base stations (i.e., relaying phase). Due to the limited resources, the aggregators not only aggregate data, but also schedule resources among MTDs. We consider two scheduling schemes: random resource scheduling (RRS) and channel-aware resource scheduling (CRS). By leveraging the stochastic geometry, we present a tractable analytical framework to investigate the signal-to-interference ratio (SIR) for each phase, thereby computing the MTD success probability, the average number of successful MTDs and probability of successful channel utilization, which are the key metrics characterizing the overall mMTC performance. Our numerical results show that, although the CRS outperforms the RRS in terms of SIR at the aggregation phase, the simpler RRS has almost the same performance as the CRS for most cases with regards to the overall mMTC performance. Furthermore, the provision of more resources at the aggregation phase is not always beneficial to the mMTC performance.

cs.IT↗

arXiv2017

Backhaul-aware Robust 3D Drone Placement in 5G+ Wireless Networks

Using drones as flying base stations is a promising approach to enhance the network coverage and area capacity by moving supply towards demand when required. However deployment of such base stations can face some restrictions that need to be considered. One of the limitations in drone base stations (drone-BSs) deployment is the availability of reliable wireless backhaul link. This paper investigates how different types of wireless backhaul offering various data rates would affect the number of served users. Two approaches, namely, network-centric and user-centric, are introduced and the optimal 3D backhaul-aware placement of a drone-BS is found for each approach. To this end, the total number of served users and sum-rates are maximized in the network-centric and user-centric frameworks, respectively. Moreover, as it is preferred to decrease drone-BS movements to save more on battery and increase flight time and to reduce the channel variations, the robustness of the network is examined as how sensitive it is with respect to the users displacements.

cs.NI↗

arXiv2017

Reduced Complexity Optimal Detection of Binary Faster-than-Nyquist Signaling

In this paper, we investigate the detection problem of binary faster-than-Nyquist (FTN) signaling and propose a novel sequence estimation technique that exploits its special structure. In particular, the proposed sequence estimation technique is based on sphere decoding (SD) and exploits the following two characteristics about the FTN detection problem: 1) the cor- relation between the noise samples after the receiver matched filter, and 2) the structure of the intersymbol interference (ISI) matrix. Simulation results show that the proposed SD-based sequence estimation (SDSE) achieves the optimal performance of the maximum likelihood sequence estimation (MLSE) at reduced computational complexity. This paper demonstrates that FTN signaling has the great potential of increasing the data rate and spectral efficiency substantially, when compared to Nyquist signaling, for the same bit-error-rate (BER) and signal-to-noise ratio (SNR).

cs.IT↗

arXiv2017

A Very Low Complexity Successive Symbol-by-Symbol Sequence Estimator for Faster-than-Nyquist Signaling

In this paper, we investigate the sequence estimation problem of binary and quadrature phase shift keying faster-than-Nyquist (FTN) signaling and propose two novel low-complexity sequence estimation techniques based on concepts of successive interference cancellation. To the best of our knowledge, this is the first approach in the literature to detect FTN signaling on a symbol-by-symbol basis. In particular, based on the structure of the self-interference inherited in FTN signaling, we first find the operating region boundary---defined by the root-raised cosine (rRC) pulse shape, its roll-off factor, and the time acceleration parameter of the FTN signaling---where perfect estimation of the transmit data symbols on a symbol-by-symbol basis is guaranteed, assuming noise-free transmission. For noisy transmission, we then propose a novel low-complexity technique that works within the operating region and is capable of estimating the transmit data symbols on a symbol-by-symbol basis. To reduce the error propagation of the proposed successive symbol-by-symbol sequence estimator (SSSSE), we propose a successive symbol-by-symbol with go-back-$K$ sequence estimator (SSSgb$K$SE) that goes back to re-estimate up to $K$ symbols, and subsequently improves the estimation accuracy of the current data symbol. Simulation results show that the proposed sequence estimation techniques perform well for low intersymbol interference (ISI) scenarios and can significantly increase the data rate and spectral efficiency. Additionally, results reveal that choosing the value of $K$ as low as $2$ or $3$ data symbols is sufficient to significantly improve the bit-error-rate performance. Results also show that the performance of the proposed SSSgb$K$SE, with $K = 1$ or $2$, surpasses the performance of the lowest complexity equalizers reported in the literature, with reduced computational complexity.

cs.IT↗