Covering Set-Based Inner-Cluster Data Aggregation Scheme for Wireless Sensor Networks
2013 ◽
Vol 321-324
◽
pp. 592-595
Keyword(s):
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
Keyword(s):
2013 ◽
Vol 341-342
◽
pp. 1187-1190
2015 ◽
Vol 742
◽
pp. 7-10
◽
2016 ◽
Vol 12
(11)
◽
pp. 28
2012 ◽
Vol 490-495
◽
pp. 383-386
2021 ◽
Vol 6
(2)
◽
pp. 137
2015 ◽
Vol 8
(4)
◽
pp. 1935-1955
◽
Keyword(s):
2006 ◽
Vol 16
(5)
◽
pp. 531-536
Keyword(s):