Ad hoc wireless distribution service

About: Ad hoc wireless distribution service is a research topic. Over the lifetime, 17734 publications have been published within this topic receiving 488205 citations.

CHR: a distributed hash table for wireless ad hoc networks

Abstract: his paper focuses on the problem of implementing a distributed hash table (DHT) in wireless ad hoc networks. Scarceness of resources and node mobility turn routing into a challenging problem and therefore, we claim that building DHT as an overlay network (like in wired environments) is not the best option. Hence, we present a proof-of-concept DHT, called cell hash routing (CHR), designed from scratch to cope with problems like limited available energy, communication range or node mobility. CHR overcomes these problems, by using position information to organize a DHT of clusters instead of individual nodes. By using position-based routing on top of these clusters, CHR is very efficient. Furthermore, its localized routing and its load sharing schemes, make CHR very scalable in respect to network size and density. For these reasons, we believe that CHR is a simple and yet powerful adaptation of the DHT concept for wireless ad hoc environments.

A Cooperative Network Framework for Multi-UAV Guided Ground Ad Hoc Networks

Abstract: Cooperative ad hoc networks are becoming very important in various military and civilian applications. The interfacing between different ad hoc networks provides large applications in field of surveillance, navigation, disaster monitoring and homeland security. This paper focuses on implementation of UAV (unmanned aerial vehicles) ad hoc network that forms a guidance system for ground ad hoc network. The network framework proposed in the paper uses neural network to form cognitive and topology maps. Indirect and Bayesian Kalman Filter are used for estimations. These estimations allows updating of pre-constructed cognitive map to form ideal final search map that is shared among all nodes to perform search and track operations. The analysis showed that the proposed framework is capable of forming a search maps that is able to define multiple way points for each UAV in the network to follow a non-redundant path for searching and identifying various user nodes and geographical territories. The effectiveness of the model is demonstrated using simulations.

A Hierarchical Privacy Preserving Pseudonymous Authentication Protocol for VANET

Abstract: Vehicular ad hoc network (VANET) is a technology that enables smart vehicles to communicate with each other and form a mobile network VANET facilitates users with improved traffic efficiency and safety Authenticated communication becomes one of the prime requirements of VANET However, authentication may reveal a user’s personal information such as identity or location, and therefore, the privacy of an honest user must be protected This paper proposes an efficient and practical pseudonymous authentication protocol with conditional privacy preservation Our protocol proposes a hierarchy of pseudonyms based on the time period of their usage We propose the idea of primary pseudonyms with relatively longer time periods that are used to communicate with semi-trusted authorities and secondary pseudonyms with a smaller life time that are used to communicate with other vehicles Most of the current pseudonym-based approaches are based on certificate revocation list (CRL) that causes significant communication and storage overhead or group-based approaches that are computationally expensive and suffer from group-management issues These schemes also suffer from trust issues related to certification authority Our protocol only expects an honest-but-curious behavior from otherwise fully trusted authorities Our proposed protocol protects a user’s privacy until the user honestly follows the protocol In case of a malicious activity, the true identity of the user is revealed to the appropriate authorities Our protocol does not require maintaining a CRL and the inherent mechanism assures the receiver that the message and corresponding pseudonym are safe and authentic We thoroughly examined our protocol to show its resilience against various attacks and provide computational as well as communicational overhead analysis to show its efficiency and robustness Furthermore, we simulated our protocol in order to analyze the network performance and the results show the feasibility of our proposed protocol in terms of end-to-end delay and packet delivery ratio

Lanes - A Lightweight Overlay for Service Discovery in Mobile Ad Hoc Networks

Abstract: The ability to discover services offered in a mobile ad hoc network is the major prerequisite for effective usability of these networks. Unfortunately, existing approaches to service trading are not well suited for these highly dynamic topologies since they either rely on centralized servers or on resource-consuming query flooding. Application layer overlays seem to be a more promising approach. However, existing solutions like the ContentAddressable Network (CAN) are especially designed for internet based peerto-peer networks yielding structural conditions that are far too complex for ad hoc networks. Therefore, in this paper, we propose a more lightweight overlay structure: lanes. We present algorithms to correct and optimize its structure in case of topology changes and show how it enables the trading of services specified by arbitrary descriptions.