本文選題：無線傳感器網(wǎng)絡(luò)　切入點：負(fù)載均衡　出處：《天津工業(yè)大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：無線傳感器網(wǎng)絡(luò)(Wireless Sensor Networks,WSNs)是目前國內(nèi)外研究的熱點。由于傳感器節(jié)點的能量供給全部來自電池,因而儲備能量受電池存儲的限制。當(dāng)節(jié)點部署環(huán)境相對較差,且對節(jié)點數(shù)量有極大需求時,人工更換傳感器節(jié)點的電池不便也不現(xiàn)實。所以,對于無線傳感器網(wǎng)絡(luò)的發(fā)展而言,如何提高網(wǎng)絡(luò)壽命,成為至關(guān)重要的核心問題之一。RaSMaLai算法是最大化無線傳感器網(wǎng)絡(luò)壽命的一種典型算法,本文詳細(xì)介紹了 RaSMaLai算法并針對其有可能進入無效循環(huán)和無效等待狀態(tài)的問題,進行了兩點改進并提出了一種新的隨機轉(zhuǎn)換算法NRaSMaLai。改進一,在數(shù)據(jù)收集樹初始化過程中對其進行檢測,防止其進入無效等待狀態(tài);改進二,在更新數(shù)據(jù)收集樹操作過程中對數(shù)據(jù)收集樹中的最大負(fù)載節(jié)點及其所有子孫節(jié)點進行狀態(tài)檢測,如果最大負(fù)載節(jié)點的所有子孫節(jié)點都不存在潛在的雙親節(jié)點,則按照一定的策略對數(shù)據(jù)收集樹進行隨機轉(zhuǎn)換,防止樹進入無效循環(huán)狀態(tài),從而保證數(shù)據(jù)收集樹最終能達(dá)到平衡或接近預(yù)設(shè)的平衡狀態(tài)。經(jīng)實驗證明,一般情況下,使用改進一或改進二的RaSMaLai算法都能使數(shù)據(jù)收集樹達(dá)到平衡狀態(tài),從而擴大無線傳感器網(wǎng)絡(luò)的壽命。在RaSMaLai的基礎(chǔ)上提出了一種新的隨機轉(zhuǎn)換算法NRaSMaLai,在循環(huán)過程中會在數(shù)據(jù)收集樹中尋找樹中擁有最小負(fù)載的節(jié)點,通過增加其本身或其子孫節(jié)點的負(fù)載,從而使數(shù)據(jù)收集樹達(dá)到平衡狀態(tài)或接近預(yù)設(shè)的平衡狀態(tài)。經(jīng)實驗證明,NRaSMaLai相比于RaSMaLai,在隨機轉(zhuǎn)換的過程中迭代步數(shù)更少且發(fā)生振蕩的情況遠(yuǎn)遠(yuǎn)少。
[Abstract]:Wireless Sensor Networks (WSNs) is a hot research topic at home and abroad. Since the energy supply of sensor nodes comes from the battery, the storage energy is limited by the battery storage. And when there is a great demand for the number of nodes, it is not practical to manually replace the battery of sensor nodes. Therefore, for the development of wireless sensor networks, how to improve the network life, Rahim MaLai algorithm is a typical algorithm to maximize the lifetime of wireless sensor networks. This paper introduces the RaSMaLai algorithm in detail and aims at the possibility of its entering into invalid cycle and invalid waiting state. In this paper, two improvements are made and a new random transformation algorithm, NRASMA Lai. is proposed. One is improved to detect the data collection tree during initialization to prevent it from entering an invalid waiting state. In the process of updating the data collection tree, the state of the maximum load node in the data collection tree and all the descendant nodes are detected, if no potential parent node exists in all the descendant nodes of the maximum load node. Then the data collection tree is randomly converted according to a certain strategy to prevent the tree from entering an invalid cycle state, so as to ensure that the data collection tree can eventually achieve equilibrium or close to the preset equilibrium state. Using an improved one or two RaSMaLai algorithm can balance the data collection tree. In order to extend the lifetime of wireless sensor networks, a new random conversion algorithm, NRASMA Lai, is proposed on the basis of RaSMaLai, in which the nodes with the minimum load in the tree will be found in the data collection tree during the cycle. By increasing the load on the nodes themselves or their descendants, Experimental results show that NRaS MaLai has fewer iterative steps and fewer oscillations in the process of random conversion than Raj Mai.
【學(xué)位授予單位】：天津工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 梁俊斌;王建新;李陶深;陳建二;;傳感器網(wǎng)絡(luò)中基于樹的最大生命精確數(shù)據(jù)收集[J];軟件學(xué)報;2010年09期

2 余勇昌;韋崗;;無線傳感器網(wǎng)絡(luò)中基于PEGASIS協(xié)議的改進算法[J];電子學(xué)報;2008年07期

3 王天荊;楊震;胡海峰;;基于空間相關(guān)性的事件驅(qū)動無線傳感器網(wǎng)絡(luò)分簇算法[J];電子與信息學(xué)報;2008年03期

4 崔莉,鞠海玲,苗勇,李天璞,劉巍,趙澤;無線傳感器網(wǎng)絡(luò)研究進展[J];計算機研究與發(fā)展;2005年01期

，

本文編號：1635966