資源描述：
《無(wú)線傳感器網(wǎng)絡(luò)論文：無(wú)線傳感器網(wǎng)絡(luò) 非均勻分簇》由會(huì)員上傳分享，免費(fèi)在線閱讀，更多相關(guān)內(nèi)容在學(xué)術(shù)論文-天天文庫(kù)。
1、無(wú)線傳感器網(wǎng)絡(luò)論文：無(wú)線傳感器網(wǎng)絡(luò)非均勻分簇【中文摘要】無(wú)線傳感器網(wǎng)絡(luò)中,為有效的延長(zhǎng)網(wǎng)絡(luò)生存周期,均衡網(wǎng)絡(luò)能量消耗,需要研究合理高效的路由協(xié)議算法。同平面路由相比,分簇路由算法被認(rèn)為具有良好的發(fā)展前景,但當(dāng)前多數(shù)分簇路由算法存在簇頭節(jié)點(diǎn)負(fù)擔(dān)過(guò)重,節(jié)點(diǎn)能耗不均,以及容易形成“熱區(qū)”等情況,部分算法引入雙簇頭的思想雖有效緩解了主簇頭的負(fù)擔(dān),但對(duì)副簇頭的選擇機(jī)制以及減少因采用競(jìng)爭(zhēng)機(jī)制選擇簇頭所產(chǎn)生的能耗問(wèn)題還缺少有效方法,因而在一定程度上也影響了無(wú)線傳感器網(wǎng)絡(luò)的性能。本文針對(duì)此種情況,首先引入雙簇頭機(jī)制,通過(guò)副簇頭承擔(dān)數(shù)據(jù)轉(zhuǎn)發(fā)任務(wù)來(lái)減
2、輕主簇頭的負(fù)擔(dān),同時(shí)為減少分簇次數(shù),延長(zhǎng)簇存活周期,減少因簇頭選擇競(jìng)爭(zhēng)造成的能耗,提出一種基于ARMA流量預(yù)測(cè)的WSN非均勻分簇雙簇頭選擇算法(AUDC算法),算法利用主簇頭結(jié)合ARMA模型對(duì)簇內(nèi)副簇頭在下一時(shí)刻需要轉(zhuǎn)發(fā)的數(shù)據(jù)量進(jìn)行預(yù)測(cè),進(jìn)而根據(jù)剩余能量選擇能承擔(dān)此次轉(zhuǎn)發(fā)任務(wù)的副簇頭,達(dá)到及時(shí)更換副簇頭的。為有效解決網(wǎng)絡(luò)“熱區(qū)”問(wèn)題,本文進(jìn)一步提出了一種基于不等帶寬圓環(huán)分區(qū)的WSN非均勻分簇算法(UCCB算法),該算法主要通過(guò)利用不等帶寬圓環(huán)結(jié)合扇形區(qū)域進(jìn)行網(wǎng)絡(luò)分區(qū),利用限制條件確定帶寬增長(zhǎng)因子和不同分區(qū)的簇?cái)?shù)目以及其他參數(shù)的最優(yōu)
3、值,再進(jìn)行非均勻分簇,用以達(dá)到均衡網(wǎng)絡(luò)節(jié)點(diǎn)能耗以及總能耗最小的。在MATLAB平臺(tái)上,本文對(duì)提出的兩種算法進(jìn)行了仿真實(shí)驗(yàn),通過(guò)與LEACH算法、HEED算法等進(jìn)行仿真比較,說(shuō)明了新算法能有效延長(zhǎng)網(wǎng)絡(luò)的生存周期,實(shí)現(xiàn)網(wǎng)絡(luò)的負(fù)載均衡。【英文摘要】Inwirelesssensornetworks,weneedtoresearcharationalandefficientroutingprotocolalgorithm,withaviewtoprolongthenetworklifetimeandbalancenetworkenergyc
4、onsumption.Atpresent,comparingwiththeplanerouting,clusteringroutingalgorithmisconsideredtohavesplendiddevelopmentprospect,however,therearecircsofexcessiveburdenonclusterheadnode,theinequalityenergyconsumptionofthenode,aswellasformingthe“hotspot”easyinmostclusteringrou
5、tingalgorithm.SeveralalgorithmscanalleviatetheburdenofthemainclusterheadeffectivelybyintroducingtheideaofDoubleClusterHeads,theyhavenomethodaimingattheselectionmechanismofassistingclusterheadandtheissueofreducingtheenergyconsumptionwhichgrowsoutofchoosingclusterheadby
6、competitionmechanism,thustheissuesaffectedthefunctionsofwirelesssensornetworkstosomeextent.Inthisthesis,weintroducedoubleclusterheadsmechanismwhichcansharetheburdenofmainclusterheadbyusingassistingclusterheadtotakeonthedataswitching,besides,forthepurposeofreducingthef
7、requencyofclustering,prolongingthelifecycleofclusterandreducingtheenergyconsumptionwhichgrowsoutofclusterheadselectioncompetition,weintroducetheAlgorithmofChoosingtheUnevenDistributedDoubleClusterHeadsinWSNBasedonARMATrafficPrediction(AUDC).Thealgorithmcanpredictthene
8、xtmomenttrafficofassistingclusterheadbyusingthecombinationofthemainclusterheadandARMATrafficPrediction,andthenwechoosetheass
