Fault Tolerant Scheme in WSN by Finding Minimum FAS

摘要：

The Feedback Arc Set (FAS) problem asks whether it is possible to delete at most k arcs to make a directed graph acyclic. We present an algorithm to find FAS for some special kinds of directed graphs, which is fundamental to hierarchical security and fault tolerant scheme aiming to improve the security and reliability in Wireless Sensor Networks(WSN). The main idea behind our scheme is to select pivotal nodes as the cluster heads and aggregators with higher defending and computing capability and extra fault tolerant approaches.

关键词： Feedback Arc Set Minimum Set Adjacency Matriz WSNs Security and Fault Tolerant

作者: Guanghui Li Changqing Xu Hailin Feng

作者单位: School of Information Engineering, Zhejiang Forestry University, Hangzhou, 311300, China Department of Applied Mathemtics, Zhejiang Forestry University, Hangzhou, 311300, China

会议类型: 国际会议

会议名称: The Third International Workshop on Applied Matriz Theory(第三届国际矩阵分析与应用会议)

会议地点: 杭州

会议语种:英文

页码: 411-414

在线出版日期: 2009-07-09（万方平台首次上网日期，不代表论文的发表时间）