Self-organized backpressure routing for the wireless mesh backhaul of small cells

The ever increasing demand for wireless data services has given a starring role to dense small cell (SC) deployments for mobile networks, as increasing frequency re-use by reducing cell size has historically been the most effective and simple way to increase capacity. Such densification entails challenges at the Transport Network Layer (TNL), which carries packets throughout the network, since hard-wired deployments of small cells prove to be cost-unfeasible and inflexible in some scenarios. The goal of this thesis is, precisely, to provide cost-effective and dynamic solutions for the TNL that drastically improve the performance of dense and semi-planned SC deployments. One approach to decrease costs and augment the dynamicity at the TNL is the creation of a wireless mesh backhaul amongst SCs to carry control and data plane traffic towards/from the core network. Unfortunately, these lowcost SC deployments preclude the use of current TNL routing approaches such as Multiprotocol Label Switching Traffic Profile (MPLS-TP), which was originally designed for hard-wired SC deployments. In particular, one of the main problems is that these schemes are unable to provide an even network resource consumption, which in wireless environments can lead to a substantial degradation of key network performance metrics for Mobile Network Operators. The equivalent of distributing load across resources in SC deployments is making better use of available paths, and so exploiting the capacity offered by the wireless mesh backhaul formed amongst SCs. To tackle such uneven consumption of network resources, this thesis presents the design, implementation, and extensive evaluation of a self-organized backpressure routing protocol explicitly designed for the wireless mesh backhaul formed amongst the wireless links of SCs. Whilst backpressure routing in theory promises throughput optimality, its implementation complexity introduces several concerns, such as scalability, large end-to-end latencies, and centralization of all the network state. To address these issues, we present a throughput suboptimal yet scalable, decentralized, low-overhead, and low-complexity backpressure routing scheme. More specifically, the contributions in this thesis can be summarized as follows: We formulate the routing problem for the wireless mesh backhaul from a stochastic network optimization perspective, and solve the network optimization problem using the Lyapunov-driftplus-penalty method. The Lyapunov drift refers to the difference of queue backlogs in the network between different time instants, whereas the penalty refers to the routing cost incurred by some network utility parameter to optimize. In our case, this parameter is based on minimizing the length of the path taken by packets to reach their intended destination. Rather than building routing tables, we leverage geolocation information as a key component to complement the minimization of the Lyapunov drift in a decentralized way. In fact, we observed that the combination of both components helps to mitigate backpressure limitations (e.g., scalability,centralization, and large end-to-end latencies). The drift-plus-penalty method uses a tunable optimization parameter that weight the relative importance of queue drift and routing cost. We find evidence that, in fact, this optimization parameter impacts the overall network performance. In light of this observation, we propose a self-organized controller based on locally available information and in the current packet being routed to tune such an optimization parameter under dynamic traffic demands. Thus, the goal of this heuristically built controller is to maintain the best trade-off between the Lyapunov drift and the penalty function to take into account the dynamic nature of semi-planned SC deployments. We propose low complexity heuristics to address problems that appear under different wireless mesh backhaul scenarios and conditions..

Towards a Queueing-Based Framework for In-Network Function Computation

We seek to develop network algorithms for function computation in sensor networks. Specifically, we want dynamic joint aggregation, routing, and scheduling algorithms that have analytically provable performance benefits due to in-network computation as compared to simple data forwarding. To this end, we define a class of functions, the Fully-Multiplexible functions, which includes several functions such as parity, MAX, and k th -order statistics. For such functions we exactly characterize the maximum achievable refresh rate of the network in terms of an underlying graph primitive, the min-mincut. In acyclic wireline networks, we show that the maximum refresh rate is achievable by a simple algorithm that is dynamic, distributed, and only dependent on local information. In the case of wireless networks, we provide a MaxWeight-like algorithm with dynamic flow splitting, which is shown to be throughput-optimal

Intrusion detection in IPv6-enabled sensor networks.

