Data Accumulation using Sampled Dispersive Routes in Wireless Sensor Networks |
||||
|
|
||||
|
||||
BibTeX: |
||||
|
@article{IJIRSTV1I9041, |
||||
Abstract: |
||||
|
In large amount of sensor network, especially in case of data aggregation it should reduce the amount of communication and energy consumption. Recently, the research community has proposed 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. But these aggregation frameworks aggregation frameworks does not solve the problems which are appearing at base station side. These problems may occur due to the irrespective of the network size, the per node communication over-head. In this paper, we make the synopsis diffusion approach secure against attacks in which compromised nodes contribute false sub aggregate values. In particular, we present a novel lightweight verification algorithm by which the base station can determine if the computed aggregate (predicate Count or Sum) includes any false contribution. In this paper, we study the compromised-node and denial-of-service is the two key attacks in wireless sensor networks. We argue that multipath routing approaches are highly vulnerable to such attacks. So, for these attacks we develop the mechanisms that generate randomized multipath routes. Under our designs, the routes taken by the shares of different packets change over time. So, we analytically investigate the security and energy performance of proposed schemes. |
||||
Keywords: |
||||
|
Sensor Networks, Aggregation, Security, Base Station, Randomized Multipath Routing |
||||



