Research Area:  Wireless Sensor Networks
Low-cost sensor nodes being prone to fault, disambiguation between the fault and the event is challenging in event-driven routing. In this paper, we present a True Event-driven and fault-tolerant routing algorithm that sends report to the base station through multi-hops when any node confirms environmental event such as wildfire, earthquake, high chemical density etc. Here, true events and faulty measurements are disambiguated using the majority voting algorithm. Faulty measurements are ignored, but in case of true-event, an alert message is routed to the Base Station through multi hops using our routing algorithm. In our routing algorithm a multi objective weighted sum method and hop-count is utilized to select the most suitable node from neighbors to relay event report towards the Base Station bypassing hole/void area in the network. We simulated our proposed method using network simulator NS-2.35 and compared with the existing routing algorithm using performance metrics namely packet error rate, latency, and network lifetime. We also evaluated our event detection algorithm using performance metrics namely, false alarm rate, and event node detection accuracy. Simulation results showed that our proposed method outperforms the baseline algorithm.
Author(s) Name:  Priyajit Biswas,Tuhina Samanta
Journal name:  Wireless Personal Communications
Publisher name:  Springer
Volume Information:  volume 112, pages 439–461 (2020)
Paper Link:   https://link.springer.com/article/10.1007%2Fs11277-020-07037-3