【摘要】：為解決現(xiàn)有無(wú)線傳感器網(wǎng)絡(luò)(WSN)分簇算法難以同時(shí)兼顧其異構(gòu)性和移動(dòng)性,從而引發(fā)網(wǎng)絡(luò)壽命較短、網(wǎng)絡(luò)數(shù)據(jù)吞吐量較低等問(wèn)題,提出了基于節(jié)點(diǎn)等級(jí)的自適應(yīng)分簇算法。該算法按輪運(yùn)行,每輪分為自適應(yīng)分簇、簇建立、數(shù)據(jù)傳輸三個(gè)階段。為解決節(jié)點(diǎn)移動(dòng)性引發(fā)的簇首數(shù)目和成簇規(guī)模不合理的問(wèn)題,在自適應(yīng)分簇階段,根據(jù)子區(qū)域內(nèi)節(jié)點(diǎn)數(shù)目變化對(duì)相應(yīng)子區(qū)域進(jìn)行細(xì)化或就近合并,以確保每個(gè)子區(qū)域內(nèi)節(jié)點(diǎn)數(shù)目在合理范圍內(nèi)。在簇建立階段,選舉簇內(nèi)等級(jí)最高的節(jié)點(diǎn)為簇首,解決異構(gòu)性引發(fā)的部分節(jié)點(diǎn)能耗過(guò)快、網(wǎng)絡(luò)壽命縮短的問(wèn)題;節(jié)點(diǎn)等級(jí)除考慮節(jié)點(diǎn)剩余能量外,還結(jié)合WSN實(shí)際應(yīng)用,由節(jié)點(diǎn)剩余能量、能量消耗速率、到基站的距離、到簇內(nèi)其他節(jié)點(diǎn)的距離綜合決定�；贠MNeT++和Matlab的仿真實(shí)驗(yàn)結(jié)果表明,在節(jié)點(diǎn)移動(dòng)速度為0~0.6 m/s的能量異構(gòu)WSN環(huán)境下,較移動(dòng)低功耗自適應(yīng)集簇分層(LEACH-Mobile)算法和分布式能量有效分簇(DEEC)算法,運(yùn)用所提算法分簇的WSN壽命延長(zhǎng)了30.9%以上,網(wǎng)絡(luò)數(shù)據(jù)吞吐量是其他兩種算法分簇的網(wǎng)絡(luò)的1.15倍以上。
[Abstract]:In order to solve the problems of short network life and low network data throughput, an adaptive clustering algorithm based on node level is proposed to solve the problem that (WSN) clustering algorithm in wireless sensor networks is difficult to take into account its heterogeneity and mobility at the same time. The algorithm runs according to the wheel, and each round is divided into three stages: adaptive clustering, cluster establishment and data transmission. In order to solve the problem of unreasonable cluster head number and cluster size caused by node mobility, in the adaptive clustering stage, the corresponding sub-region is refined or merged according to the change of the number of nodes in the sub-region. To ensure that the number of nodes in each sub-area is within a reasonable range. In the cluster establishment stage, the highest grade node in the cluster is selected as the cluster head, which solves the problem of too fast energy consumption and shortening the network life caused by heterogeneity. In addition to considering the residual energy of the node, the node level is also combined with the practical application of WSN, which is determined by the residual energy of the node, the energy consumption rate, the distance to the base station and the distance to the other nodes in the cluster. The simulation results based on OMNeT and Matlab show that the adaptive cluster layering (LEACH-Mobile) algorithm and the distributed energy efficient clustering (DEEC) algorithm are lower than the mobile low power adaptive cluster layering (LEACH-Mobile) algorithm in the energy heterogeneous WSN environment with node moving speed of 0 鈮，

本文編號(hào)：2491220