無線傳感器網(wǎng)絡(luò)論文：無線傳感器網(wǎng)絡(luò) 非均勻分簇

《無線傳感器網(wǎng)絡(luò)論文：無線傳感器網(wǎng)絡(luò) 非均勻分簇》由會員上傳分享，免費(fèi)在線閱讀，更多相關(guān)內(nèi)容在學(xué)術(shù)論文-天天文庫。

1、無線傳感器網(wǎng)絡(luò)論文：無線傳感器網(wǎng)絡(luò)非均勻分簇【中文摘要】無線傳感器網(wǎng)絡(luò)中,為有效的延長網(wǎng)絡(luò)生存周期,均衡網(wǎng)絡(luò)能量消耗,需要研究合理高效的路由協(xié)議算法。同平面路由相比,分簇路由算法被認(rèn)為具有良好的發(fā)展前景,但當(dāng)前多數(shù)分簇路由算法存在簇頭節(jié)點(diǎn)負(fù)擔(dān)過重,節(jié)點(diǎn)能耗不均,以及容易形成“熱區(qū)”等情況,部分算法引入雙簇頭的思想雖有效緩解了主簇頭的負(fù)擔(dān),但對副簇頭的選擇機(jī)制以及減少因采用競爭機(jī)制選擇簇頭所產(chǎn)生的能耗問題還缺少有效方法,因而在一定程度上也影響了無線傳感器網(wǎng)絡(luò)的性能。本文針對此種情況,首先引入雙簇頭機(jī)制,通過副簇頭承擔(dān)數(shù)據(jù)轉(zhuǎn)發(fā)任務(wù)來減輕主簇頭的負(fù)擔(dān)

2、,同時為減少分簇次數(shù),延長簇存活周期,減少因簇頭選擇競爭造成的能耗,提出一種基于ARMA流量預(yù)測的WSN非均勻分簇雙簇頭選擇算法(AUDC算法),算法利用主簇頭結(jié)合ARMA模型對簇內(nèi)副簇頭在下一時刻需要轉(zhuǎn)發(fā)的數(shù)據(jù)量進(jìn)行預(yù)測,進(jìn)而根據(jù)剩余能量選擇能承擔(dān)此次轉(zhuǎn)發(fā)任務(wù)的副簇頭,達(dá)到及時更換副簇頭的。為有效解決網(wǎng)絡(luò)“熱區(qū)”問題,本文進(jìn)一步提出了一種基于不等帶寬圓環(huán)分區(qū)的WSN非均勻分簇算法(UCCB算法),該算法主要通過利用不等帶寬圓環(huán)結(jié)合扇形區(qū)域進(jìn)行網(wǎng)絡(luò)分區(qū),利用限制條件確定帶寬增長因子和不同分區(qū)的簇數(shù)目以及其他參數(shù)的最優(yōu)值,再進(jìn)行非均勻分簇,用以達(dá)

3、到均衡網(wǎng)絡(luò)節(jié)點(diǎn)能耗以及總能耗最小的。在MATLAB平臺上,本文對提出的兩種算法進(jìn)行了仿真實驗,通過與LEACH算法、HEED算法等進(jìn)行仿真比較,說明了新算法能有效延長網(wǎng)絡(luò)的生存周期,實現(xiàn)網(wǎng)絡(luò)的負(fù)載均衡?！居⑽恼縄nwirelesssensornetworks,weneedtoresearcharationalandefficientroutingprotocolalgorithm,withaviewtoprolongthenetworklifetimeandbalancenetworkenergyconsumption.Atpresent,

4、comparingwiththeplanerouting,clusteringroutingalgorithmisconsideredtohavesplendiddevelopmentprospect,however,therearecircsofexcessiveburdenonclusterheadnode,theinequalityenergyconsumptionofthenode,aswellasformingthe“hotspot”easyinmostclusteringroutingalgorithm.Severalalgorit

5、hmscanalleviatetheburdenofthemainclusterheadeffectivelybyintroducingtheideaofDoubleClusterHeads,theyhavenomethodaimingattheselectionmechanismofassistingclusterheadandtheissueofreducingtheenergyconsumptionwhichgrowsoutofchoosingclusterheadbycompetitionmechanism,thustheissuesa

6、ffectedthefunctionsofwirelesssensornetworkstosomeextent.Inthisthesis,weintroducedoubleclusterheadsmechanismwhichcansharetheburdenofmainclusterheadbyusingassistingclusterheadtotakeonthedataswitching,besides,forthepurposeofreducingthefrequencyofclustering,prolongingthelifecycl

7、eofclusterandreducingtheenergyconsumptionwhichgrowsoutofclusterheadselectioncompetition,weintroducetheAlgorithmofChoosingtheUnevenDistributedDoubleClusterHeadsinWSNBasedonARMATrafficPrediction(AUDC).Thealgorithmcanpredictthenextmomenttrafficofassistingclusterheadbyusingtheco

8、mbinationofthemainclusterheadandARMATrafficPrediction,andthenwechoosetheass