Flexible and dynamic network coding for adaptive data transmission in DTNs

Existing network coding approaches for Delay-Tolerant Networks (DTNs) do not detect and adapt to congestion in the network. In this paper we describe CafNC (Congestion aware forwarding with Network Coding) that combines adaptive network coding and adaptive forwarding in DTNs. In CafNC each node learns the status of its neighbours, and their egonetworks in order to detect coding opportunities, and codes as long as the recipients can decode. Our flexible design allows CafNC to efficiently support multiple unicast flows, with dynamic traffic demands and dynamic senders and receivers. We evaluate CafNC with two real connectivity traces and a realistic P2P application, introducing congestion by increasing the number of unicast flows in the network. Our results show that CafNC improves the success ratio, delay and packet loss, as the number of flows grows in comparison to no coding and hub-based static coding, while at the same time achieving efficient utilisation of network resources. We also show that static coding misses a number of coding opportunities and increases packet loss rates at times of increased congestion

A DIVERSE BAND-AWARE DYNAMIC SPECTRUM ACCESS ARCHITECTURE FOR CONNECTIVITY IN RURAL COMMUNITIES

Ubiquitous connectivity plays an important role in improving the quality of life in terms of economic development, health and well being, social justice and equity, as well as in providing new educational opportunities. However, rural communities which account for 46% of the world\u27s population lacks access to proper connectivity to avail such societal benefits, creating a huge digital divide between the urban and rural areas. A primary reason is that the Information and Communication Technologies (ICT) providers have less incentives to invest in rural areas due to lack of promising revenue returns. Existing research and industrial attempts in providing connectivity to rural communities suffer from severe drawbacks, such as expensive wireless spectrum licenses and infrastructures, under- and over-provisioning of spectrum resources while handling heterogeneous traffic, lack of novel wireless technologies tailored to the unique challenges and requirements of rural communities (e.g., agricultural fields). Leveraging the recent advances in Dynamic Spectrum Access (DSA) technologies like wide band spectrum analyzers and spectrum access systems, and multi-radio access technologies (multi-RAT), this dissertation proposes a novel Diverse Band-aware DSA (d-DSA) network architecture, that addresses the drawbacks of existing standard and DSA wireless solutions, and extends ubiquitous connectivity to rural communities; a step forward in the direction of the societal and economic improvements in rural communities, and hence, narrowing the digital divide between the rural and urban societies. According to this paradigm, a certain wireless device is equipped with software defined radios (SDRs) that are capable of accessing multiple (un)licensed spectrum bands, such as, TV, LTE, GSM, CBRS, ISM, and possibly futuristic mmWaves. In order to fully exploit the potential of the d-DSA paradigm, while meeting heterogeneous traffic demands that may be generated in rural communities, we design efficient routing strategies and optimization techniques, which are based on a variety of tools such as graph modeling, integer linear programming, dynamic programming, and heuristic design. Our results on realistic traces in a large variety of rural scenarios show that the proposed techniques are able to meet the heterogeneous traffic requirements of rural applications, while ensuring energy efficiency and robustness of the architecture for providing connectivity to rural communities

Delay tolerant network for Navy scenarios: quality-based approach

