Development of an efficient Ad Hoc broadcasting scheme for critical networking environments

Mobile ad hoc network has been widely deployed in support of the communications in hostile environment without conventional networking infrastructure, especially in the environments with critical conditions such as emergency rescue activities in burning building or earth quick evacuation. However, most of the existing ad hoc based broadcasting schemes either rely on GPS location or topology information or angle-of-arrival (AoA) calculation or combination of some or all to achieve high reachability. Therefore, these broadcasting schemes cannot be directly used in critical environments such as battlefield, sensor networks and natural disasters due to lack of node location and topology information in such critical environments. This research work first begins by analyzing the broadcast coverage problem and node displacement form ideal locations problem in ad hoc networks using theoretical analysis. Then, this research work proposes an efficient broadcast relaying scheme, called Random Directional Broadcasting Relay (RDBR), which greatly reduces the number of retransmitting nodes and end-to-end delay while achieving high reachability. This is done by selecting a subset of neighboring nodes to relay the packet using directional antennas without relying on node location, network topology and complex angle-of-arrival (AoA) calculations. To further improve the performance of the RDBR scheme in complex environments with high node density, high node mobility and high traffic rate, an improved RDBR scheme is proposed. The improved RDBR scheme utilizes the concept of gaps between neighboring sectors to minimize the overlap between selected relaying nodes in high density environments. The concept of gaps greatly reduces both contention and collision and at the same time achieves high reachability. The performance of the proposed RDBR schemes has been evaluated by comparing them against flooding and Distance-based schemes. Simulation results show that both proposed RDBR schemes achieve high reachability while reducing the number of retransmitting nodes and end-to-end delay especially in high density environments. Furthermore, the improved RDBR scheme achieves better performance than RDBR in high density and high traffic environment in terms of reachability, end-to-end delay and the number of retransmitting nodes

The derivation of performance expressions for communication protocols from timed Petri net models

Petri Net models have been extended in a variety of ways and have been used to prove the correctness and evaluate the performance of communication protocols. Several extensions have been proposed to model time. This work uses a form of Timed Petri Nets and presents a technique for symbolically deriving expressions which describe system performance. Unlike past work on performance evaluation of Petri Nets which assumes a priori knowledge of specific time delays, the technique presented here applies to a wide range of time delays so long as the delays satisfy a set of timing constraints. The technique is demonstrated using a simple communication protocol

Diagnose network failures via data-plane analysis

Diagnosing problems in networks is a time-consuming and error-prone process. Previous tools to assist operators primarily focus on analyzing control plane configuration. Configuration analysis is limited in that it cannot find bugs in router software, and is harder to generalize across protocols since it must model complex configuration languages and dynamic protocol behavior. This paper studies an alternate approach: diagnosing problems through static analysis of the data plane. This approach can catch bugs that are invisible at the level of configuration files, and simplifies unified analysis of a network across many protocols and implementations. We present Anteater, a tool for checking invariants in the data plane. Anteater translates high-level network invariants into boolean satisfiability problems, checks them against network state using a SAT solver, and reports counterexamples if violations have been found. Applied to a large campus network, Anteater revealed 23 bugs, including forwarding loops and stale ACL rules, with only five false positives. Nine of these faults are being fixed by campus network operators