發(fā)布時間：2018-06-12 21:14

  本文選題：無線傳感器網(wǎng)絡(luò) + 分簇路由協(xié)議　； 參考：《電子科技大學(xué)》2017年碩士論文

【摘要】：發(fā)射功率恒定的傳感器節(jié)點憑借其簡單的構(gòu)造、低廉的價格被廣泛應(yīng)用在無線傳感器網(wǎng)絡(luò)中。目前,無線傳感器網(wǎng)絡(luò)路由協(xié)議的研究主要集中于分簇式路由協(xié)議,在這些協(xié)議中,通常假設(shè)傳感器節(jié)點的發(fā)射功率是可調(diào)的且能夠直接與基站進(jìn)行通信,這就造成此類協(xié)議在基于恒定節(jié)點功率的無線傳感器網(wǎng)絡(luò)的應(yīng)用中會導(dǎo)致“孤立簇首”的出現(xiàn)。最新的分簇算法采用中繼技術(shù),暫時解決了孤立簇首的問題,但是由于要轉(zhuǎn)發(fā)大量的數(shù)據(jù),中繼節(jié)點會因為能量耗盡而更早死亡,最終導(dǎo)致孤島和網(wǎng)絡(luò)黑洞。針對當(dāng)前主流分簇協(xié)議存在的“孤立簇首”的問題,本文對無線傳感器網(wǎng)絡(luò)中可靠的分簇路由協(xié)議進(jìn)行了探索性研究,提出了一種新的基于恒定節(jié)點功率的無線傳感器網(wǎng)絡(luò)分簇算法,本文的研究工作主要包括以下幾個方面:(1)對無線傳感器網(wǎng)絡(luò)的基本理論知識進(jìn)行了深入研究。研究了無線傳感器網(wǎng)絡(luò)的體系結(jié)構(gòu)、關(guān)鍵技術(shù)、主要特點以及面臨的挑戰(zhàn),介紹了無線傳感器網(wǎng)絡(luò)的系統(tǒng)模型和拓?fù)浣Y(jié)構(gòu)、能量損耗模型、協(xié)議棧結(jié)構(gòu)以及傳感器節(jié)點的硬件結(jié)構(gòu)。(2)研究了無線傳感器網(wǎng)絡(luò)路由協(xié)議,并重點研究了分簇路由算法。介紹了無線傳感器網(wǎng)絡(luò)路由協(xié)議的特點和設(shè)計要求,并對當(dāng)今典型的無線傳感網(wǎng)絡(luò)路由協(xié)議的主要思想和執(zhí)行過程進(jìn)行了認(rèn)真的分析和總結(jié),包括平面路由和分簇路由,總結(jié)了它們的特點,分析了它們的優(yōu)缺點,并指出了它們的適用情況。(3)分析了“孤立簇首”產(chǎn)生的原因,提出了一種新的基于恒定節(jié)點功率的無線傳感器網(wǎng)絡(luò)分簇算法(DCRP)。DCRP的主要思想是以基站為中心向外擴(kuò)散式分簇,新的簇首總是產(chǎn)生于簇成員節(jié)點,從而保證了簇首之間的通信,避免了孤立簇首的產(chǎn)生。簇首的選擇策略綜合考慮了節(jié)點的剩余能量、深度和簇外鄰居節(jié)點個數(shù)三個因子,提高了網(wǎng)絡(luò)的能耗均衡性和能量高效性并且減少了網(wǎng)絡(luò)中分簇的個數(shù)。因此,DCRP在延長了網(wǎng)絡(luò)壽命的同時也縮短了網(wǎng)絡(luò)的傳輸時延。(4)通過仿真對DCRP的性能進(jìn)行評價。通過在MATLAB平臺下進(jìn)行仿真,驗證了DCRP算法的可行性,并通過與DEBR和EEUC算法進(jìn)行對比,驗證了DCRP在能耗均衡性、能量高效性以及網(wǎng)絡(luò)傳輸時延等方面的改善。仿真結(jié)果表明:DCRP算法能夠避免孤立簇首的產(chǎn)生;與DEBR和EEUC相比,DCRP算法不僅使網(wǎng)絡(luò)壽命分別延長大約60%和16%,而且縮短了網(wǎng)絡(luò)的傳輸時延。
[Abstract]:Sensor nodes with constant transmission power are widely used in wireless sensor networks because of their simple structure and low price. At present, the research of wireless sensor network routing protocols is mainly focused on cluster routing protocols. In these protocols, it is generally assumed that the transmission power of sensor nodes is adjustable and can communicate directly with the base station. This leads to the emergence of "isolated cluster heads" in wireless sensor networks based on constant node power. The latest clustering algorithm uses relay technology to solve the problem of isolated cluster heads temporarily. However, due to forwarding a large amount of data, relay nodes will die earlier because of energy depletion, resulting in isolated islands and network black holes. Aiming at the problem of "isolated cluster head" existing in current mainstream clustering protocols, this paper makes an exploratory study on reliable clustering routing protocols in wireless sensor networks. A new clustering algorithm for wireless sensor networks based on constant node power is proposed. The research work in this paper mainly includes the following aspects: 1) the basic theoretical knowledge of wireless sensor networks is deeply studied. The architecture, key technologies, main characteristics and challenges of wireless sensor networks are studied. The system model, topology and energy loss model of wireless sensor networks are introduced. Protocol stack structure and sensor node hardware structure. This paper introduces the characteristics and design requirements of wireless sensor network routing protocols, and makes a careful analysis and summary of the main ideas and execution processes of the typical wireless sensor network routing protocols, including plane routing and clustering routing. This paper summarizes their characteristics, analyzes their advantages and disadvantages, and points out their application. A new clustering algorithm based on constant node power for wireless sensor networks (WSN) is proposed. The main idea of DCRPU. DCRP is that the base station is the center of the cluster, and the new cluster head is always generated from the cluster member node, thus ensuring the communication between the cluster heads. The isolated cluster head is avoided. The selection strategy of cluster head takes into account three factors: residual energy depth and the number of neighbors outside the cluster. It improves the energy balance and energy efficiency of the network and reduces the number of clusters in the network. Therefore, DCRP not only prolongs the network life, but also shortens the transmission delay. 4) the performance of DCRP is evaluated by simulation. The feasibility of DCRP algorithm is verified by simulation on MATLAB platform, and compared with DEBR and EEUC algorithm, the improvement of DCRP in energy balance, energy efficiency and network transmission delay is verified. Compared with DEBR and EEUC, the DCRP algorithm can not only prolong the network lifetime by about 60% and 16%, but also shorten the transmission delay.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 彭鐸;黎鎖平;楊喜娟;;一種能量高效的無線傳感器網(wǎng)絡(luò)非均勻分簇路由協(xié)議[J];傳感技術(shù)學(xué)報;2014年12期

2 徐光yP ,史元春 ,謝偉凱;普適計算[J];計算機(jī)學(xué)報;2003年09期

3 任豐原,黃海寧,林闖;無線傳感器網(wǎng)絡(luò)[J];軟件學(xué)報;2003年07期

，

本文編號：2011112