A Novel Simple Distributed Algorithm for Cluster Organization of Wireless Sensor Networks

Abstract

This paper proposes an innovative distributed algorithm for cluster organization of wireless sensor networks (WSN), named DSCO. Simple logic, connectionless information exchange and asynchronism are prominent features of the algorithm. DSCO involves three correlative processes: cluster organization, cluster reorganization and cluster self-healing. The process of cluster organization is the basic process of DSCO, which adopts random backoff strategy; the cluster reorganization and cluster self-healing processes are recursion of the former, which effectively simplifies the design of the algorithm. Furthermore, DSCO furthest isolates nodes and clusters, and reduces the reliance of global information to minimum, which is useful to reduce the pressure of data storage and processing in nodes, lessen the network traffic and enhance the anti-destroy ability of WSN. The algorithm simulation illustrates that DSCO can get fast clustering speed and uniform distribution of cluster nodes, proves its good performance on clustering rate and topology control, and shows good adaptability to large-scale WSN.