In this research, we study efficient and lightweight Intrusion Detection Systems (IDS) for ad-hoc networks through the lens of IPv6-enabled Wireless Sensor Actuator Networks. These networks consist of highly constrained devices able to communicate wirelessly in an ad-hoc fashion, thus following the architecture of ad-hoc networks. Current state of the art IDS in IoT and WSNs have been developed considering the architecture of conventional computer networks, and as such they do not efficiently address the paradigm of ad-hoc networks, which is highly relevant in emerging network paradigms, such as the Internet of Things (IoT). In this context, the network properties of resilience and redundancy have not been extensively studied. In this thesis, we first identify a trade-off between the communication and energy overheads of an IDS (as captured by the number of active IDS agents in the network) and the performance of the system in terms of successfully identifying attacks. In order to fine-tune this trade-off, we model networks as Random Geometric Graphs; these are a rigorous approach that allows us to capture underlying structural properties of the network. We then introduce a novel IDS architectural approach that consists of a central IDS agent and set of distributed IDS agents deployed uniformly at random over the network area. These nodes are able to efficiently detect attacks at the networking layer in a collaborative manner by monitoring locally available network information provided by IoT routing protocols, such as RPL. The detailed experimental evaluation conducted in this research demonstrates significant performance gains in terms of communication overhead and energy dissipation while maintaining high detection rates. We also show that the performance of our IDS in ad-hoc networks does not rely on the size of the network but on fundamental underling network properties, such as the network topology and the average degree of the nodes. The experiments show that our proposed IDS architecture is resilient against frequent topology changes due to node failures

System design issues in dense urban millimeter wave cellular networks

Upcoming deployments of cellular networks will see an increasing use of millimeter wave (mmWave) frequencies, roughly between 20-100 GHz. The goal of this dissertation is to investigate some key design issues in dense urban mmWave cellular networks by developing mathematical models that are representative of these networks. In the first contribution, stochastic geometry (SG) is used to study the per user rate performance of multi-user MIMO (MU-MIMO) in downlink mmWave cellular network incorporating the impact of a spatially sparse blockage dependent multipath channel and hybrid precoding. Performance of MU-MIMO is then compared with single-user beamforming and spatial multiplexing in different network scenarios considering coverage, rate and power consumption tradeoffs to suggest when to use which MIMO scheme. The second contribution reconsiders a popular received signal power model used in system capacity analysis of MIMO wireless networks employing single user beamforming. A modification is suggested to the model by introducing a correction factor. An approximate analysis is done to justify incorporating such a factor and simulations are performed to validate it's importance. Although this contribution does not study a new system design issue for mmWave cellular, it highlights a shortcoming with using the popular received signal power model to study design issues in mmWave cellular networks. The third and fourth contributions investigate resource allocation in self-backhauled mmWave cellular networks. In order to enable affordable initial deployments of mmWave cellular, self-backhauling is envisioned as a cost-saving solution. The third contribution investigates how to divide resources between uplink and downlink for access and backhaul in self-backhauled networks with single hop wireless backhauling. The performance of dynamic time division duplexing (TDD) and integrated access-backhaul (IAB) is compared with static TDD and orthogonal access backhaul (OAB) strategies using a SG based model. The last contribution of this dissertation addresses the following key question for self-backhauled networks. What is the maximum extended coverage area that a single fiber site can support using multi-hop relaying, while still achieving a minimum target per user data rate? The problem of maximizing minimum per user rates is studied considering a series of deployments with a single fiber site and varying number of relays. Several design guidelines for multi-hop mmWave cellular networks are provided based on the analytical and empirical results.Electrical and Computer Engineerin

Zuverlässige und Energieeffiziente gemischt-kritische Echtzeit On-Chip Systeme

