An energyefficient data gathering algorithm to prolong lifetime of wireless sensor networks文档格式.docx
- 文档编号:22100363
- 上传时间:2023-02-02
- 格式:DOCX
- 页数:30
- 大小:709.85KB
An energyefficient data gathering algorithm to prolong lifetime of wireless sensor networks文档格式.docx
《An energyefficient data gathering algorithm to prolong lifetime of wireless sensor networks文档格式.docx》由会员分享,可在线阅读,更多相关《An energyefficient data gathering algorithm to prolong lifetime of wireless sensor networks文档格式.docx(30页珍藏版)》请在冰豆网上搜索。
bCollegeofInformationEngineering,ZhejiangUniversityofTechnology,Hangzhou,Zhejiang310023,China
ARTICLEINF
Articlehistory:
Received18February2009
Receivedinrevisedform13September2009
Accepted9November2009
Availableonline15November2009
Keywords:
Wirelesssensornetwork
Routingalgorithms
Networklifetime
Energysaving
ABSTRACT
Nodesinmostwirelesssensornetworks(WSNs)arepoweredbybatterieswithlimitedenergy.ProlongingnetworklifetimeandsavingenergyaretwocriticalissuesforWSNs.Someenergy-savingroutingalgorithmslikeminimumspanningtreebasedonescanreducetotalenergyconsumptionofaWSN,buttheyplacetooheavyburdenofforwardingdatapacketsonseveralkeynodessothatthesenodesquicklydrainoutavailablebatteryenergy,makingnetworklifetimeshortened.Inthispaper,aroutingalgorithmtermedEnergy-efficientRoutingAlgorithmtoProlongLifetime(ERAPL)isproposed,whichisabletodramaticallyprolongnetworklifetimewhileefficientlyexpendsenergy.IntheERAPL,adatagatheringsequence(DGS),usedtoavoidmutualtransmissionandlooptransmissionamongnodes,isconstructed,andeachnodeproportionallytransmitstraffictothelinksconfinedintheDGS.Inaddition,amathematicalprogrammingmodel,inwhichminimalremainingenergyofnodesandtotalenergyconsumptionareincluded,ispresentedtooptimizenetworklifetime.Moreover,geneticalgorithmsareusedtofindtheoptimalsolutionoftheproposedprogrammingproblem.Further,simulationexperimentsareconductedtocomparetheERAPLwithsomewell-knownroutingalgorithmsandsimulationresultsshowtheERAPLoutperformsthemintermsofnetworklifetime.
_2009ElsevierB.V.Allrightsreserved.
1.Introduction
Wirelesssensornetworks(WSNs),inwhichnodesincorporatewirelessinterfacestocommunicateeachother,arebeingwidelyusedinvariousareassuchasreconnaissance,disasterrelief,intelligenttransportation,surveillance,environmentalmonitoring,healthcare,targettracking,andmore.WSNsareextremelyusefultocollectinformationinharshorhostileenvironment.
InaWSN,datacollectedbysensornodesareneededtobedeliveredtosinks(basestations).Probably,datakeptinsomenodescouldnotbedirectlytransmittedtothesinkssincethesinksarefarawayfromtheradiotransceiversofthewirelessinterfacesofthesenodes.Therefore,routingprotocolsareneeded,inwhichdatapacketsaretransmittedviamulti-hopmanner,i.e.,theyaretransmittednodebynode,therebyreachingthesinks.
Basically,nodesinaWSNarepoweredbybatterieswithlimitedenergy.Asaresult,networkpartitioningmayoccurwhenoneormorenodesexpendavailableenergyofbatteries,whichcausestraditionalroutingprotocolsinvalid.Therefore,itiscriticalforaWSNtoruneffectivelytodesignanenergy-efficientroutingalgorithminwhichbatteryenergyisexpendedefficientlywhiletheWSNhasalongerlifetime.Hitherto,routingprotocolsthataimatpower-savingandprolongingnetworklifetimeareintensivelystudiedinresearchcommunity.Anoptimalenergyefficientroutingstrategyisproposedin[1],inwhichnonlinearmin–maxprogrammingproblemwithconvexproductformisapplied.Geographicalforwardingschemesareproposedtoimprovenetworklifetimebyconsideringtheresidualenergyofneighboringnodesindecidingnext-hopwhilepreservingthelocalized,scalableandnearlystatelesspropertyofgeographicalrouting[2].Anonlineheuristicmodel,inwhicheachmessageisroutedwithoutknowledgeoffuturerouterequests,isproposedtomaximizenetworklifetime[3].Energysavingscheduleprotocolisinvestigatedfortargettrackingsensornetworksinordertoprovideadynamicsleepscheduleforradiossuchthatmaximumenergyissavedwithoutaffectingactivitiesofsensors[4].Acluster-basedroutingprotocoltermedLEACH(LowEnergyAdaptiveClusterHierarchy)[5]evenlydistributesenergyloadamongallthesensornodes.Achain-basedprotocolnamedPEGASIS(Power-EfficientGatheringinSensorInformationSystems)isproposedin[6],inwhichachainamongthesensornodesisformedsothateachnodereceivesfromandtransmitstoacloseneighbor.Basedonconcentricclustering,anenhancedPEGASISisproposedin[7].Networkdeploymentstrategiestomaximizenetworklifetimeareinvestigatedin[8].Infact,itishardtoenumeratealltheprotocolsdealingwithpower-savingandprolongingnetworklifetime.
ItappearsthatnetworklifetimeshouldbeprolongediftotalenergyconsumptionofaWSNisreduced.But,inreality,itmaybenotthecase.Forexample,someroutingalgorithmslikeminimalspanningtree(MST)basedones,suchasPEDAP(PowerEfficientDatagatheringandAggregationProtocol)andPEDAP-PA[9],doreduceenergyconsumptionofaWSN,butnetworklifetimeisshortenedaswell.Thereasonisthat,inthesealgorithms,severalkeynodestaketooheavyresponsibilitytoforwarddatapackets,whichmakestheirbatteriesdrainedoutquickly.Agoodroutingstrategyshouldresolveenergyimbalancewhilemaintaininghighenergyefficiency.Motivatedbythis,weinvestigateroutingalgorithmstorealizetheobjectivethatnetworklifetimeisprolongedwhileenergyisefficientlyconsumed.Themaincontributionsofthispaperareasfollows:
(1)Energy-efficientroutingalgorithmtoprolonglifetime(ERAPL)ofWSNisproposed,inwhichadatagatheringsequence(DGS),usedtoeliminatemutualtransmissionandlooptransmissionamongnodes,isconstructedwherebyeachnodeproportionallyforwardstraffictoitsneighboringnode;
(2)amathematicalprogrammingmodel,whoseobjectivefunctionincorporatesminimalremainingenergyandtotalenergyconsumption,isdesigned;
and(3)geneticalgorithms(GAs)[10]withcompressedchromosomecodingschemeareusedtofindtheoptimalsolutionoftheproposedprogrammingproblem.
Theremainderofthepaperisorganizedasfollows:
energyconsumptionmodelisgiveninSection2,theERAPLwithprogrammingmodelandimplementationispresentedinSection3,theimplementationoftheERAPLisgiveninSection4,numericexperimentalresultswithanalysesareshowninSection5,andconclusionisgiveninSection6.
2.Preliminary
AtypicalnodeinaWSNismainlycomprisedoffourcomponents:
asensor,aprocessingunit,aradiotransceiver,andapowersupplyunit[11].Energyconsumptionofanodeismainlycausedbyradiocommunications[12].Therefore,weonlyconsidertheenergyconsumptionrelatedtotheradiocomponentsbutignoretheenergyconsumptionoftheprocessingunitandthesensor.Further,weapplythesamemodelproposedin[13],i.e.,theenergycostsoftransmittingandreceivingak-bitdatapacketbetweentwonodesbeingdmetersapartcanbe,respectively,expressedas[13]:
ETX(k,d)=k(Eelec+εampdγ)
(1)
and
ERX(k)=kEelec
(2)
Whereγ∈[2,4]isthepathlossexponent;
Eelecdenotestheenergyconsumptionduetodigitalcoding,modulation,filtering,andspreadingofthesignal,etc.;
andεampistheenergyconsumedbythetransmitterpoweramplifier.
Letdu,vbethedistancebetweennodesuandv.Then,from
(1)and
(2),wehavethetotalenergyexpenditurefordeliveringakbitdatapacketfromnodeutonodevasfollows:
Cu,v(k,du,v)=ETX(k,du,v)+ERX(k)=k(2Eelec+εamp[du,v]γ)(3)
3.Routingalgorithms
Considerasetofsensorsdeployedinafield.We,followingcommonresearchcommunity,assumethefollowingpropertiesoftheWSN:
(1)Thereisonlyonesinkandnregularsensornodes(simplyreferredasnodesbelow)intheWSN,wherenisapositiveinteger.
(2)ThesinkisstationaryandhasknowledgeofthetopologyoftheWSN,anditperiodicallycollectsdatageneratedbythenodes.
(3)Thesinkhassufficientpowersupplywhilenodesarepoweredbybatterieswithlimitedenergy.
(4)Nodesdonotmoveaftertheyaredeployed,andeachnodehasatleastoneroute,consistingofwirelesslinks,tothesink(i.e.,thenetworkisnotpartitioned).
(5)Allnodeshavesimilarcharacteristics(e.g.,rangeofradiocoverage,energyofbatteries,etc.).
Twonodesaretermedneighborsiftheyareineachother’sradiocoverage.Letlink(i,j)standforthelinkconnectingnodesiandj,andN(i)bethesetoftheneighborsofnodei.WeusegraphG(V,E)torepresenttheWSN,inwhichVisthesetofallthenodesintheWSNandEisthesetoflinkseachconnectingtwoneighboringnodes.
Weuseaitorepresentthedatageneratedbynodei,T(i,j)thetraffictransmittedfromnodeitonodej,andT(i)thetotaltraffictransmittedbynodei.Here,ai;
Tei;
jT,andT(i)areallmeasuredinbits.Additionally,wedefineoutgoingtrafficproportion(OTP)fromnodeitonodejasxi,j≡T(i,j)/T(i),whichrepresentstheproportionofthetrafficgoingthroughlink(i,j)tothetotaloutgoingtrafficatnodei.Hence,theOTPsforallnodesintheWSNcanbelistedinthefollowingmatrix,referredtoasOTPmatrixbelow.
Clearly,theOTPmatrixhasthefollowingproperties:
(1)xi,j=0,i∈V;
(2)xi,j=0forj∉N(i),i∈V;
(3)0≤xi,j1,i,j∈V;
(4)∑nj=1xi,j=1,i∈V;
LetECtotbethetotalenergyconsumptionofallthenodesintheWSN,W(i)thetotalenergyexpendedbynodeifortransmittingandreceivingtraffic,andRE(i)theremainingenergyofnodei.Clearly,ECtot=Σi∈VW(i).AssumetheinitialenergyofeachnodeisequaltoE0.Accordingto
(1)and
(2),undertheOTPmatrixX,theenergyconsu
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- An energyefficient data gathering algorithm to prolong lifetime of wireless sensor networks
链接地址:https://www.bdocx.com/doc/22100363.html