Fault tolerant broadcasting analysis in wireless monitoring networks

Wireless monitoring networks can be used for security applications such as the monitoring of narrow passages and operational fields. These networks can be designed based on sensor networks. In sensor networks, each node can hear a message and broadcast the message to its neighbor nodes. Nevertheless, nodes may fail, so that faulty nodes cannot hear or cannot transmit any message, where the locations of the faulty nodes are unknown and their failures are permanent. In this paper, the nodes are situated on a line or a square grid-based topology in a plane for security/monitoring applications. For each topology, 2 nonadaptive and adaptive broadcasting scheduling algorithms are proposed and analyzed. In addition, the scheduling algorithms take the energy consumption of the sensor nodes into account in order to prolong the network’s lifetime. The analysis results show that adaptive algorithms need less time than nonadaptive algorithms to inform the whole network domain.