兼容弱连通簇的AdHoc网络分簇算法
Computer Engineering(2013)
Abstract
现有分簇算法生成的簇结构都是强连通的单一结构,无法充分利用节点资源。针对该问题,提出一种兼容弱连通簇的分簇算法。定义符合弱连通簇的邻居表结构,并阐述邻居表维护策略,该算法去除簇成员与簇首强连通的条件限制,从而可选择更优的节点作为簇首。分析结果表明,该算法得到的簇结构具有较好的稳定性和持续性。
MoreTranslated text
Key words
Ad Hoc network,cluster member,cluster header,weak connection,clustering algorithm
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined