ETRI-QM: reward oriented query model for wireless sensor networks

  • Authors:
  • Jie Yang;Lei Shu;Xiaoling Wu;Jinsung Cho;Sungyoung Lee;Sangman Han

  • Affiliations:
  • Department of Computer Engineering, Kyung Hee University, Korea;Department of Computer Engineering, Kyung Hee University, Korea;Department of Computer Engineering, Kyung Hee University, Korea;Department of Computer Engineering, Kyung Hee University, Korea;Department of Computer Engineering, Kyung Hee University, Korea;Department of Computer Engineering, Kyung Hee University, Korea

  • Venue:
  • EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Since sensors have a limited power supply, energy-efficient processing of queries over the network is an important issue. As data filtering is an important approach to reduce energy consumption, interest is used to be a constraint to filter uninterested data when users query data from sensor networks. Within these interested data, some of them are more important because they may have more valuable information than that of the others. We use ‘Reward’ to denote the importance level of data. Among the interested data, we hope to query the most important data first. In this paper, we propose a novel query model ETRI-QM and a new algorithm ETRI-PF (packet filter) dynamically combines the four constraints: Energy, Time, Reward and Interest. Based on our simulation results, we find out that our ETRI-QM together with ETRI-PF algorithm can improve the quality of the information queried and also reduce the energy consumption.