Abstract: A clustering algorithm for wireless sensor networks was presented under the predictable mobility condition of the sink node. The proposed algorithm introduces subsink node into the HEED clustering algorithm to achieve faster sensing of mobile track changes and quick formation of clustered topologies, and uses the sink node registration to achieve the information exchange in the sink node mobile process. Case analysis shows that the algorithm can quickly form a rational network topology and prolong the lifetime of wireless sensor networks.

Key words: Wireless sensor networks, Mobile sink, Clustering algorithm