Joint Distributed Clustering and Ranging for Wireless Ad-Hoc Sensor Networks

This paper discusses a joint decentralized clustering and ranging algorithm for wireless ad-hoc sensor networks. Each sensor uses a random waiting timer and local criteria to determine whether to form a new cluster or to join a current cluster and utilizes the messages transmitted during hierarchical clustering to establish two-way communications so that clock calibration for distance estimation can be achieved. The algorithm operates without a centralized controller, it operates asynchronously, and does not require that the location of the sensors be known a priori. An analysis of the distance measurement, and the energy requirements of the algorithm are used to study the behaviors of the proposed algorithm. The performance of the algorithm is described analytically and via simulation.