计算机科学 ›› 2011, Vol. 38 ›› Issue (Z10): 305-307.

• 无线网络与通信技术 • 上一篇    下一篇

基于凸区域容错性的拓扑控制算法

孙若姿,袁坚,山秀明,任勇   

  1. (清华大学电子工程系 北京 100084)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Convex Region Fault-tolerance Based Topology Control Algorithm

SUN Ruo-zi, YUAN Jian , SHAN Xiu-ming, REN Yong   

  • Online:2018-11-16 Published:2018-11-16

摘要: 目前多数研究以连通度来衡量无线网络的容错性。连通度没有考虑失效节点的位置关系,任意节点组合会同时失效,而无线网络失效的节点间通常具有空间相关性,即处于一个局域的节点更可能会同时失效,尤其在军事应用中,比如炸弹的袭击,会导致一个局域内的节点失效,因此连通度度量容错性并不适合无线网络场景。考虑无线网络失效节点具有空间相关性的特点,提出凸区域容错性概念,并基于此,提出拓扑控制算法C-RH I'。理论证明C-RFT算法生成的网络能保持原始图的凸区域容错性,仿真结果表明经过GRFT算法拓扑控制的网络的平均逻辑度值和平均传输半径有明显下降。

关键词: 容错性,连通度,凸区域,空间相关性

Abstract: At present, most studies utilize connectivity to evaluate fault tolerance of wireless networks. As a metric of fault tolerance, connectivity fails to consider spatial relativity of failed nodes and assumes that any node group can fail simultaneously. In fact, the faults generally have strong spatial correlativity in wireless networks. It is particularly true in military application that the nodes located in the same limited area will fail simultaneously such as due to the damage of an enemy bomb. Therefore, connectivity hardly satisfies the fault tolerant design requirements for wireless networks.To capture the feature of the spatial correlations of faults, the notion of convex region fault tolerance was introduced and based on it,a fault-tolerant topology control algorithm named as convex region fault tolerant algorithm(C-RFT) was proposed. It is proved theoretically that GRI门can preserve the convex region fault tolerance of the original graph and simulation results demonstrate that the topology generated by C-RI门' has lower logical degree and transmission rathus compared with original graph.

Key words: Fault tolerance, Connectivity, Convex region, Spatial relativity

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!