Clustering algorithm for mobile Ad hoc networks
Shi Xing-rong · Computer Engineering and Applications Journal · 2007
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.