本文關鍵詞：無線傳感器網(wǎng)絡不相交多路徑容錯路由研究　出處：《山東大學》2014年博士論文　論文類型：學位論文

  更多相關文章： 無線傳感器網(wǎng)絡 不相交多路徑路由 容錯 中心計算 定制冗余 路徑代理 HSV色彩空間 區(qū)域分割

【摘要】：因環(huán)境惡劣、能量受限和無線信道不可靠等特性,無線傳感器網(wǎng)絡經常出現(xiàn)節(jié)點損壞、通信鏈路中斷等故障,使得數(shù)據(jù)傳輸?shù)男瘦^低,難以滿足實際的應用需求,因此容錯(Fault Tolerance)能力是衡量無線傳感器網(wǎng)絡性能的一個重要指標。傳統(tǒng)網(wǎng)絡的容錯技術由于沒有綜合無線傳感器網(wǎng)絡的上述特性,因而難以應用于無線傳感器網(wǎng)絡的實際。無線傳感器網(wǎng)絡的容錯性是指當部分節(jié)點或鏈路失效后,能夠進行傳輸數(shù)據(jù)的恢復或者網(wǎng)絡結構自愈。當前對無線傳感器網(wǎng)絡的容錯技術的研究主要集中在以下五個方面：硬件容錯、覆蓋容錯、路由容錯、事件容錯和應用容錯。其中,路由容錯是無線傳感器網(wǎng)絡容錯研究的基礎和重點。 多路徑容錯路由是路由容錯的主要方式,相比于單路徑路由機制,它在傳輸可靠性、均衡負載、容錯恢復等方面具有明顯的優(yōu)勢。但是,在多路徑路由機制中,從源節(jié)點到目的節(jié)點的多條路徑中可能包含公共節(jié)點(鏈路),公共節(jié)點(鏈路)的失效會造成多條路徑的傳輸失敗。而不相交多路徑路由機制可以有效避免公共節(jié)點(鏈路)的出現(xiàn),從而顯著提升多路徑路由的容錯性能。 不相交多路徑容錯路由機制面臨的主要難題有三個：一是公共節(jié)點(鏈路)避免問題,即通過何種路徑規(guī)劃機制實現(xiàn)從源節(jié)點到目的節(jié)點的多條路徑的不相交；二是不相交多路徑選優(yōu)問題,即在路徑不相交的約束下,如何優(yōu)化路徑選擇過程以達到節(jié)省能量和提高容錯性能；三是節(jié)點移動帶來的路徑斷裂問題,即在網(wǎng)絡拓撲產生變化的情況下,如何以最小的代價實現(xiàn)不相交多路徑的快速恢復。本文針對上述問題,基于數(shù)據(jù)冗余和路徑冗余方法,對無線傳感器網(wǎng)絡的不相交多路徑容錯路由機制進行了研究。本文的研究主要立足于五個方面：(1)網(wǎng)絡的多路徑不相交約束模型；(2)中心計算方式的不相交多路徑規(guī)劃和維護機制；(3)分布式計算方式的不相交多路徑規(guī)劃和維護機制；(4)節(jié)點移動情況下的不相交多路徑規(guī)劃和維護機制；(5)有負載均衡要求情況下的不相交多路徑規(guī)劃和維護機制。本文取得的研究成果包括如下幾個方面： 1.中心計算的2-不相交路徑容錯路由算法：針對某些工業(yè)應用中網(wǎng)絡拓撲比較穩(wěn)定,sink節(jié)點運算存儲能力較強等特點,利用全網(wǎng)信息計算出從源節(jié)點到sink節(jié)點的近似最優(yōu)2-節(jié)點(鏈路)不相交路徑,然后生成微路由表并下傳到每個節(jié)點,采用中心調度的自適應機制提高路徑維護的靈活性。 2.面向不相交多路徑的multi-routing tree拓撲結構：提出了一種面向不相交多路徑的multi-routing tree拓撲結構,由一個唯一的根節(jié)點和一組特殊的子樹構成。該組子樹滿足如下三個約束：一是任意子樹都是點可相交的,二是任意子樹都是邊不相交的,三是連接任一節(jié)點與其子節(jié)點的邊必屬于同一子樹。在該樹結構下,從源節(jié)點沿不同子樹到達根節(jié)點的路徑是不相交的。 3.基于1multi-routing tree的不相交多路徑容錯路由算法：采用集中式和分布式兩種算法在網(wǎng)絡中實現(xiàn)multi-routing tree,提出一種能量消耗與容錯性能的平衡模型：定制冗余模型,為源數(shù)據(jù)實現(xiàn)三種模式的定制冗余：重發(fā)冗余、路徑冗余和混合冗余。 4.采用HSV色彩空間分離模型的不相交多路徑容錯路由算法：針對節(jié)點移動帶來的路徑斷裂問題,采用HSV色彩空間模型為每條鏈路建立數(shù)值化的(h,s,v)三元組,并分離使其屬于不同的色彩平面,按照不同色彩平面構造從源節(jié)點到目的節(jié)點的多條節(jié)點不相交路徑,設計基于可變時間間隔鏈路接收信號強度指示值探測的不相交多路徑維護機制。 5.采用區(qū)域分割模型的不相交多路徑容錯路由算法：基于地理位置信息,將網(wǎng)絡部署區(qū)域分割成若干組互不重疊的元區(qū)域鏈,使得源節(jié)點沿不同的元區(qū)域鏈可以生成到目的節(jié)點的多條不相交路徑,通過化“移動節(jié)點”為“靜止區(qū)域”的思想解決移動無線傳感器網(wǎng)絡的不相交多路徑容錯路由問題。 6.基于路徑代理的負載均衡不相交多路徑容錯路由算法：基于路徑代理思想設計,根據(jù)“一個鄰居一個路徑代理服務,不同鄰居不同路徑代理服務”的路由選擇原理,算法獲得的從源節(jié)點到sink節(jié)點的多條路徑是鏈路不相交的。提出了一種負載均衡模型,將數(shù)據(jù)流量均衡地覆蓋到多條路徑中,以延長網(wǎng)絡生存期。
[Abstract]:Because of bad environment, energy is limited and unreliable wireless channel characteristics of wireless sensor network nodes often damaged, communication interruption link fault, the data transmission efficiency is low, it is difficult to meet the needs of practical applications, so the fault tolerance ability (Fault Tolerance) is an important index to measure the performance of wireless sensor networks in traditional network. Because of the characteristics of fault-tolerant technology without integrated wireless sensor network, the actual and difficult to be applied to wireless sensor network. The fault tolerance in wireless sensor networks is when some nodes or links fail, can be restored or self-healing network structure of data transmission. The current research on wireless sensor network fault-tolerant technology mainly focus on the following five aspects: hardware fault coverage, fault tolerance, fault tolerant routing, fault tolerance and fault tolerant event application. Among them, Lu Yourong is wrong in wireless The foundation and emphasis of fault tolerance research on sensor networks.
Multi path routing fault-tolerant routing is the main way of fault tolerance, compared to single path routing mechanism, its load balancing in transmission reliability, fault tolerance, and other aspects of recovery has obvious advantages. However, in the multi path routing mechanism, multiple paths from the source node to the destination node may contain a common node (link), public node (link) transmission failure creates multiple paths fail. And disjoint multipath routing mechanism can effectively avoid the common node (link) appears to significantly enhance the fault-tolerant performance of multipath routing.
The main problem facing the disjoint multi path fault tolerant routing mechanism has three: one is the public node (link) to avoid problems, through which path planning mechanism to realize multiple paths from the source node to the destination node disjoint; two is disjoint multi path selection problem, namely in disjoint path constraints and how to optimize the path selection process to save energy and improve the fault tolerance performance; three is the problem of path breakage caused by the movement of nodes, which produce changes in the network topology, how to minimize the cost to achieve rapid recovery of disjoint multipath. Aiming at the above problems, data redundancy and path redundancy method based on wireless sensor network disjoint multipath routing mechanism was studied in this paper. The research is mainly based on five aspects: (1) multi path disjoint constraint model; (2) center Is the disjoint multi path planning and maintenance mechanism; (3) distributed computing disjoint multi path planning and maintenance mechanism; (4) under the condition of the mobile node disjoint multi path planning and maintenance mechanism; (5) the load balancing requirements under disjoint multipath planning and maintenance mechanism. The research results of this paper are as follows:
1. center calculation 2- disjoint path fault tolerant routing algorithm for network topology is relatively stable in some industrial applications, the sink node computing and storage ability etc., utilization of the network information to calculate the approximate optimal 2- node from source node to the sink node (link) disjoint paths, and then generate micro routing table and to each node, using the adaptive mechanism of center scheduling path to improve maintenance flexibility.
Multi-routing tree topology for 2. disjoint paths: multi-routing tree proposed a topology for disjoint paths, consisting of only one root node and a special set of subtrees. The group subtree satisfies the following three constraints: one is the arbitrary subtrees are point of intersection, two arbitrary subtrees are edge disjoint, three is connected to any node and child nodes need to belong to the same tree. In the tree structure, from the source node along the path to the root nodes in different subtrees are disjoint.
3. disjoint path fault tolerant routing algorithm 1multi-routing based on tree: the centralized and distributed two algorithms multi-routing tree in the network, a model is proposed to balance the energy consumption and the fault-tolerant performance: Custom redundant models, as the data source to achieve customized redundancy in three modes: redundant retransmission, path redundancy and mixed redundancy.
Disjoint path routing algorithm using 4. HSV color space separation model: the problem of path for fracture caused by the movement of nodes, a numerical value for each link using the HSV color space model (h, s, V) three tuple, and that the separation of different colors belong to the plane, according to the different color plane constructed from a node in the source node to the destination node disjoint paths, the design variable time interval link received signal strength indication value detection mechanism based on disjoint path maintenance.
Using 5. disjoint multipath fault-tolerant routing algorithm segmentation model: Based on geographical location information, the network deployment area is divided into several groups of non overlapping area chain, so that the source node along different element area chain to the destination node can generate multiple disjoint paths, through the "mobile node" mobile solution wireless sensor network disjoint multipath fault-tolerant routing problem as "static" thoughts.
6. load balancing proxy path disjoint multipath routing algorithm based on path fault tolerance design based on agent, "according to a neighbor a path different neighbor proxy service, different path routing agent service" principle, the algorithm obtains multiple paths from the source node to the sink node is disjoint. This paper presents a load balancing model, data flow and balanced coverage to more paths, to prolong the network lifetime.

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

【參考文獻】

相關期刊論文 前3條

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

2 李建中,李金寶,石勝飛;傳感器網(wǎng)絡及其數(shù)據(jù)管理的概念、問題與進展[J];軟件學報;2003年10期

3 郜帥;霍宏偉;張宏科;張思東;;基于數(shù)據(jù)采集量均衡的移動無線傳感器網(wǎng)絡節(jié)能機制[J];通信學報;2009年09期

，

本文編號：1441567