本文選題：無線傳感器網(wǎng)絡(luò) + 連通支配集　； 參考：《計算機工程》2017年01期

【摘要】：現(xiàn)有的連通支配集構(gòu)建算法大多過程復(fù)雜、步驟冗余、耗能較多,且不能適應(yīng)網(wǎng)絡(luò)動態(tài)拓撲的變化。為此,提出一種能量有效的構(gòu)建算法。該算法通過單階段快速構(gòu)建能適應(yīng)節(jié)點小范圍移動的連通支配集,簡化構(gòu)建過程,其支配節(jié)點的選擇考慮節(jié)點額外覆蓋范圍大小、節(jié)點剩余能量等因素,使得主干網(wǎng)生存時間大大延長,避免頻繁構(gòu)建主干網(wǎng)帶來的能耗。仿真結(jié)果表明,與EEIA_CDS,Flooding等算法相比,該算法構(gòu)建主干網(wǎng)的開銷降低31%~46%,廣播風(fēng)暴發(fā)生概率降低52%~67%,網(wǎng)絡(luò)生命周期延長約35.5%。
[Abstract]:Most of the existing algorithms for constructing connected dominating sets are complex, redundant and energy-consuming, and can not adapt to the change of network dynamic topology. Therefore, an energy efficient construction algorithm is proposed. The algorithm can quickly construct the connected dominating set which can adapt to the small scale movement of nodes, and simplify the construction process. The selection of the dominating nodes takes into account the additional coverage of nodes, the residual energy of nodes, and so on. The survival time of backbone network is prolonged greatly, and energy consumption caused by building backbone network frequently is avoided. The simulation results show that compared with EEIAA CDSU flooding algorithm, the cost of constructing the main network is reduced by 31 / 46, the probability of broadcasting storm is reduced by 52 / 67, and the network life cycle is prolonged by 35. 5%.
【作者單位】： 重慶郵電大學(xué)光通信與網(wǎng)絡(luò)重點實驗室;
【基金】：國家自然科學(xué)基金(61371097) 國家物聯(lián)網(wǎng)發(fā)展專項資金項目(工信部科函[2014]351號) 重慶郵電大學(xué)青年基金(A201293)
【分類號】：TP212.9;TN929.5

【相似文獻】

相關(guān)期刊論文 前10條

1 馬婭婕;田翔川;;網(wǎng)絡(luò)拓撲聚合的帶寬加權(quán)支配集算法研究[J];小型微型計算機系統(tǒng);2007年04期

2 張e，

本文編號：2089818