Clustering algorithms for wireless ad hoc networks
Lakshmi Ramachandran, Manika Kapoor, Abhinanda Sarkar, Alok Aggarwal · 2000
Efficient clustering algorithms play a very important role in the fast connection establishment of ad hoc networks. In this paper, we describe a communication model that is derived directly from that of Bluetooth, an emerging technology for pervasive computing; this technology is expected to play a major role in future personal area network applications. We further propose two new distributed algorithms for clustering in wireless ad hoc networks. The existing algorithms often become infeasible because they use models where the discovering devices broadcast their Ids and exchange substantial information in the initial stages of the algorithm.