摘要
提出了一种分布式最小连通支配集求解算法,对Rule K算法中的标记算法进行了优化,从而形成了连通支配集,并通过新的剪枝算法对连通支配集进行了有效缩减.模拟仿真结果表明:在增加算法复杂度的前提下,该算法求得的连通支配集比前算法更小.
Minimum connected dominating set(MCDS) is a NP-C problem,and it is generally solved using approximate methods.A distributed minimum connected dominating set algorithm is proposed.It optimizes the marking process of the Rule K algorithm to construct a connected dominating set,and a new pruning algorithm is formed to reduce CDS.The simulation results show that the size of the connected dominating set is smaller than the previous dominating set.
出处
《西安石油大学学报(自然科学版)》
CAS
北大核心
2012年第5期102-105,12,共4页
Journal of Xi’an Shiyou University(Natural Science Edition)
关键词
无线传感器网络
最小连通支配集
剪枝算法
wireless sensor network
minimum connected dominating set
pruning algorithm