INTERFERENCE MANAGEMENT IN LTE SYSTEM AND BEYOUND

The key challenges to high throughput in cellular wireless communication system are interference, mobility and bandwidth limitation. Mobility has never been a problem until recently, bandwidth has been constantly improved upon through the evolutions in cellular wireless communication system but interference has been a constant limitation to any improvement that may have resulted from such evolution. The fundamental challenge to a system designer or a researcher is how to achieve high data rate in motion (high speed) in a cellular system that is intrinsically interference-limited. Multi-antenna is the solution to data on the move and the capacity of multi-antenna system has been demonstrated to increase proportionally with increase in the number of antennas at both transmitter and receiver for point-to-point communications and multi-user environment. However, the capacity gain in both uplink and downlink is limited in a multi-user environment like cellular system by interference, the number of antennas at the base station, complexity and space constraint particularly for a mobile terminal. This challenge in the downlink provided the motivation to investigate successive interference cancellation (SIC) as an interference management tool LTE system and beyond. The Simulation revealed that ordered successive interference (OSIC) out performs non-ordered successive interference cancellation (NSIC) and the additional complexity is justified based on the associated gain in BER performance of OSIC. The major drawback of OSIC is that it is not efficient in network environment employing power control or power allocation. Additional interference management techniques will be required to fully manage the interference.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format

Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

Bandwidth and Energy-Efficient Route Discovery for Noisy Mobile Ad-Hoc Networks

Broadcasting is used in on-demand routing protocols to discover routes in Mobile Ad-hoc Networks (MANETs). On-demand routing protocols, such as Ad-hoc On-demand Distance Vector (AODV) commonly employ pure flooding based broadcasting to discover new routes. In pure flooding, a route request (RREQ) packet is broadcast by the source node and each receiving node rebroadcasts it. This continues until the RREQ packet arrives at the destination node. Pure flooding generates excessive redundant routing traffic that may lead to the broadcast storm problem (BSP) and deteriorate the performance of MANETs significantly. A number of probabilistic broadcasting schemes have been proposed in the literature to address BSP. However, these schemes do not consider thermal noise and interference which exist in real life MANETs, and therefore, do not perform well in real life MANETs. Real life MANETs are noisy and the communication is not error free. This research argues that a broadcast scheme that considers the effects of thermal noise, co-channel interference, and node density in the neighbourhood simultaneously can reduce the broadcast storm problem and enhance the MANET performance. To achieve this, three investigations have been carried out: First, the effect of carrier sensing ranges on on-demand routing protocol such as AODV and their impact on interference; second, effects of thermal noise on on-demand routing protocols and third, evaluation of pure flooding and probabilistic broadcasting schemes under noisy and noiseless conditions. The findings of these investigations are exploited to propose a Channel Adaptive Probabilistic Broadcast (CAPB) scheme to disseminate RREQ packets efficiently. The proposed CAPB scheme determines the probability of rebroadcasting RREQ packets on the fly according to the current Signal to Interference plus Noise Ratio (SINR) and node density in the neighbourhood. The proposed scheme and two related state of the art (SoA) schemes from the literature are implemented in the standard AODV to replace the pure flooding based broadcast scheme. Ns-2 simulation results show that the proposed CAPB scheme outperforms the other schemes in terms of routing overhead, average end-to-end delay, throughput and energy consumption

Efficient Passive Clustering and Gateways selection MANETs

Passive clustering does not employ control packets to collect topological information in ad hoc networks. In our proposal, we avoid making frequent changes in cluster architecture due to repeated election and re-election of cluster heads and gateways. Our primary objective has been to make Passive Clustering more practical by employing optimal number of gateways and reduce the number of rebroadcast packets

Reliable Message Dissemination in Mobile Vehicular Networks

