Service Provisioning in Mobile Networks Through Distributed Coordinated Resource Management

The pervasiveness of personal computing platforms offers an unprecedented opportunity to deploy large-scale services that are distributed over wide physical spaces. Two major challenges face the deployment of such services: the often resource-limited nature of these platforms, and the necessity of preserving the autonomy of the owner of these devices. These challenges preclude using centralized control and preclude considering services that are subject to performance guarantees. To that end, this thesis advances a number of new distributed resource management techniques that are shown to be effective in such settings, focusing on two application domains: distributed Field Monitoring Applications (FMAs), and Message Delivery Applications (MDAs). In the context of FMA, this thesis presents two techniques that are well-suited to the fairly limited storage and power resources of autonomously mobile sensor nodes. The first technique relies on amorphous placement of sensory data through the use of novel storage management and sample diffusion techniques. The second approach relies on an information-theoretic framework to optimize local resource management decisions. Both approaches are proactive in that they aim to provide nodes with a view of the monitored field that reflects the characteristics of queries over that field, enabling them to handle more queries locally, and thus reduce communication overheads. Then, this thesis recognizes node mobility as a resource to be leveraged, and in that respect proposes novel mobility coordination techniques for FMAs and MDAs. Assuming that node mobility is governed by a spatio-temporal schedule featuring some slack, this thesis presents novel algorithms of various computational complexities to orchestrate the use of this slack to improve the performance of supported applications. The findings in this thesis, which are supported by analysis and extensive simulations, highlight the importance of two general design principles for distributed systems. First, a-priori knowledge (e.g., about the target phenomena of FMAs and/or the workload of either FMAs or DMAs) could be used effectively for local resource management. Second, judicious leverage and coordination of node mobility could lead to significant performance gains for distributed applications deployed over resource-impoverished infrastructures

Topology design for time-varying networks

Traditional wireless networks seek to support end-to-end communication through either a single-hop wireless link to infrastructure or multi-hop wireless path to some destination. However, in some wireless networks (such as delay tolerant networks, or mobile social networks), due to sparse node distribution, node mobility, and time-varying network topology, end-to-end paths between the source and destination are not always available. In such networks, the lack of continuous connectivity, network partitioning, and long delays make design of network protocols very challenging. Previous DTN or time-varying network research mainly focuses on routing and information propagation. However, with large number of wireless devices' participation, and a lot of network functionality depends on the topology, how to maintain efficient and dynamic topology of a time-varying network becomes crucial. In this dissertation, I model a time-evolving network as a directed time-space graph which includes both spacial and temporal information of the network, then I study various topology control problems with such time-space graphs. First, I study the basic topology design problem where the links of the network are reliable. It aims to build a sparse structure from the original time-space graph such that (1) the network is still connected over time and/or supports efficient routing between any two nodes; (2) the total cost of the structure is minimized. I first prove that this problem is NP-hard, and then propose several greedy-based methods as solutions. Second, I further study a cost-efficient topology design problem, which not only requires the above two objective, but also guarantees that the spanning ratio of the topology is bounded by a given threshold. This problem is also NP-hard, and I give several greedy algorithms to solve it. Last, I consider a new topology design problem by relaxing the assumption of reliable links. Notice that in wireless networks the topologies are not quit predictable and the links are often unreliable. In this new model, each link has a probability to reflect its reliability. The new reliable topology design problem aims to build a sparse structure from the original space-time graph such that (1) for any pair of devices, there is a space-time path connecting them with the reliability larger than a required threshold; (2) the total cost of the structure is minimized. Several heuristics are proposed, which can significantly reduce the total cost of the topology while maintain the connectivity or reliability over time. Extensive simulations on both random networks and real-life tracing data have been conducted, and results demonstrate the efficiency of the proposed methods

The Impact of Rogue Nodes on the Dependability of Opportunistic Networks

