Design and Evaluation of Online Fault Diagnosis Protocols forwireless Networks

Any node in a network, or a component of it may fail and show undesirable behavior due to physical defects, imperfections, or hardware and/or software related glitches. Presence of faulty hosts in the network affects the computational efficiency, and quality of service (QoS). This calls for the development of efficient fault diagnosis protocols to detect and handle faulty hosts. Fault diagnosis protocols designed for wired networks cannot directly be propagated to wireless networks, due to difference in characteristics, and requirements. This thesis work unravels system level fault diagnosis protocols for wireless networks, particularly for Mobile ad hoc Networks (MANETs), and Wireless Sensor Networks (WSNs), considering faults based on their persistence (permanent, intermittent, and transient), and node mobility. Based on the comparisons of outcomes of the same tasks (comparison model ), a distributed diagnosis protocol has been proposed for static topology MANETs, where a node requires to respond to only one test request from its neighbors, that reduces the communication complexity of the diagnosis process. A novel approach to handle more intractable intermittent faults in dynamic topology MANETs is also discussed.Based on the spatial correlation of sensor measurements, a distributed fault diagnosis protocol is developed to classify the nodes to be fault-free, permanently faulty, or intermittently faulty, in WSNs. The nodes affected by transient faults are often considered fault-free, and should not be isolated from the network. Keeping this objective in mind, we have developed a diagnosis algorithm for WSNs to discriminate transient faults from intermittent and permanent faults. After each node finds the status of all 1-hop neighbors (local diagnostic view), these views are disseminated among the fault-free nodes to deduce the fault status of all nodes in the network (global diagnostic view). A spanning tree based dissemination strategy is adopted, instead of conventional flooding, to have less communication complexity. Analytically, the proposed protocols are shown to be correct, and complete. The protocols are implemented using INET-20111118 (for MANETs) and Castalia-3.2 (forWSNs) on OMNeT++ 4.2 platform. The obtained simulation results for accuracy and false alarm rate vouch the feasibility and efficiency of the proposed algorithms over existing landmark protocols

Relative localization with 2-hop neighborhood

Localization is the process in which nodes in a wireless sensor network self-determine their positions in the net-work. While there are many effective mathematical tech-niques for solving the problem of localization, most are not suitable for the resource-constrained distributed envi-ronment of sensor networks. We propose ANIML an iter-ative, range-aware relative localization technique for wire-less sensor networks that requires no anchor nodes. ANIML restricts itself to the use of only local 1- and 2-hop neigh-bor information, avoiding the need for information flooding and thus controlling cascading ranging errors that bedevil other localization techniques. While least-squares mini-mization is a mathematically simple constraint optimization technique, utilizing 1- and 2-hop neighbor information as constraints, ANIML provides better localization without the need for more sophisticated error control and/or global in-formation. We implemented ANIML in ns-2 and conducted extensive experimentation to evaluate its performance. Ex-perimental results show that ANIML provides robust local-ization and scales well.