Detecting and Minimizing Node Failure Context in Wireless Sensor Network

Node failure detection in mobile wireless networks is very challenging due to node movements, the network may not be always connected, and the resources are limited. In this project, propose solutions to address the challenge specific to sensor networks, to design a fault tolerant, energy efficient monitoring system in a distributed manner. In proposed concept focus on fully distributed monitoring algorithms, objective to minimize the number of overall pollers while bounding the false alarm rate. To increase the energy efficiency and reduce the monitoring overhead, take the hop-by-hop aggregation opportunities in sensor network. When building the monitoring architecture, focus on the fundamental tradeoff between the number of monitoring nodes (i.e., poller) the false alarm rate. To achieve the optimal aggregation path problem and propose an opportunistic greedy algorithm, which achieves an approximation ratio.