摘要
针对现有分簇算法存在全网唯一ID的假设及簇结构稳定性不高等问题,提出一种基于稳定度的分簇算法。该算法可消除全网唯一ID的假设,收敛快,且簇结构具有更好的稳定性和持续性。分析及实验仿真结果证明,该算法具有较高的数据包投递率以及较低的路由开销。
To tackle the problems of existing clustering algorithms, such as the assumption of unique ID in the whole network and unstable cluster structure etc., a clustering algorithm for Ad Hoc network based on stability degree is proposed. This algorithm removes the assumption of the unique ID though the stability degree based clustering algorithm, and converges fast, and the cluster structure built by this algorithm has better stability and continuity. Analysis and simulation verifies that the algorism has high packet delivery ratio and low routing overhead.
出处
《计算机工程》
CAS
CSCD
2012年第17期98-101,105,共5页
Computer Engineering
基金
重庆市自然科学基金资助项目(CSTC
2010BB2248)
中央高校基本科研业务费专项基金资助项目(CDJZR10090002)
关键词
分簇算法
Ad
HOC网络
簇头
稳定度
能耗
clustering algorithm
Ad Hoc network
cluster header
stability degree
energy consumption
