an experimental study of routing and data aggregation in sensor networks

an experimental study of routing and data aggregation in sensor networks

ID:34455111

大小:148.79 KB

页数:9页

时间:2019-03-06

an experimental study of routing and data aggregation in sensor networks_第1页
an experimental study of routing and data aggregation in sensor networks_第2页
an experimental study of routing and data aggregation in sensor networks_第3页
an experimental study of routing and data aggregation in sensor networks_第4页
an experimental study of routing and data aggregation in sensor networks_第5页
资源描述:

《an experimental study of routing and data aggregation in sensor networks》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、AnExperimentalStudyofRoutingandDataAggregationinSensorNetworksOssamaYounisSoniaFahmyDepartmentofElectrical&ComputerEngineeringDepartmentofComputerScienceUniversityofArizona,Tucson,AZ85721,USAPurdueUniversity,WestLafayette,IN47907,USAE-mail:younis@ece.arizona.eduE-mail:fahmy@cs.purdue.edu

2、Abstract—Severalsensornetworkapplications,suchasenvi-drivenapplications,wherenodesperiodicallysendreportstoronmentalmonitoring,requiredataaggregationtoanobserver.afixedobserver.(WediscussthecaseofmobileobserversForthispurpose,adataaggregationtree,rootedattheobserver,in[5]).Inparticular,we

3、consideranapplicationthatusesaisconstructedinthenetwork.Nodeclusteringcanbeemployeddataaggregationoperator,suchasaverage(AVG),maximumtofurtherbalanceloadamongsensornodesandprolongthenetworklifetime.Inthispaper,wedesignandimplementa(MAX),sum(SUM),orcount(COUNT).Priortoconstructingsystem,i

4、HEED,inwhichnodeclusteringisintegratedwithmulti-theroutingtree,thenetworkisclusteredtoidentifyasetofhoproutingforTinyOS.Weconsidersimpledataaggregationclusterheadsthathavehigheraverageresidualenergythanoperators,suchasAVGorMAX.Weuseasimpleenergytheirpeers.Onlyclusterheadsproceedtodiscove

5、rthepathtoconsumptionmodeltokeeptrackofthebatteryconsumptionoftherootofthetree(theobserver)byconstructingabreadth-clusterheadsandregularnodes.Weperformexperimentsonasensornetworktestbedtoquantifytheadvantagesofintegratingfirstspanningtree.hierarchicalroutingwithdataaggregation.Ourresultsi

6、ndicateConstructingaspanningtreefordataforwardingwaspro-thatthenetworklifetimeisprolongedbyafactorof2to4,andposedformulti-hoproutinginTinyOS[6],[7].Weintegratesuccessfultransmissionsarealmostdoubled.ClusteringplaysaHEEDclustering[2]withdataaggregationintheMulti-dominantroleindelayingthefi

7、rstnodedeath,whileaggregationHopRouter[8]toimplementintegratedHEED(iHEED)inplaysadominantroleindelayingthelastnodedeath.TinyOS.WeselecttheHEEDclusteringprotocolbecauseI.INTRODUCTIONitterminatesinaconstantnumberofiterations,andelectsSeveralsensornetworkapplicationsrequirea

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。