building representative-based data aggregation tree in wireless sensor networks在无线传感器网络构建业务代表数据聚合树.pdfVIP

Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2010, Article ID 732892, 11 pages doi:10.1155/2010/732892 Research Article Building Representative-Based Data Aggregation Tree in Wireless Sensor Networks Yanfei Zheng,1 Kefei Chen,2 and Weidong Qiu1 1 School of Information Security Engineering, Shanghai Jiaotong University, Shanghai 200240, China 2 Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200240, China Correspondence should be addressed to Weidong Qiu, wdqiu@ Received 2 December 2009; Accepted 25 January 2010 Academic Editor: Ming Li Copyright q 2010 Yanfei Zheng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 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