Traffic-Driven Energy Efficient Operational Mechanisms in Cellular Access Networks

Recent explosive growth in mobile data traffic is increasing energy consumption in cellular networks at an incredible rate. Moreover, as a direct result of the conventional static network provisioning approach, a significant amount of electrical energy is being wasted in the existing networks. Therefore, in recent time, the issue of designing energy efficient cellular networks has drawn significant attention, which is also the foremost motivation behind this research. The proposed research is particularly focused on the design of self-organizing type traffic-sensitive dynamic network reconfiguring mechanisms for energy efficiency in cellular systems. Under the proposed techniques, radio access networks (RANs) are adaptively reconfigured using less equipment leading to reduced energy utilization. Several energy efficient cellular network frameworks by employing inter-base station (BS) cooperation in RANs are proposed. Under these frameworks, based on the instantaneous traffic demand, BSs are dynamically switched between active and sleep modes by redistributing traffic among them and thus, energy savings is achieved. The focus is then extended to exploiting the availability of multiple cellular networks for extracting energy savings through inter-RAN cooperation. Mathematical models for both of these single-RAN and multi-RAN cooperation mechanisms are also formulated. An alternative energy saving technique using dynamic sectorization (DS) under which some of the sectors in the underutilized BSs are turned into sleep mode is also proposed. Algorithms for both the distributed and the centralized implementations are developed. Finally, a two-dimensional energy efficient network provisioning mechanism is proposed by jointly applying both the DS and the dynamic BS switching. Extensive simulations are carried out, which demonstrate the capability of the proposed mechanisms in substantially enhancing the energy efficiency of cellular networks

Algoritmos evolutivos para alguns problemas em telecomunicações

