一种适合移动自组网的分簇算法

分级结构的Ad hoc网络可以减少路由开销,满足网络规模扩充的需要。提出了一种基于最小ID分簇算法的改进算法,根据节点移动性和电量消耗重新分配ID,然后利用分簇快速、操作简单、效率高的最小ID分簇算法进行重新分簇,仿真实验显示与传统最小ID分簇算法（LID）、最大节点度分簇算法（HD）和基于权值的分簇算法（WCA）相比,算法能使网内节点电量消耗更平衡,簇结构更稳定,能够延长网络的服务时间。

Clustering algorithm for mobile Ad hoc networks

The architecture of grade in ad hoc networks can reduce the route cost,and satisfies the request which the network extended.A reassignment ID clustering algorithm is proposed which reassignment node ID according to the node mobility and energy power consumption.Then lowest ID clustering algorithm is invoked due to its fast,simplicity and inexpensive completion of clustering process.The simulation result demonstrates that this algorithm than traditional lowest ID algorithm(LID),highest connect degree algorithm(HD) and weight algorithm(WCA) has more stable structure,energy power consumption is uniformly distributed among network nodes,and that the network lifetime is extended.