On studying partial coverage and spatial clustering based on Jensen-Shannon divergence in sensor networks

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The idea of partial coverage is provided in this paper, which means that the distance among data trends gathered by neighbor sensors is so small that, in some period, we can cluster those sensors, and replace the cluster with certain sensor in this cluster to form the virtual sensor network topology. But adopting this approach, we need to solve two problems: 1) how to characterize the distance among data trends (rather than raw data) of different sensors; 2) based on the distance, how to form the cluster and use the virtual network to represent the whole sensor network within certain error range; For the first problem, the Jensen-Shannon Divergence (JSD) is used to characterize the distance among different distributions which represent the data trend of sensors. Then, based on JSD, a hierarchical clustering algorithm is provided to form the virtual sensor network topology. Finally, the performance of our approach is evaluated through simulation. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Wang, Y., & Wang, W. (2006). On studying partial coverage and spatial clustering based on Jensen-Shannon divergence in sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3842 LNCS, pp. 236–240). Springer Verlag. https://doi.org/10.1007/11610496_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free