摘要： 研究无线Ad Hoc网络中k-广播和k-组播2种不同拓扑结构控制机制，使网络在 -容错的前提下达到总耗最小。在上述2种拓扑控制机制的基础上，提出一种k-容错拓扑构造算法保证网络拓扑的k-容错性。仿真实验结果表明，与已有的研究成果相比，该算法具有较小的近似比O(k)，且网络总能耗较小。
关键词:
无线Ad Hoc网络,
k-容错,
k-广播,
k-组播
Abstract: This paper studies the construction of k-broadcast and k-multicast topology control problems in wireless Ad Hoc networks. The goal is to achieve the k-fault-tolerance with a minimal overall power assignment. For the two different topology control mechanism, a new framework of approximation algorithm is proposed to maintain the k-fault-tolerant topology. Simulation experiments show the algorithm has a smaller approximation ratio of O(k) and the total energy consumption is smaller than existing results.
Key words:
wireless Ad Hoc network,
k-fault-tolerant,
k-broadcast,
k-multicast
中图分类号:
姜洪璐, 禹继国, 王光辉. 无线Ad Hoc网络中k-容错拓扑构造算法[J]. 计算机工程, 2012, 38(9): 72-75.
JIANG Hong-Lu, YU Ji-Guo, WANG Guang-Hui. k-fault-tolerant Topology Construction Algorithm in Wireless Ad Hoc Network[J]. Computer Engineering, 2012, 38(9): 72-75.