Les réseaux véhiculaires accueillent une multitude d’applications d’info-divertissement et de sécurité. Les applications de sécurité visent à améliorer la sécurité sur les routes (éviter les accidents), tandis que les applications d’info-divertissement visent à améliorer l'expérience des passagers. Les applications de sécurité ont des exigences rigides en termes de délais et de fiabilité ; en effet, la diffusion des messages d’urgence (envoyés par un véhicule/émetteur) devrait être fiable et rapide. Notons que, pour diffuser des informations sur une zone de taille plus grande que celle couverte par la portée de transmission d’un émetteur, il est nécessaire d’utiliser un mécanisme de transmission multi-sauts. De nombreuses approches ont été proposées pour assurer la fiabilité et le délai des dites applications. Toutefois, ces méthodes présentent plusieurs lacunes. Cette thèse, nous proposons trois contributions. La première contribution aborde la question de la diffusion fiable des messages d’urgence. A cet égard, un nouveau schéma, appelé REMD, a été proposé. Ce schéma utilise la répétition de message pour offrir une fiabilité garantie, à chaque saut, tout en assurant un court délai. REMD calcule un nombre optimal de répétitions en se basant sur l’estimation de la qualité de réception de lien dans plusieurs locations (appelées cellules) à l’intérieur de la zone couverte par la portée de transmission de l’émetteur. REMD suppose que les qualités de réception de lien des cellules adjacentes sont indépendantes. Il sélectionne, également, un nombre de véhicules, appelés relais, qui coopèrent dans le contexte de la répétition du message d’urgence pour assurer la fiabilité en multi-sauts. La deuxième contribution, appelée BCRB, vise à améliorer REMD ; elle suppose que les qualités de réception de lien des cellules adjacentes sont dépendantes ce qui est, généralement, plus réaliste. BCRB utilise les réseaux Bayésiens pour modéliser les dépendances en vue d’estimer la qualité du lien de réception avec une meilleure précision. La troisième contribution, appelée RICS, offre un accès fiable à Internet. RICS propose un modèle d’optimisation, avec une résolution exacte optimale à l'aide d’une technique de réduction de la dimension spatiale, pour le déploiement des passerelles. Chaque passerelle utilise BCRB pour établir une communication fiable avec les véhicules.Vehicular networks aim to enable a plethora of safety and infotainment applications. Safety applications aim to preserve people's lives (e.g., by helping in avoiding crashes) while infotainment applications focus on enhancing the passengers’ experience. These applications, especially safety applications, have stringent requirements in terms of reliability and delay; indeed, dissemination of an emergency message (e.g., by a vehicle/sender involved in a crash) should be reliable while satisfying short delay requirements. Note, that multi-hop dissemination is needed to reach all vehicles, in the target area, that may be outside the transmission range of the sender. Several schemes have been proposed to provide reliability and short delay for vehicular applications. However, these schemes have several limitations. Thus, the design of new solutions, to meet the requirement of vehicular applications in terms of reliability while keeping low end-to-end delay, is required. In this thesis, we propose three schemes. The first scheme is a multi-hop reliable emergency message dissemination scheme, called REMD, which guarantees a predefined reliability , using message repetitions/retransmissions, while satisfying short delay requirements. It computes an optimal number of repetitions based on the estimation of link reception quality at different locations (called cells) in the transmission range of the sender; REMD assumes that link reception qualities of adjacent cells are independent. It also adequately selects a number of vehicles, called forwarders, that cooperate in repeating the emergency message with the objective to satisfy multi-hop reliability requirements. The second scheme, called BCRB, overcomes the shortcoming of REMD by assuming that link reception qualities of adjacent cells are dependent which is more realistic in real-life scenarios. BCRB makes use of Bayesian networks to model these dependencies; this allows for more accurate estimation of link reception qualities leading to better performance of BCRB. The third scheme, called RICS, provides internet access to vehicles by establishing multi-hop reliable paths to gateways. In RICS, the gateway placement is modeled as a k-center optimisation problem. A space dimension reduction technique is used to solve the problem in exact time. Each gateway makes use of BCRB to establish reliable communication paths to vehicles

Discrete Event Simulations

Considered by many authors as a technique for modelling stochastic, dynamic and discretely evolving systems, this technique has gained widespread acceptance among the practitioners who want to represent and improve complex systems. Since DES is a technique applied in incredibly different areas, this book reflects many different points of view about DES, thus, all authors describe how it is understood and applied within their context of work, providing an extensive understanding of what DES is. It can be said that the name of the book itself reflects the plurality that these points of view represent. The book embraces a number of topics covering theory, methods and applications to a wide range of sectors and problem areas that have been categorised into five groups. As well as the previously explained variety of points of view concerning DES, there is one additional thing to remark about this book: its richness when talking about actual data or actual data based analysis. When most academic areas are lacking application cases, roughly the half part of the chapters included in this book deal with actual problems or at least are based on actual data. Thus, the editor firmly believes that this book will be interesting for both beginners and practitioners in the area of DES

Self-Evaluation Applied Mathematics 2003-2008 University of Twente

This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT). The report provides the information for the Research Assessment Committee for Applied Mathematics, dealing with mathematical sciences at the three universities of technology in the Netherlands. It describes the state of affairs pertaining to the period 1 January 2003 to 31 December 2008

Efficient Content-based Routing, Mobility-aware Topologies, and Temporal Subspace Matching

