A light-weight contention-based clustering algorithm for wireless ad hoc networks
Reza Purtoosi, Hassan Taheri, Abbas Mohammadi, Foroohar Foroozan · 2004
In this paper a new distributed clustering algorithm based on sending beacons has been proposed. In this algorithm, mobile nodes compete with each other to become cluster-head based on the number of neighbors. A simulation study has been conducted in a fully mobile network to investigate the performance of this algorithm. The results show scalability advantage of this algorithm in networks with a large number of mobile nodes based on the average number of generated clusters and stability of the created clusters. The comparison with other algorithms shows the flexibility and suitability of the new algorithm.