A routing algorithm for distributed optimal double loop computer networks is proposed and analyzed. In this paper, the routing algorithm rule is described, and the procedures realizing the algorithm are given. The pr...A routing algorithm for distributed optimal double loop computer networks is proposed and analyzed. In this paper, the routing algorithm rule is described, and the procedures realizing the algorithm are given. The proposed algorithm is shown to be optimal and robust for optimal double loop. In the absence of failures,the algorithm can send a packet along the shortest path to destination; when there are failures,the packet can bypasss failed nodes and links.展开更多
A dist ributed optimal local double loop (DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definition...A dist ributed optimal local double loop (DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter d and average hop distance a for this class of networks are [3N- 2]≤d≤[3N ] and (5N/9 (N-1))-(3N -1.8)<a<(5N/9(N-1)) (3N -0.9),respectively (N is the number of nodes in the network ). A class of the distributed routing algorithms for the DOLDL and the implementation procedure of an adaptive fault-tolerant algorithm are proposed and analyzed. The correctness of the algorithm has also been verified by simulating.展开更多
This paper divides the vertex set into several disjoined subsets and provides an optimal fault-tolerance routing algorithm based on the vertex set partition. This algorithm is efficient and convergent, in polynomial t...This paper divides the vertex set into several disjoined subsets and provides an optimal fault-tolerance routing algorithm based on the vertex set partition. This algorithm is efficient and convergent, in polynomial time, we can get the output if the vertex is given.展开更多
Based on their "Theorem 2", an O(δ)-time algorithm of searching for the shortest path between each pair of nodes in a double loop network was proposed by K.Mukhopadyaya, et al.(1995). While, unfortunately, ...Based on their "Theorem 2", an O(δ)-time algorithm of searching for the shortest path between each pair of nodes in a double loop network was proposed by K.Mukhopadyaya, et al.(1995). While, unfortunately, it will be proved that both "Theorem 2" and its proof are in error. A new and more faster O(△)-time, △≤δ, algorithm will be presented in this paper.展开更多
针对现有电力通信网路由算法不能为业务分配双路由的问题,提出一种最可靠环路策略下的最大不相交双路由算法(the maximally disjoint routing algorithm under the most reliable loop strategy,MRMLS)。研究了公共通信网中三种类型的...针对现有电力通信网路由算法不能为业务分配双路由的问题,提出一种最可靠环路策略下的最大不相交双路由算法(the maximally disjoint routing algorithm under the most reliable loop strategy,MRMLS)。研究了公共通信网中三种类型的双路由算法,考虑了双路由算法可能面临的网络结构,阐述了采用最大不相交双路由算法的必要性。分析了最大不相交双路由的可靠性,并采用最可靠环路策略完成最大不相交双路由的分配工作。改进了原有最大不相交双路由算法,使所提算法充分考虑节点与链路的可靠性。仿真实验将MRMLS与其他两种方法进行对比,验证了MRMLS的可行性与有效性。展开更多
针对无线传感器网络分簇结构中簇头节点能量消耗过快而容易死亡的问题,提出了一种适合于水稻田监测的混合天线组网通信的能量异构双簇头分簇路由算法。首先估算全网平均剩余能量确定阈值,根据阈值选择主簇头;然后依据节点向主簇头节点...针对无线传感器网络分簇结构中簇头节点能量消耗过快而容易死亡的问题,提出了一种适合于水稻田监测的混合天线组网通信的能量异构双簇头分簇路由算法。首先估算全网平均剩余能量确定阈值,根据阈值选择主簇头;然后依据节点向主簇头节点发送应答信号强弱的原则,确定簇成员节点;最后,按照簇内成员节点剩余能量大小,选择一个副簇头。副簇头负责收集并融合簇内其他成员节点的数据,从而减轻主簇头的能量消耗,降低主簇头的死亡概率。采用能量异构网络对本算法进行仿真,网络节点初始总能量的平均值与同构网络节点初始能量相等,结果显示,该算法异构网络相对于LEACH(low-energy adaptive clustering hierarchy)算法同构网络的稳定周期延长了12.1%。采用无线通信模块nRF905射频芯片和TDJ-0825BKM1定向天线,在水稻田进行混合天线通信试验,测试了定向天线水平覆盖范围;在此基础上的网络模拟试验结果表明,基于该算法的通信网络稳定周期比值相比于LEACH、LEACH-E(LEACH-energy adaptive and uneven cluster)、DEEC(design of energy efficient clustering)、EADC(energy aware data-gathering cluster-heads)4种算法分别提高了46%、47%、58%、11%。该研究可为大面积水稻田无线传感器网络组网进行环境参数实时监测提供理论参考。展开更多
文摘A routing algorithm for distributed optimal double loop computer networks is proposed and analyzed. In this paper, the routing algorithm rule is described, and the procedures realizing the algorithm are given. The proposed algorithm is shown to be optimal and robust for optimal double loop. In the absence of failures,the algorithm can send a packet along the shortest path to destination; when there are failures,the packet can bypasss failed nodes and links.
文摘A dist ributed optimal local double loop (DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter d and average hop distance a for this class of networks are [3N- 2]≤d≤[3N ] and (5N/9 (N-1))-(3N -1.8)<a<(5N/9(N-1)) (3N -0.9),respectively (N is the number of nodes in the network ). A class of the distributed routing algorithms for the DOLDL and the implementation procedure of an adaptive fault-tolerant algorithm are proposed and analyzed. The correctness of the algorithm has also been verified by simulating.
基金This project is supported by National Natural Science Foundation of Chins （10371049） and Science Foundation of Three Gorges University
文摘This paper divides the vertex set into several disjoined subsets and provides an optimal fault-tolerance routing algorithm based on the vertex set partition. This algorithm is efficient and convergent, in polynomial time, we can get the output if the vertex is given.
基金Supported by the National Natural Science Foundation of China(No.69772035)
文摘Based on their "Theorem 2", an O(δ)-time algorithm of searching for the shortest path between each pair of nodes in a double loop network was proposed by K.Mukhopadyaya, et al.(1995). While, unfortunately, it will be proved that both "Theorem 2" and its proof are in error. A new and more faster O(△)-time, △≤δ, algorithm will be presented in this paper.
文摘针对现有电力通信网路由算法不能为业务分配双路由的问题,提出一种最可靠环路策略下的最大不相交双路由算法(the maximally disjoint routing algorithm under the most reliable loop strategy,MRMLS)。研究了公共通信网中三种类型的双路由算法,考虑了双路由算法可能面临的网络结构,阐述了采用最大不相交双路由算法的必要性。分析了最大不相交双路由的可靠性,并采用最可靠环路策略完成最大不相交双路由的分配工作。改进了原有最大不相交双路由算法,使所提算法充分考虑节点与链路的可靠性。仿真实验将MRMLS与其他两种方法进行对比,验证了MRMLS的可行性与有效性。
文摘针对无线传感器网络分簇结构中簇头节点能量消耗过快而容易死亡的问题,提出了一种适合于水稻田监测的混合天线组网通信的能量异构双簇头分簇路由算法。首先估算全网平均剩余能量确定阈值,根据阈值选择主簇头;然后依据节点向主簇头节点发送应答信号强弱的原则,确定簇成员节点;最后,按照簇内成员节点剩余能量大小,选择一个副簇头。副簇头负责收集并融合簇内其他成员节点的数据,从而减轻主簇头的能量消耗,降低主簇头的死亡概率。采用能量异构网络对本算法进行仿真,网络节点初始总能量的平均值与同构网络节点初始能量相等,结果显示,该算法异构网络相对于LEACH(low-energy adaptive clustering hierarchy)算法同构网络的稳定周期延长了12.1%。采用无线通信模块nRF905射频芯片和TDJ-0825BKM1定向天线,在水稻田进行混合天线通信试验,测试了定向天线水平覆盖范围;在此基础上的网络模拟试验结果表明,基于该算法的通信网络稳定周期比值相比于LEACH、LEACH-E(LEACH-energy adaptive and uneven cluster)、DEEC(design of energy efficient clustering)、EADC(energy aware data-gathering cluster-heads)4种算法分别提高了46%、47%、58%、11%。该研究可为大面积水稻田无线传感器网络组网进行环境参数实时监测提供理论参考。
