資源描述：
《改進(jìn)的無(wú)線傳感器網(wǎng)絡(luò)非均勻分簇路由算法.pdf》由會(huì)員上傳分享，免費(fèi)在線閱讀，更多相關(guān)內(nèi)容在行業(yè)資料-天天文庫(kù)。
1、第28卷第5期傳感技術(shù)學(xué)報(bào)Vo1．28No．5CHINESEJOURNALOFSENSORSANDACTUATORSMav20152015年5月ImprovedUnevenClusteringRoutingAlgorithmf0rWirelessSensorNetworksZHANGWenmei，LIAOFubao(1．DepartmentofMechanicsandElectronics，GuangDongAIBPolytechnicCollege，Guangzhou510507，China；2．Depar
2、tmentofComputer，GuangDongAIBPolytechnicCollege，Guangzhou510507，China)Abstract：Inordertosolvetheproblemofenergyholeinwirelesssensornetworkscausedbyunevenclusteringpro-tocol，animprovedunevenclusteringroutingalgorithmisproposed．Intheclusterheadsselectionstage，
3、thealgorithmselectstheclusterheadsbasedOfseveralfactors，includingtheresidualenergyofnode，thedistancebe—tweennodeandbasestation，the”degree”ofthenode，andthedistancebetweennodeandclusterhead．Othernodesthatcan’tbeclusterheadsselecttojointheclusternearesttocompl
4、etetheprocessofclusteringandthenet—workisdividedintoclusterswithdifferentsize．Inthestageofdatatransmission．thealgorithmconstructstheoptimaltransmissionpathbasedonminimumspanningtree，accordingtotheresidualenergyofclusterheads，andthedistancebetweenclusterhead
5、sandbasestationaswel1．Theordinarynodesofaclustersendsthedatatoclusterheadthroughasinglejump，andclusterheadssendthedatatobasestationthroughthenodesofthetreebythemorejumpingcommunication．Thesimulationshowsthattheroutingalgorithmcanefficientlyreduceandbalancet
6、heen-ergyconsumption，andprolongthewirelesssensornetworksurvivalperiod．Keywords：wirelesssensornetworks；energybalance；unevenclustering；minimumspanningtreeEEACC：6150Pdoi：10．3969／j．issn．1004-1699．2015．05．021改進(jìn)的無(wú)線傳感器網(wǎng)絡(luò)非均勻分簇路由算法張文梅，廖福保(1．廣東農(nóng)工商職業(yè)技術(shù)學(xué)院機(jī)電系，廣州510507；2
7、．廣東農(nóng)工商職業(yè)技術(shù)學(xué)院計(jì)算機(jī)系，廣州510507)摘要：針對(duì)無(wú)線傳感器網(wǎng)絡(luò)中不均勻分簇引起能量空洞的問(wèn)題，提出了改進(jìn)的無(wú)線傳感器網(wǎng)絡(luò)非均勻分簇路由算法。該算法先根據(jù)節(jié)點(diǎn)剩余能量、節(jié)點(diǎn)到基站的距離、節(jié)點(diǎn)“度”和節(jié)點(diǎn)到簇頭的距離等因素選舉簇頭；沒(méi)有成為簇頭的節(jié)點(diǎn)選擇加入到距離最近的簇頭所在的簇中，從而將整個(gè)網(wǎng)絡(luò)劃分為大小不等的簇；然后簇頭再根據(jù)簇頭剩余能量、簇頭到基站的距離構(gòu)造基于最小生成樹(shù)的最優(yōu)傳輸路徑；通過(guò)簇內(nèi)節(jié)點(diǎn)單跳、樹(shù)內(nèi)簇頭多跳通信的方式將數(shù)據(jù)最終傳輸?shù)交尽７抡娼Y(jié)果表明，該路由算法能有效節(jié)約能量和均衡
8、節(jié)點(diǎn)能耗，從而延長(zhǎng)網(wǎng)絡(luò)的生命周期。關(guān)鍵詞：無(wú)線傳感器網(wǎng)絡(luò)；能量均衡；非均勻分簇；最小生成樹(shù)中圖分類號(hào)：TP3931文獻(xiàn)標(biāo)識(shí)碼：A文章編號(hào)：1004-1699(2015)05-0739-05無(wú)線傳感器網(wǎng)絡(luò)通常包括了大量的傳感器節(jié)點(diǎn)效降低能耗并提高網(wǎng)絡(luò)生命周期，但簇頭到基站通和用于收集和發(fā)送數(shù)據(jù)的基站組成，這些傳感器節(jié)過(guò)單跳方式傳輸會(huì)使距離基站遠(yuǎn)的簇頭消耗過(guò)多能點(diǎn)采集監(jiān)控區(qū)域的數(shù)據(jù)，通過(guò)自組網(wǎng)方式將采集
