A sample-decimation based fast preamble detection algorithm

Random access is a commonly used multiple access scheme that allows multiple users to share the same resource in a distributed fashion. In a Universal Mobile Telecommunication System (UMTS), the preamble of a random access channel (RACH) message is used by a mobile user to signal the base station for requesting network access or short data packets transportation. The base station is responsible in a timely fashion for detecting the preambles and informing the user whether the request has been granted or denied through the acquisition indication channel (AICH). Preamble detection is one of the most computationally intensive functional units of a base station. It has attracted many research attentions and investments in the past a few decades. The drawback of the existing preamble detection (PD) algorithms for UMTS base-station is that either their computational complexity is high or the detection accuracy is low. The conventional full search PD algorithm gives the best result in terms of the detection probability, but its complexity is high. On the hand, the parallel-serial code phase detector PD algorithm provides a reduced computational complexity, but the detection accuracy becomes low. In this thesis, a sample-decimation based preamble detection technique is proposed in order to substantially reduce the computational complexity and at the same time retain a high detection accuracy. The proposed algorithm comprises two stages. Delay hypotheses or delay offsets which are unlikely to have a strong correlation power between the antenna samples and the locally generated preamble replica are identified and discarded in the first stage. The second stage operates on the remaining offsets and employs all the antenna samples within the preamble signal. Extensive computer simulations are conducted under different levels of additive white Gaussian noise interferences. The results show that the proposed algorithm has a detection performance very close to that of the conventional full search PD algorithm, while at the same time it reduces the computational complexity by more than sixty percen

Performance Boundaries of Massive Floating Car Data Offloading

International audienceFloating Car Data (FCD) consist of information generated by moving vehicles and uploaded to Internet-based control centers for processing and analysis. As upcoming mobile services based on or built for networked vehicles largely rely on uplink transfers of small-sized but high-frequency messages, FCD traffic is expected to become increasingly common in the next few years. Presently, FCD are managed through a traditional cellular network paradigm : however, the scalability of such a model is unclear in the face of massive FCD upload, involving large fractions of the vehicles over short time intervals. In this paper, we explore the use of vehicle-to-vehicle (V2V) communication to partially relieve the cellular infrastructure from FCD traffic. Specifically, we study the performance boundaries of such a FCD offloading approach in presence of best- and worst-case data aggregation possibilities at vehicles. We show the gain that can be obtained by offloading FCD via vehicular communication, and propose a simple distributed heuristic that has nearly optimal performance under any FCD aggregation model

Business scenarios, technical challenges and system requirements - D2.1

Deliverable D2.1 del projecte Europeu OneFIT (ICT-2009-257385)Preprin

Private Communication Detection via Side-Channel Attacks

Private communication detection (PCD) enables an ordinary network user to discover communication patterns (e.g., call time, length, frequency, and initiator) between two or more private parties. Analysis of communication patterns between private parties has historically been a powerful tool used by intelligence, military, law-enforcement and business organizations because it can reveal the strength of tie between these parties. Ordinary users are assumed to have neither eavesdropping capabilities (e.g., the network may employ strong anonymity measures) nor the legal authority (e.g. no ability to issue a warrant to network providers) to collect private-communication records. We show that PCD is possible by ordinary users merely by sending packets to various network end-nodes and analyzing the responses. Three approaches for PCD are proposed based on a new type of side channels caused by resource contention, and defenses are proposed. The Resource-Saturation PCD exploits the resource contention (e.g., a fixed-size buffer) by sending carefully designed packets and monitoring different responses. Its effectiveness has been demonstrated on three commercial closed-source VoIP phones. The Stochastic PCD shows that timing side channels in the form of probing responses, which are caused by distinct resource-contention responses when different applications run in end nodes, enable effective PCD despite network and proxy-generated noise (e.g., jitter, delays). It was applied to WiFi and Instant Messaging for resource contention in the radio channel and the keyboard, respectively. Similar analysis enables practical Sybil node detection. Finally, the Service-Priority PCD utilizes the fact that 3G/2G mobile communication systems give higher priority to voice service than data service. This allows detection of the busy status of smartphones, and then discovery of their call records by correlating the busy status. This approach was successfully applied to iPhone and Android phones in AT&T's network. An additional, unanticipated finding was that an Internet user could disable a 2G phone's voice service by probing it with short enough intervals (e.g., 1 second). PCD defenses can be traditional side-channel countermeasures or PCD-specific ones, e.g., monitoring and blocking suspicious periodic network traffic

