87 research outputs found

    Consistency mechanisms for a distributed lookup service supporting mobile applications

    Get PDF
    This paper presents a general-purpose distributed lookup service, denoted Passive Distributed Indexing (PDI). PDI stores entries in form of (key, value) pairs in index caches located in each mobile device. Index caches are filled by epidemic dissemination of popular index entries. By exploiting node mobility, PDI can resolve most queries locally without sending messages outside the radio coverage of the inquiring node. Thus, PDI reduces network traffic for the resolution of keys to values. For keeping index caches coherent, configurable value timeouts implementing implicit invalidation and lazy invalidation caches implementing explicit invalidation are introduced. Inconsistency in index caches due to weak connectivity or node failure is handled by value timeouts. Lazy invalidation caches reduce the fraction of stale index entries due to modified data at the origin node. Similar to index caches, invalidation caches are filled by epidemic distributions of invalidation messages. Simulation results show that with the suitable integration of both invalidation mechanisms, more than 95% of results delivered by PDI index caches are up-to-date for the considered scenario

    Exploiting epidemic data dissemination for consistent lookup operations in mobile applications

    Get PDF
    This paper presents a general-purpose distributed lookup service, denoted Passive Distributed Indexing (PDI). PDI stores entries in form of (key, value) pairs in index caches located at mobile devices. Index caches are filled by epidemic dissemination of popular index entries. By exploiting node mobility, PDI can resolve most queries locally without sending messages outside the radio coverage of the inquiring node. For keeping index caches coherent, configurable value timeouts implementing implicit invalidation and lazy invalidation caches implementing explicit invalidation are introduced. Inconsistency in index caches due to weak connectivity or node failure is handled by value timeouts. Lazy invalidation caches reduce the fraction of stale index entries due to modified data at the origin node. Similar to index caches, invalidation caches are filled by epidemic distributions of invalidation messages. We evaluate the performance of PDI for a mobile P2P file sharing a mobile instant messaging application. Simulation results show that with the suitable integration of both invalidation mechanisms, up to 80% of the lookup operations return correct results and more than 90% of results delivered by PDI index caches are up-to-date

    Service Replication in Wireless Mobile Ad Hoc Networks

    Get PDF
    Die vorliegende Arbeit beschäftigt sich mit dem Management von Diensten im mobilen ad-hoc Netzwerken (MANETs). MANETs sind drahtlose Netzverbände mobiler Einheiten die sich dezentral ohne eine übergeordnete Organisation selbst verwalten. Die Netztopologie eines MANET verändert sich dabei dynamisch mit der Bewegung der autonomen Teilnehmer. Sensor Netzwerke, Personal Area Networks und Satelliten Netzwerke sind typische Beispiele für derartige MANETs. Mit der wachsenden Bedeutung der drahtlosen Vernetzung mobiler Geräte haben sich MANETs in den vergangenen Jahren zu einem wichtigen Forschungsgebiet entwickelt. Im Katastrophenmanagement, bei zivilen Rettungsfällen oder in militärischen Szenarien kann ihre infrastrukturlose Selbstorganisation MANETs zum einzig möglichen Kommunikationsmittel machen. Die mobilen Knoten eines MANETs kooperieren um essenzielle Netzwerkdienste wie das Routing und den Datentransport gemeinschaftlich zu gewährleisten. Ressourcen wie die Bandbreite zwischen Knoten, die Rechenleistung der mobilen Geräte und ihre Batterieleistung sind dabei typischerweise stark begrenzt und zudem wechselnd. Das Teilen der verfügbaren Ressourcen ist daher eine Notwendigkeit für das effiziente Funktionieren eines MANETs. Dienstorientierte Architekturen (SOAs) stellen ein geeignetes Paradigma dar, um geteilte Ressourcen zu verwalten. Wenn verfügbare Ressourcen als Dienst aufgefasst werden, lässt sich ihre Nutzung als Dienstabfrage bearbeiten. In diesem Zusammenhang ermöglichen SOAs Abstraktion, Kapselung, lose Koppelung, Auffindbarkeit von Ressourcen und dir für MANETs essenzielle Autonomie. Die Anwendung von SOAs auf MANETs findet daher zunehmend Beachtung in der Forschung

    Location based services in wireless ad hoc networks

    Get PDF
    In this dissertation, we investigate location based services in wireless ad hoc networks from four different aspects - i) location privacy in wireless sensor networks (privacy), ii) end-to-end secure communication in randomly deployed wireless sensor networks (security), iii) quality versus latency trade-off in content retrieval under ad hoc node mobility (performance) and iv) location clustering based Sybil attack detection in vehicular ad hoc networks (trust). The first contribution of this dissertation is in addressing location privacy in wireless sensor networks. We propose a non-cooperative sensor localization algorithm showing how an external entity can stealthily invade into the location privacy of sensors in a network. We then design a location privacy preserving tracking algorithm for defending against such adversarial localization attacks. Next we investigate secure end-to-end communication in randomly deployed wireless sensor networks. Here, due to lack of control on sensors\u27 locations post deployment, pre-fixing pairwise keys between sensors is not feasible especially under larger scale random deployments. Towards this premise, we propose differentiated key pre-distribution for secure end-to-end secure communication, and show how it improves existing routing algorithms. Our next contribution is in addressing quality versus latency trade-off in content retrieval under ad hoc node mobility. We propose a two-tiered architecture for efficient content retrieval in such environment. Finally we investigate Sybil attack detection in vehicular ad hoc networks. A Sybil attacker can create and use multiple counterfeit identities risking trust of a vehicular ad hoc network, and then easily escape the location of the attack avoiding detection. We propose a location based clustering of nodes leveraging vehicle platoon dispersion for detection of Sybil attacks in vehicular ad hoc networks --Abstract, page iii

    SCALABLE MULTI-HOP DATA DISSEMINATION IN VEHICULAR AD HOC NETWORKS

    Get PDF
    Vehicular Ad hoc Networks (VANETs) aim at improving road safety and travel comfort, by providing self-organizing environments to disseminate traffic data, without requiring fixed infrastructure or centralized administration. Since traffic data is of public interest and usually benefit a group of users rather than a specific individual, it is more appropriate to rely on broadcasting for data dissemination in VANETs. However, broadcasting under dense networks suffers from high percentage of data redundancy that wastes the limited radio channel bandwidth. Moreover, packet collisions may lead to the broadcast storm problem when large number of vehicles in the same vicinity rebroadcast nearly simultaneously. The broadcast storm problem is still challenging in the context of VANET, due to the rapid changes in the network topology, which are difficult to predict and manage. Existing solutions either do not scale well under high density scenarios, or require extra communication overhead to estimate traffic density, so as to manage data dissemination accordingly. In this dissertation, we specifically aim at providing an efficient solution for the broadcast storm problem in VANETs, in order to support different types of applications. A novel approach is developed to provide scalable broadcast without extra communication overhead, by relying on traffic regime estimation using speed data. We theoretically validate the utilization of speed instead of the density to estimate traffic flow. The results of simulating our approach under different density scenarios show its efficiency in providing scalable multi-hop data dissemination for VANETs

    Réseaux ad hoc : système d'adressage et méthodes d'accessibilité aux données

    Get PDF
    RÉSUMÉ Au cours de la dernière décennie, un nouveau type de réseaux sans fil a suscité un grand intérêt dans la communauté scientifique: ce sont les réseaux ad hoc. Ils existent sous la variante des réseaux mobiles ad hoc (MANET), et des réseaux de capteurs sans fil (RCSF). Les réseaux mobiles ad hoc sont constitués de noeuds mobiles qui communiquent les uns avec les autres sans l‘aide d‘une d'infrastructure centralisée. Les noeuds se déplacent librement et sont soumis à des déconnexions fréquentes en raison de l'instabilité des liens. Cela a pour conséquence de diminuer l'accessibilité aux données, et de modifier la façon dont les données sont partagées dans le réseau. Comparable aux réseaux MANET, un RCSF est composé d'un ensemble d'unités de traitements embarquées, appelées capteurs, communiquant via des liens sans fil et dont la fonction principale est la collecte de paramètres relatifs à l'environnement qui les entoure, telles que la température, la pression, ou la présence d'objets. Les RCSF diffèrent des MANET de par le déploiement à grande échelle des noeuds, et trouvent leur application dans diverses activités de la société, tels les processus industriels, les applications militaires de surveillance, l'observation et le suivi d'habitat, etc. Lorsqu‘un grand nombre de capteurs sont déployés avec des dispositifs d'actionnement appelés acteurs, le RCSF devient un réseau de capteurs et d‘acteurs sans fil (RCASF). Dans une telle situation, les capteurs collaborent pour la détection des phénomènes physiques et rapportent les données afférentes aux acteurs qui les traitent et initient les actions appropriées. De nombreux travaux dans les RCSF supposent l'existence d'adresses et d'infrastructures de routage pour valider leurs propositions. Cependant, l‘allocation d‘adresses et le routage des données liées aux événements détectés dans ces réseaux restent des défis entiers, en particulier à cause du nombre élevé de capteurs et des ressources limitées dont ils disposent. Dans cette thèse, nous abordons le problème de l'accessibilité aux données dans les MANET, et les mécanismes d‘adressage et de routage dans les RCSF de grande taille.----------ABSTRACT During the last decade, a new type of wireless networks has stirred up great interest within the scientific community: there are ad hoc networks. They exist as mobile ad hoc networks (MANET), and wireless sensor (WSN). The mobile ad hoc networks consist of mobile nodes that communicate with each other without using a centralized infrastructure. The nodes move freely and are subject to frequent disconnections due to links instability. This has the effect of reducing data accessibility, and change the way data are shared across the network. Similar MANET networks, a WSN consists of a set of embedded processing units called sensors that communicate with each other via wireless links. Their main function is the collection of parameters relating to the environment around them, such as temperature, pressure, motion, video, etc. WSNs differ from the MANETs due to the large scale deployment of nodes, and are expected to have many applications in various fields, such as industrial processes, military surveillance, observation and monitoring of habitat, etc. When a large number of sensors which are resource-impoverished nodes are deployed with powerful actuation devices, the WSN becomes a Wireless Sensor and Actor Network (WSAN). In such a situation, the collaborative operation of sensors enables the distributed sensing of a physical phenomenon, while actors collect and process sensor data to perform appropriate action. Numerous works in WSN assumes the existence of addresses and routing infrastructure to validate their proposals. However, assigning addresses and delivering detected events remains highly challenging, specifically due to the sheer number of nodes. In this thesis, we address the problem of data accessibility in MANET, and that of addressing and routing in large scale WSN. This involves techniques such as data caching and replication to prevent the deterioration of data accessibility. The addressing system in WSN includes a distributed address allocation scheme and a routing infrastructure for both actors and sensors. Moreover, with the birth of the multimedia sensors, the traffic may be mixed with time sensitive packets and reliability-demanding packets. For that purpose, we also address the problem of providing quality of service (QoS) in the routing infrastructure for WSN

    Mobile Ad-Hoc Networks

    Get PDF
    Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: vehicular ad-hoc networks, security and caching, TCP in ad-hoc networks and emerging applications. It is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

    Dynamic Selection of Network Protocols for Group Communications in Mobile Ad-hoc Networks

    Get PDF
    This thesis addresses the topic of dynamically selecting protocols at various levels of network stacks in challenged environments, speci cally those with message loss, long-term fragmentation, and high mobility, in an e ort to meet the demands of group-based messaging applications. Currently, developers select protocols based on a static set of assumptions about the underlying network and application requirements. This thesis introduces a method of sensing the network state, merging this with similar information from peers, and dynamically changing the underlying protocols. This alleviates the need for developers to select protocols and instead assert message requirements. Further, since application instances are involved in group communications, they likely act as such from a mobility perspective, causing di erent portions of the network to have drastically di erent properties. For example, there may be clusters of nodes in certain locations, but minimal connectivity between them. The proposed solution allows systems to adapt to these situations as protocols may be interchanged at any time, allowing the best to be used in any given scenario. The thesis rst establishes a formal de nition of the problem space, and then proposes a solution utilizing Markov Random Fields to classify the network. This classi cation is then used to dynamically select the protocols utilized by the network stack. The Dynamic Protocol Selection Middleware (DPSM) is introduced as the implementation of this approach. Using this middelware, the e ectiveness of the approach is tested in both random group environments and real-world scenarios. In general, DPSM delivered at least as many messages as any statically selected protocol, while delivering substantially more messages in many scenarios with only modest increases in overhead or latency.M.S., Computer Science -- Drexel University, 201
    • …
    corecore