Report on a Working Session on Security in Wireless Ad Hoc Networks

No abstrac

Context-Aware Group Communication in Mobile Ad-Hoc Networks

Abstract. The widespread availability of both fixed and wireless network con-nectivity and the growing market of portable devices are enabling anytime and anywhere impromptu collaboration. The emergence of Mobile Ad-Hoc Net-works (MANET) further opens up new possibilities for the provisioning of ad-vanced collaborative services, such as civil protection, e-care, and troop car management. However, the design and the deployment of collaborative appli-cations in MANET scenarios raises new group management challenges. In par-ticular, MANET characteristics, e.g., unpredictable and frequent mobility of us-ers/devices, intermittent device connectivity, continuous variations of network topology, make it impossible any a-priori knowledge about group members availability and ask for novel solutions to handle properly the communication about group members. The paper proposes a context-aware communication model to govern communication on the basis of the characteristics of the com-municating parties, such as their location and their profiling information. The model provides communication patterns with different semantics to address both point-to-point and point-to-multipoint communication needs. The paper shows the implementation of the proposed model in the AGAPE framework for the design, deployment, and support of collaborative applications in MANET environments and presents the functioning of the AGAPE communication sup-port in the context of a civil protection application scenario.

High-Quality in Data Authentication Dodging Massive Attack in VANETS

VANET plays an important role in the Security terms. VANET network is due to their unique features like as a high dynamic network (topology) and Mobility prediction. It attracts so much attention to the industry. VANET wireless networks are rapidly increased commercial and academic interests. Mobile connectivity, Traffic congestion management and road safety are some applications that have arisen within this network model. The routing protocol is a reactive type which means if there is data to be sent then the way will create. On-demand Distance Vector routing protocol is a generally used network topology based on rules for VANET. In surveyed of the routing protocol implemented a balance AODV method used for identifying the malicious nodes in the network. A balanced AODV routing method is defined with following characteristics:- (i) Use of threshold adaptive according to the network situations and balance index i.e node nature. (ii) Detect the malicious node in the network. (iii) Detection and prevention methods in real-time and independent on each vehicle node. In research paper, implement a B-AODV routing protocol and RSA method for detection and prevention the malicious node in the vehicular network. In this proposed algorithm, each vehicle node is employing balance index for acceptable and reject able REQ information’s (Bits). The consequences of the simulation tool in MATLAB (Matrix Laboratory) indicates BAODV and RSA method is used to detect and prevent the flood attach and loss of network bandwidth. Comparison between AODV, BAODV, RSA in normal phase defines B-AODV is exactly matched with AODV in the vehicular network and performance analysis overhead, an end to end delay and packet delivery rate

A trading model and security regime for mobile e-commerce via ad hoc wireless networking

Ad hoc wireless networking offers mobile computer users the prospect of trading with others in their vicinity anywhere anytime. This thesis explores the potential for developing such trading applications. A notable difficulty in designing their security services is being unable to use trusted parties. No one can be guaranteed present in each ad hoc wireless network session. A side benefit is that their costs don't have to be paid for. A reference model is defined for ad hoc m-commerce and a threat model is for- mulated of its security vulnerabilities. They are used to elicit security objectives and requirements for such trading systems. Possible countermeasures to address the threats are critically analysed and used to design security services to mitigate them. They include a self-organised P2P identity support scheme using PGP cer- tificates; a distributed reputation system backed by sanctions; a group membership service based on membership vouchers, quorate decisions by some group members and partial membership lists; and a security warning scheme. Security analysis of the schemes shows that they can mitigate the threats to an adequate degree to meet the trading system's security objectives and requirements if users take due care when trading within it. Formal verification of the system shows that it satisfies certain safety properties

Cooperation of Nodes. In: L. Buttyan and J.-P. Hubaux (eds.), Report on a Working Session on Security in Wireless Ad Hoc Networks