Mestrado em Engenharia Eletrónica e TelecomunicaçõesThe navy operations involve several participants that work between them with common objectives and usually under challenged communication conditions. There are natural constrains that are imposed by the operation environment, e.g. hilly terrains. There are also artificial constrains that are created by enemy elements which force conditions to affect the navy operation (or other military forces), e.g. intentional jamming. The military often uses proprietary devices to communicate between them. Despite of the effectiveness of these devices, they are expensive and usually offer a limited range of services. However, the recent technological advances allow the proliferation of several mobile devices with wireless communication capabilities and with the value to easily insert new features, but these devices are still not prepared to military networks in terms of communication. Thus, this dissertation proposes to use Delay Tolerant Networks (DTNs) with a new routing protocol Quality-PRoPHET (Q-PRoPHET) able to measure the quality of the wireless links and route the information using the connections with best quality, where the probability of transmission is higher. The Q-PRoPHET uses a quality function to evaluate the quality of the connections and a transitive property to route through multiple hops. This algorithm was implemented in IBR-DTN and it was evaluated in three scenarios that emulate three scenarios observed during the navy tactical operations. Two of these scenarios were tested inside a building and the last one was tested in an external environment using real mobility of the nodes. The obtained results show that Q-PRoPHET has better performance than PRoPHET in terms of delivery ratio, endto-end delay and packets transmission, which are critical parameters for the communication in navy operations.As operações da marinha envolvem vários intervenientes que trabalham entre si com objetivos comuns e frequentemente sob condições de comunicação desafiadoras. Existem constrangimentos naturais que são impostos pelo ambiente da operação, por exemplo, geografia acidentada do terreno. Existem também constrangimentos artificiais que são criados por elementos hostis que forçam condições de modo a prejudicar as operações da marinha (ou outras equipas militares), por exemplo, criação de interferência intencional. Os militares geralmente usam equipamentos de comunicação proprietários para comunicar entre si. Apesar da eficácia destes equipamentos, eles são caros e normalmente oferecem uma gama de serviços limitada. Contudo, os recentes avanços tecnológicos permitiram a proliferação de muitos dispositivos portáteis com capacidade de comunicação sem fios e com o valor de acrescentar novas funcionalidades de formas muito simples, mas estes dispositivos ainda não estão adaptados para as redes militares em termos de comunicação. Esta dissertação propõe usar Redes Tolerantes a Atrasos (DTNs) com um novo protocolo de encaminhamento QualityPRoPHET (Q-PRoPHET) capaz de medir a qualidade das ligações sem-fios e encaminhar a informação pelas ligações de melhor qualidade, onde a probabilidade de sucesso da transmissão é maior. O Q-PRoPHET usa uma função de qualidade para avaliar a qualidade das ligações e uma propriedade transitiva para encaminhamento a múltiplos saltos. Este algoritmo foi implementado no IBR-DTN e foi avaliado em três cenários que emulam três cenários observados durante operações táticas da Marinha. Dois destes cenários foram testados dentro de um edifício e o último foi testado em ambiente exterior, recorrendo a mobilidade real dos nós. Os resultados obtidos mostram que o Q-PRoPHET tem melhor desempenho que o PRoPHET em termos de taxa de entrega, tempo de entrega e transmissão de pacotes, que são parâmetros críticos para as comunicações das operações da marinha

Utilizing Public Transport Networks for Bulk Data Transfer

Public transport networks are a subset of vehicular networks with some important distinctions; the actors in the network include buses and bus-stops, they are predictable and they provide reliable physical coverage of an area. The Public Transport Network of a city can also be interpreted as an opportunistic network where nodes are bus-stops and communication between these nodes occurs when a bus travels between two bus-stops. How will a data communication network perform when built upon the opportunistic network formed by the public transport system of a city? In this thesis we explore this question basing our analysis on Helsinki Region’s public bus transport system as a real example. We explore the performance of a public transport network when used for communication of data using both simulation of the network and graph analysis. The key performance factors studied are the data delivery ratio and data delivery time. Additional issues considered are the kind of applications such a system is suited for, the important characteristics governing the reliability and efficacy of such a data communications system, and the design guidelines for building such an application. The results demonstrate that data transfer applications can be built over a city’s Public Transport Network

Energy-efficient Transitional Near-* Computing

Studies have shown that communication networks, devices accessing the Internet, and data centers account for 4.6% of the worldwide electricity consumption. Although data centers, core network equipment, and mobile devices are getting more energy-efficient, the amount of data that is being processed, transferred, and stored is vastly increasing. Recent computer paradigms, such as fog and edge computing, try to improve this situation by processing data near the user, the network, the devices, and the data itself. In this thesis, these trends are summarized under the new term near-* or near-everything computing. Furthermore, a novel paradigm designed to increase the energy efficiency of near-* computing is proposed: transitional computing. It transfers multi-mechanism transitions, a recently developed paradigm for a highly adaptable future Internet, from the field of communication systems to computing systems. Moreover, three types of novel transitions are introduced to achieve gains in energy efficiency in near-* environments, spanning from private Infrastructure-as-a-Service (IaaS) clouds, Software-defined Wireless Networks (SDWNs) at the edge of the network, Disruption-Tolerant Information-Centric Networks (DTN-ICNs) involving mobile devices, sensors, edge devices as well as programmable components on a mobile System-on-a-Chip (SoC). Finally, the novel idea of transitional near-* computing for emergency response applications is presented to assist rescuers and affected persons during an emergency event or a disaster, although connections to cloud services and social networks might be disturbed by network outages, and network bandwidth and battery power of mobile devices might be limited

Erkennung und Vermeidung von Fehlverhalten in fahrzeugbasierten DTNs

