Energy Aware Chain based data aggregation scheme for wireless sensor network

Author(s):  
Sukhwinder Singh Sran ◽  
Lakhwinder Kaur ◽  
Gurjeet Kaur ◽  
Sukhpreet Kaur Sidhu
2018 ◽  
Vol 14 (8) ◽  
pp. 155014771879584 ◽  
Author(s):  
Danyang Qin ◽  
Yan Zhang ◽  
Jingya Ma ◽  
Ping Ji ◽  
Pan Feng

Due to the advantages of large-scale, data-centric and wide application, wireless sensor networks have been widely used in nowadays society. From the physical layer to the application layer, the multiply increasing information makes the data aggregation technology particularly important for wireless sensor network. Data aggregation technology can extract useful information from the network and reduce the network load, but will increase the network delay. The non-exchangeable feature of the battery of sensor nodes makes the researches on the battery power saving and lifetime extension be carried out extensively. Aiming at the delay problem caused by sleeping mechanism used for energy saving, a Distributed Collision-Free Data Aggregation Scheme is proposed in this article to make the network aggregate data without conflicts during the working states periodically changing so as to save the limited energy and reduce the network delay at the same time. Simulation results verify the better aggregating performance of Distributed Collision-Free Data Aggregation Scheme than other traditional data aggregation mechanisms.


2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
D. Vinodha ◽  
E. A. Mary Anita

In a wireless sensor network, data privacy with a minimum network bandwidth usage is addressed using homomorphic-based data aggregation schemes. Most of the schemes which ensure the end-to-end privacy provide collective integrity verification of aggregated data at the receiver end. The presence of corrupted values affects the integrity of the aggregated data and results in the rejection of the whole data by the base station (BS) thereby leading to the wastage of bandwidth and other resources of energy constraint wireless sensor network. In this paper, we propose a secured data aggregation scheme by slicing the data generated by each sensor node deployed in layered topology and enabling en route aggregation. Novel encoding of data and hash slices based on child order is proposed to enable concatenation-based additive aggregation and smooth extraction of slices from the aggregate by the BS. Elliptic curve-based homomorphic encryption is adopted to ensure end-to-end confidentiality. To the best of our knowledge, the proposed scheme is the first which facilitates the BS to perform node-wise integrity verification, filter out only the corrupted portion, and implement dynamic query over the received data. Communication- and computation-based performance analysis shows the efficiency of the proposed scheme for varied network sizes. The scheme can resist eavesdropping attack, node compromising attack, replay attack, malleability attack, selective dropping attack, and collusion attack.


2013 ◽  
Vol 347-350 ◽  
pp. 965-969
Author(s):  
Na Wang ◽  
Yue Ping Wu

One of the critical tasks in designing a wireless sensor network is to monitor, detect, and report various useful occurrences of events in the network domain which are determined by the result of data aggregation. Fault tolerance is critical to the efficiency of data aggregation scheme. One important reason is that sensor nodes are neither reliable nor stabile. In this paper, we present an improved k-means data aggregation algorithm considering the proposal of isolated point. Each cluster includes three types of sets: aggregation data, fault data set and abnormal data set. Aggregation data comes from normal sensors in this cluster through the improved K-means aggregation algorithm and abnormal nodes can be detected according to the aggregation result.


Sign in / Sign up

Export Citation Format

Share Document