Building Representative-Based Data Aggregation Tree in Wireless Sensor Networks. (17th March 2010)

• Record Type: Journal Article
• Authors: Zheng, Yanfei; Chen, Kefei; Qiu, Weidong
• Other Names: Li Ming Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2010(2010)
• Publication Date: 2010-03-17
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2010/732892
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : Data aggregation is an essential operation to reduce energy consumption in large-scale wireless sensor networks (WSNs). A compromised node may forge an aggregation result and mislead base station into trusting a false reading. Efficient and secure aggregation scheme is critical in WSN applications due to the stringent resource constraints. In this paper, we propose a method to build up the representative-based aggregation tree in the WSNs such that the sensing data are aggregated along the route from the leaf cell to the root of the tree. In the cinema of large-scale and high-density sensor nodes, representative-based aggregation tree can reduce the data transmission overhead greatly by directed aggregation and cell-by-cell communications. It also provides security services including the integrity, freshness, and authentication, via detection mechanism in the cells.