Delay- and Disruption-Tolerant Networks (DTNs) are a suitable technology for many applications when the network suffers from intermittent connections and significant delays. In current vehicular networks, due to the high mobility of vehicles, the connectivity in vehicular networks can be highly unstable, links may change or break soon after they have been established and the network topology varies significantly depending on time and location. When the density of networked vehicles is low, connectivity is intermittent and with only a few transmission opportunities. This makes forwarding packets very difficult. For the next years, until a high penetration of networked vehicles is realized, delay-tolerant methods are a necessity in vehicular networks, leading to Vehicular DTNs (VDTNs). By implementing a store-carry-forward paradigm, VDTNs can make sure that even under difficult conditions, the network can be used by applications. However, we cannot assume that all vehicles are altruistic in VDTNs. Attackers can penetrate the communication systems of vehicles trying their best to destroy the network. Especially if multiple attackers collude to disrupt the network, the characteristics of VDTNs, without continuous connectivity, make most traditional strategies of detecting attackers infeasible. Additionally, selfish nodes may be reluctant to cooperate considering their profit, and due to hard- or software errors some vehicles cannot send or forward data. Hence, efficient mechanisms to detect malicious nodes in VDTNs are imperative. In this thesis, two classes of Misbehavior Detection Systems (MDSs) are proposed to defend VDTNs against malicious nodes. Both MDSs use encounter records (ERs) as proof to document nodes' behavior during previous contacts. By collecting and securely exchanging ERs, depending on different strategies in different classes of MDSs, a reputation system is built in order to punish bad behavior while encouraging cooperative behavior in the network. With independently operating nodes and asynchronous exchange of observations through ERs, both systems are very well suited for VDTNs, where there will be no continuous, ubiquitous network in the foreseeable future. By evaluating our methods through extensive simulations using different DTN routing protocols and different realistic scenarios, we find that both MDS classes are able to efficiently protect the system with low overhead and prevent malicious nodes from further disrupting the network.In Netzwerken mit zeitweisen Unterbrechungen oder langen Verzögerungen sind Delay- and Disruption-Tolerant Networks (DTNs) eine geeignete Technologie für viele Anwendungen. Die Konnektivität in Fahrzeugnetzen ist bedingt durch die hohe Mobilität und die geringe Verbreitung von netzwerkfähigen Fahrzeugen oft instabil. Bis zur flächendeckenden Verbreitung von netzwerkfähigen Fahrzeugen ist es daher zwingend notwendig auf Methoden des Delay Tolerant Networking zurückzugreifen um die bestmögliche Kommunikation zu gewährleisten. In diesem Zusammenhang wird von Vehicular Delay Tolerant Networks (VDTNs) gesprochen. Durch das Store-Carry-Forward-Prinzip kann ein VDTN Kommunikation für Anwendungen ermöglichen. Allerdings ist davon auszugehen, dass sich nicht alle Fahrzeuge altruistisch verhalten: Angreifer können Fahrzeuge übernehmen und das Netzwerk attackieren oder Knoten sind aus egoistischen Motiven oder auf Grund von Defekten unkooperativ. Verfahren, die Fehlverhalten in stabilen Netzen durch direkte Beobachtung erkennen können, sind in VDTNs nicht anwendbar. Daher sind Methoden, die Fehlverhalten in VDTNs nachweisen können, zwingend erforderlich. In dieser Arbeit werden zwei Klassen von Misbehavior Detection Systems (MDSs) vorgestellt. Beide Systeme basieren auf Encounter Records (ERs): Nach einem Kontakt tauschen zwei Knoten kryptografisch signierte Meta-Informationen zu den erfolgten Datentransfers aus. Diese ERs dienen bei darauffolgenden Kontakten mit anderen Netzwerkteilnehmern als vertrauenswürdiger Nachweis für das Verhalten eines Knotens in der Vergangenheit. Basierend auf der Auswertung gesammelter ERs wird ein Reputationssystem entwickelt, das kooperatives Verhalten belohnt und unkooperatives Verhalten bestraft. Dauerhaft unkooperative Knoten werden aus dem Netzwerk ausgeschlossen. Durch den asynchronen Austausch von Informationen kann jeder Knoten das Verhalten seiner Nachbarn selbstständig und unabhängig evaluieren. Dadurch sind die vorgestellten MDS-Varianten sehr gut für den Einsatz in einem VDTN geeignet. Durch umfangreiche Evaluationen wird gezeigt, dass sich die entwickelten MDS-Verfahren für verschiedene Routingprotokolle und in unterschiedlichen Szenarien anwenden lassen. In allen Fällen ist das MDS in der Lage das System mit geringem Overhead gegen Angreifer zu verteidigen und eine hohe Servicequalität im Netzwerk zu gewährleisten

Reliable Communications over Heterogeneous Wireless Networks

