TY - GEN
T1 - An energy efficient and integrity-preserving aggregation protocol in wireless sensor networks
AU - Zhu, Liehuang
AU - Li, Meng
PY - 2011
Y1 - 2011
N2 - Wireless sensor networks(WSNs) is a data-centric network where the querier is mostly concerned about the statistical aggregates (MAX/MIN, SUM, AVERAGE). A few protocols have been proposed for provably secure tree-based in-network data aggregation in WSN. However, these protocols all suffer from high communication overhead or long network delay when sending off-path values to each sensor node to independently verify that its own data was added into the final aggregation result. Since the off-path dissemination phase is the dominating factor, it is crucial to optimize this phase and save energy to increase the lifetime of network. In this paper, we propose a novel integrity preserving protocol Energy Efficient and Integrity-Preserving Aggregation Protocol (E2IPAP) for tree-based sensor network-s, aiming to provide a new approach for result-checking and reduce communication overhead. Analysis shows that, E2IPAP significantly reduces the overhead in disseminating off-path values and overall communication. E2IPAP has O(Δ log n) node congestion and is suitable for similar secure data aggregation protocols.
AB - Wireless sensor networks(WSNs) is a data-centric network where the querier is mostly concerned about the statistical aggregates (MAX/MIN, SUM, AVERAGE). A few protocols have been proposed for provably secure tree-based in-network data aggregation in WSN. However, these protocols all suffer from high communication overhead or long network delay when sending off-path values to each sensor node to independently verify that its own data was added into the final aggregation result. Since the off-path dissemination phase is the dominating factor, it is crucial to optimize this phase and save energy to increase the lifetime of network. In this paper, we propose a novel integrity preserving protocol Energy Efficient and Integrity-Preserving Aggregation Protocol (E2IPAP) for tree-based sensor network-s, aiming to provide a new approach for result-checking and reduce communication overhead. Analysis shows that, E2IPAP significantly reduces the overhead in disseminating off-path values and overall communication. E2IPAP has O(Δ log n) node congestion and is suitable for similar secure data aggregation protocols.
UR - http://www.scopus.com/inward/record.url?scp=84862946889&partnerID=8YFLogxK
U2 - 10.1109/PCCC.2011.6108066
DO - 10.1109/PCCC.2011.6108066
M3 - Conference contribution
AN - SCOPUS:84862946889
SN - 9781467300100
T3 - Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference
BT - 30th IEEE International Performance Computing and Communications Conference, IPCCC 2011
T2 - 30th IEEE International Performance, Computing and Communications Conference, IPCCC 2011
Y2 - 17 November 2011 through 19 November 2011
ER -