Maximizing system value among interested packets while satisfying time and energy constraints

  • Authors:
  • Shu Lei;Sungyoung Lee;Wu Xiaoling;Yang Jie

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

  • Venue:
  • ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Interest is used as a constraint to filter uninterested data in sensor networks. Within these interested data some are more valuable than others. Sometimes among these interested data, we hope to process the more important data first. By using Reward to denote the important level of data, in this paper, we present a packet scheduling algorithm by considering four constraints (Energy, Time, Reward, and Interest) simultaneously. Based on simulation result, we find out that our ETRI-PS packet scheduling algorithm can substantially improve the information quality and reduce energy consumption.