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)

A Framework to Quantify Network Resilience and Survivability

The significance of resilient communication networks in the modern society is well established. Resilience and survivability mechanisms in current networks are limited and domain specific. Subsequently, the evaluation methods are either qualitative assessments or context-specific metrics. There is a need for rigorous quantitative evaluation of network resilience. We propose a service oriented framework to characterize resilience of networks to a number of faults and challenges at any abstraction level. This dissertation presents methods to quantify the operational state and the expected service of the network using functional metrics. We formalize resilience as transitions of the network state in a two-dimensional state space quantifying network characteristics, from which network service performance parameters can be derived. One dimension represents the network as normally operating, partially degraded, or severely degraded. The other dimension represents network service as acceptable, impaired, or unacceptable. Our goal is to initially understand how to characterize network resilience, and ultimately how to guide network design and engineering toward increased resilience. We apply the proposed framework to evaluate the resilience of the various topologies and routing protocols. Furthermore, we present several mechanisms to improve the resilience of the networks to various challenges

Energy-aware and secure routing with trust levels for wireless ad hoc and sensor networks

This dissertation focuses on the development of routing algorithms for secure and trusted routing in wireless ad hoc and sensor network. The first paper presents the Trust Level Routing (TLR) protocol, an extension of the optimized energy-delay routing (OEDR) protocol, focusing on the integrity, reliability and survivability of the wireless network...The second paper analyzes both OLSR and TLR in terms of survivability and reliability to emphasize the improved performance of the network in terms of lifetime and proper delivery of data...The third paper proposes a statistical reputation model that uses the watchdog mechanism to observe the cooperation of the neighboring nodes...The last paper presents the results of the hardware implementation of Energy-Efficient Hybrid Key Management --Abstract, page iv

Modelling and Design of Resilient Networks under Challenges

Communication networks, in particular the Internet, face a variety of challenges that can disrupt our daily lives resulting in the loss of human lives and significant financial costs in the worst cases. We define challenges as external events that trigger faults that eventually result in service failures. Understanding these challenges accordingly is essential for improvement of the current networks and for designing Future Internet architectures. This dissertation presents a taxonomy of challenges that can help evaluate design choices for the current and Future Internet. Graph models to analyse critical infrastructures are examined and a multilevel graph model is developed to study interdependencies between different networks. Furthermore, graph-theoretic heuristic optimisation algorithms are developed. These heuristic algorithms add links to increase the resilience of networks in the least costly manner and they are computationally less expensive than an exhaustive search algorithm. The performance of networks under random failures, targeted attacks, and correlated area-based challenges are evaluated by the challenge simulation module that we developed. The GpENI Future Internet testbed is used to conduct experiments to evaluate the performance of the heuristic algorithms developed

Susceptibility Modeling and Mission Flight Route Optimization in a Low Threat, Combat Environment

Movement and transportation systems are a primary topic in the study of humans and their relationship with the environment. Only a few modes of transportation allow for nearly full freedom of movement that is unconstrained by rigid nodes and networks. Individual human travel (walking, climbing, swimming, etc.) is one example while rotorcraft travel is another. Although other criteria constrain movement, independence from a network allows for a unique examination of human spatial decision-making and choice behavior. This research analyzes helicopter flight route planning in a low threat combat environment with respect to geography. The particular problem addressed, which ultimately concerns the quantitative representation and mapping of helicopter susceptibility in a low threat, combat environment, is assisted by a Geographic Information System (GIS). Prior susceptibility research on helicopters is combined with the spatial analytical functions of a GIS to cartographically model three dimensional flight corridors and routes across four separate areas. GIS optimized flight routing plans that minimize helicopter susceptibility (maximize capability to avoid threats) are then compared to the conventional routes produced by human flight route planners using existing techniques. Findings indicate that although the GIS routes reduce susceptibility costs, they concomitantly decrease route diversity. There was no significant evidence that experience, expertise, landscape familiarity, age, or the amount of time taken to plan had any effect on the spatial character of the routes. Several spatial similarities between conventionally planned routes and GIS optimized routes were revealed that expose potential perceptual limitations imposed by the conventional flight planning paradigm. Implementation of geospatial technology could help eliminate these restrictions