A two‐step authentication framework for Mobile ad hoc networks

The lack of fixed infrastructure in ad hoc networks causes nodes to rely more heavily on peer nodes for communication. Nevertheless, establishing trust in such a distributed environment is very difficult, since it is not straightforward for a node to determine if its peer nodes can be trusted. An additional concern in such an environment is with whether a peer node is merely relaying a message or if it is the originator of the message. In this paper, we propose an authentication approach for protecting nodes in mobile ad hoc networks. The security requirements for protecting data link and network layers are identified and the design criteria for creating secure ad hoc networks using several authentication protocols are analyzed. Protocols based on zero knowledge and challenge response techniques are presented and their performance is evaluated through analysis and simulation

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

Coloured Petrinet for Modelling and Validation of Dynamic Transmission Range Adjustment Protocol for Ad Hoc Network

The IEEE 802.11 standard defines two operational modes for WLANs: infrastructure based and infrastructureless or ad hoc. A wireless ad hoc network comprises of nodes that communicate with each other without the help of any centralized control. Ad hoc implies that the network does not rely on a pre-existing infrastructure but rather each node participates in routing by forwarding data for other nodes. The decentralized nature improves the scalability of wireless ad hoc network as compared to wireless managed networks. Each node acts as either a host or router. A node that is within the transmission range of any other node can establish a link with the later and becomes its immediate neighbour. However, the nodes in the ad hoc networks are constrained with limited resources and computation capability. So it may not be possible for a node to serve more number of neighbours at some instant of time. This enforces a node to remain connected or disconnected with few of its existing neighbours supporting the dynamic restructuring of the network. The presence of dynamic and adaptive routing protocol enables ad hoc networks to be formed quickly. The Dynamic Transmission Range Adjustment Protocol (DTRAP) provides a mechanism for adjusting transmission range of the ad hoc nodes. They maintain a threshold number of registered neighbours based on their available resources. The node protects its neighbourhood relationship during data communication by controlling its transmission range. It registers or de-registers a communicating node as its neighbour by dynamically varying the transmission range. However a node has a maximum limit on its transmission range. If the distance between the node and its neighbour is less than the transmission range and; 1)if the number of neighbours of a node falls short of threshold value, the node dynamically increases its transmission range in steps until it is ensured of an optimal number of neighbours 2)if the number of neighbours of a node exceeds the threshold value, the node dynamically decreases its transmission range in steps until it is ensured of an optimal number of neighbours. Coloured Petri nets (CP-nets) is the modelling language tool used for systems having communication, synchronisation and resource sharing as significant aspects. It provides a framework for the design, specication, validation, and verication of systems. It describes the states in which the system may be in and the transition between these states. The CPN combines Petri nets and programming languages. Petri nets amalgamate the use of graphical notation and the semantical foundation for modelling in systems. The functional programming language standard ML provides the primitives for the definition of data types and manipulation of data values. Besides providing the strength of a graphical modelling language, CP-nets are theoretically well-founded and versatile enough to be used in practice for systems of the size and complexity of industrial projects

A survey of evaluation platforms for ad hoc routing protocols: a resilience perspective

Routing protocols allow for the spontaneous formation of wireless multi-hop networks without dedicated infrastructure, also known as ad hoc networks. Despite significant technological advances, difficulties associated with the evaluation of ad hoc routing protocols under realistic conditions, still hamper their maturation and significant roll out in real world deployments. In particular, the resilience evaluation of ad hoc routing protocols is essential to determine their ability of keeping the routing service working despite the presence of changes, such as accidental faults or malicious ones (attacks). However, the resilience dimension is not always addressed by the evaluation platforms that are in charge of assessing these routing protocols. In this paper, we provide a survey covering current state-of-the-art evaluation platforms in the domain of ad hoc routing protocols paying special attention to the resilience dimension. The goal is threefold. First, we identify the most representative evaluation platforms and the routing protocols they have evaluated. Then, we analyse the experimental methodologies followed by such evaluation platforms. Finally, we create a taxonomy to characterise experimental properties of such evaluation platforms.This work is partially supported by the Spanish Project ARENES (TIN2012-38308-C02-01), the ANR French Project AMORES (ANR-11-INSE-010), and the Intel Doctoral Student Honour Programme 2012.Friginal López, J.; Andrés Martínez, DD.; Ruiz García, JC.; Martínez Raga, M. (2014). A survey of evaluation platforms for ad hoc routing protocols: a resilience perspective. Computer Networks. 75(A):395-413. https://doi.org/10.1016/j.comnet.2014.09.010S39541375

