论文部分内容阅读
This paper proposes a distributed dynamic k-medoid clustering algorithm for wireless sensor networks (WSNs),DDKCAWSN.Different from node-clustering algorithms and protocols for WSNs,the algorithm focuses on clustering data in the network.By sending the sink clustered data instead of practical ones,the algorithm can greatly reduce the size and the time of data communication,and further save the energy of the nodes in the network and prolong the system lifetime.Moreover,the algorithm improves the accuracy of the clustered data dynamically by updating the clusters periodically such as each day.Simulation results demonstrate the effectiveness of our approach for different metrics.
This paper proposes a distributed dynamic k-medoid clustering algorithm for wireless sensor networks (WSNs), DDKCAWSN.Different from node-clustering algorithms and protocols for WSNs, the algorithm focuses on clustering data in the network.By sending the sink clustered data instead of of实用 的, the algorithm can greatly reduce the size and the time of data communication, and further save the energy of the nodes in the network and prolong the system lifetime. Moreover, the algorithm improves the accuracy of the clustered data dynamically by updating the clusters such such as as .S .S .S .S .S .S .S .S .S .S .S im im im