本文選題：無線傳感器網(wǎng)絡 + 數(shù)據(jù)收集�。� 參考：《計算機科學》2017年03期

【摘要】：針對設施農(nóng)業(yè)無線傳感器網(wǎng)絡節(jié)點分布不均勻、能量約束嚴格的特點,為降低網(wǎng)絡總能耗,提出一種改進的遺傳粒子群算法,構建一棵樹高受限且網(wǎng)絡總能耗最小的數(shù)據(jù)收集樹。首先,隨機生成連通圖網(wǎng)絡,采用父節(jié)點表示法將生成樹編碼成粒子;然后,設計一種隨機生成數(shù)據(jù)收集樹算法,隨機產(chǎn)生滿足樹高限制的生成樹;最后,考慮節(jié)點能耗均衡,設計一種粒子單點突變算法,實現(xiàn)對節(jié)點能耗最優(yōu)值的比較。通過粒子單點變異、交叉以及優(yōu)化新粒子,提高了種群多樣性,避免了算法過早陷入局部最優(yōu)解,在滿足時延要求的同時,降低了網(wǎng)絡總能耗。實驗表明,與有樹高約束的DL-DCT算法相比,所提算法降低了7.34%的網(wǎng)絡總能耗,延長了網(wǎng)絡平均生存期。
[Abstract]:In order to reduce the total energy consumption of the network, an improved genetic particle swarm optimization (PSO) algorithm is proposed to reduce the total energy consumption of the network. In order to reduce the total energy consumption of the network, a data collection tree with a tree height limited and the minimum total energy consumption of the network is constructed. First, the connected graph network is randomly generated and the tree is generated by the parent node representation. Then, a random generated data collection tree algorithm is designed to generate random tree which satisfies the height limit of the tree. Finally, considering the energy balance of the nodes, a single point mutation algorithm of particle is designed to achieve the comparison of the optimal value of energy consumption. The algorithm avoids the local optimal solution prematurely and reduces the total energy consumption of the network while meeting the delay requirement. The experiment shows that compared with the DL-DCT algorithm with high tree constraints, the proposed algorithm reduces the total energy consumption by 7.34% and prolongs the average lifetime of the network.

【作者單位】： 東南大學移動通信國家重點實驗室;徐州工業(yè)職業(yè)技術學院信息與電氣工程學院;
【基金】：國家自然科學基金(6504030000) 移動通信國家重點實驗室基金(2015A03) 徐州市科技發(fā)展基金(XF13C035) 院級科研課題基金(XGY201414)資助
【分類號】：TP212.9;TN929.5;TP18

【參考文獻】

相關期刊論文 前10條

1 朱藝華;徐驥;田賢忠;池凱凱;;無線傳感器網(wǎng)絡應用簡單Reed-Solomon編碼的低能耗和低時延可靠數(shù)據(jù)收集方案[J];計算機學報;2015年10期

2 高霞;袁明波;饒，

本文編號：1836151