Advertisement
Published in:
2013 | OriginalPaper | Chapter
Efficient Data Collection with Spatial Clustering in Time Constraint WSN Applications
Authors : Zhimin Yang, Kaijun Ren, Chang Liu
Published in: Pervasive Computing and the Networked World
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.