Covering Set-Based Inner-Cluster Data Aggregation Scheme for Wireless Sensor Networks

2013 ◽  
Vol 321-324 ◽  
pp. 592-595
Author(s):  
Jiang Hong Guo ◽  
Yu Dong Luo

For reducing the communication overhead of data aggregation, authors proposed an covering set-based inner-cluster data aggregation scheme for wireless sensor networks. The network is clustered upon deployment; nodes achieve the inner-cluster neighbors’ identifiers by information exchanging and transmit the list of inner-cluster neighbors to the cluster head to help the cluster head deducing the inner-cluster covering set. Each node selects a neighbor form inner-cluster covering set as reference point and keeps silent if it has the same reading with reference point. Simulation shows that the proposed scheme lowers the communication overhead of data aggregation effectively.

2013 ◽  
Vol 347-350 ◽  
pp. 3945-3949
Author(s):  
Jiang Hong Guo ◽  
Yu Dong Luo ◽  
De Li Chen

For reducing the communication overhead of data aggregation, authors proposed an inner-cluster data aggre-gation scheme for wireless sensor networks. Agent nodes are selected with assist of location information and only the nodes have different readings with agent nodes transmit their data to cluster head, thus reduce the inner-cluster transmissions. Analysis and experiments show that our scheme reduces inner-cluster transmissions effectively and lowers the communication overhead.


2013 ◽  
Vol 341-342 ◽  
pp. 1187-1190
Author(s):  
Jiang Hong Guo ◽  
Yu Dong Luo

For reducing the communication overhead of data aggregation, authors proposed a probabilistic transmitting-based data aggregation scheme for wireless sensor network. Due to limited number of nodes in the cluster and aggregation error is unavoidable; nodes adopt the probabilistic transmitting to lower the communication overhead with tolerable error. In order to prevent the influence of big noise, Dixon criterion was adopted to eliminate the gross error in the small sample. Experiment shows the proposed scheme reduces the inner-cluster transmissions and lowers the communication overhead effectively with tolerable error. The aggregation error of probabilistic transmitting and all nodes transmitting are at the same level and both are acceptable for wireless sensor networks.


2015 ◽  
Vol 742 ◽  
pp. 7-10 ◽  
Author(s):  
Li Jun Yang ◽  
Chao Ding ◽  
Meng Wu

Data aggregation is an important techniques to save energy consumption in wireless sensor networks. However, the compromised aggregators may forge fake values as the aggregated results of their child nodes. In this paper, we proposed an efficient secure data aggregation scheme to overcome the problem. Integrated with the privacy homomorphism and the aggregate message authentication code techniques, our proposal can provide both end-to-end privacy and data integrity in data aggregation for sensor networks. The performance analysis shows that compared with other existing secure data aggregation schemes, the proposed scheme has remarkable advantages in terms of computation and communication overhead.


2016 ◽  
Vol 12 (11) ◽  
pp. 28
Author(s):  
Li Luo

In order to solve the problem of low efficiency and high energy consumption in data processing, In this paper, for reducing the communication overhead of data aggregation, we put forward a cluster division based data aggregation scheme for wireless sensor networks in which the cluster is divided into three subareas and some report nodes are assigned to each subarea. Simulation results show that, compared with LEACH algorithm, BP neural network and PSO-BP algorithm, more than 50% lower compression error is decreased and the simplicity of the improved algorithm makes it suitable for massive and the long term environmental monitoring network.


2012 ◽  
Vol 490-495 ◽  
pp. 383-386
Author(s):  
Jiang Hong Guo ◽  
Jian Qiang Wu ◽  
Xi Hong Wu

Secure end-to-end data transmission is an important method to protect the data privacy in wireless sensor networks. Authors proposed a data aggregation scheme with end-to-end security for wireless sensor networks. The plaintext of sensor readings only appeared in source node and remote server, the aggregators completed the data integrity verification, sender identity authentication and data aggregation without the plaintext. Analysis and simulation show that our scheme has higher security in terms of resilient against malicious attacks and reduces the communication overhead effectively


Sign in / Sign up

Export Citation Format

Share Document