| 无线传感器网络中能量有效的最小连通支配集算法 |
| |
| 引用本文： | 于晓,付春.无线传感器网络中能量有效的最小连通支配集算法[J].西安石油大学学报(自然科学版),2012,27(5):102-105,12. |
| |
| 作者姓名： | 于晓 付春 |
| |
| 作者单位： | 西安石油大学计算机学院,陕西西安,710065 |
| |
| 摘 要： | 提出了一种分布式最小连通支配集求解算法,对Rule K算法中的标记算法进行了优化,从而形成了连通支配集,并通过新的剪枝算法对连通支配集进行了有效缩减.模拟仿真结果表明:在增加算法复杂度的前提下,该算法求得的连通支配集比前算法更小.
|
| 关 键 词： | 无线传感器网络 最小连通支配集 剪枝算法 |
An energy-efficient minimum connected dominating set algorithm in wireless sensor network |
| |
| YU Xiao,FU Chun.An energy-efficient minimum connected dominating set algorithm in wireless sensor network[J].Journal of Xian Shiyou University,2012,27(5):102-105,12. |
| |
| Authors: | YU Xiao FU Chun |
| |
| Institution: | (College of Computer Science,Xi’an Shiyou University,Xi’an 710065,Shaanxi,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | wireless sensor network minimum connected dominating set pruning algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
