Supporting Large Scale Communication Systems on Infrastructureless Networks Composed of Commodity Mobile Devices: Practicality, Scalability, and Security.

Infrastructureless Delay Tolerant Networks (DTNs) composed of commodity mobile devices have the potential to support communication applications resistant to blocking and censorship, as well as certain types of surveillance. In this thesis we study the utility, practicality, robustness, and security of these networks. We collected two sets of wireless connectivity traces of commodity mobile devices with different granularity and scales. The first dataset is collected through active installation of measurement software on volunteer users' own smartphones, involving 111 users of a DTN microblogging application that we developed. The second dataset is collected through passive observation of WiFi association events on a university campus, involving 119,055 mobile devices. Simulation results show consistent message delivery performances of the two datasets. Using an epidemic flooding protocol, the large network achieves an average delivery rate of 0.71 in 24 hours and a median delivery delay of 10.9 hours. We show that this performance is appropriate for sharing information that is not time sensitive, e.g., blogs and photos. We also show that using an energy efficient variant of the epidemic flooding protocol, even the large network can support text messages while only consuming 13.7% of a typical smartphone battery in 14 hours. We found that the network delivery rate and delay are robust to denial-of-service and censorship attacks. Attacks that randomly remove 90% of the network participants only reduce delivery rates by less than 10%. Even when subjected to targeted attacks, the network suffered a less than 10% decrease in delivery rate when 40% of its participants were removed. Although structurally robust, the openness of the proposed network introduces numerous security concerns. The Sybil attack, in which a malicious node poses as many identities in order to gain disproportionate influence, is especially dangerous as it breaks the assumption underlying majority voting. Many defenses based on spatial variability of wireless channels exist, and we extend them to be practical for ad hoc networks of commodity 802.11 devices without mutual trust. We present the Mason test, which uses two efficient methods for separating valid channel measurement results of behaving nodes from those falsified by malicious participants.PhDElectrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/120779/1/liuyue_1.pd

A Dynamic Application Partitioning and Offloading Framework to Enhance the Capabilities of Transient Clouds Using Mobile Agents

Mobile cloud computing has emerged as a prominent area of research, a natural extension of cloud computing that proposes to offer solutions for enhancing the capabilities of smart mobile devices commonly plagued by resource constraints. As one of its promising models, transient clouds aim to address the internet connectivity shortfall inherent in most solutions through the formation of ad hoc networks by devices in close proximity, then the offloading some computations (Cyber Foraging) to the created cloud. However, transient clouds, at their current state, have several limitations, concerning their expansion on a local network having a large number of devices and the management of the instability of the network due to the constant mobility of the devices. Another issue is the fact code partitioning and offloading are not addressed to fit the need of such networks, thereby rendering the distributed computing mechanism barely efficient for the Transient Cloud. In this study, we propose a transient cloud-based framework that exploits the use of multi-agent systems, enabling a dynamic partitioning and offloading of code, and facilitating the movement and the execution of code partition packets in a multi-hop ad-hoc mesh network. When created and deployed, these intelligent mobile agents operate independently or collaboratively and adapt to the continual entry and exit of devices in the neighbourhood. The integration of these trending concepts in distributed computing within a framework offers a new architecture for resource-sharing among cooperating devices that addresses the varied issues that arise in dynamic environments

Connectivity Optimization in Robotic Networks

