133 research outputs found
A process algebra for wireless mesh networks used for modelling, verifying and analysing AODV
We propose AWN (Algebra for Wireless Networks), a process algebra tailored to the modelling of Mobile Ad hoc Network (MANET) and Wireless Mesh Network (WMN) protocols. It combines novel treatments of local broadcast, conditional unicast and data structures.
In this framework we present a rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) protocol, a popular routing protocol designed for MANETs and WMNs, and one of the four protocols currently standardised by the IETF MANET working group.
We give a complete and unambiguous specification of this protocol, thereby formalising the RFC of AODV, the de facto standard specification, given in English prose. In doing so, we had to make non-evident assumptions to resolve ambiguities occurring in that specification. Our formalisation models the exact details of the core functionality of AODV, such as route maintenance and error handling, and only omits timing aspects.
The process algebra allows us to formalise and (dis)prove crucial properties of mesh network routing protocols such as loop freedom and packet delivery. We are the first to provide a detailed proof of loop freedom of AODV. In contrast to evaluations using simulation or model checking, our proof is generic and holds for any possible network scenario in terms of network topology, node mobility, etc. Due to ambiguities and contradictions the RFC specification allows several interpretations; we show for more than 5000 of them whether they are loop free or not, thereby demonstrating how the reasoning and proofs can relatively easily be adapted to protocol variants.
Using our formal and unambiguous specification, we find shortcomings of AODV that affect performance, e.g. the establishment of non-optimal routes, and some routes not being found at all. We formalise improvements in the same process algebra; carrying over the proofs is again easy
Recommended from our members
A Unified Wormhole Attack Detection Framework for Mobile Ad hoc Networks
The Internet is experiencing an evolution towards a ubiquitous network paradigm, via the so-called internet-of-things (IoT), where small wireless computing devices like sensors and actuators are integrated into daily activities. Simultaneously, infrastructure-less systems such as mobile ad hoc networks (MANET) are gaining popularity since they provide the possibility for devices in wireless sensor networks or vehicular ad hoc networks to share measured and monitored information without having to be connected to a base station. While MANETs offer many advantages, including self-configurability and application in rural areas which lack network infrastructure, they also present major challenges especially in regard to routing security. In a highly dynamic MANET, where nodes arbitrarily join and leave the network, it is difficult to ensure that nodes are trustworthy for multi-hop routing. Wormhole attacks belong to most severe routing threats because they are able to disrupt a major part of the network traffic, while concomitantly being extremely difficult to detect.
This thesis presents a new unified wormhole attack detection framework which is effective for all known wormhole types, alongside incurring low false positive rates, network loads and computational time, for a variety of diverse MANET scenarios. The framework makes three original technical contributions: i) a new accurate wormhole detection algorithm based on packet traversal time and hop count analysis (TTHCA) which identifies infected routes, ii) an enhanced, dynamic traversal time per hop analysis (TTpHA) detection model which is adaptable to node radio range fluctuations, and iii) a method for automatically detecting time measurement tampering in both TTHCA and TTpHA.
The thesis findings indicate that this new wormhole detection framework provides significant performance improvements compared to other existing solutions by accurately, efficiently and robustly detecting all wormhole variants under a wide range of network conditions
Statistical model checking of ad hoc routing protocols in lossy grid networks
We extend recent work by Hofner and McIver con the performances of the ad hoc routing protocols AODV and DYMO in terms of routes established. Hofner and McIver apply statistical model checking to show that on arbitrary small networks (up to 5 nodes) the most recent, and apparently more robust, DYMO protocol is less efficient than AODV. Here, we reformulate their experiments on 4x3 toroidal networks, with possibly lossy communication. As a main result we demonstrate that, in this more realistic scenario, DYMO performs significantly better than AODV
A Routing Delay Predication Based on Packet Loss and Explicit Delay Acknowledgement for Congestion Control in MANET
In Mobile Ad hoc Networks congestion control and prevention are demanding because of network node mobility and dynamic topology. Congestion occurs primarily due to the large traffic volume in the case of data flow because the rate of inflow of data traffic is higher than the rate of data packets on the node. This alteration in sending rate results in routing delays and low throughput. The Rate control is a significant concern in streaming applications, especially in wireless networks. The TCP friendly rate control method is extensively recognized as a rate control mechanism for wired networks, which is effective in minimizing packet loss (PL) in the event of congestion. In this paper, we propose a routing delay prediction based on PL and Explicit Delay Acknowledgement (EDA) mechanism for data rate and congestion control in MANET to control data rate to minimize the loss of packets and improve the throughput. The experiment is performed over a reactive routing protocol to reduce the packet loss, jitter, and improvisation of throughput
Performance metrics and routing in vehicular ad hoc networks
The aim of this thesis is to propose a method for enhancing the performance of Vehicular Ad hoc
Networks (VANETs). The focus is on a routing protocol where performance metrics are used to
inform the routing decisions made. The thesis begins by analysing routing protocols in a random
mobility scenario with a wide range of node densities. A Cellular Automata algorithm is
subsequently applied in order to create a mobility model of a highway, and wide range of density
and transmission range are tested. Performance metrics are introduced to assist the prediction of
likely route failure. The Good Link Availability (GLA) and Good Route Availability (GRA)
metrics are proposed which can be used for a pre-emptive action that has the potential to give
better performance. The implementation framework for this method using the AODV routing
protocol is also discussed. The main outcomes of this research can be summarised as identifying
and formulating methods for pre-emptive actions using a Cellular Automata with NS-2 to
simulate VANETs, and the implementation method within the AODV routing protocol
Suitability of Abstract State Machines for Discussing Mobile Ad-hoc Networks
Abstract: Several formalisms have been applied for addressing development issues in Mobile Ad-hoc NETworks (MANETs), however they usually lack of understandability, expressiveness and executability features. Instead, the Abstract State Machine (ASM) formalism does not suffer these limitations and can provide a useful conceptual tool for reasoning about MANET behavior. This paper shows the practical suitability of ASMs in capturing the specific MANET issues: concurrency, communications, and so on. To this end, the Ad-hoc On-demand Distance Vector (AODV) routing protocol for MANETs is modeled, and some properties of interest are proved
- …