A partition detection system for mobile ad-hoc networks

Abstract

A vast amount of applications and mechanisms recently developed for mobile ad-hoc networks could greatly benefit from the utilization of network status information. That includes, but is not limited to the detection of network partitioning. Network partitioning is a form of network failure. A single connected network topology breaks apart into two or more network topologies separated from each other. Nodes within each partition are still able to communicate with each other but nodes in other partitions are unreachable. This paper proposes two different partition detection mechanisms, one using a centralized approach, the other one utilizing the advantages of a distributed mechanism. The simulations show that both approaches detect partitioning reliably, with both having unique advantages.

Debugging Low-Power and Lossy Wireless Networks: A Survey

“…Harte et al monitor the status of each sensor node to detect physical malfunctions [54]. Ritter et al detect and distinguish network partition from node failure [55]. Others detect malicious nodes and faulty sensor readings [56], [57].…”

Towards robustness and energy efficiency of cut detection in wireless sensor networks

“…In Ritter et al [7], the authors select a source node and make it broadcast an alive message throughout the network. Border nodes detect a cut if they miss the alive message from the source node more than a given number of times.…”

“…In [5][6][7][8], a subset of nodes are given the task of monitoring the connectivity of network. Of particular note is the work by Shrivastava et al [8] that proposes deterministic and randomized algorithms to detect a linear cut using a set of specially designated entities called sentinel nodes.…”

Virtualising Testbeds to Support Large-Scale Reconfigurable Experimental Facilities

“…In this application we wish to detect if the network is partitioned due to the failure of an intermediate node or due to a lossy radio link; in case of a partition we issue an alarm at the sink. To do this we implement the algorithm of [9], in which each sink essentially sends a beacon message every 5sec to the other sink by flooding it through the network. If a beacon message gets lost between the two sinks then an alarm message is generated.…”