Multi- and many-core embedded systems are increasingly becoming the target for many applications that require high performance under varying conditions. A resulting challenge is the control, and reliable operation of such complex multiprocessing architectures under changes, e.g., high temperature and degradation. In mixed-criticality systems where many applications with varying criticalities are consolidated on the same execution platform, fundamental isolation requirements to guarantee non-interference of critical functions are crucially important. While Networks-on-Chip (NoCs) are the prevalent solution to provide scalable and efficient interconnects for the multiprocessing architectures, their associated energy consumption has immensely increased. Specifically, hard real-time NoCs must manifest limited energy consumption as thermal runaway in such a core shared resource jeopardizes the whole system guarantees. Thus, dynamic energy management of NoCs, as opposed to the related work static solutions, is highly necessary to save energy and decrease temperature, while preserving essential temporal requirements. In this thesis, we introduce a centralized management to provide energy-aware NoCs for hard real-time systems. The design relies on an energy control network, developed on top of an existing switch arbitration network to allow isolation between energy optimization and data transmission. The energy control layer includes local units called Power-Aware NoC controllers that dynamically optimize NoC energy depending on the global state and applications’ temporal requirements. Furthermore, to adapt to abnormal situations that might occur in the system due to degradation, we extend the concept of NoC energy control to include the entire system scope. That is, online resource management employing hierarchical control layers to treat system degradation (imminent core failures) is supported. The mechanism applies system reconfiguration that involves workload migration. For mixed-criticality systems, it allows flexible boundaries between safety-critical and non-critical subsystems to safely apply the reconfiguration, preserving fundamental safety requirements and temporal predictability. Simulation and formal analysis-based experiments on various realistic usecases and benchmarks are conducted showing significant improvements in NoC energy-savings and in treatment of system degradation for mixed-criticality systems improving dependability over the status quo.Eingebettete Many- und Multi-core-Systeme werden zunehmend das Ziel für Anwendungen, die hohe Anfordungen unter unterschiedlichen Bedinungen haben. Für solche hochkomplexed Multi-Prozessor-Systeme ist es eine grosse Herausforderung zuverlässigen Betrieb sicherzustellen, insbesondere wenn sich die Umgebungseinflüsse verändern. In Systeme mit gemischter Kritikalität, in denen viele Anwendungen mit unterschiedlicher Kritikalität auf derselben Ausführungsplattform bedient werden müssen, sind grundlegende Isolationsanforderungen zur Gewährleistung der Nichteinmischung kritischer Funktionen von entscheidender Bedeutung. Während On-Chip Netzwerke (NoCs) häufig als skalierbare Verbindung für die Multiprozessor-Architekturen eingesetzt werden, ist der damit verbundene Energieverbrauch immens gestiegen. Daher sind dynamische Plattformverwaltungen, im Gegensatz zu den statischen, zwingend notwendig, um ein System an die oben genannten Veränderungen anzupassen und gleichzeitig Timing zu gewährleisten. In dieser Arbeit entwickeln wir energieeffiziente NoCs für harte Echtzeitsysteme. Das Design basiert auf einem Energiekontrollnetzwerk, das auf einem bestehenden Switch-Arbitration-Netzwerk entwickelt wurde, um eine Isolierung zwischen Energieoptimierung und Datenübertragung zu ermöglichen. Die Energiesteuerungsschicht umfasst lokale Einheiten, die als Power-Aware NoC-Controllers bezeichnet werden und die die NoC-Energie in Abhängigkeit vom globalen Zustand und den zeitlichen Anforderungen der Anwendungen optimieren. Darüber hinaus wird das Konzept der NoC-Energiekontrolle zur Anpassung an Anomalien, die aufgrund von Abnutzung auftreten können, auf den gesamten Systemumfang ausgedehnt. Online- Ressourcenverwaltungen, die hierarchische Kontrollschichten zur Behandlung Abnutzung (drohender Kernausfälle) einsetzen, werden bereitgestellt. Bei Systemen mit gemischter Kritikalität erlaubt es flexible Grenzen zwischen sicherheitskritischen und unkritischen Subsystemen, um die Rekonfiguration sicher anzuwenden, wobei grundlegende Sicherheitsanforderungen erhalten bleiben und Timing Vorhersehbarkeit. Experimente werden auf der Basis von Simulationen und formalen Analysen zu verschiedenen realistischen Anwendungsfallen und Benchmarks durchgeführt, die signifikanten Verbesserungen bei On-Chip Netzwerke-Energieeinsparungen und bei der Behandlung von Abnutzung für Systeme mit gemischter Kritikalität zur Verbesserung die Systemstabilität gegenüber dem bisherigen Status quo zeigen

