本文選題：物聯(lián)網(wǎng) + 拓撲控制　； 參考：《安徽理工大學(xué)》2017年碩士論文

【摘要】：隨著科技的進步,經(jīng)濟的發(fā)展,物聯(lián)網(wǎng)已經(jīng)成為當今研究的熱點,由于其功能強大以及很好的智能性,已經(jīng)成為生活中不可或缺的一部分。因為物聯(lián)網(wǎng)技術(shù)可以自動的獲取周圍的信息,這就使得網(wǎng)絡(luò)節(jié)點在其扮演著中重要角色。網(wǎng)絡(luò)節(jié)點一般都是大規(guī)模的組成一個拓撲結(jié)構(gòu),要想網(wǎng)絡(luò)的生存時間長,這就要求網(wǎng)絡(luò)拓撲結(jié)構(gòu)應(yīng)該設(shè)計的更加合理,也就是設(shè)計出能耗低的拓撲結(jié)構(gòu)。所以一個性能更佳以及能量損耗更低的網(wǎng)絡(luò)拓撲結(jié)構(gòu)是當前重要的研究目標。本文主要對物聯(lián)網(wǎng)中網(wǎng)絡(luò)拓撲結(jié)構(gòu)進行了分析和研究,對已有的算法進行改進,提出了基于遺傳算法對LEACH拓撲算法的優(yōu)化(LEACH-GA)。LEACH-GA算法在簇頭選取的階段,通過對閥值的修改,使得簇頭的選擇考慮的因素包括簇頭的剩余能量、節(jié)點的鄰居節(jié)點數(shù)以及節(jié)點是否當選過簇頭等,這樣選擇出來的簇頭會更加合理;另外在簇的建立階段,利用遺傳算法的適應(yīng)度函數(shù)的計算值來確定更加合理的分簇結(jié)構(gòu)。通過MATLAB仿真表明,改進后的算法在節(jié)點的生命周期以及數(shù)據(jù)發(fā)送量都有所提高,說明改進后的算法網(wǎng)絡(luò)結(jié)構(gòu)更加合理。本文結(jié)合網(wǎng)絡(luò)節(jié)點以及提出的算法,設(shè)計出能夠?qū)崿F(xiàn)LEACH-GA算法的硬件電路,利用FPGA芯片來實現(xiàn)算法。實驗結(jié)果表明LEACH-GA算法確實能夠提高物聯(lián)網(wǎng)中網(wǎng)絡(luò)拓撲結(jié)構(gòu)的能量利用率,從而延長物聯(lián)網(wǎng)的網(wǎng)絡(luò)生存時間。
[Abstract]:With the progress of science and technology and the development of economy, the Internet of things has become a hot spot of research today, because of its powerful function and good intelligence, it has become an indispensable part of life. Because the Internet of things technology can automatically obtain the surrounding information, this makes network nodes play an important role in it. Network nodes generally constitute a topology structure on a large scale. In order to live a long time, network topology should be designed more reasonably, that is, to design a topology with low energy consumption. Therefore, a network topology with better performance and lower energy loss is an important research goal. In this paper, the network topology in the Internet of things is analyzed and studied, the existing algorithms are improved, and the optimization of Leach topology algorithm based on genetic algorithm is proposed. In the stage of cluster head selection, the threshold is modified. The factors that make the cluster head selection consider include the residual energy of the cluster head, the number of neighbor nodes of the node and whether the node has been elected as the cluster head, so that the selected cluster head will be more reasonable; in addition, in the stage of cluster establishment, A more reasonable clustering structure is determined by using the computational value of fitness function of genetic algorithm. The MATLAB simulation shows that the improved algorithm can improve the node life cycle and data delivery, which indicates that the improved algorithm network structure is more reasonable. Combining the network node and the proposed algorithm, this paper designs the hardware circuit which can realize the LEACH-GA algorithm, and uses FPGA chip to realize the algorithm. The experimental results show that the LEACH-GA algorithm can improve the energy utilization rate of the network topology in the Internet of things, thus prolonging the network lifetime of the Internet of things.
【學(xué)位授予單位】：安徽理工大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP391.44;TN929.5

【相似文獻】

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

1 吳雪霽;;把握“物聯(lián)網(wǎng)”時代的三個關(guān)鍵點[J];通信世界;2009年33期

2 秦茜;;物聯(lián)網(wǎng)驟成產(chǎn)業(yè)巨浪 各方大肆追捧恐為時尚早[J];IT時代周刊;2009年Z2期

3 石菲;;物聯(lián)網(wǎng)還有多遠[J];中國計算機用戶;2009年Z2期

4 馬繼華;韓文哲;;物聯(lián)網(wǎng)的未來會變成“空中樓閣”嗎?[J];信息網(wǎng)絡(luò);2009年10期

5 ;物聯(lián)網(wǎng)系列報道之一 理性物聯(lián)網(wǎng)[J];通信世界;2009年40期

6 李鵬;;物聯(lián)網(wǎng)發(fā)展 標準與應(yīng)用先行[J];通信世界;2009年40期

7 李鵬;趙經(jīng)緯;;北郵謝東亮 物聯(lián)網(wǎng)需兩顆紅心一種準備[J];通信世界;2009年40期

8 周雙陽;;尋找物聯(lián)網(wǎng)的制高點[J];通信世界;2009年41期

9 張鵬;;物聯(lián)網(wǎng),十年涅i，

本文編號：2016046