Abstract
Information processing in wireless sensor networks, demands a theory of computation that allows the minimization of processing effort, and the distribution of this effort is relative to the whole network. When monitoring spatial phenomena, such as temperature or humidity in an indoor environment, it is obvious that some sensors might represent their neighbors well with permitted error. Recently, a new clustering algorithm, named ”affinity propagation”, is proposed. Different from the popular k-centers clustering technique, affinity propagation operates by simultaneously considering all data points as potential cluster centers (called ”exemplars”) and exchanging messages between data points until a good set of exemplars and cluster emerges. In this paper, we apply affinity propagation for choosing exemplars in wireless sensing network. However, a difference is made between the original form AP and the algorithm in our application. The AP algorithm in our experiments is exploited thoroughly, under different spatial constraints. We only consider the relationship between close neighbor nodes under a certain threshold of distance, instead of the pairwise similarities between the whole network nodes. The experiments proved that our methodology can also effectively acquire necessary information of network status. Meanwhile, the scarce resources in network (energy, etc.) can be saved in a more efficient way.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Guestrin, C., Krause, A., Singh, A.: Near-optimal sensor placements in gaussian processes. In: ICML (2005)
Krause, A., Guestrin, C., Gupta, A., Kleinberg, J.: Near-optimal sensor placements: Maximizing information while minimizing communication cost. In: IPSN 2006 (2006)
Bajwa, W., Haupt, J., Sayeed, A., Nowak, R.: Compressive wireless sensing. In: IPSN 2006 (April 2006)
Frey, B., Dueck, D.: Mixture modeling by affinity propagation. Neural Information Processing Systems 18, 379–386 (2006)
Frey, B.J., Dueck, D.: Clustering by passing messages between data points. Science 315(5814), 972–976 (2007)
Guestrin, C.: Sensor network data, http://www-2.cs.cmu.edu/~guestrin/research/data/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, J., Jin, X. (2011). Modeling Wireless Sensor Network with Spatial Constrained Affinity Propagation. In: Wang, Y., Li, T. (eds) Practical Applications of Intelligent Systems. Advances in Intelligent and Soft Computing, vol 124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25658-5_73
Download citation
DOI: https://doi.org/10.1007/978-3-642-25658-5_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25657-8
Online ISBN: 978-3-642-25658-5
eBook Packages: EngineeringEngineering (R0)