一种通过加入中继节点以修复大面积网络损坏的能量均衡算法  

An Energy-efficient Healing Algorithm for Connectivity Restoration in Wireless Sensor Networks through Relay Node Placement

作　　者：黄健文[1] 倪卫明[1] 

机构地区：[1]复旦大学通信科学与工程系

出　　处：《微型电脑应用》2013年第4期58-61,共4页Microcomputer Applications

摘　　要：研究了在大面积受损的无线传感网(WSN)中通过加入中继节点(RN)来修复网络连通性的问题,以修复代价最小化为目标提出了新的算法,目标包括减少中继节点数并均衡节点能量。为了减少中继节点数,在每个分区的边界上寻找代表节点,借助最小生成树、费马点、Steiner树的经典方法。为了均衡网络节点的剩余能量,在分区中选择能量最大的作为代表节点,并让能量大的节点分担更多传输任务。算法优化了所需中继节点的数量,且样本值保持在均值15%区间范围内。此问题可以看作SMT-MSP问题,算法在多项式时间内解决连通性修复,其性能通过仿真进行了验证。This paper studies the problems of connectivity restoration through relay nodes placement in large scale damaged Wireless Sensor Networks, and proposed an improved algorithm, the objective of which is to reduce the number of relay nodes and the balance of energy. To reduce the number of relay nodes, we pick representative node on the border of each partition, and find location of the relay nodes with assist of classic minimum spanning tree, Fermat point and Steiner tree. To balance nodes＇ energy, representative node with largest energy is picked on each border, and those nodes with larger energy will undertake more transmission task. The algorithm optimizes the number of relay nodes needed, which stays within 15% of the sample mean, is lowered. The problem can be considered as MST-SMP and be solved within polynomial time. Performance of the proposed algorithm is validated through simulation process.

关 键 词：无线传感网 连通性修复 中继节点 算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]