Opportunistic Networks (OppNets) are an extension to the classical Mobile Ad hoc Networks (MANETs) where the network is not dependent on any infrastructure (e.g. Access Points or centralized administrative nodes). OppNets can be more flexible than MANETs because an end to end path does not exist and much longer delays can be expected. Whereas a Rogue Access Point is typically immobile in the legacy infrastructure based networks and can have considerable impact on the overall connectivity, the research question in this project evaluates how the pattern and mobility of a rogue nodes impact the dependability and overall "Average Latency" in an Opportunistic Network Environment. We have simulated a subset of the mathematical modeling performed in a previous publication in this regard. Ad hoc networks are very challenging to model due to their mobility and intricate routing schemes. We strategically started our research by exploring the evolution of Opportunistic networks, and then implemented the rogue behavior by utilizing The ONE (Opportunistic Network Environment, by Nokia Research Centre) simulator to carry out our research over rogue behavior. The ONE simulator is an open source simulator developed in Java, simulating the layer 3 of the OSI model. The Rogue behavior is implemented in the simulator to observe the effect of rogue nodes. Finally we extracted the desired dataset to measure the latency by carefully simulating the intended behavior, keeping rest of the parameters (e.g. Node Movement Models, Signal Range and Strength, Point of Interest (POI) etc) unchanged. Our results are encouraging, and coincide with the average latency deterioration patterns as modeled by the previous researchers, with a few exceptions. The practical implementation of plug-in in ONE simulator has shown that only a very high degree of rogue nodes impact the latency, making OppNets more resilient and less vulnerable to malicious attacks

Optimal Monotone Forwarding Policies in Delay Tolerant Mobile Ad Hoc Networks with Multiple Classes of Nodes

International audienceIn this paper we describe a framework for the optimal control of delay tolerant mobile ad hoc networks where multiple classes of nodes co-exist. We specialize the description of the energy-delay tradeoffs as an optimization problem based on a fluid approximation. We then adopt two product forms to model message diffusion and show that optimal controls are of bang-bang type. Under this general framework, we analyze some specific cases of interest for applications

UAV swarm coordination and control for establishing wireless connectivity

Ph.DDOCTOR OF PHILOSOPH

H3N - Analysewerkzeuge für hybride Wegewahl in heterogenen, unterbrechungstoleranten Ad-Hoc-Netzen für Rettungskräfte

