计算机科学 ›› 2012, Vol. 39 ›› Issue (6): 89-92.
• 计算机网络与信息安全 • 上一篇 下一篇
章韵,巨德文,陈志,雇罗全,岳文静
出版日期:
发布日期:
Online:
Published:
摘要: 在汇聚节点移动可预测情况下,提出一种无线传感网分簇算法。该算法将subsink节点引入到HEED分簇算法中,以较快感知移动路径变化,快速形成分簇拓扑;采用sink节点注册机制,实现汇聚节点移动过程中的信息交互。实例分析表明,该算法能快速形成合理网络拓扑,延长无线传感网的生存期。
关键词: 无线传感网,移动sink,分簇算法
Abstract: A clustering algorithm for wireless sensor networks was presented under the predictable mobility condition of the sink node. The proposed algorithm introduces subsink node into the HEED clustering algorithm to achieve faster sensing of mobile track changes and quick formation of clustered topologies, and uses the sink node registration to achieve the information exchange in the sink node mobile process. Case analysis shows that the algorithm can quickly form a rational network topology and prolong the lifetime of wireless sensor networks.
Key words: Wireless sensor networks, Mobile sink, Clustering algorithm
章韵,巨德文,陈志,雇罗全,岳文静. 基于可预测移动汇聚节点的无线传感网分簇算法研究[J]. 计算机科学, 2012, 39(6): 89-92. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2012/V39/I6/89
Cited