La collaboration entre multiple appareils électroniques (e.g. smartphones, ordinateurs, robots, senseurs et routeurs) est une tendance qui suscite un vif intérêt tant ses applications semblent prometteuses. Les maisons autonomes ou villes intelligentes figurent parmi la prodigieuse variété d’exemples. La communication entre appareils est une des clés du succès de leur coopération. Sans un bon système de communication, les appareils se retrouvent vite incapables d’échanger l’information nécessaire à la prise de décision. Pour garantir une bonne communication, il faut un réseau solide sur lequel elle puisse reposer. Nous pourrions envisager une organisation centralisée, puisqu’elles sont si répandues. Nos téléphones portables communiquent grâce à des antennes-relais ; et nous naviguons sur l’internet grâce à des routeurs. Dans un réseau centralisé, si un noeud principal, tel qu’une antenne ou un routeur, est défaillant, la capacité à communiquer en est dramatiquement diminuée. Or, certaines collaborations entre appareils interviennent, parfois, dans des situations où les infrastructures classiques ne sont pas accessibles. C’est le cas pour les opérations de sauvetages, où les moyens de communications classiques ont pu être endommagés à la suite d’un sinistre. D’autres organisations sont alors plus judicieuses. Dans les réseaux ad hoc, par exemple, il n’existe pas de noeud central, car chaque appareil peut servir au transit de l’information. Cette dissertation s’intéresse à la mise en place de réseaux ad hoc et mobiles entre smartphones et drones. Elle s’inscrit dans le cadre d’un partenariat, entre Humanitas Solutions et l’École Polytechnique de Montréal, qui vise à établir un moyen de communication basé sur ces appareils, pour connecter victimes et premiers secours lors d’opérations de sauvetages. Pour mener à bien ce projet, nous devons permettre aux appareils électroniques de communiquer sans recourir à quelconque infrastructure. Pour relayer l’information, nous devons également maintenir les drones connectés au-dessus de la zone sinistrée.----------ABSTRACT: Because of their promising applications, the interest for machine-to-machine interaction has soared (e.g. between smartphones, laptops, robots, sensors, or routers). Autonomous homes and smart cities are just two examples among the many. Without a good communication system, devices are unable to share relevant information and take effective decisions. Thus, inter-device communication is key for successful cooperations. To guarantee suitable communication, devices need to rely on a robust network. One might think of classical centralized network architecture since it is so common – antennae relay our smartphone communications, and routers provide us with an Internet connection at home. However, this architecture is not adequate for every application. When a central node (e.g. an antenna or a router) fails, it can cripple all the network. Moreover, fixed infrastructure is not always available, which is detrimental for applications like search and rescue operations. Hence, other network designs can be more suitable, like ad hoc networks, where there is no central node and every device can route information. This work aims at establishing mobile ad hoc networks between multiple devices for search and rescue operations. This thesis is framed by a partnership between Humanitas Solutions and École Polytechnique de Montréal, whose goal is to relay information between victims and first responders by the use of smartphones and flying robots (i.e. drones). For this purpose, we have to enable infrastructureless communications between devices and maintain drones connected over the disaster area

Secure Communication in Disaster Scenarios

Während Naturkatastrophen oder terroristischer Anschläge ist die bestehende Kommunikationsinfrastruktur häufig überlastet oder fällt komplett aus. In diesen Situationen können mobile Geräte mithilfe von drahtloser ad-hoc- und unterbrechungstoleranter Vernetzung miteinander verbunden werden, um ein Notfall-Kommunikationssystem für Zivilisten und Rettungsdienste einzurichten. Falls verfügbar, kann eine Verbindung zu Cloud-Diensten im Internet eine wertvolle Hilfe im Krisen- und Katastrophenmanagement sein. Solche Kommunikationssysteme bergen jedoch ernsthafte Sicherheitsrisiken, da Angreifer versuchen könnten, vertrauliche Daten zu stehlen, gefälschte Benachrichtigungen von Notfalldiensten einzuspeisen oder Denial-of-Service (DoS) Angriffe durchzuführen. Diese Dissertation schlägt neue Ansätze zur Kommunikation in Notfallnetzen von mobilen Geräten vor, die von der Kommunikation zwischen Mobilfunkgeräten bis zu Cloud-Diensten auf Servern im Internet reichen. Durch die Nutzung dieser Ansätze werden die Sicherheit der Geräte-zu-Geräte-Kommunikation, die Sicherheit von Notfall-Apps auf mobilen Geräten und die Sicherheit von Server-Systemen für Cloud-Dienste verbessert

Towards Energy-Efficient, Fault-Tolerant, and Load-Balanced Mobile Cloud

