无线传感器网络的二终端可靠性优化  

Two-Terminal Reliability Optimization in Wireless Sensor Networks

作　　者：唐敏[1] 邵方明[2] 孟华军[1] 

机构地区：[1]大连海事大学数学系,辽宁大连116026 [2]华东理工大学理学院,上海200237

出　　处：《传感技术学报》2006年第3期908-912,916,共6页Chinese Journal of Sensors and Actuators

摘　　要：研究的问题是无线传感器网络中一些节点由于能量耗尽导致节点损坏而影响二终端网络可靠性的优化问题,提出了无线传感器网络中,m个节点被损毁情况下使得边不交道路可靠性最大的优化问题。通过引入s-t子图边不交道路可靠性的概念,本文建立了一个优化模型,在该模型中,当C0满足C0≥C(C是设计的启发式算法得到的最可靠的s-t子网中所包含的节点数),而被损毁的节点数m≤|V|-C时,给出了寻找源点与终端节点之间最大的s-t子图可靠性的启发式算法,即最大边不交道路可靠性算法,并证明了这个算法的计算复杂性是多项式时间的。仿真结果说明在损坏的节点数小于给定条件时该算法有效地处理该优化问题。此外也用类似的方法简单地处理了优化模型中C0≤C′时的最大s-t子图可靠性,其中C′是最短s-t道路中所含的点数。This paper studies the reliability optimization in the wireless sensor network. The two-terminal reliability and topology of network will be affected because of the sensors energy being exhausted. This paper proposes the reliability optimization for edge-disjoint paths under m nodes＇ malfunction. By introducing the notion of s-t sub-graphs, a math model is set up. By DPSP pathset selection technique of searching the most reliable edge-disjoint paths between source and destination, an optimal algorithm, maximum edge-disjoint pathset reliability algorithmis present, which can figure out the most optimal s-t sub-network reliability as m≤｜V｜-C （C is the number of active sensor nodes of the most reliable s-t sub-graphs gained from the MEDPR algorithm）. The proposed results illustrate the effectiveness of the algorithm. the optimization model, where C＇ is the number of algorithm is polynomial time. Consequently simulation Furthermore, we also deal with the case that C0≤C＇ in nodes in the shortest s-t path.

关 键 词：边不交道路 二终端可靠性 无线传感器网络 

分 类 号：TP212[自动化与计算机技术—检测技术与自动化装置] TN919.2[自动化与计算机技术—控制科学与工程]