Adaptive multipath selective secure data forwarding in sensor networks

The wireless sensor network data aggregation significantly reduces the amount of communication and energy consumption. In the existing system a robust aggregation framework called synopsis diffusion which combines multipath routing schemes with duplicate-insensitive algorithms to accurately compute aggregates (e.g., predicate Count, Sum) in spite of message losses resulting from node and transmission failures. Lightweight verification algorithm is used in the existing system by which the base station can determine if the computed aggregate (predicate Count or Sum) includes any false contribution. However, this aggregation framework does not address the problem of false sub-aggregate values contributed by compromised nodes resulting in large errors in the aggregate computed at the base station, which is the root node in the aggregation hierarchy. A new novel technique called Selective forwarding schemes will depend on parameters such as the available battery at the node, the packet delivery ratio cost of retransmitting a message, or the importance of messages. Here we plan to design an efficient attack-resilient computation algorithm. This algorithm would guarantee the successful computation of the aggregate even in the presence of an attack. More sophisticated schemes will achieve better importance performance, but will also require information from other sensors. Suboptimal schemes that rely on local estimation algorithms and entail reduced computational cost are also designed.