Trade-off between power and bandwidth consumption in a reconfigurable xhaul network architecture

The increasing number of wireless devices, the high required traffic bandwidth, and power consumption will lead to a revolution of mobile access networks, which is not a simple evolution of traditional ones. Cloud radio access network technologies are seen as promising solution in order to deal with the heavy requirements defined for 5G mobile networks. The introduction of the common public radio interface (CPRI) technology allows for a centralization in BaseBand unit (BBU) of some access functions with advantages in terms of power consumption saving when switching off algorithms are implemented. Unfortunately, the advantages of the CPRI technology are to be paid with an increase in required bandwidth to carry the traffic between the BBU and the radio remote unit (RRU), in which only the radio functions are implemented. For this reason, a tradeoff solution between power and bandwidth consumption is proposed and evaluated. The proposed solution consists of: 1) handling the traffic generated by the users through both RRU and traditional radio base stations (RBS) and 2) carrying the traffic generated by the RRU and RBS (CPRI and Ethernet flows) with a reconfigurable network. The proposed solution is investigated under the lognormal spatial traffic distribution assumption. After proposing resource dimensioning analytical models validated by simulation, we show how the sum of the bandwidth and power consumption may be minimized with the deployment of a given percentage of RRU. For instance we show how in 5G traffic scenarios this percentage can vary from 30% to 50% according to total traffic amount handled by a switching node of the reconfigurable network

Inter-cell Interference Management Technique for Multi-Cell LTE-A Network

In modern cellular system such as LTE Advanced (LTE-A), frequency reuse scheme is targeted to be applied to fulfill the requirement of high capacity broadband access and high spectrum efficiency. But this kind of frequency planning may lead to the worse inter-cell interference (ICI) level experienced especially by a user located at the cell edge. Soft Frequency Reuse (SFR) is considered as an effective way to mitigate inter-cell interference and maintain capacity. We propose a power division SFR, known as multi level SFR technique to minimize ICI in a designed LTE-A network for sub-urban environment. Service area of LTE-A network was first developed to deploy particular number of eNB by using LTE network planning tools in the frequency of 1800 MHz with the use of SISO (Single Input Single Output) antennas. Coverage dimensioning and propagation consideration determine LTE-A parameters which were used in the simulation. Monte carlo simulation is executed to examine the performance of SFR for LTE-A downlink transmission to address different power ratio and traffic loads problem. Both performance of cell edge users and overall cell performance are evaluated in terms of CINR, BLER, and throughput. Performance with SFR is also compared with the classical frequency reuse one and three

Massive M2M Access with Reliability Guarantees in LTE Systems

Machine-to-Machine (M2M) communications are one of the major drivers of the cellular network evolution towards 5G systems. One of the key challenges is on how to provide reliability guarantees to each accessing device in a situation in which there is a massive number of almost-simultaneous arrivals from a large set of M2M devices. The existing solutions take a reactive approach in dealing with massive arrivals, such as non-selective barring when a massive arrival event occurs, which implies that the devices cannot get individual reliability guarantees. In this paper we propose a proactive approach, based on a standard operation of the cellular access. The access procedure is divided into two phases, an estimation phase and a serving phase. In the estimation phase the number of arrivals is estimated and this information is used to tune the amount of resources allocated in the serving phase. Our results show that the proactive approach is instrumental in delivering high access reliability to the M2M devices.Comment: Accepted for presentation in ICC 201

A Tractable Model of the LTE Access Reservation Procedure for Machine-Type Communications