In mobile ad-hoc networks nodes need to cooperate to communicate, but there are many reasons for non-cooperation. Saving power or preventing other nodes from obstructing a service are merely selfish reasons for non-cooperation, whereas nodes may also actively and maliciously deny service or divert traffic for all sorts of attacks. However, without an infrastructure to rely on, nodes depend on each other`s cooperation. In game-theoretic terms, this is a dilemma. The dominating strategy for individual nodes is not to cooperate, as cooperation consumes resources and it might result in a disadvantage. But if every node follows that strategy, the outcome is undesirable for everyone as it results in a non functional or entirely absent network. Our goals are to increase cooperation by proactively giving selfish nodes an incentive to cooperate, as well as reactively isolate selfish or malicious nodes such that they cannot continue their misbehavior. To make cooperation in mobile ad-hoc networks attractive we have to make sure that selfish behavior, i.e., a behavior that maximizes the utility of a node, leads to an outcome that is also beneficial for the network

Trust models for mobile content-sharing applications

Using recent technologies such as Bluetooth, mobile users can share digital content (e.g., photos, videos) with other users in proximity. However, to reduce the cognitive load on mobile users, it is important that only appropriate content is stored and presented to them. This dissertation examines the feasibility of having mobile users filter out irrelevant content by running trust models. A trust model is a piece of software that keeps track of which devices are trusted (for sending quality content) and which are not. Unfortunately, existing trust models are not fit for purpose. Specifically, they lack the ability to: (1) reason about ratings other than binary ratings in a formal way; (2) rely on the trustworthiness of stored third-party recommendations; (3) aggregate recommendations to make accurate predictions of whom to trust; and (4) reason across categories without resorting to ontologies that are shared by all users in the system. We overcome these shortcomings by designing and evaluating algorithms and protocols with which portable devices are able automatically to maintain information about the reputability of sources of content and to learn from each other’s recommendations. More specifically, our contributions are: 1. An algorithm that formally reasons on generic (not necessarily binary) ratings using Bayes’ theorem. 2. A set of security protocols with which devices store ratings in (local) tamper-evident tables and are able to check the integrity of those tables through a gossiping protocol. 3. An algorithm that arranges recommendations in a “Web of Trust” and that makes predictions of trustworthiness that are more accurate than existing approaches by using graph-based learning. 4. An algorithm that learns the similarity between any two categories by extracting similarities between the two categories’ ratings rather than by requiring a universal ontology. It does so automatically by using Singular Value Decomposition. We combine these algorithms and protocols and, using real-world mobility and social network data, we evaluate the effectiveness of our proposal in allowing mobile users to select reputable sources of content. We further examine the feasibility of implementing our proposal on current mobile phones by examining the storage and computational overhead it entails. We conclude that our proposal is both feasible to implement and performs better across a range of parameters than a number of current alternatives

IAM - Interpolation and Aggregation on the Move: Collaborative Crowdsensing for Spatio-temporal Phenomena

International audienceCrowdsensing allows citizens to contribute to the monitoring of their living environment using the sensors embedded in their mobile devices, e.g., smartphones. However, crowdsensing at scale involves significant communication, computation, and financial costs due to the dependence on cloud infrastructures for the analysis (e.g., interpolation and aggregation) of spatio-temporal data. This limits the adoption of crowdsensing by activists although sorely needed to inform our knowledge of the environment. As an alternative to the centralized analysis of crowdsensed observations, this paper introduces a fully distributed interpolation-mediated aggregation approach running on smartphones. To achieve so efficiently, we model the interpolation as a distributed tensor completion problem, and we introduce a lightweight aggregation strategy that anticipates the likelihood of future encounters according to the quality of the interpolation. Our approach thus shifts the centralized postprocessing of crowdsensed data to distributed pre-processing on the move, based on opportunistic encounters of crowdsensors through state-of-the-art D2D networking. The evaluation using a dataset of quantitative environmental measurements collected from 550 crowdsensors over 1 year shows that our solution significantly reduces-and may even eliminate-the dependence on the cloud infrastructure, while it incurs a limited resource cost on end devices. Meanwhile, the overall data accuracy remains comparable to that of the centralized approach