arXiv subjects

Matti Latva-aho

Publications and source records attributed to Matti Latva-aho.

At least 127 records · Page 7Linked to original sources

arXiv2019

In-Band Pilot Overhead in Ultra-Reliable Low Latency Decode and Forward Relaying

In URLLC the performance of short message communications highly depends on the training sequence length due to the stringent latency and reliability requirements. In this paper, we study the performance of cooperative and non-cooperative transmissions under imperfect channel estimation and Rayleigh fading for URLLC. We assume a peak power constraint on pilot symbols in addition to the average power constraint which is used for comparison purposes. We obtain the optimal training length as a function of blocklength and power constraint factor to meet the URLLC requirements. Moreover, the simulation results show the impact of pilot overhead on reliability, latency, and goodput of cooperative communications compared to pointto-point transmission

cs.IT↗

arXiv2019

Performance of Non-orthogonal Multiple Access under Finite Blocklength

In this paper, we present a finite-block-length comparison between the orthogonal multiple access (OMA) scheme and the non-orthogonal multiple access (NOMA) for the uplink channel. First, we consider the Gaussian channel, and derive the closed form expressions for the rate and outage probability. Then, we extend our results to the quasi-static Rayleigh fading channel. Our analysis is based on the recent results on the characterization of the maximum coding rate at finite block-length and finite block-error probability. The overall system throughput is evaluated as a function of the number of information bits, channel uses and power. We find what would be the respective values of these different parameters that would enable throughput maximization. Furthermore, we analyze the system performance in terms of reliability and throughput when applying the type-I ARQ protocol with limited number of retransmissions. The throughput and outage probability are evaluated for different blocklengths and number of information bits. Our analysis reveals that there is a trade-off between reliability and throughput in the ARQ. While increasing the number of retransmissions boosts reliability by minimizing the probability of reception error, it results in more delay which decreases the throughput. Nevertheless, the results show that NOMA always outperforms OMA in terms of throughput, reliability and latency regardless of the users priority or the number of retransmissions in both Gaussian and fading channels.

cs.IT↗

arXiv2019

Effective Capacity and Power Allocation for Machine-Type Communication

Effective capacity (EC) determines the maximum communication rate subject to a particular delay constraint. In this work, we analyze the EC of ultra reliable Machine Type Communication (MTC) networks operating in the finite blocklength (FB) regime. First, we present a closed form approximation for EC in quasi-static Rayleigh fading channels. Our analysis determines the upper bounds for EC and delay constraint when varying transmission power. Finally, we characterize the power-delay trade-off for fixed EC and propose an optimum power allocation scheme which exploits the asymptotic behavior of EC in the high SNR regime. The results illustrate that the proposed scheme provides significant power saving with a negligible loss in EC.

cs.IT↗

arXiv2018

Network Slicing with Mobile Edge Computing for Micro-Operator Networks in Beyond 5G

We model the scenarios of network slicing allocation for the micro-operator (MO) network. The MO creates the slices "as a service" of wireless resource and then allocates these slices to multiple mobile network operators (MNOs). We propose the slice allocation problem of multiple MNOs with the goal of maximizing the social welfare of the network defined as sum rate of all MNOs. The many-to-one matching game framework is adopted to solve this problem. Then, the generic Markov Chain Monte Carlo (MCMC) method is introduced for the computation of game theoretical solution. After the MNOs obtain the slices, for each small cell base station (SBS), we investigate the role of power allocation using Q-learning and uniform power. We numerically show that the solution of the matching game leads to two-sided stable matching. Furthermore, for each MNO, we explore the problem of infrastructure cost minimization constrained on the latency at the user equipment (UE). The optimal solution is given by a greedy fractional knapsack algorithm. We illustrate that it is sufficient for the MNO to use a small fraction of the SBS to serve the UE while satisfying the latency constraint. For the problem of overall data rate maximization, we numerically show that the power allocation has significant effect on the social welfare of the system.

cs.IT↗

arXiv2018

Autonomous Driving without a Burden: View from Outside with Elevated LiDAR

The current autonomous driving architecture places a heavy burden in signal processing for the graphics processing units (GPUs) in the car. This directly translates into battery drain and lower energy efficiency, crucial factors in electric vehicles. This is due to the high bit rate of the captured video and other sensing inputs, mainly due to Light Detection and Ranging (LiDAR) sensor at the top of the car which is an essential feature in autonomous vehicles. LiDAR is needed to obtain a high precision map for the vehicle AI to make relevant decisions. However, this is still a quite restricted view from the car. This is the same even in the case of cars without a LiDAR such as Tesla. The existing LiDARs and the cameras have limited horizontal and vertical fields of visions. In all cases it can be argued that precision is lower, given the smaller map generated. This also results in the accumulation of a large amount of data in the order of several TBs in a day, the storage of which becomes challenging. If we are to reduce the effort for the processing units inside the car, we need to uplink the data to edge or an appropriately placed cloud. However, the required data rates in the order of several Gbps are difficult to be met even with the advent of 5G. Therefore, we propose to have a coordinated set of LiDAR's outside at an elevation which can provide an integrated view with a much larger field of vision (FoV) to a centralized decision making body which then sends the required control actions to the vehicles with a lower bit rate in the downlink and with the required latency. The calculations we have based on industry standard equipment from several manufacturers show that this is not just a concept but a feasible system which can be implemented.The proposed system can play a supportive role with existing autonomous vehicle architecture and it is easily applicable in an urban area.