A canonical scenario in Machine-Type Communications (MTC) is the one featuring a large number of devices, each of them with sporadic traffic. Hence, the number of served devices in a single LTE cell is not determined by the available aggregate rate, but rather by the limitations of the LTE access reservation protocol. Specifically, the limited number of contention preambles and the limited amount of uplink grants per random access response are crucial to consider when dimensioning LTE networks for MTC. We propose a low-complexity model of LTE's access reservation protocol that encompasses these two limitations and allows us to evaluate the outage probability at click-speed. The model is based chiefly on closed-form expressions, except for the part with the feedback impact of retransmissions, which is determined by solving a fixed point equation. Our model overcomes the incompleteness of the existing models that are focusing solely on the preamble collisions. A comparison with the simulated LTE access reservation procedure that follows the 3GPP specifications, confirms that our model provides an accurate estimation of the system outage event and the number of supported MTC devices.Comment: Submitted, Revised, to be presented in IEEE Globecom 2015; v3: fixed error in eq. (4

Self-optimizing load balancing with backhaul-constrained radio access networks

Self-Organizing Network (SON) technology aims at autonomously deploying, optimizing and repairing the Radio Access Networks (RAN). SON algorithms typically use Key Performance Indicators (KPIs) from the RAN. It is shown that in certain cases, it is essential to take into account the impact of the backhaul state in the design of the SON algorithm. We revisit the Base Station (BS) load definition taking into account the backhaul state. We provide an analytical formula for the load along with a simple estimator for both elastic and guaranteed bit-rate (GBR) traffic. We incorporate the proposed load estimator in a self-optimized load balancing algorithm. Simulation results for a backhaul constrained heterogeneous network illustrate how the correct load definition can guarantee a proper operation of the SON algorithm.Comment: Wireless Communications Letters, IEEE, 201

Insights in the cost of continuous broadband Internet on trains for multi-service deployments by multiple actors with resource sharing

The economic viability of broadband Internet services on trains has always been proved difficult, mainly due to a high investment cost and low willingness to pay by train passengers, but also due to unused opportunities such as non-passenger services (e.g. train performance monitoring, crew services) and optimization of the resources consumed to offer Internet services. Evaluating opportunities to improve the return on investment is therefore essential towards profitability of the business case. By efficiently sharing resources amongst services, costs can be pooled over several services in order to reduce the investment cost per service. Current techno-economic evaluation models are hard to apply to cost allocation in a multi-service deployment with multiple actors and resource sharing. We therefore propose a new evaluation model and apply it to a deployment of Internet services on trains. We start with a detailed analysis of the technical architecture required to provide Internet access on trains. For each component, we investigate the impact by the different services on resource consumption. The proposed techno-economic evaluation model is then applied in order to calculate the total cost and allocate the used and unused resources to the appropriate services. In a final step, we calculate the business case for each stakeholder involved in the offering of these services. This paper details the proposed model and reports on our findings for a multi-service deployment by multiple actors. Results show important benefits for the case that considers the application of resource sharing in a multi-service, multi-actor scenario and the proposed model produces insights in the contributors to the cost per service and the unused amount of a resource. In addition, ex-ante insights in the cost flows per involved actor are obtained and the model can easily be extended to include revenue flows to evaluate the profitability per actor. As a consequence, the proposed model should be considered to support and stimulate upcoming multi-actor investment decisions for Internet-based multi-service offerings on-board trains with resource sharing

On the Reliability of LTE Random Access: Performance Bounds for Machine-to-Machine Burst Resolution Time

Random Access Channel (RACH) has been identified as one of the major bottlenecks for accommodating massive number of machine-to-machine (M2M) users in LTE networks, especially for the case of burst arrival of connection requests. As a consequence, the burst resolution problem has sparked a large number of works in the area, analyzing and optimizing the average performance of RACH. However, the understanding of what are the probabilistic performance limits of RACH is still missing. To address this limitation, in the paper, we investigate the reliability of RACH with access class barring (ACB). We model RACH as a queuing system, and apply stochastic network calculus to derive probabilistic performance bounds for burst resolution time, i.e., the worst case time it takes to connect a burst of M2M devices to the base station. We illustrate the accuracy of the proposed methodology and its potential applications in performance assessment and system dimensioning.Comment: Presented at IEEE International Conference on Communications (ICC), 201