在无线传感器网络中,虚拟骨干网技术可使得平面网络层次化,从而简化网络路由、数据传输和网络维护.提出一个2-连通r-hop k-支配虚拟骨干网构造算法,本算法通过多次构造r-hop独立集实现k-支配,添加节点使其连通,最终扩展为2-连通支配集,既保证了支配集自身的容错性(2-连通),又保证了被支配节点的容错性(k-支配),本文从理论和仿真上对算法的复杂度、近似比和算法性能做了全面的分析和验证.
The virtual backbone have been used to optimize multi-level hierarchical networks from flat models in wireless sensor networks, which can simplify routing, transmission, maintain. We have developed an algorithm for constructing 2-connected r-hop k-dominating virtual backbone using r-hop maximal independent set, which can be used many times to construct k-dominating sets. The dominating sets become connected by adding connecting nodes. Finally, expanding the r-hop connected k-dominating sets to 2-connected. Not only ensure the dominating sets fault tolerance ( 2-connected), but also ensure dominated nodes fault tolerance ( k-dominating ). The complexity, approximation ratio and performance of the algorithm were given through theoretical analysis and simulations.