本文關鍵詞：無線傳感器網(wǎng)絡分層路由算法研究　出處：《山東師范大學》2014年碩士論文　論文類型：學位論文

  更多相關文章： 無線傳感器網(wǎng)絡 能量 距離 定時器 分層路由算法

【摘要】：無線傳感器網(wǎng)絡（Wireless Sensor Network，WSN）是由傳感器節(jié)點和基站組成的自組織網(wǎng)絡。傳感器節(jié)點負責感知和處理監(jiān)測區(qū)域內(nèi)的信息，然后協(xié)作地以無線通信方式將收集的信息傳輸給基站。它們通常由電池供電，且部署后不再補給能量，因此能源有效性是WSN研究的核心問題。能源的有限性限制了傳感器節(jié)點的存儲能力、處理能力及通信能力�；诜执氐姆謱勇酚蓞f(xié)議與平面路由協(xié)議相比更適用于無線傳感器網(wǎng)絡，能夠有效地提高能源有效性。因而，本文對無線傳感器網(wǎng)絡分層路由算法展開了深入的研究。本文的主要工作和創(chuàng)新點可概括如下： 1、首先，深入地研究和系統(tǒng)地概括了WSN的體系結構、涉及的關鍵技術及實際應用情況。然后，概述了WSN路由協(xié)議的設計目標，研究了節(jié)能策略，對現(xiàn)有的WSN路由協(xié)議進行了分類，詳細地分析了經(jīng)典的無線傳感器網(wǎng)絡路由協(xié)議，并深入地分析了分層路由協(xié)議的優(yōu)勢。 2、針對以往的異構無線傳感器網(wǎng)絡分層路由算法存在的不足，提出了EDU（Unequal Clustering Algorithm Based on Energy Distribution）算法。EDU算法借鑒了EDBCA算法的計算簇頭競爭參數(shù)的方法。EDU算法具有以下創(chuàng)新：首先，EDU算法使?jié)M足一定條件的距離基站近的傳感器節(jié)點直接與基站通信，在一定程度上節(jié)約了能源；其次，傳感器節(jié)點根據(jù)自身與基站的距離計算競選簇頭的半徑，在網(wǎng)絡中構造非均勻的簇，削弱了“熱點”效應；再者，簇成員節(jié)點根據(jù)簇頭節(jié)點的剩余能量、與基站的距離及通信代價選擇合適的簇頭加入簇，而不是根據(jù)收到信號的強弱；最后，，與基站通過多跳數(shù)據(jù)傳輸方式通信的簇頭節(jié)點，在選擇中繼節(jié)點時，綜合考慮候選節(jié)點的剩余能量、與基站的距離及通信代價。 3、提出了基于能量和距離的無線傳感器網(wǎng)絡自適應分層路由算法EDA（Energy-based and Distance-based Adaptive Clustering Algorithm）。EDA算法從簇頭的競選、簇半徑的計算及簇間路由樹的建立三個方面改進了以往的分層路由算法。EDA算法引入基于能量和距離的概率模型產(chǎn)生候選簇頭，減少了網(wǎng)絡中競選簇頭的傳感器節(jié)點的數(shù)量和用于信息交換的消息包的數(shù)量，節(jié)約了能量；EDA算法根據(jù)剩余能量設置定時器，使得局部區(qū)域內(nèi)剩余能量多的候選簇頭成為簇頭，能夠合理地控制簇頭的分布；EDA算法在計算簇頭的競爭半徑時不僅考慮候選簇頭節(jié)點的位置，還考慮候選簇頭節(jié)點的剩余能量，能夠有效地均衡網(wǎng)絡負載；EDA算法根據(jù)簇頭節(jié)點與基站的距離計算最優(yōu)轉發(fā)跳數(shù)，結合剩余能量和通信代價等信息選擇最優(yōu)的中繼節(jié)點。 4、在OMNET++仿真平臺上搭建了仿真環(huán)境。在相同的仿真環(huán)境下，實現(xiàn)了EDU算法與異構無線傳感器網(wǎng)絡路由算法DEEC、EDBCA的仿真實驗。實驗結果表明，EDU算法與DEEC、EDBCA算法相比，能夠有效地均衡網(wǎng)絡負載，延長網(wǎng)絡生命周期。在相同的仿真環(huán)境下，實現(xiàn)了EDA算法與I-LEACH、DEBUC的仿真實驗。實驗結果表明，EDA算法與I-LEACH、DEBUC算法相比，具有更好的穩(wěn)定性，能夠更好地平衡網(wǎng)絡能量消耗，提高能源有效性，延長網(wǎng)絡生命周期。
[Abstract]:Wireless sensor network (Wireless Sensor Network, WSN) is a self-organizing network composed of sensor nodes and the base station. The sensor node is responsible for sensing and processing monitoring information in the region, and then cooperate with wireless communication transmit the collected information to the base station. They are usually powered by batteries, and after the deployment of energy supply is no longer so. Energy efficiency is a key problem in WSN research. The limited energy limited storage capacity of sensor nodes, processing ability and communication ability. Hierarchical routing protocol clustering compared with the flat routing protocol is suitable for wireless sensor networks based on, can effectively improve the energy efficiency. Therefore, this paper conducts an in-depth research on the hierarchical routing algorithm for wireless sensor networks. The main work and innovation points can be summarized as follows:
1, first of all, in-depth research and systematic summarization of the architecture of the WSN, the key technique and practical application. Then, summarizes the design goal of WSN routing protocol, the energy saving strategy, on the existing WSN routing protocols are classified and analyzed in detail by the wireless sensor network routing protocol code, and deeply analyze the advantages of hierarchical routing protocol.
2, to solve the problems existing in heterogeneous hierarchical wireless sensor network routing algorithm in the past, the EDU (Unequal Clustering Algorithm Based on Energy Distribution).EDU algorithm from the calculation method of cluster head competition parameter EDBCA algorithm.EDU algorithm has the following innovations: firstly, EDU algorithm to meet certain conditions from the sensor nodes near base station the direct communication with the base station, to a certain extent, saving energy; secondly, the sensor node calculation for cluster head according to their distance from the base station radius, construct the non-uniform clusters in the network, weakened the "hot spot" effect; moreover, the member nodes according to the residual energy of the cluster head nodes, the distance from the base station the communication cost and select a proper cluster head to join the cluster, rather than according to the received signal strength; finally, the cluster head and the base station through the multi hop data transmission communication Nodes, when selecting relay nodes, the residual energy of the candidate nodes, the distance from the base station and the communication cost are considered.
3, put forward the EDA adaptive wireless sensor network routing algorithm based on energy and distance (Energy-based and Distance-based Adaptive Clustering Algorithm) for the.EDA algorithm from the cluster head, cluster radius calculation and routing tree establishment three aspects to improve the hierarchical routing algorithm.EDA algorithm is introduced to generate candidate cluster head probability model based on energy and distance, reduce the number of nodes in the cluster head election in sensor networks for information exchange and message packet number, saving energy; EDA algorithm based on the residual energy setting timer, the local area in the remaining candidate cluster head energy to be the cluster head, can reasonably control the distribution of cluster head the EDA algorithm; not only consider the candidate cluster head node position in competition radius calculation of cluster head, also considering the residual energy of candidate cluster head node, effectively all The EDA algorithm calculates the optimal forwarding hops according to the distance between cluster head nodes and base stations, and selects the optimal relay nodes combined with residual energy and communication cost information.
4, build a simulation environment in OMNET++ simulation platform. In the same simulation environment, the realization of the EDU algorithm and DEEC routing algorithm for heterogeneous wireless sensor networks, EDBCA simulation experiments. The experimental results show that EDU algorithm and DEEC EDBCA algorithm, can effectively balance network load, prolong the network life cycle. The same simulation environment, the realization of the EDA algorithm and I-LEACH DEBUC simulation experiments. The experimental results show that EDA algorithm and I-LEACH DEBUC algorithm, it has better stability, better able to balance the network energy consumption, improve energy efficiency, prolong the network life cycle.

【學位授予單位】：山東師范大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP212.9;TN929.5

【引證文獻】

相關碩士學位論文 前1條

1 吳楠;傳感器網(wǎng)絡中節(jié)點自身定位方法的研究[D];山東師范大學;2015年

本文編號：1382480