Building Representative-Based Data Aggregation Tree in Wireless Sensor Networks英文文献资料.docVIP

HindawiPublishingCorporation MathematicalProblemsinEngineering Volume2010,ArticleID732892,11pages doi:10.1155/2010/732892 ResearchArticle BuildingRepresentative-Based DataAggregation TreeinWirelessSensorNetworks YanfeiZheng, KefeiChen, andWeidongQiu 1 2 1 1SchoolofInformation SecurityEngineering, ShanghaiJiaotongUniversity, Shanghai200240,China 2Department ofComputerScienceandEngineering, ShanghaiJiaotongUniversity, Shanghai200240,China Correspondence shouldbeaddressedtoWeidongQiu,wdqiu@ Received2December 2009;Accepted 25January2010 Academic Editor:MingLi Copyright q2010YanfeiZhengetal.Thisisanopenaccessarticledistributed undertheCreative Commons Attribution License, which permits unrestricted use,distribution, andreproduction in anymedium,providedtheoriginalworkisproperlycited. 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. E?cient and secure aggregation scheme is critical in WSN applications due tothe stringent resource constraints. Inthis paper,we propose amethod 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 inthecells. 1.Introduction Wireless sensor networks WSNs have been used in many promising applications such ashabitatmonitoring,battle?eldsurveillanceandtargettracking.Alargernumberoftiny sensorscollectmeasurementdataandsendthemtoprocessingcenter,whichisusuallycalled base station or sink node. Howeve