Performance measurement methodology for integrated services networks

With the emergence of advanced integrated services networks, the need for effective performance analysis techniques has become extremely important. Further advancements in these networks can only be possible if the practical performance issues of the existing networks are clearly understood. This thesis is concerned with the design and development of a measurement system which has been implemented on a large experimental network. The measurement system is based on dedicated traffic generators which have been designed and implemented on the Project Unison network. The Unison project is a multisite networking experiment for conducting research into the interconnection and interworking of local area network based multi-media application systems. The traffic generators were first developed for the Cambridge Ring based Unison network. Once their usefulness and effectiveness was proven, high performance traffic generators using transputer technology were built for the Cambridge Fast Ring based Unison network. The measurement system is capable of measuring the conventional performance parameters such as throughput and packet delay, and is able to characterise the operational performance of network bridging components under various loading conditions. In particular, the measurement system has been used in a 'measure and tune' fashion in order to improve the performance of a complex bridging device. Accurate measurement of packet delay in wide area networks is a recognised problem. The problem is associated with the synchronisation of the clocks between the distant machines. A chronological timestamping technique has been introduced in which the clocks are synchronised using a broadcast synchronisation technique. Rugby time clock receivers have been interfaced to each generator for the purpose of synchronisation. In order to design network applications, an accurate knowledge of the expected network performance under different loading conditions is essential. Using the measurement system, this has been achieved by examining the network characteristics at the network/user interface. Also, the generators are capable of emulating a variety of application traffic which can be injected into the network along with the traffic from real applications, thus enabling user oriented performance parameters to be evaluated in a mixed traffic environment. A number of performance measurement experiments have been conducted using the measurement system. Experimental results obtained from the Unison network serve to emphasise the power and effectiveness of the measurement methodology

Methodologies and Toolflows for the Predictable Design of Reliable and Low-Power NoCs

There is today the unmistakable need to evolve design methodologies and tool ows for Network-on-Chip based embedded systems. In particular, the quest for low-power requirements is nowadays a more-than-ever urgent dilemma. Modern circuits feature billion of transistors, and neither power management techniques nor batteries capacity are able to endure the increasingly higher integration capability of digital devices. Besides, power concerns come together with modern nanoscale silicon technology design issues. On one hand, system failure rates are expected to increase exponentially at every technology node when integrated circuit wear-out failure mechanisms are not compensated for. However, error detection and/or correction mechanisms have a non-negligible impact on the network power. On the other hand, to meet the stringent time-to-market deadlines, the design cycle of such a distributed and heterogeneous architecture must not be prolonged by unnecessary design iterations. Overall, there is a clear need to better discriminate reliability strategies and interconnect topology solutions upfront, by ranking designs based on power metric. In this thesis, we tackle this challenge by proposing power-aware design technologies. Finally, we take into account the most aggressive and disruptive methodology for embedded systems with ultra-low power constraints, by migrating NoC basic building blocks to asynchronous (or clockless) design style. We deal with this challenge delivering a standard cell design methodology and mainstream CAD tool ows, in this way partially relaxing the requirement of using asynchronous blocks only as hard macros

Improvements to end-to-end performance of low-power wireless networks

