Spatial Data Correlation Based Clustering Algorithms for Wireless Sensor Networks

In this paper, spatial data correlations are exploited to group sensor nodes into clusters of high data aggregation efficiency. The problem of selecting the set of cluster heads is defined as the weighted connected dominating set problem. Then centralized and distributed algorithms are developed to select the cluster heads. Simulation results demonstrate the effectiveness and efficiency of the designed algorithms.

[1]  Johannes H. Hattingh,et al.  On weakly connected domination in graphs , 1997, Discret. Math..

[2]  Mahdi Lotfinezhad,et al.  Effect of partially correlated data on clustering in wireless sensor networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[3]  Özgür B. Akan,et al.  Spatio-temporal correlation: theory and applications for wireless sensor networks , 2004, Comput. Networks.

[4]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[5]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Vishnu Navda,et al.  Efficient gathering of correlated data in sensor networks , 2008, TOSN.

[8]  Deborah Estrin,et al.  ASCENT: adaptive self-configuring sensor networks topologies , 2004, IEEE Transactions on Mobile Computing.

[9]  Edward J. Coyle,et al.  An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Leonidas J. Guibas,et al.  Wireless sensor networks - an information processing approach , 2004, The Morgan Kaufmann series in networking.