ACM Home Page
Please provide us with feedback. Feedback
An efficient integrity-preserving scheme for hierarchical sensor aggregation
Full text PdfPdf (260 KB)
Source
Conference On Wireless Network Security archive
Proceedings of the first ACM conference on Wireless network security table of contents
Alexandria, VA, USA
SESSION: Sensor network security table of contents
Pages 68-76  
Year of Publication: 2008
ISBN:978-1-59593-814-5
Authors
Keith B. Frikken  Miami University, Oxford, OH
Joseph A. Dougherty, IV  Miami University, Oxford, OH
Sponsors
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 51,   Downloads (12 Months): 138,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1352533.1352546
What is a DOI?

ABSTRACT

Sensor networks have proven to be useful in many application domains. Having the sensor nodes aggregate their results inside the network before sending the results to a base station has been shown to increase the lifetime of the network. However, sensor networks that are deployed in hostile environments need aggregation protocols that protect the integrity of the result. Recently, Chan et al. [3] introduced such a scheme that requires O(Δlog2n) communication per node, where Δ$ is the degree of the aggregation tree for the network and n is the number of nodes in the network. In this paper, we introduce modifications of this approach that reduce the maximum communication per node to O(Δlog2n).


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
H. Çam, S. Özdemir, P. Nair, D. Muthuavinashiappan, and H. Ozgur Sanli. Energy-efficient secure pattern based data aggregation for wireless sensor networks. Computer Communications, 29(4):446--455, 2006.
 
2
3
 
4
 
5
W. Du, J. Deng, Y. S. Han, and P. K. Varshney. A witness-based approach for data fusion assurance in wireless sensor networks. In Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE, volume 3, pages 1435--1439, Dec. 2003.
 
6
J. Girao, D. Westhoff, and M. Schneider. CDA: Concealed Data Aggregation in Wireless Sensor Networks. In WiSe '04: Proceedings of the 2004 ACM workshop on Wireless security, New York, NY, USA, 2004. ACM Press.
 
7
 
8
W. Heinzelman, A. Chandrakasan, and H. Balakrishnan. An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications, 1(4), 2002.
 
9
 
10
P. Jadia and A. Mathuria. Efficient secure aggregation in sensor networks. In Proceedings of the 11th International Conference on High Performance Computing. Springer, 2004.
 
11
P. M. M. Garofalakis, J. Hellerstein. Proof sketches: Verifiable in-network aggregation. In Proceedings of the IEEE 23rd International Conference on Data Engineering, 2007.
12
 
13
A. Mahimkar and T. S. Rappaport. SecureDAV: a secure data aggregation and verification protocol for sensor networks. In Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE, volume 4, pages 2175--2179, Nov./Dec. 2004.
14
 
15
R. C. Merkle. Protocols for public key cryptosystems. In Symposium on Security and Privacy, pages 122--134, 1980.
16
 
17
18
 
19
 
20
M. Sirivianos, D. Westhoff, F. Armknecht, and J. Girao. Non-manipulable aggregator node election protocols for wireless sensor networks. In 5th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, Limassol, Cyprus, Greece, April 2007. WiOpt 2007.
21
22

Collaborative Colleagues:
Keith B. Frikken: colleagues
Joseph A. Dougherty, IV: colleagues