Recent advances in mobile technologies have enabled a new computing paradigm in which large amounts of data are generated and accessed from mobile devices. However, running resource-intensive applications (e.g., video/image storage and processing or map-reduce type) on a single mobile device still remains off bounds since it requires large computation and storage capabilities. Computer scientists overcome this issue by exploiting the abundant computation and storage resources from traditional cloud to enhance the capabilities of end-user mobile devices. Nevertheless, the designs that rely on remote cloud services sometimes underlook the available resources (e.g., storage, communication, and processing) on mobile devices. In particular, when the remote cloud services are unavailable (due to service provider or network issues) these smart devices become unusable. For mobile devices deployed in an infrastructureless network where nodes can move, join, or leave the network dynamically, the challenges on energy-efficiency, reliability, and load-balance are still largely unexplored. This research investigates challenges and proposes solutions for deploying mobile application in such environments. In particular, we focus on a distributed data storage and data processing framework for mobile cloud. The proposed mobile cloud computing (MCC) framework provides data storage and data processing services to MCC applications such as video storage and processing or map-reduce type. These services ensure the mobile cloud is energy-efficient, fault-tolerant, and load-balanced by intelligently allocating and managing the stored data and processing tasks accounting for the limited resources on mobile devices. When considering the load-balance, the framework also incorporates the heterogeneous characteristics of mobile cloud in which nodes may have various energy, communication, and processing capabilities. All the designs are built on the k-out-of-n computing theoretical foundation. The novel formulations produce a reliability-compliant, energy-efficient data storage solution and a deadline-compliant, energy-efficient job scheduler. From the promising outcomes of this research, a future where mobile cloud offers real-time computation capabilities in complex environments such as disaster relief or warzone is certainly not far

On-the-Fly Establishment of Multi-hop D2D Communication based on Android Smartphones and Embedded Platforms: Implementation and Real-Life Experiments

