資源描述:
《基于節(jié)能的無線傳感器網(wǎng)絡(luò)路由機(jī)制及算法研究》由會(huì)員上傳分享,免費(fèi)在線閱讀,更多相關(guān)內(nèi)容在學(xué)術(shù)論文-天天文庫。
1、Y1438378分類號(hào):——UDC:——工學(xué)博士學(xué)位論文密級(jí):——編號(hào):——基于節(jié)能的無線傳感器網(wǎng)絡(luò)路由機(jī)制及算法研究博士研究生:指導(dǎo)教師:學(xué)位級(jí)別:學(xué)科、專業(yè):所在單位:論文提交日期:論文答辯日期:學(xué)位授予單位:孫亭楊永田教授工學(xué)博士計(jì)算機(jī)應(yīng)用技術(shù)計(jì)算機(jī)科學(xué)與技術(shù)學(xué)院2007年7月2007年10月哈爾濱工程大學(xué)哈爾濱工程大學(xué)博士學(xué)何論文通信通過將簇內(nèi)節(jié)點(diǎn)組鏈,使得數(shù)據(jù)在從源節(jié)點(diǎn)向簇首的傳輸過程中就得到了充分的融合,降低了傳輸能耗。鏈?zhǔn)鬃鳛榇厥椎拇砉?jié)點(diǎn),分擔(dān)了簇首的工作,降低了簇首的能耗,而鏈?zhǔn)椎膭?dòng)態(tài)更換使得
2、節(jié)點(diǎn)間的能耗更加平均。針對(duì)無線傳感器網(wǎng)絡(luò)與實(shí)際應(yīng)用相結(jié)合的特點(diǎn),本文提出了一種能夠解決網(wǎng)內(nèi)可移動(dòng)節(jié)點(diǎn)運(yùn)動(dòng)過程中與靜態(tài)節(jié)點(diǎn)順利通信問題的移動(dòng)節(jié)點(diǎn)路由算法。把基于移動(dòng)代理的信息處理過程擴(kuò)展到簇內(nèi),將移動(dòng)節(jié)點(diǎn)在簇內(nèi)沿最優(yōu)路徑收集數(shù)據(jù)的問題等價(jià)成一個(gè)頂點(diǎn)加權(quán)的游客問題,通過采用一種新的近似算法,由簇首計(jì)算出移動(dòng)節(jié)點(diǎn)在簇內(nèi)運(yùn)動(dòng)的最佳路徑,使移動(dòng)節(jié)點(diǎn)能夠采集到最充分的靜態(tài)節(jié)點(diǎn)數(shù)據(jù)。新路由算法給出了各要素彼此之間的關(guān)系,保證了移動(dòng)代理節(jié)點(diǎn)對(duì)固定靜態(tài)源節(jié)點(diǎn)的信息的成功接收,與此同時(shí)結(jié)合動(dòng)態(tài)休眠機(jī)制,降低了節(jié)點(diǎn)能耗。全文的工作圍
3、繞分層的無線傳感器網(wǎng)絡(luò)路由展開,結(jié)合無線傳感器網(wǎng)絡(luò)的特點(diǎn)及其實(shí)際應(yīng)用環(huán)境的特點(diǎn),來解決目前領(lǐng)域內(nèi)存在的問題。關(guān)鍵詞:無線傳感器網(wǎng)絡(luò);路由機(jī)制;分層路由;簇:能量?jī)?yōu)化AbstractInrecentyears,somenewlowcostandmulti.functionmicro.sensornodesareproducedalong、ⅣitlltherapiddevelopmentofMicro—Electro-MechanicalSystems,lowenergy—consumptionelectro-de
4、vicesandwirelesscommunicationtechniques.Andinthefuture,wirelesssensornetworksthatconsistoftheseequipmentswillprobablybringhugeinfluencetoalmostalloftheindustrialfieldsandpeople’Sdailylife.However,aswirelesssensornodesarecharacterizedbylimitedenergyavailabili
5、ty,lowmemoryandreducedprocessingpower,energyefficiencyisakeyissueindesigningthenetwork.Routingmechanismcallaffectthenetwork’Sstatusfromthenetworklayer;simple,effectiveandlowenergyconsumptionroutebecomesanimportanttargetofahigllperformancenetwork.Takingtheene
6、rgyoptimizationasthegoal,thisdissertationmainlyresearchesonthecluster-basedhierarchicalroutingprotocols,includingthecommunicationbetweennodesinduster,dynamicfoundationoftheclusteraswellasapplication-basedroutingsolution.Inthedissertation,anewleast-hopbasedro
7、utingalgorithmisproposed.nlenetworkoverallusesthecluster-basedhierarchicairoutingmechanism.a(chǎn)ndincluster,least·hopbasedroutingmodelisusedfordatacollectionandtransmission.111iskindofstructurefullyutilizestheadvantageofleast.hoproutewhilethenodesiSmoreincluster
8、,whichCallmakethecommunicationbetweennodesalongwiththebestroute,andCanmaketheinformationpacketsinthenetwork1east.Solongasremembertheirownhopnumberandthosenodesthatareone-hopfarawayfromthem,theso