Evaluation of channel switching threshold for MBMS in UMTS networks

In this project, thershold to switching from dedicated to shared/common channel for efficent delivery of MBMS serveces have been evaluated. It also been evaluated the coverage using multiple channer in function of the distribution of the user

Cellular networks for smart grid communication

The next-generation electric power system, known as smart grid, relies on a robust and reliable underlying communication infrastructure to improve the efficiency of electricity distribution. Cellular networks, e.g., LTE/LTE-A systems, appear as a promising technology to facilitate the smart grid evolution. Their inherent performance characteristics and well-established ecosystem could potentially unlock unprecedented use cases, enabling real-time and autonomous distribution grid operations. However, cellular technology was not originally intended for smart grid communication, associated with highly-reliable message exchange and massive device connectivity requirements. The fundamental differences between smart grid and human-type communication challenge the classical design of cellular networks and introduce important research questions that have not been sufficiently addressed so far. Motivated by these challenges, this doctoral thesis investigates novel radio access network (RAN) design principles and performance analysis for the seamless integration of smart grid traffic in future cellular networks. Specifically, we focus on addressing the fundamental RAN problems of network scalability in massive smart grid deployments and radio resource management for smart grid and human-type traffic. The main objective of the thesis lies on the design, analysis and performance evaluation of RAN mechanisms that would render cellular networks the key enabler for emerging smart grid applications. The first part of the thesis addresses the radio access limitations in LTE-based networks for reliable and scalable smart grid communication. We first identify the congestion problem in LTE random access that arises in large-scale smart grid deployments. To overcome this, a novel random access mechanism is proposed that can efficiently support real-time distribution automation services with negligible impact on the background traffic. Motivated by the stringent reliability requirements of various smart grid operations, we then develop an analytical model of the LTE random access procedure that allows us to assess the performance of event-based monitoring traffic under various load conditions and network configurations. We further extend our analysis to include the relation between the cell size and the availability of orthogonal random access resources and we identify an additional challenge for reliable smart grid connectivity. To this end, we devise an interference- and load-aware cell planning mechanism that enhances reliability in substation automation services. Finally, we couple the problem of state estimation in wide-area monitoring systems with the reliability challenges in information acquisition. Using our developed analytical framework, we quantify the impact of imperfect communication reliability in the state estimation accuracy and we provide useful insights for the design of reliability-aware state estimators. The second part of the thesis builds on the previous one and focuses on the RAN problem of resource scheduling and sharing for smart grid and human-type traffic. We introduce a novel scheduler that achieves low latency for distribution automation traffic while resource allocation is performed in a way that keeps the degradation of cellular users at a minimum level. In addition, we investigate the benefits of Device-to-Device (D2D) transmission mode for event-based message exchange in substation automation scenarios. We design a joint mode selection and resource allocation mechanism which results in higher data rates with respect to the conventional transmission mode via the base station. An orthogonal resource partition scheme between cellular and D2D links is further proposed to prevent the underutilization of the scarce cellular spectrum. The research findings of this thesis aim to deliver novel solutions to important RAN performance issues that arise when cellular networks support smart grid communication.Las redes celulares, p.e., los sistemas LTE/LTE-A, aparecen como una tecnología prometedora para facilitar la evolución de la próxima generación del sistema eléctrico de potencia, conocido como smart grid (SG). Sin embargo, la tecnología celular no fue pensada originalmente para las comunicaciones en la SG, asociadas con el intercambio fiable de mensajes y con requisitos de conectividad de un número masivo de dispositivos. Las diferencias fundamentales entre las comunicaciones en la SG y la comunicación de tipo humano desafían el diseño clásico de las redes celulares e introducen importantes cuestiones de investigación que hasta ahora no se han abordado suficientemente. Motivada por estos retos, esta tesis doctoral investiga los principios de diseño y analiza el rendimiento de una nueva red de acceso radio (RAN) que permita una integración perfecta del tráfico de la SG en las redes celulares futuras. Nos centramos en los problemas fundamentales de escalabilidad de la RAN en despliegues de SG masivos, y en la gestión de los recursos radio para la integración del tráfico de la SG con el tráfico de tipo humano. El objetivo principal de la tesis consiste en el diseño, el análisis y la evaluación del rendimiento de los mecanismos de las RAN que convertirán a las redes celulares en el elemento clave para las aplicaciones emergentes de las SGs. La primera parte de la tesis aborda las limitaciones del acceso radio en redes LTE para la comunicación fiable y escalable en SGs. En primer lugar, identificamos el problema de congestión en el acceso aleatorio de LTE que aparece en los despliegues de SGs a gran escala. Para superar este problema, se propone un nuevo mecanismo de acceso aleatorio que permite soportar de forma eficiente los servicios de automatización de la distribución eléctrica en tiempo real, con un impacto insignificante en el tráfico de fondo. Motivados por los estrictos requisitos de fiabilidad de las diversas operaciones en la SG, desarrollamos un modelo analítico del procedimiento de acceso aleatorio de LTE que nos permite evaluar el rendimiento del tráfico de monitorización de la red eléctrica basado en eventos bajo diversas condiciones de carga y configuraciones de red. Además, ampliamos nuestro análisis para incluir la relación entre el tamaño de celda y la disponibilidad de recursos de acceso aleatorio ortogonales, e identificamos un reto adicional para la conectividad fiable en la SG. Con este fin, diseñamos un mecanismo de planificación celular que tiene en cuenta las interferencias y la carga de la red, y que mejora la fiabilidad en los servicios de automatización de las subestaciones eléctricas. Finalmente, combinamos el problema de la estimación de estado en sistemas de monitorización de redes eléctricas de área amplia con los retos de fiabilidad en la adquisición de la información. Utilizando el modelo analítico desarrollado, cuantificamos el impacto de la baja fiabilidad en las comunicaciones sobre la precisión de la estimación de estado. La segunda parte de la tesis se centra en el problema de scheduling y compartición de recursos en la RAN para el tráfico de SG y el tráfico de tipo humano. Presentamos un nuevo scheduler que proporciona baja latencia para el tráfico de automatización de la distribución eléctrica, mientras que la asignación de recursos se realiza de un modo que mantiene la degradación de los usuarios celulares en un nivel mínimo. Además, investigamos los beneficios del modo de transmisión Device-to-Device (D2D) en el intercambio de mensajes basados en eventos en escenarios de automatización de subestaciones eléctricas. Diseñamos un mecanismo conjunto de asignación de recursos y selección de modo que da como resultado tasas de datos más elevadas con respecto al modo de transmisión convencional a través de la estación base. Finalmente, se propone un esquema de partición de recursos ortogonales entre enlaces celulares y D2Postprint (published version

Next-Generation Self-Organizing Networks through a Machine Learning Approach

Fecha de lectura de Tesis Doctoral: 17 Diciembre 2018.Para reducir los costes de gestión de las redes celulares, que, con el tiempo, aumentaban en complejidad, surgió el concepto de las redes autoorganizadas, o self-organizing networks (SON). Es decir, la automatización de las tareas de gestión de una red celular para disminuir los costes de infraestructura (CAPEX) y de operación (OPEX). Las tareas de las SON se dividen en tres categorías: autoconfiguración, autooptimización y autocuración. El objetivo de esta tesis es la mejora de las funciones SON a través del desarrollo y uso de herramientas de aprendizaje automático (machine learning, ML) para la gestión de la red. Por un lado, se aborda la autocuración a través de la propuesta de una novedosa herramienta para una diagnosis automática (RCA), consistente en la combinación de múltiples sistemas RCA independientes para el desarrollo de un sistema compuesto de RCA mejorado. A su vez, para aumentar la precisión de las herramientas de RCA mientras se reducen tanto el CAPEX como el OPEX, en esta tesis se proponen y evalúan herramientas de ML de reducción de dimensionalidad en combinación con herramientas de RCA. Por otro lado, en esta tesis se estudian las funcionalidades multienlace dentro de la autooptimización y se proponen técnicas para su gestión automática. En el campo de las comunicaciones mejoradas de banda ancha, se propone una herramienta para la gestión de portadoras radio, que permite la implementación de políticas del operador, mientras que, en el campo de las comunicaciones vehiculares de baja latencia, se propone un mecanismo multicamino para la redirección del tráfico a través de múltiples interfaces radio. Muchos de los métodos propuestos en esta tesis se han evaluado usando datos provenientes de redes celulares reales, lo que ha permitido demostrar su validez en entornos realistas, así como su capacidad para ser desplegados en redes móviles actuales y futuras

Identification of femtocells in mobile networks

The evolving mobile networks are requested to convey increasing data traffic as popularity of online services together with affordability of mobile devices is growing. One solution to mobile carriers, which can help them quickly deploy small base stations (BS) ensuring great indoor coverage with minimum costs, and high data rate capability, is femtocell technology. However, standard deployment techniques are unsatisfactory for these type of BSs. There are two main reasons for that. Firstly, femtocells will be deployed in great numbers. Secondly, they are deployed by users and are portable. It means their position is not known in advance, and can vary in time. Therefore, femtocells have to implement self-configuration principles. Physical Cell Identity is one of the most important parameters to be chosen automatically under defined conditions. It is crucial parameter, which allows them to convey a communication between a user equipment and a core network. A study on Physical Cell Identity issues in mobile networks with femtocells is presented in my thesis. For this purpose, I created two different models of femtocells deployment and deal with a collision and a confusion. They are two main problems, which threaten proper Physical Cell Identity assignment in mobile networks. Outputs of the thesis serves for better understanding of interrelations between differently placed femtocells in term of collision and confusion issue and as the basis to design the framework handling Physical Cell Identity allocation. The simulations conducted on proposed models were utilized to obtain probability characteristics and indicators based on graph theory. In the evaluation section, I appoint several characteristics as probability of collision, probability of confusion and maximal number of neighbourhood cells and some others to support solution of collision and confusion issue. I use results of evaluation and layout the framework for automated Physical Cell Identity assignment with two different approaches, the distributed one, and the centralized one. Since, femtocells are subcategory of small cells so findings, mentioned in this thesis, can also be used for other types of small cells.Katedra telekomunikační technik

Desempenho de redes de acesso heterogéneas com suporte de mobilidade

Mestrado em Engenharia Electrónica e TelecomunicaçõesO desenvolvimento crescente da Internet e das tecnologias sem fios levou à necessidade de estarmos sempre ligados, onde quer que estejamos, dentro de casa ou fora, estacionários ou em movimento. O protocolo IEEE 802.21, desenvolvido pelo grupo IEEE, surge como um mecanismo independente da tecnologia de acesso que visa optimizar os processos de handover. Esta dissertação apresenta mecanismos de mobilidade independentes entre as tecnologias de WiFi, WiMAX e UMTS. São descritos os processos de handover entre as diferentes tecnologias para efectuar mobilidade transparente, e optimização do processo de mobilidade através do suporte de servidores com informação dinâmica da rede. Posteriormente é analisado o simulador de redes, ferramenta utilizada na avaliação do desempenho dos handovers em redes heterogéneas através dos mecanismos apresentados pelo protocolo IEEE 802.21, e são feitas alterações a estes mesmos mecanismos de forma a optimizar os handovers. Com a criação de cenários com suporte das diferentes tecnologias de acesso sem fios, foram realizados, testados e analisados handovers entre as diversas tecnologias, com e sem suporte de servidores com informação dinâmica da rede. Através da análise dos resultados obtidos pode-se constatar que as alterações propostas, em termos da integração do IEEE 802.21 com as diferentes tecnologias e de disponibilização de informação dinâmica na rede, apresentam melhorias significativas no processo, e consequente tempo de handover. ABSTRACT: The growing development of the Internet and the wireless access technologies lead us to the need of being always connected, wherever we are, at home or outside, stationary or moving. The IEEE 802.21 protocol, developed by the IEEE group, comes up as a mechanism independent from the access technology, with the purpose of improving the handover process. This thesis presents possible independent mobility mechanisms between WiFi, WiMAX and UMTS technologies. It is described the handover process between the different technologies to have transparent mobility, and the optimization of the mobility process through the support of dynamic information servers. Later, it is analyzed the network simulator, tool used to evaluate the performance of the handovers between heterogeneous networks through the mechanisms presented in the IEEE 802.21 protocol, and are made modifications to the same mechanisms in order to improve the handovers. With the creation of scenarios supporting several wireless access technologies, were made, analyzed and tested handovers between the different technologies, with and without the support for servers in the network with dynamic information. Through the analysis of the obtained results it is possible to see that the modifications presented, regarding the IEEE 802.21 integration with the different technologies and the availability of dynamic information in the network, present significant improvements to the process, and consequent handover time