Over the last decades, wireless technologies have become an important part of our daily lives. A plentitude of new types of networks based on wireless technologies have emerged, often replacing wired solutions. In this development, not only the number and the types of devices equipped with wireless transceivers have significantly increased, also the variety of wireless technologies has grown considerably. Moreover, Internet access for wireless devices has paved the way for a large variety of new private, business, and research applications. Great efforts have been made by the research community and the industry to develop standards, specifications, and communication protocols for networks of constrained devices, we refer to as Wireless Sensor Networks (WSNs). The Institute of Electrical and Electronics Engineers (IEEE) defined the 802.15.4 standard for Personal Area Networks (PANs). With the introduction of an adaptation layer which makes IEEE 802.15.4 networks IPv6-capable, interconnecting billions of constrained devices has become possible and is expected to become a reality in the near future. The vision that embraces the idea of interweaving Internet technology with any type of smart objects, such as wearable devices or sensors of a WSN, is called the Internet of Things (IoT). The main goal of this thesis is the improvement of the performance of low-power wireless networks. Given the wide scope of application scenarios and networking solutions proposed for such networks, the development and optimization of communication protocols for wireless low-power devices is a challenging task: The hardware restrictions of constrained devices, specific application scenarios that may vary from one network to another, and the integration of WSNs into the IoT require new approaches to the design and evaluation of communication protocols. To face these challenges and to find solutions for them, research needs to be carried out. Mechanisms and parameter settings of communication protocol stacks for WSNs that are crucial to the network performance need to be identified, optimized, and complemented by adding new ones. The first contribution of this thesis is the improvement of end-to-end performance for IEEE 802.15.4-based PANs, where default parameter settings of common communication protocols are analyzed and evaluated with regard to their impact on the network performance. Physical evaluations are carried out in a large testbed, addressing the important question of whether the default and allowed range settings defined for common communication protocols are efficient or whether alternative settings may yield a better performance. The second contribution of this thesis is the improvement of end-to-end performance for ZigBee wireless HA networks. ZigBee is an important standard for low-power wireless networks and the investigations carried out address the crucial lack of investigation the ZigBee HA performance evaluations through physical experiments and potential ways to improve the network performance based on these experiments. Eventually, this thesis focuses on the improvement of the congestion control (CC) mechanism applied by the Constrained Application Protocol (CoAP) used in IoT communications. For the handling of the possible congestion in the IoT produced by the plethora of the devices and/or link errors innate to low-power radio communications, the default CC mechanism it lacks an advanced CC algorithm. Given CoAP's high relevance for IoT communications, an advanced CC algorithm should be capable of adapting to these particularities of IoT communications. This thesis contributes to this topic with the design and optimization of the CoAP Advanced Congestion Control/Simple (CoCoA) protocol, an advanced CC mechanism for CoAP.The investigations of advanced CC mechanisms for CoAP involve extensive performance evaluations in simulated networks and physical experiments in real testbeds using different communication technologies.En les últimes dècades, les tecnologies sense fils s'han convertit en una part important de la nostra vida quotidiana. Una àmplia varietat de nous tipus de xarxes basades en tecnologies sense fils han sorgit, sovint reemplaçant solucions cablejades. En aquest desenvolupament, no només el nombre i els tipus de dispositius equipats amb transceptors sense fils han augmentat significativament, també la varietat de tecnologies sense fils ha crescut de manera considerable. D'altra banda, l'accés a Internet per als dispositius sense fils ha donat pas a una gran varietat de noves aplicacions privades, comercials i d'investigació. La comunitat científica i la indústria han fet grans esforços per desenvolupar normes, especificacions i protocols de comunicació per a xarxes de sensors sense fils (WSNs). L'Institut d'Enginyeria Elèctrica i Electrònica (IEEE) defineix l'estàndard 802.15.4 per a xarxes d'àrea personal (PAN). Amb la introducció d'una capa d'adaptació que possibilita les IEEE 802.15.4 xarxes compatibles amb IPv6, la interconnexió de milers de milions de dispositius restringits s'ha fet possible. La idea d'entreteixir la tecnologia d'Internet amb qualsevol tipus d'objectes intel·ligents, com els dispositius o sensors d'una WSN és coneguda com la Internet de les Coses (IoT). L'objectiu principal d'aquesta tesi és la millora del rendiment de les WSNs. Donada l'àmplia gamma d'escenaris d'aplicacions i solucions de xarxes proposats per a aquest tipus de xarxes, el desenvolupament i l'optimització dels protocols de comunicació per a dispositius de WSNs és una tasca difícil: les limitacions de capacitats dels dispositius restringits, escenaris d'aplicació específics que poden variar d'una xarxa a l'altra, i la integració de les WSNs a la IoT requereixen nous enfocaments per al disseny i avaluació de protocols de comunicació. Cal identificar mecanismes i configuracions de paràmetres de les piles de protocols de comunicació per a WSNs que són elementals per al rendiment de la xarxa, optimitzar-los, i complementar-los amb l'addició d'altres de nous. La primera contribució d'aquesta tesi és la millora del rendiment extrem a extrem per PANs basat en IEEE 802.15.4, on s'analitza la configuració de paràmetres que es fan servir per defecte en protocols de comunicació comuns i s'avalua el seu impacte en el rendiment de la xarxa. Avaluacions físiques en una xarxa de sensors permeten fer front a la important qüestió de si els valors estàndards dels paràmetres són eficients o si ajustant-los es pot proporcionar un millor rendiment. La segona contribució d'aquesta tesi és l'optimització del rendiment extrem a extrem de xarxes ZigBee domòtiques (HA) sense fils. ZigBee és un estàndard important per a WSNs. Els estudis duts a terme cobreixen la important falta d'investigació d'avaluacions de rendiment de xarxes HA de ZigBee mitjançant experiments físics i mostrant formes per millorar el rendiment de la xarxa en base d'aquests experiments. Finalment, aquesta tesi es centra en la millora del mecanisme bàsic de control de congestió (CC) aplicada pel Constrained Application Protocol (CoAP) utilitzat en les comunicacions de la IoT. És necessari un algoritme de CC avançat per al control de la possible congestió en la IoT produïda per la plètora de dispositius i/o errors d'enllaç naturals per a les comunicacions de ràdio de baixa potencia. Donada l'alta rellevància de CoAP per a les comunicacions en la IoT, un algoritme CC avançat ha de ser capaç d'adaptar-se a les particularitats de les comunicacions de la IoT. Aquesta tesi contribueix al problema amb el disseny i l'optimització Control de Congestió Avançat / Simple del CoAP (CoCoA), un mecanisme de CC avançat per CoAP. Les investigacions de mecanismes de CC avançats per CoAP impliquen avaluacions extenses en xarxes simulades i experiments físics en xarxes reals utilitzant diferents tecnologies de comunicacions

