6,763 research outputs found
Trust-based security for the OLSR routing protocol
International audienceThe trust is always present implicitly in the protocols based on cooperation, in particular, between the entities involved in routing operations in Ad hoc networks. Indeed, as the wireless range of such nodes is limited, the nodes mutually cooperate with their neighbors in order to extend the remote nodes and the entire network. In our work, we are interested by trust as security solution for OLSR protocol. This approach fits particularly with characteristics of ad hoc networks. Moreover, the explicit trust management allows entities to reason with and about trust, and to take decisions regarding other entities. In this paper, we detail the techniques and the contributions in trust-based security in OLSR. We present trust-based analysis of the OLSR protocol using trust specification language, and we show how trust-based reasoning can allow each node to evaluate the behavior of the other nodes. After the detection of misbehaving nodes, we propose solutions of prevention and countermeasures to resolve the situations of inconsistency, and counter the malicious nodes. We demonstrate the effectiveness of our solution taking different simulated attacks scenarios. Our approach brings few modifications and is still compatible with the bare OLSR
On Energy Efficiency and Delay Minimization in Reactive Protocols in Wireless Multi-hop Networks
In Wireless Multi-hop Networks (WMhNs), routing protocols with energy
efficient and delay reduction techniques are needed to fulfill users demands.
In this paper, we present Linear Programming models (LP_models) to assess and
enhance reactive routing protocols. To practically examine constraints of
respective LP_models over reactive protocols, we select AODV, DSR and DYMO. It
is deduced from analytical simulations of LP_models in MATLAB that quick route
repair reduces routing latency and optimizations of retransmission attempts
results efficient energy utilization. To provide quick repair, we enhance AODV
and DSR. To practically examine the efficiency of enhanced protocols in
different scenarios of WMhNs, we conduct simulations using NS- 2. From
simulation results, enhanced DSR and AODV achieve efficient output by
optimizing routing latencies and routing load in terms of retransmission
attempts
Multipath optimized link state routing for mobile ad hoc networks
International audienceMultipath routing protocols for Mobile Ad hoc NETwork (MANET) address the problem of scalability, security (confidentiality and integrity), lifetime of networks, instability of wireless transmissions, and their adaptation to applications. Our protocol, called MP-OLSR (MultiPath OLSR), is a multipath routing protocol based on OLSR. The Multipath Dijkstra Algorithm is proposed to obtain multiple paths. The algorithm gains great flexibility and extensibility by employing different link metrics and cost functions. In addition, route recovery and loop detection are implemented in MP-OLSR in order to improve quality of service regarding OLSR. The backward compatibility with OLSR based on IP source routing is also studied. Simulation based on Qualnet simulator is performed in different scenarios. A testbed is also set up to validate the protocol in real world. The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints
iPDA: An Integrity-Protecting Private Data Aggregation Scheme for Wireless Sensor Networks
Data aggregation is an efficient mechanism widely used in wireless sensor networks (WSN) to collect statistics about data of interests. However, the shared-medium nature of communication makes the WSNs are vulnerable to eavesdropping and packet tampering/injection by adversaries. Hence, how to protect data privacy and data integrity are two major challenges for data aggregation in wireless sensor networks. In this paper, we present iPDA??????an integrity-protecting private data aggregation scheme. In iPDA, data privacy is achieved through data slicing and assembling technique; and data integrity is achieved through redundancy by constructing disjoint aggregation paths/trees to collect data of interests. In iPDA, the data integrity-protection and data privacy-preservation mechanisms work synergistically. We evaluate the iPDA scheme in terms of the efficacy of privacy preservation, communication overhead, and data aggregation accuracy, comparing with a typical data aggregation scheme--- TAG, where no integrity protection and privacy preservation is provided. Both theoretical analysis and simulation results show that iPDA achieves the design goals while still maintains the efficiency of data aggregation
Modeling Routing Overhead Generated by Wireless Proactive Routing Protocols
In this paper, we present a detailed framework consisting of modeling of
routing overhead generated by three widely used proactive routing protocols;
Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and
Optimized Link State Routing (OLSR). The questions like, how these protocols
differ from each other on the basis of implementing different routing
strategies, how neighbor estimation errors affect broadcast of route requests,
how reduction of broadcast overhead achieves bandwidth, how to cope with the
problem of mobility and density, etc, are attempted to respond. In all of the
above mentioned situations, routing overhead and delay generated by the chosen
protocols can exactly be calculated from our modeled equations. Finally, we
analyze the performance of selected routing protocols using our proposed
framework in NS-2 by considering different performance parameters; Route
REQuest (RREQ) packet generation, End-to-End Delay (E2ED) and Normalized
Routing Load (NRL) with respect to varying rates of mobility and density of
nodes in the underlying wireless network
Resilient networking in wireless sensor networks
This report deals with security in wireless sensor networks (WSNs),
especially in network layer. Multiple secure routing protocols have been
proposed in the literature. However, they often use the cryptography to secure
routing functionalities. The cryptography alone is not enough to defend against
multiple attacks due to the node compromise. Therefore, we need more
algorithmic solutions. In this report, we focus on the behavior of routing
protocols to determine which properties make them more resilient to attacks.
Our aim is to find some answers to the following questions. Are there any
existing protocols, not designed initially for security, but which already
contain some inherently resilient properties against attacks under which some
portion of the network nodes is compromised? If yes, which specific behaviors
are making these protocols more resilient? We propose in this report an
overview of security strategies for WSNs in general, including existing attacks
and defensive measures. In this report we focus at the network layer in
particular, and an analysis of the behavior of four particular routing
protocols is provided to determine their inherent resiliency to insider
attacks. The protocols considered are: Dynamic Source Routing (DSR),
Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing
(RWR)
- …