The recent years have seen an enormous advance in wireless communication technology and co-existence of various types of wireless networks, which requires effective inter-networking among the heterogeneous wireless networks in order to support user roaming over the networks while maintaining the connectivity. One of main challenges to achieve the connectivity over heterogeneous wireless networks is potential intermittent connections caused by user roaming. The issue is how to maintain the connection as the user roams and how to ensure service quality in the presence of a long disconnection period. In this dissertation, we apply the delay tolerant network (DTN) framework to heterogeneous terrestrial wireless networks, and propose a system architecture to achieve the connectivity in the presence of excessive long delays and intermittent paths. We study several possible approaches, discuss the applicability of each of the approaches and propose the super node architecture. To demonstrate the effectiveness of the proposed super node architecture, we give a simulation study that compares the system performance under the super node architecture and under the epidemic based architecture. Within the proposed architecture that employs the idea of super nodes, we further study how to effectively route a message over access networks. We present a new routing technique for mobile ad-hoc networks (MANETs) based on the DTN system architecture. We introduce the concept of virtual network topology and redefine the dominating-set based routing for the challenged network environment under consideration. In addition, we propose a time based methodology to predict the probability of future contacts between node pairs to construct the virtual network topology. We present a simulation study that demonstrates the effectiveness of the proposed routing approach as compared with the epidemic routing, and that the time based technique for predicting the future contacts gives better performance compared with that using the number of previous contacts. We further extend the dominating set routing technique through analyzing the underlying node mobility model. We shed some light on how using node mobility model can improve contact probability estimation. Based on our findings we propose a new algorithm that improves the routing performance by minimizing the selected dominating set size. Information security challenges in the super node architecture are introduced. We further address two main security challenges: The first is how to prevent unauthorized nodes from using the network resources, and the second is how to achieve end-to-end secure message exchange over the network. Our proposed solutions are based on asymmetric key cryptography techniques. Moreover, we introduce a new idea of separating the problem of source authentication from the problem of message authorization. We propose a new technique that employs the one-way key chain to use symmetric key cryptographic techniques to address the problems under consideration

Routage et codage réseau inter-session dans les réseaux sociaux mobiles tolérant le délai

We consider Delay Tolerant Mobile Social Networks (DTMSN), made of wireless nodes with intermittent connections and clustered into social communities. This thesis deals with the analysis and design of information transfer strategies in DTMSN. It is mostly dedicated to investigate the use of Inter-Session Network Coding (ISNC) towards this goal. Network coding is a generalization of routing and ISNC is known as a difficult optimization problem in general, specifically because it can easily get detrimental, compared to no coding, if not designed carefully. The first part of this thesis addresses theoretically the optimization problem of the (non-ISNC) routing policy in DTMSNs. We generalize the existing results for homogeneous topologies. The second part of the thesis designs and models a parameterized pairwise ISNC control policy that encompasses both routing and coding controls with an energy constraint. In order to tackle heuristically the optimization problem, the third chapter presents an experimental study of pairwise ISNC to investigate when it can be beneficial or detrimental. We examine the impact on ISNC performance of a number of parameters, such as the constraint on the maximum number of copies per packet, the network load, the buffer size of the relay nodes and the buffer management policies. The fourth chapter addresses the design of decentralized coding criteria allowing to trigger online session mixing if ISNC may be beneficial. We test these coding criteria on both toy topologies and real-world traces, pointing out and explaining the limits of our approach.Nous considérons les Réseaux Sociaux Mobiles Tolérant le Délai (DTMSN), constitués de nœuds sans-fil avec une connectivité intermittente, et groupés en communautés sociales. Cette thèse traite de l’analyse et de la conception de stratégies de transfert de l’information dans les DTMSN. Elle est principalement dédiée à l’étude de codage réseau inter-session (ISNC) dans ce but. Le codage réseau est une généralisation du routage et ISNC est connu comme un problème d’optimisation difficile en général, spécifiquement parce qu’il peut vite devenir nuisible si non conçu avec soin. Le premier chapitre répond théoriquement au problème d’optimisation du routage (sans ISNC) dans les DTMSN. Nous généralisons les résultants existants pour les topologies homogènes. Le deuxième chapitre conçoit et modélise un contrôle de ISNC par paire, qui englobe conjointement le contrôle du routage et du codage, avec une contrainte d’énergie. Pour s’attaquer de façon heuristique à l’optimisation de ce contrôle, le troisième chapitre présente une étude expérimentale visant à identifier quand ISNC est bénéfique ou nuisible, en fonction du nombre maximum de copies par paquet, de la charge du réseau, de la taille de buffer des nœuds relais et de la gestion de buffer. Le quatrième chapitre présente la conception de critères décentralisés de codage, pour déclencher en ligne le mélange de sessions si ISNC peut être bénéfique. Nous testons ces critères sur des topologies simples et sur des traces réelles, en expliquant les limites de notre approche

