A Clustering Algorithm for Mobile Ad-Hoc Network
Cheng Wei · Chinese Journal of Computers · 2005
In this paper, a clustering algorithm for ad hoc network named D-tree is proposed. After calculating the value of relation between ad hoc network nodes by using relativity concept, the D-tree algorithm can be used for clustering the random located mobile nodes. The analysis and simulation of D-tree has been implemented and the relation between network variables has been got.