Adaptive Hybrid Switching Technique for Parallel Computing System

Parallel processing accelerates computations by solving a single problem using multiple compute nodes interconnected by a network. The scalability of a parallel system is limited byits ability to communicate and coordinate processing. Circuit switching, packet switchingand wormhole routing are dominant switching techniques. Our simulation results show that wormhole routing and circuit switching each excel under different types of traffic.This dissertation presents a hybrid switching technique that combines wormhole routing with circuit switching in a single switch using vrtual channels and time division multiplexing. The performance of this hybrid switch is significantly impacted by the effciency of traffic scheduling and thus, this dissertation also explores the design and scalability of hardware scheduling for the hybrid switch. In particular, we introduce two schedulers for crossbar networks: a greedy scheduler and an optimal scheduler that improves upon the resultsprovided by the greedy scheduler. For the time division multiplexing portion of the hybrid switch, this dissertation presents three allocation methods that combine wormhole switching with predictive circuit switching. We further extend this research from crossbar networks to fat tree interconnected networks with virtual channels. The global "level-wise" scheduling algorithm is presented and improves network utilization by 30% when compared to a switch-level algorithm. The performance of the hybrid switching is evaluated on a cycle accurate simulation framework that is also part of this dissertation research. Our experimental results demonstrate that the hybrid switch is capable of transferring both predictable traffics and unpredictable traffics successfully. By dynamically selecting the proper switching technique based on the type of communication traffic, the hybrid switch improves communication for most types of traffic