Orientadores: Flavio Keidi Miyazawa, Mauricio Guilherme de Carvalho ResendeTese (doutorado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: Nos últimos anos, as redes de telecomunicação tem experienciado um grande aumento no fluxo de dados. Desde a utilização massiva de vídeo sob demanda até o incontável número de dispositivos móveis trocando texto e vídeo, o tráfego alcançou uma escala capaz de superar a capacidade das redes atuais. Portanto, as companhias de telecomunicação ao redor do mundo tem sido forçadas a aumentar a capacidade de suas redes para servir esta crescente demanda. Como o custo de instalar uma infraestrutura de rede é geralmente muito grande, o projeto de redes usa fortemente ferramentas de otimização para manter os custos tão baixos quanto possível. Nesta tese, nós analisamos vários aspectos do projeto e implementação de redes de telecomunicação. Primeiramente, nós apresentamos um novo problema de projeto de redes usado para servir demandas sem fio de dispositivos móveis e rotear tal tráfego para a rede principal. Tais redes de acesso são baseadas em tecnologias sem fio modernos como Wi-Fi, LTE e HSPA. Este problema consideramos várias restrições reais e é difícil de ser resolvido. Nós estudamos casos reais nas vizinhanças de uma grande cidade nos Estados Unidos. Em seguida, nós apresentamos uma variação do problema de localização de hubs usado para modelar as redes principais (backbones ou laços centrais). Este problema também pode ser utilizado para modelar redes de transporte de cargas e passageiros. Nós também estudamos o problema de clusterização correlacionada com sobreposições usado para modelar o comportamento dos usuários quando utilizam seus equipamentos móveis. Neste problema, nós podemos rotular um objeto usando múltiplos rótulos e analisar a conexão entre eles. Este problema é adequado para análise de mobilidade de equipamentos que pode ser usada para estimar o tráfego em uma dada região. E finalmente, nós analisamos o licenciamento de espectro sobre uma perspectiva governamental. Nestes casos, uma agência do governo deseja vender licenças para companhias de telecomunicação para que operem em uma dada faixa de espectro. Este processo usualmente é conduzido usando leilões combinatoriais. Para todos problemas, nós propomos algoritmos genéticos de chaves aleatórias viciadas e modelos de programação linear inteira mista para resolvê-los (exceto para o problema de clusterização correlacionada com sobreposição, devido sua natureza não-linear). Os algoritmos que propusemos foram capazes de superar algoritmos do estado da arte para todos problemasAbstract: Cutting and packing problems are common problems that occur in many industry and business process. Their optimized resolution leads to great profits in several sectors. A common problem, that occur in textil and paper industries, is to cut a strip of some material to obtain several small items, using the minimum length of material. This problem, known by Two Dimensional Strip Packing Problem (2SP), is a hard combinatorial optimization problem. In this work, we present an exact algorithm to 2SP, restricted to two staged cuts (known by Two Dimensional Level Strip Packing, 2LSP). The algorithm uses the branch-and-price technique, and heuristics based on approximation algorithms to obtain upper bounds. The algorithm obtained optimal or almost optimal for small and moderate sized instancesAbstract: In last twenty years, telecommunication networks have experienced a huge increase in data utilization. From massive on-demand video to uncountable mobile devices exchanging text and video, traffic reached scales that overcame the network capacities. Therefore, telecommunication companies around the world have been forced to increase their capacity to serve this increasing demand. As the cost to deploy network infrastructure is usually very large, the design of a network heavily uses optimization tools to keep costs as low as possible. In this thesis, we analyze several aspects of the design and deployment of communication networks. First, we present a new network design problem used to serve wireless demands from mobile devices and route the traffic to the core network. Such access networks are based on modern wireless access technologies such as Wi-Fi, LTE, and HSPA. This problem has several real world constraints and it is hard to solve. We study real cases of the vicinity of a large city in the United States. Following, we present a variation of the hub-location problem used to model these core networks. Such problem is also suitable to model transportation networks. We also study the overlapping correlation clustering problem used to model the user's behavior when using their mobile devices. In such problem, one can label an object with multiple labels and analyzes the connections between them. Although this problem is very generic, it is suitable to analyze device mobility which can be used to estimate traffic in geographical regions. Finally, we analyze spectrum licensing from a governmental perspective. In these cases, a governmental agency wants to sell rights for telecommunication companies to operate over a given spectrum range. This process usually is conducted using combinatorial auctions. For all problems we propose biased random-key genetic algorithms and mixed integer linear programming models (except in the case of the overlapping correlation clustering problem due its non-linear nature). Our algorithms were able to overcome the state of the art algorithms for all problemsDoutoradoCiência da ComputaçãoDoutor em Ciência da Computaçã

Wielokryterialne, mrowiskowe algorytmy optymalizacji w nawigacji samochodowej

Rozwiązywanie złożonych problemów optymalizacji dyskretnej znajduje zastosowania praktyczne w wielu dziedzinach aktywności człowieka. Przykładem możne być wyszukiwanie optymalnej drogi między dwoma punktami na mapie drogowej w nawigacji samochodowej z zastosowaniem wielu kryteriów oceny. Problem jest znany w literaturze jako bardziej ogólny, wielokryterialny problem najkrótszej drogi w grafie (ang. multi-objective shortest path problem – MOSP). Na początku rozprawy zostały omówione różne, klasyczne podejścia do rozwiązywania problemów optymalizacji wielokryterialnej, ze szczególnym uwzględnieniem podejścia zaproponowanego przez włoskiego ekonomistę Vilfredo Pareto. W metodzie tej zakłada się, że w procesie optymalizacji wielokryterialnej bardzo rzadko możliwe jest wyznaczenie jednego rozwiązania, które jest optymalne z punktu widzenia każdego kryterium oceny równocześnie. W związku z tym wynikiem optymalizacji wielokryterialnej metoda Pareto jest najczęściej zbiór rozwiązań niezdominowanych. Każde rozwiązanie, które należy do tego zbioru charakteryzuje się tym, że nie da się już polepszyć żadnego z kryterium oceny bez pogorszenia pozostałych. W rozprawie zdefiniowano wielokryterialny problem wyszukiwania najkrótszej drogi w grafie oraz dokonano przeglądu różnych metod rozwiązywania tego problemu. Charakteryzują się one dużą złożonością obliczeniową, co zachęca do stosowania algorytmów wyznaczających rozwiązania przybliżone. Są wśród nich algorytmy optymalizacji mrowiskowej, które są skuteczną metodą rozwiązywania złożonych problemów optymalizacji dyskretnej. Optymalizacja mrowiskowa (ang. ant colony optimization – ACO) jest paradygmatem związanym z tworzeniem algorytmów heurystycznych dla rozwiązywania problemów optymalizacji dyskretnej, które należą do licznego grona algorytmów inspirowanych przez naturę. Jest on oparty na kolonii sztucznych mrówek, które współpracują i komunikują się za pośrednictwem sztucznych śladów feromonowych. Pierwszym algorytmem w tej klasie był system mrówkowy, który wywodzi się z badań w dziedzinie systemów naśladujących rzeczywiste zachowania mrówek i został zaproponowany w 1991 r. przez M. Dorigo, V. Maniezzo i A. Colorniego jako algorytm rozwiązujący problem komiwojażera. Mrówki podróżują w przestrzeni rozwiązań, która zwykle ma strukturę grafową. Następny punkt swojej drogi mrówki wybierają z prawdopodobieństwem zależącym od dwóch rodzajów informacji związanych z krawędzią: statycznej informacji heurystycznej, np. odległości między węzłami oraz śladu feromonowego, który zmienia się w trakcie obliczeń i jest środkiem „porozumiewania się” mrówek. Algorytmy mrowiskowe stały się podstawą zaproponowanych w rozprawie oryginalnych wielokryterialnych algorytmów optymalizacji w nawigacji samochodowej. Na podstawie algorytmu AVN, znanego z literatury, zaprezentowano nowe, udoskonalone algorytmy NAVN i MultiNAVN będące głównymi efektami prac nad niniejszą rozprawa. Zaproponowano dwie wersje algorytmu MultiNAVN: z kryterium zastępczym (MultiNAVNZ) oraz losowym wyborem kryterium (MultiNAVN-L), które zostały poddane eksperymentom na danych rzeczywistych. Wykorzystano cztery kryteria oceny rozwiązań: długość drogi, szerokość drogi, liczba skrzyżowań oraz bezpieczeństwo. Dane dotyczące trzech pierwszych kryteriów pozyskano z bazy danych systemu OpenStreetMap, a jako kryterium bezpieczeństwa wykorzystano informacje o wypadkach i kolizjach z systemu Policji o nazwie SEWiK. Oba algorytmy wyznaczają przybliżone zbiory rozwiązań niezdominowanych, których jakość może być mierzona odległością tych zbiorów (np. metryka Hausdorffa) od pełnych zbiorów rozwiązań wyznaczonych algorytmem deterministycznym. Za pomocą wielu eksperymentów wykazano, że zaproponowane algorytmy z powodzeniem wyznaczają drogi dla rzeczywistych map drogowych, przy czym wyniki są porównywalne, a nierzadko lepsze od rezultatów uzyskiwanych za pomocą innych algorytmów

A PARADIGM SHIFTING APPROACH IN SON FOR FUTURE CELLULAR NETWORKS

The race to next generation cellular networks is on with a general consensus in academia and industry that massive densification orchestrated by self-organizing networks (SONs) is the cost-effective solution to the impending mobile capacity crunch. While the research on SON commenced a decade ago and is still ongoing, the current form (i.e., the reactive mode of operation, conflict-prone design, limited degree of freedom and lack of intelligence) hinders the current SON paradigm from meeting the requirements of 5G. The ambitious quality of experience (QoE) requirements and the emerging multifarious vision of 5G, along with the associated scale of complexity and cost, demand a significantly different, if not totally new, approach to SONs in order to make 5G technically as well as financially feasible. This dissertation addresses these limitations of state-of-the-art SONs. It first presents a generic low-complexity optimization framework to allow for the agile, on-line, multi-objective optimization of future mobile cellular networks (MCNs) through only top-level policy input that prioritizes otherwise conflicting key performance indicators (KPIs) such as capacity, QoE, and power consumption. The hybrid, semi-analytical approach can be used for a wide range of cellular optimization scenarios with low complexity. The dissertation then presents two novel, user-mobility, prediction-based, proactive self-optimization frameworks (AURORA and OPERA) to transform mobility from a challenge into an advantage. The proposed frameworks leverage mobility to overcome the inherent reactiveness of state-of-the-art self-optimization schemes to meet the extremely low latency and high QoE expected from future cellular networks vis-à-vis 5G and beyond. The proactiveness stems from the proposed frameworks’ novel capability of utilizing past hand-over (HO) traces to determine future cell loads instead of observing changes in cell loads passively and then reacting to them. A semi-Markov renewal process is leveraged to build a model that can predict the cell of the next HO and the time of the HO for the users. A low-complexity algorithm has been developed to transform the predicted mobility attributes to a user-coordinate level resolution. The learned knowledge base is used to predict the user distribution among cells. This prediction is then used to formulate a novel (i) proactive energy saving (ES) optimization problem (AURORA) that proactively schedules cell sleep cycles and (ii) proactive load balancing (LB) optimization problem (OPERA). The proposed frameworks also incorporate the effect of cell individual offset (CIO) for balancing the load among cells, and they thus exploit an additional ultra-dense network (UDN)-specific mechanism to ensure QoE while maximizing ES and/or LB. The frameworks also incorporates capacity and coverage constraints and a load-aware association strategy for ensuring the conflict-free operation of ES, LB, and coverage and capacity optimization (CCO) SON functions. Although the resulting optimization problems are combinatorial and NP-hard, proactive prediction of cell loads instead of reactive measurement allows ample time for combination of heuristics such as genetic programming and pattern search to find solutions with high ES and LB yields compared to the state of the art. To address the challenge of significantly higher cell outage rates in anticipated in 5G and beyond due to higher operational complexity and cell density than legacy networks, the dissertation’s fourth key contribution is a stochastic analytical model to analyze the effects of the arrival of faults on the reliability behavior of a cellular network. Assuming exponential distributions for failures and recovery, a reliability model is developed using the continuous-time Markov chains (CTMC) process. Unlike previous studies on network reliability, the proposed model is not limited to structural aspects of base stations (BSs), and it takes into account diverse potential fault scenarios; it is also capable of predicting the expected time of the first occurrence of the fault and the long-term reliability behavior of the BS. The contributions of this dissertation mark a paradigm shift from the reactive, semi-manual, sub-optimal SON towards a conflict-free, agile, proactive SON. By paving the way for future MCN’s commercial and technical viability, the new SON paradigm presented in this dissertation can act as a key enabler for next-generation MCNs

Recent Trends in Communication Networks

In recent years there has been many developments in communication technology. This has greatly enhanced the computing power of small handheld resource-constrained mobile devices. Different generations of communication technology have evolved. This had led to new research for communication of large volumes of data in different transmission media and the design of different communication protocols. Another direction of research concerns the secure and error-free communication between the sender and receiver despite the risk of the presence of an eavesdropper. For the communication requirement of a huge amount of multimedia streaming data, a lot of research has been carried out in the design of proper overlay networks. The book addresses new research techniques that have evolved to handle these challenges

Particle Swarm Optimization

Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field

ReSCon '12, Research Student Conference: Book of Abstracts

The fifth SED Research Student Conference (ReSCon2012) was hosted over three days, 18-20 June 2012, in the Hamilton Centre at Brunel University. The conference consisted of 130 oral and 70 poster presentations, based on the high quality and diverse research being conducted within the School of Engineering and Design by postgraduate research students. The conference is held annually, and ReSCon plays a key role in contributing to research and innovations within the School