cs.AI↗

arXiv2018

Resource Allocation for Co-Primary Spectrum Sharing in MIMO Networks

We study co-primary spectrum sharing concept in two small cell multiuser network. Downlink transmission is explored with Rayleigh fading in interfering broadcast channel. Both base stations and all the users are equipped with multiple antennas. Resource allocation with joint precoder and decoder design is proposed for weighted sum rate (WSR) maximization problem. The problem becomes mixed-integer and non-convex. We factor the main objective problem into two subproblems. First subproblem is multiuser with subcarrier allocation where we assume that each subcarrier can be allocated to multiple users. Gale-Shapley algorithm based on stable marriage problem and transportation method are implemented for subcarrier allocation part. For the second subproblem, a joint precoder and decoder design is proposed to obtain the optimal solution for WSR maximization. Monte Carlo simulation is employed to obtain the results.

cs.NI↗

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

Edge Caching for Cache Intensity under Probabilistic Delay Constraint

In order to reduce the latency of data delivery, one of techniques is to cache the popular contents at the base stations (BSs) i.e. edge caching. However, the technique of caching at edge can only reduce the backhaul delay, other techniques such as BS densification will also need to be considered to reduce the fronthaul delay. In this work, we study the trade-offs between BS densification and cache size under delay constraint at a typical user (UE). For this, we use the downlink SINR coverage probability and throughput obtained based on stochastic geometrical analysis. The network deployment of BS and cache storage is introduced as a minimization problem of the product of the BS intensity and cache size which we refer to the product of \tit{cache intensity}' under probabilistic delay constraint. We examine the cases when (i) either BS intensity or the cache size is held fixed, and (ii) when both BS intensity and the cache size are vary. For the case when both BS intensity and the cache size are variable, the problem become nonconvex and we convert into a geometric programing which we solve it analytically.

cs.IT↗

arXiv2018

Performance Analysis of Ultra-Reliable Short Message Decode and Forward Relaying Protocols

Machine-Type Communication (MTC) is a rapidly growing technology which covers a broad range of automated applications and propels the world into a fully connected society. Two new use cases of MTC are mMTC and URLLC, where mMTC support a large number of devices with high reliability and low rate connectivity while URLLC refers to excessively low outage probability under very stringent latency constraint. Herein, we examine the URLLC through three cooperative schemes, namely dual-hop DF, SC and MRC, and compare to direct transmission under Rayleigh fading. We compare the performance of studied cooperative protocols under two distinct power constraints with respect to latency and energy efficiency. Moreover, we illustrate the impact of coding rate on the probability of successful transmission in ultra-reliable region in addition to the effect of power allocation on the outage probability. We also provide the performance analysis of cooperative schemes in terms of energy efficiency and latency requirements.

cs.IT↗

arXiv2018

Optimum Transmission Rate in Fading Channels with Markovian Sources and QoS Constraints

This paper evaluates the performance of reliability and latency in machine type communication networks, which composed of single transmitter and receiver in the presence of Rayleigh fading channel. The source's traffic arrivals are modeled as Markovian processes namely Discrete-Time Markov process, Fluid Markov process, and Markov Modulated Poisson process, and delay/buffer overflow constraints are imposed. Our approach is based on the reliability and latency outage probability, where transmitter not knowing the channel condition, therefore the transmitter would be transmitting information over the fixed rate. The fixed rate transmission is modeled as a two state Discrete time Markov process, which identifies the reliability level of wireless transmission. Using effective bandwidth and effective capacity theories, we evaluate the trade-off between reliability-latency and identify QoS requirement. The impact of different source traffic originated from MTC devices under QoS constraints on the effective transmission rate are investigated.

cs.IT↗

arXiv2018

Statistical QoS provisioning for MTC Networks under Finite Blocklength

This paper analyzes the effective capacity of delay constrained machine type communication (MTC) networks operating in the finite blocklength regime. First, we derive a closed-form mathematical approximation for the effective capacity in quasi-static Rayleigh fading channels. We characterize the optimum error probability to maximize the concave effective capacity function with reliability constraint and study the effect of signal-to-interference-plus-noise ratio (SINR) variations for different delay constraints. The trade off between reliability and effective capacity maximization reveals that we can achieve higher reliability with limited sacrifice in effective capacity specially when the number of machines is small. Our analysis reveals that SINR variations have less impact on effective capacity for strict delay constrained networks. We present an exemplary scenario for massive MTC access to analyze the interference effect proposing three methods to restore the effective capacity for a certain node which are power control, graceful degradation of delay constraint and joint compensation. Joint compensation combines both power control and graceful degradation of delay constraint, where we perform maximization of an objective function whose parameters are determined according to delay and SINR priorities. Our results show that networks with stringent delay constraints favor power controlled compensation and compensation is generally performed at higher costs for shorter packets.

