Fault Tolerance using Quadratic-Minimum Spanning Tree (Q-MST) with Secure Data Aggregation in Wireless Sensor Networks

摘要

In wireless Sensor networks (WSN), fault tolerance along with secure data aggregation is a challenging issue. In the literature, Minimum Spanning Tree (MST) is most widely used tree mechanism for data aggregation in WSN. Sensor nodes are typically densely deployed in disaster environments therefore secure data transmission with fault tolerance is a crucial task. WSNs are subject to node failure due to many reasons like battery power, physical damage to the sensors, etc. The proposed work mainly concentrate on replacement of alternate edge in place of the weak edge using Q-MST, which is based on artificial Bee Colony (ABC). The proposed work shows the advantage of the alternate path instead of regenerating the MST when a link has failed due to lack of resources. In the proposed work secure transmission of data along with the integration of two-hop mechanism which is Secure and Efficient protocol for Data Aggregation in wireless sensor Networks (SEDAN) is used. We have compared the Performance of Q-MST to MST in terms of energy consumption and other parameters which are essential to optimize in WSN for better performance.