Rettungskräfte müssen unter widrigen Bedingungen zuverlässig kommunizieren können, um in Rettungseinsätzen effizient arbeiten zu können und somit Leben zu retten. Idealerweise ist dazu ein selbstorganisiertes Ad-Hoc-Netz notwendig, weil die Kommunikationsinfrastruktur ggf. beschädigt oder überlastet sein kann. Um die geforderte Robustheit der Kommunikation auch in Szenarien mit größeren zu überbrückenden Entfernungen zu gewährleisten, werden zusätzlich Mechanismen benötigt, die eine Unterbrechungstoleranz ermöglichen. Verzögerungstolerante Netze (engl. Delay Tolerant Networks, kurz: DTN) stellen solche Mechanismen bereit, erfordern aber zusätzliche Verzögerungen, die für Rettungskommunikation nachteilig sind. Deshalb werden intelligente hybride Wegewahlverfahren benötigt, um die Verzögerung durch DTN-Mechanismen zu begrenzen. Außerdem sollten entsprechende Verfahren heterogene Netze unterstützen. Das ermöglicht zusätzlich eine effizientere Weiterleitung durch die Nutzung von Geräten mit unterschiedlichen Kommunikationstechnologien und damit auch Reichweiten. Um solche Systeme und die dafür benötigten Kommunikationsprotokolle zu entwickeln, werden verschiedene Analysewerkzeuge genutzt. Dazu gehören analytische Modelle, Simulationen und Experimente auf der Zielsystemhardware. Für jede Kategorie gibt es verschiedene Werkzeuge und Frameworks, die sich auf unterschiedliche Aspekte fokussieren. Dadurch unterstützen diese herkömmlichen Analysemethoden jedoch meistens nur einen der oben genannten Punkte, während die Untersuchung von hybriden und/oder heterogenen Ansätzen und Szenarien nicht ohne weiteres möglich ist. Im Falle von Rettungskräften kommt hinzu, dass die charakteristischen Merkmale hinsichtlich der Bewegung der Knoten und des erzeugten Datenverkehrs während eines Einsatzes ebenfalls nicht modelliert werden können. In dieser Arbeit werden deshalb verschiedene Erweiterungen zu existierenden Analysewerkzeugen sowie neue Werkzeuge zur Analyse und Modelle zur Nachbildung realistischer Rettungsmissionen untersucht und entwickelt. Ziel ist es, die Vorteile existierender Werkzeuge miteinander zu kombinieren, um ganzheitliche, realitätsnahe Untersuchungen von hybriden Protokollen für heterogene Netze zu ermöglichen. Die Kombination erfolgt in Form von gezielten Erweiterungen und der Entwicklung ergänzender komplementärer Werkzeuge unter Verwendung existierender Schnittstellen. Erste Ergebnisse unter Verwendung der entwickelten Werkzeuge zeigen Verbesserungspotentiale bei der Verwendung traditioneller Protokolle und erlauben die Bewertung zusätzlicher Maßnahmen, um die Kommunikation zu verbessern. Szenarien zur Kommunikation von Rettungskräften werden dabei als ein Beispiel verwendet, die Tools sind jedoch nicht auf die Analyse dieses Anwendungsfalls beschränkt. Über die reine Analyse verschiedener existierender Ansätze hinaus bildet die entwickelte Evaluationsumgebung eine Grundlage für die Entwicklung und Verifikation von neuartigen hybriden Protokollen für die entsprechenden Systeme.Communication between participating first responders is essential for efficient coordination of rescue missions and thus allowing to save human lives. Ideally, ad hoc-style communication networks are applied to this as the first responders cannot rely on infrastructure-based communication for two reasons. First, the infrastructure could be damaged by the disastrous event or not be available for economic reasons. Second, even if public infrastructure is available and functional, it might be overloaded by users. To guarantee the robustness and reliability requirements of first responders, the Mobile Ad Hoc Networks (MANETs) have to be combined with an approach to mitigate intermittent connectivity due to otherwise limited connectivity. Delay Tolerant Networks (DTNs) provide such a functionality but introduce additional delay which is problematic. Therefore, intelligent hybrid routing approaches are required to limit the delay introduced by DTN mechanisms. Besides that, the approach should be applicable to heterogeneous networks in terms of communication technologies and device capabilities. This is required for cross multi-agency and volunteer communication but also enables the opportunistic exploitation of any given communication option. To evaluate such systems and develop the corresponding communication protocols, various tools for the analysis are available. This includes analytical models, simulations and real-world experiments on target hardware. In each category a wide set of tools is available already. However, each tool is focused on specific aspects usually and thus does not provide methods to analyze hybrid approaches out of the box. Even if the tools are modular and allow an extension, there are often other tools that are better suited for partial aspects of hybrid systems. In addition to this, few tools exist to model the characteristics of first responder networks. Especially the generalized movement during missions and the generated data traffic are difficult to model and integrate into analyses. The focus of this project is therefore to develop selected extensions to existing analysis and simulation tools as well as additional tools and models to realistically capture the characteristics of first responder networks. The goal is to combine the advantages of existing specialized simulation tools to enable thorough evaluations of hybrid protocols for heterogeneous networks based on realistic assumptions. To achieve this, the tools are extended by specifically designing tools that enable the interaction between tools and new tools that complement the existing analysis capabilities. First results obtained via the resulting toolbox clearly indicate further research directions as well as a potential for protocol enhancements. Besides that, the toolbox was used to evaluate various methods to enhance the connectivity between nodes in first responder networks. First responder scenarios are used as an example here. The toolbox itself is however not limited to this use case. In addition to the analysis of existing approaches for hybrid and heterogeneous networks, the developed toolbox provides a base framework for the development and verification of newly developed protocols for such use cases