Security Verification of Secure MANET Routing Protocols

Secure mobile ad hoc network (MANET) routing protocols are not tested thoroughly against their security properties. Previous research focuses on verifying secure, reactive, accumulation-based routing protocols. An improved methodology and framework for secure MANET routing protocol verification is proposed which includes table-based and proactive protocols. The model checker, SPIN, is selected as the core of the secure MANET verification framework. Security is defined by both accuracy and availability: a protocol forms accurate routes and these routes are always accurate. The framework enables exhaustive verification of protocols and results in a counter-example if the protocol is deemed insecure. The framework is applied to models of the Optimized Link-State Routing (OLSR) and Secure OLSR protocol against five attack vectors. These vectors are based on known attacks against each protocol. Vulnerabilities consistent with published findings are automatically revealed. No unknown attacks were found; however, future attack vectors may lead to new attacks. The new framework for verifying secure MANET protocols extends verification capabilities to table-based and proactive protocols

Evaluation of an OPNET Model for Unmanned Aerial Vehicle Networks

The concept of Unmanned Aerial Vehicles (UAVs) was first used as early as the American Civil War, when the North and the South unsuccessfully attempted to launch balloons with explosive devices. Since the American Civil War, the UAV concept has been used in all subsequent military operations. Over the last few years, there has been an explosion in the use of UAVs in military operations, as well as civilian and commercial applications. UAV Mobile Ad Hoc Networks (MANETs) are fast becoming essential to conducting Network-Centric Warfare (NCW). As of October 2006, coalition UAVs, exclusive of hand-launched systems, had flown almost 400,000 flight hours in support of Operations Enduring Freedom and Iraqi Freedom [1]. This study develops a verified network model that emulates UAV network behavior during flight, using a leading simulation tool. A flexible modeling and simulation environment is developed to test proposed technologies against realistic mission scenarios. The simulation model evaluation is performed and findings documented. These simulations are designed to understand the characteristics and essential performance parameters of the delivered model. A statistical analysis is performed to explain results obtained, and identify potential performance irregularities. A systemic approach is taken during the preparation and execution simulation phases to avoid producing misleading results

Layered Mobility Model Architecture - LEMMA

This paper presents the generic layered architecture for mobility models (LEMMA), which can be used to construct a wide variety of mobility models, including the majority of models used in wireless network simulations. The fundamental components of the architecture are described and analyzed, in addition to its benefits. One of the core principles stipulates that each mobility model is divided in five distinct layers that communicate via interfaces. This allows their easy replacement and recombination, which we support by reviewing 19 layers that can form 480 different mobility models. Some of the advanced features provided by the architecture are also discussed, such as layer aggregation, and creation of hybrid and group mobility models. Finally, some of the numerous existing studies of the different layers are presented

W-NINE: a two-stage emulation platform for mobile and wireless systems

More and more applications and protocols are now running on wireless networks. Testing the implementation of such applications and protocols is a real challenge as the position of the mobile terminals and environmental effects strongly affect the overall performance. Network emulation is often perceived as a good trade-off between experiments on operational wireless networks and discrete-event simulations on Opnet or ns-2. However, ensuring repeatability and realism in network emulation while taking into account mobility in a wireless environment is very difficult. This paper proposes a network emulation platform, called W-NINE, based on off-line computations preceding online pattern-based traffic shaping. The underlying concepts of repeatability, dynamicity, accuracy and realism are defined in the emulation context. Two different simple case studies illustrate the validity of our approach with respect to these concepts