Masteroppgave informasjons- og kommunikasjonsteknologi - Universitetet i Agder, 2015(Konfidensiell til/confidential until 01.07.2020

The sociable traveller: human travelling patterns in social-based mobility

Understanding how humans move is a key factor for the design and evaluation of networking protocols and mobility management solutions in mobile networks. This is particularly true for mobile scenarios in which conventional singlehop access to the infrastructure is not always possible, and multi-hop wireless forwarding is a must. We specifically focus on one of the most recent mobile networking paradigms, i.e., opportunistic networks. In this paradigm the communication takes place directly between the personal devices (e.g., smartphones and PDAs) that the users carry with them during their daily activities, without any assumption about pre-existing infrastructures. Among all mobility characteristics that may affect the performance of opportunistic networks, the users\u27 travelling patterns have recently gained a lot of attention due to their impact on the spreading of both viruses and messages in such a network. In this paper we consider a social-based mobility model (HCMM) and we extend this model to account for the typical travelling behaviour of users. To the best of our knowledge, the resulting mobility model is the first model in which movements driven by social relations also match statistical features of travelling patterns as measured in reality. Finally, we evaluate our proposal through simulations over a wide range of scenarios, emphasizing the effect of finite sampling on the obtained results

Self-organizing Network Optimization via Placement of Additional Nodes

Das Hauptforschungsgebiet des Graduiertenkollegs "International Graduate School on Mobile Communication" (GS Mobicom) der Technischen Universität Ilmenau ist die Kommunikation in Katastrophenszenarien. Wegen eines Desasters oder einer Katastrophe können die terrestrischen Elementen der Infrastruktur eines Kommunikationsnetzwerks beschädigt oder komplett zerstört werden. Dennoch spielen verfügbare Kommunikationsnetze eine sehr wichtige Rolle während der Rettungsmaßnahmen, besonders für die Koordinierung der Rettungstruppen und für die Kommunikation zwischen ihren Mitgliedern. Ein solcher Service kann durch ein mobiles Ad-Hoc-Netzwerk (MANET) zur Verfügung gestellt werden. Ein typisches Problem der MANETs ist Netzwerkpartitionierung, welche zur Isolation von verschiedenen Knotengruppen führt. Eine mögliche Lösung dieses Problems ist die Positionierung von zusätzlichen Knoten, welche die Verbindung zwischen den isolierten Partitionen wiederherstellen können. Hauptziele dieser Arbeit sind die Recherche und die Entwicklung von Algorithmen und Methoden zur Positionierung der zusätzlichen Knoten. Der Fokus der Recherche liegt auf Untersuchung der verteilten Algorithmen zur Bestimmung der Positionen für die zusätzlichen Knoten. Die verteilten Algorithmen benutzen nur die Information, welche in einer lokalen Umgebung eines Knotens verfügbar ist, und dadurch entsteht ein selbstorganisierendes System. Jedoch wird das gesamte Netzwerk hier vor allem innerhalb eines ganz speziellen Szenarios - Katastrophenszenario - betrachtet. In einer solchen Situation kann die Information über die Topologie des zu reparierenden Netzwerks im Voraus erfasst werden und soll, natürlich, für die Wiederherstellung mitbenutzt werden. Dank der eventuell verfügbaren zusätzlichen Information können die Positionen für die zusätzlichen Knoten genauer ermittelt werden. Die Arbeit umfasst eine Beschreibung, Implementierungsdetails und eine Evaluierung eines selbstorganisierendes Systems, welche die Netzwerkwiederherstellung in beiden Szenarien ermöglicht.The main research area of the International Graduate School on Mobile Communication (GS Mobicom) at Ilmenau University of Technology is communication in disaster scenarios. Due to a disaster or an accident, the network infrastructure can be damaged or even completely destroyed. However, available communication networks play a vital role during the rescue activities especially for the coordination of the rescue teams and for the communication between their members. Such a communication service can be provided by a Mobile Ad-Hoc Network (MANET). One of the typical problems of a MANET is network partitioning, when separate groups of nodes become isolated from each other. One possible solution for this problem is the placement of additional nodes in order to reconstruct the communication links between isolated network partitions. The primary goal of this work is the research and development of algorithms and methods for the placement of additional nodes. The focus of this research lies on the investigation of distributed algorithms for the placement of additional nodes, which use only the information from the nodes’ local environment and thus form a self-organizing system. However, during the usage specifics of the system in a disaster scenario, global information about the topology of the network to be recovered can be known or collected in advance. In this case, it is of course reasonable to use this information in order to calculate the placement positions more precisely. The work provides the description, the implementation details and the evaluation of a self-organizing system which is able to recover from network partitioning in both situations

Distributed localisation algorithm for wireless ad hoc networks of moving nodes

Existing ad hoc network localisation solutions rely either on external location references or network-wide exchange of information and centralised processing and computation of location estimates. Without these, nodes are not able to estimate the relative locations of other nodes within their communication range. This thesis defines a new distributed localisation algorithm for ad hoc networks of moving nodes. The Relative Neighbour Localisation (RNL) algorithm works without any external localisation signal or systems and does not assume centralised information processing. The idea behind the location estimates produced by the RNL algorithm is the relationship between the relative locations of two nodes, their mobility parameters and the signal strengths measured between them. The proposed algorithm makes use of the data available to each node to produce a location estimate. The signal strength each node is capable of measuring is used as one algorithm input. The other input is the velocity vector of the neighbouring node, composed of its speed and direction of movement, which each node is assumed to periodically broadcast. The relationship between the signal strength and the mobility parameters on one, and the relative location on the other side can be analytically formulated in an ideal case. The limitations of a realistic scenario complicate this relationship, making it very difficult to formulate analytically. An empirical approach is thus used. The angle and the distance estimates are individually computed, together forming a two-dimensional location estimate. The performance of the algorithm was analysed in detail using simulation, showing a median estimate error of under 10m, and its application was tested through design and evaluation of a distributed sensing coverage algorithm, showing RNL location estimates can provide 90% of the coverage achievable with true locations being known