Efficient data collection with spatial clustering in time constraint WSN applications

  • Authors:
  • Zhimin Yang;Kaijun Ren;Chang Liu

  • Affiliations:
  • Department of Computer, Shandong University at Weihai, Weihai, P.R. China;College of Computer, National University of Defense Technology, Changsha, Hunan, P.R. China;Faculty of Engineering and Information Technology, University of Technology, Sydney, Australia

  • Venue:
  • ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.