cs.IT↗

arXiv2018

Rate Control under Finite Blocklength for Downlink Cellular Networks with Reliability Constraints

Coming cellular systems are envisioned to open up to new services and applications with high reliability and low latency requirements. In this paper we focus on the rate allocation problem in downlink cellular networks with Rayleigh fading and stringent reliability constraints. We propose a rate control strategy to cope with those requirements making use only of topological characteristics of the scenario, the reliability constraint and the number of antennas that are available at the receiver side. Numerical results show the feasibility of the ultra-reliable operation when the number of antennas increases, and also that our results remain valid even when operating at short blocklength as far as the amount of information to be transmitted is not too small.

cs.NI↗

arXiv2018

On the Application of Network Slicing for 5G-V2X

Ultra-reliable vehicle-to-everything (V2X) communication is essential for enabling the next generation of intelligent vehicles. V2X communication refers to the exchange of information between vehicle and infrastructure (V2I) or between vehicles (V2V). Network slicing is one of the promising technologies for the next generation of connected devices, creating several logical networks on a common and programmable physical infrastructure. Following this idea, we propose a network slicing based communication model for vehicular networks. In this paper, we have modelled a multi-lane highway scenario with vehicles having heterogeneous traffic requirements. Autonomous driving slice (exchanges safety messages) and infotainment slice (provides video stream) are the two logical slices created on a common infrastructure. In addition, a relaying approach is utilized to improve the performance of low signal-to-interferenceplus-noise-ratio (SINR) video streaming vehicles. These low SINR vehicles are served by other infotainment vehicles, which have high quality V2V and V2I link and are not serving as autonomous driving slice access point. An extensive Long Term Evolution Advanced (LTE-A) system level simulator is used to evaluate the performance of the proposed method, in which it is shown that the proposed network slicing approach increases the packet reception ratio (PRR) from 31.15% to 99.47%.

cs.NI↗

arXiv2018

Path Selection and Rate Allocation in Self-Backhauled mmWave Networks

We investigate the problem of multi-hop scheduling in self-backhauled millimeter wave (mmWave) networks. Owing to the high path loss and blockage of mmWave links, multi-hop paths between the macro base station and the intended users via full-duplex small cells need to be carefully selected. This paper addresses the fundamental question: how to select the best paths and how to allocate rates over these paths subject to latency constraints. To answer this question, we propose a new system design, which factors in mmWave-specific channel variations and network dynamics. The problem is cast as a network utility maximization subject to a bounded delay constraint and network stability. The studied problem is decoupled into: (i) a path selection and (ii) rate allocation, whereby learning the best paths is done by means of a reinforcement learning algorithm, and the rate allocation is solved by applying the successive convex approximation method. Via numerical results, our approach ensures reliable communication with a guaranteed probability of 99.9999%, and reduces latency by 50.64% and 92.9% as compared to baselines.

cs.NI↗

arXiv2018

Aggregation and Resource Scheduling in Machine-type Communication Networks: A Stochastic Geometry Approach

Data aggregation is a promising approach to enable massive machine-type communication (mMTC). This paper focuses on the aggregation phase where a massive number of machine-type devices (MTDs) transmit to aggregators. By using non-orthogonal multiple access (NOMA) principles, we allow several MTDs to share the same orthogonal channel in our proposed hybrid access scheme. We develop an analytical framework based on stochastic geometry to investigate the system performance in terms of average success probability and average number of simultaneously served MTDs, under imperfect successive interference cancellation (SIC) at the aggregators, for two scheduling schemes: random resource scheduling (RRS) and channel-aware resource scheduling (CRS). We identify the power constraints on the MTDs sharing the same channel to attain a fair coexistence with purely orthogonal multiple access (OMA) setups, then power control coefficients are found so that these MTDs perform with similar reliability. We show that under high access demand, the hybrid scheme with CRS outperforms the OMA setup by simultaneously serving more MTDs with reduced power consumption.

cs.IT↗

arXiv2018

Hybrid Wired-Wireless Backhaul Solutions for Heterogeneous Ultra-Dense Networks

Wireless networks are becoming extremely pervasive while traffic demand is ever increasing. In order to cope with the forecast increase in traffic volume for the upcoming years, as well as the number of connected devices, new technologies, practices and spectrum rearrangements are required. In this context, a key question arises: how to provide extensive backhaul connectivity and capacity for pervasive ultra dense networks? The answer is rather complex, if feasible. To shed some light into this issue we overview potential technologies, either wired or wireless, and identify technical challenges. Moreover, we evaluate an illustrative scenario of a ultra-dense network that operates with hybrid wired-wireless backhaul. We assume multiple radio access technologies at small and macro base stations (BSs), and we discuss optimal traffic splitting and routing solutions for different topologies and traffic profiles.

cs.NI↗

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↗