Efficient data collection with spatial clustering in time constraint WSN applications

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

Abstract

With the development of wireless sensor networks, more and more applications require the high data rate and real time decision making based on sensing data. In this paper, to achieve energy efficiency and quick reaction to real time event monitoring, a novel algorithms for collecting WSN data based on clustering is proposed. The algorithm depends on the similarity to cluster sensor nodes. In every cluster, only one representative node needs to report its data. Hence, the time slots of other nodes can be saved. When there is an event monitoring query offered by users, the query evaluation can return a query answer as soon as possible. Significant reaction time then can be saved. Furthermore, with the reduced reaction time, less sensor nodes are involved in the data communication, the energy efficiency can also be achieved in terms of transmission because of longer sleeping time can be guaranteed. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Yang, Z., Ren, K., & Liu, C. (2013). Efficient data collection with spatial clustering in time constraint WSN applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7719 LNCS, pp. 728–742). https://doi.org/10.1007/978-3-642-37015-1_64

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