Event-based systems are seen as good candidates for supporting distributed applications in dynamic and ubiquitous environments because they support decoupled and asynchronous many-to-many information dissemination. Event systems are widely used, because asynchronous messaging provides a flexible alternative to RPC (Remote Procedure Call). They are typically implemented using an overlay network of routers. A content-based router forwards event messages based on filters that are installed by subscribers and other routers. The filters are organized into a routing table in order to forward incoming events to proper subscribers and neighbouring routers. This thesis addresses the optimization of content-based routing tables organized using the covering relation and presents novel data structures and configurations for improving local and distributed operation. Data structures are needed for organizing filters into a routing table that supports efficient matching and runtime operation. We present novel results on dynamic filter merging and the integration of filter merging with content-based routing tables. In addition, the thesis examines the cost of client mobility using different protocols and routing topologies. We also present a new matching technique called temporal subspace matching. The technique combines two new features. The first feature, temporal operation, supports notifications, or content profiles, that persist in time. The second feature, subspace matching, allows more expressive semantics, because notifications may contain intervals and be defined as subspaces of the content space. We also present an application of temporal subspace matching pertaining to metadata-based continuous collection and object tracking.Tapahtumapohjaiset järjestelmät nähdään hyvänä tapana tukea ja kehittää hajautettuja sovelluksia dynaamisissa ympäristöissä. Nämä järjestelmät tukevat asynkronista viestien välitystä. Tapahtumapohjaisia järjestelmiä käytetään, koska asynkroninen viestintä mahdollistaa etäproseduurikutsuja vapaammat sidokset sovellusten välille. Tapahtumapohjaiset järjestelmät toteutetaan tyypillisesti ns. "overlay" verkkoina sovelluskerroksella. Sisältöpohjainen reititin välittää tapahtumaviestejä tilaajien asettamien suotimien (eng. filter) perusteella. Tiedon tilaajat ja tuottajat kytketään suotimien avulla niin että tuottajien tuottamat tapahtumat välittyvät aktiivisille tilaajille. Suodin valikoi viestivirrasta halutut viestit erityisten sääntöjen avulla. Suotimet järjestetään reititystauluksi, jonka perusteella päätetään kenelle reititin ohjaa viestejä. Väitöskirja käsittelee suodinpohjaisten reititystaulujen optimointia ja esittää uusia tietorakenteita ja konfiguraatioita paikalliseen sekä hajautettuun toimintaan. Työssä esitetään yleinen formaali suotimien yhdistämismalli, joka integroidaan esitettyjen tietorakenteiden kanssa. Lisäksi työssä tutkitaan liikkuvien tilaajien ja tuottajien aiheuttamia kustannuksia. Työssä esitetään myös uusi tekniikka aikaan kytketyn tiedon välitykseen. Tekniikka yhdistää kaksi uutta piirrettä. Ensimmäinen piirre on temporaalinen toiminta, jossa välitettävä tieto on määritetty olemaan voimassa tietyn ajanjakson. Toinen ominaisuus mahdollistaa sekä kyselyiden että datan, johon kyselyt kohdistuvat, määrittelyn moniulotteisten suotimien avulla. Työssä esitetään tekniikasta esimerkkisovellus, joka käsittelee joukkojen ja olioiden seurantaa

Discovering Network Control Vulnerabilities and Policies in Evolving Networks

The range and number of new applications and services are growing at an unprecedented rate. Computer networks need to be able to provide connectivity for these services and meet their constantly changing demands. This requires not only support of new network protocols and security requirements, but often architectural redesigns for long-term improvements to efficiency, speed, throughput, cost, and security. Networks are now facing a drastic increase in size and are required to carry a constantly growing amount of heterogeneous traffic. Unfortunately such dynamism greatly complicates security of not only the end nodes in the network, but also of the nodes of the network itself. To make matters worse, just as applications are being developed at faster and faster rates, attacks are becoming more pervasive and complex. Networks need to be able to understand the impact of these attacks and protect against them. Network control devices, such as routers, firewalls, censorship devices, and base stations, are elements of the network that make decisions on how traffic is handled. Although network control devices are expected to act according to specifications, there can be various reasons why they do not in practice. Protocols could be flawed, ambiguous or incomplete, developers could introduce unintended bugs, or attackers may find vulnerabilities in the devices and exploit them. Malfunction could intentionally or unintentionally threaten the confidentiality, integrity, and availability of end nodes and the data that passes through the network. It can also impact the availability and performance of the control devices themselves and the security policies of the network. The fast-paced evolution and scalability of current and future networks create a dynamic environment for which it is difficult to develop automated tools for testing new protocols and components. At the same time, they make the function of such tools vital for discovering implementation flaws and protocol vulnerabilities as networks become larger and more complex, and as new and potentially unrefined architectures become adopted. This thesis will present the design, implementation, and evaluation of a set of tools designed for understanding implementation of network control nodes and how they react to changes in traffic characteristics as networks evolve. We will first introduce Firecycle, a test bed for analyzing the impact of large-scale attacks and Machine-to-Machine (M2M) traffic on the Long Term Evolution (LTE) network. We will then discuss Autosonda, a tool for automatically discovering rule implementation and finding triggering traffic features in censorship devices. This thesis provides the following contributions: 1. The design, implementation, and evaluation of two tools to discover models of network control nodes in two scenarios of evolving networks, mobile network and censored internet 2. First existing test bed for analysis of large-scale attacks and impact of traffic scalability on LTE mobile networks 3. First existing test bed for LTE networks that can be scaled to arbitrary size and that deploys traffic models based on real traffic traces taken from a tier-1 operator 4. An analysis of traffic models of various categories of Internet of Things (IoT) devices 5. First study demonstrating the impact of M2M scalability and signaling overload on the packet core of LTE mobile networks 6. A specification for modeling of censorship device decision models 7. A means for automating the discovery of features utilized in censorship device decision models, comparison of these models, and their rule discover