Ereignisbasierte Software-Architektur für Verzögerungs- und Unterbrechungstolerante Netze

Continuous end-to-end connectivity is not available all the time, not even in wired networks. Delay- and Disruption-Tolerant Networking (DTN) allows devices to communicate even if there is no continuous path to the destination by replacing the end-to-end semantics with a hop-by-hop store-carry-and-forward approach. Since existing implementations of DTN software suffer from various limitations, this work presents the event-driven software architecture of IBR-DTN, a lean, lightweight, and extensible implementation of a networking stack for Delay- and Disruption-Tolerant Networking. In a comprehensive description of the architecture and the underlying design decisions, this work focuses on eliminating weaknesses of the Bundle Protocol (RFC 5050). One of these is the dependency on synchronized clocks. Thus, this work takes a closer look on that requirement and presents approaches to bypass that dependency for some cases. For scenarios which require synchronized clocks, an approach is presented to distribute time information which is used to adjust the individual clock of nodes. To compare the accuracy of time information provided by each node, this approach introduces a clock rating. Additionally, a self-aligning algorithm is used to automatically adjust the node's clock rating parameters according to the estimated accuracy of the node's clock. In an evaluation, the general portability of the bundle node software is proven by porting it to various systems. Further, a performance analysis compares the new implementation with existing software. To perform an evaluation of the time-synchronization algorithm, the ONE simulator is modified to provide individual clocks with randomized clock errors for every node. Additionally, a specialized testbed, called Hydra, is being developed to test the implementation of the time-synchronization approach in real software. Hydra instantiates virtualized nodes running a complete operating system and provides a way to test real software in large DTN scenarios. Both the simulation and the emulation in Hydra show that the algorithm for time-synchronization can provide an adequate accuracy depending on the inter-contact times.Eine kontinuierliche Ende-zu-Ende-Konnektivität ist nicht immer verfügbar, nicht einmal in drahtgebundenen Netzen. Verzögerungs- und unterbrechungstolerante Kommunikation (DTN) ersetzt die Ende-zu-Ende-Semantik mit einem Hop-by-Hop Store-Carry-and-Forward Ansatz und erlaubt es so Geräten miteinander zu kommunizieren, auch wenn es keinen kontinuierlichen Pfad gibt. Da bestehende DTN Implementierungen unter verschiedenen Einschränkungen leiden, stellt diese Arbeit die ereignisgesteuerte Software-Architektur von IBR-DTN, eine schlanke, leichte und erweiterbare Implementierung eines Netzwerk-Stacks für Verzögerungs- und unterbrechungstolerante Netze vor. In einer umfassenden Beschreibung der Architektur und den zugrunde liegenden Design-Entscheidungen, konzentriert sich diese Arbeit auf die Beseitigung von Schwächen des Bundle Protocols (RFC 5050). Eine davon ist die Abhängigkeit zu synchronisierten Uhren. Daher wirft diese Arbeit einen genaueren Blick auf diese Anforderung und präsentiert Ansätze, um diese Abhängigkeit in einigen Fällen zu umgehen. Für Szenarien die synchronisierte Uhren voraussetzen wird außerdem ein Ansatz vorgestellt, um die Uhren der einzelnen Knoten mit Hilfe von verteilten Zeitinformationen zu korrigieren. Um die Genauigkeit der Zeitinformationen von jedem Knoten vergleichen zu können, wird eine Bewertung der Uhren eingeführt. Zusätzlich wird ein Algorithmus vorgestellt, der die Parameter der Bewertung in Abhängigkeit von der ermittelten Genauigkeit der lokalen Uhr anpasst. In einer Evaluation wird die allgemeine Portabilität der Software zu verschiedenen Systemen gezeigt. Ferner wird bei einer Performance-Analyse die neue Software mit existierenden Implementierungen verglichen. Um eine Evaluation des Zeitsynchronisationsalgorithmus durchzuführen, wird der ONE Simlator so angepasst, dass jeder Knoten eine individuelle Uhr mit zufälligem Fehler besitzt. Außerdem wird eine spezielle Testumgebung namens Hydra vorgestellt um eine echte Implementierung des Zeitsynchronisationsalgorithmus zu testen. Hydra instanziiert virtualisierte Knoten mit einem kompletten Betriebssystem und bietet die Möglichkeit echte Software in großen DTN Szenarien zu testen. Sowohl die Simulation als auch die Emulation in Hydra zeigen, dass der Algorithmus für die Zeitsynchronisation eine ausreichende Genauigkeit in Abhängigkeit von Kontakthäufigkeit erreicht