Toward aggregating time-discounted information

  • Authors:

  • Stephan Olariu;Shahram Mohrehkesh;Michele C. Weigle

  • Affiliations:

  • Old Dominion University, Norfolk, VA, USA;Old Dominion University, Norfolk, VA, USA;Old Dominion University, Norfolk, VA, USA

  • Venue:
  • Proceedings of the 2nd ACM annual international workshop on Mission-oriented wireless sensor networking
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper provides a way to think formally about the aggregation processes that take place in networks where individual actors (whether sensors, robots, or people) possess data whose value is discounted over time. The various actors use data to make decisions: the larger the value, the better (i.e. more informed) the decision. At every moment, individual actors have the choice of making a decision or else to defer decision to a later time. However, the longer they wait, the lower the value of the data they hold. To counter-balance the effect of time discounting, we define an algebraic operation that we call aggregation, whereby two or more actors integrate their data in the hope of increasing its value. Our main contribution is a formal look at the value of time-discounted information and at the algebra of its aggregation. We allow aggregation of time-discounted information to proceed in an arbitrary, not necessarily pairwise, manner. Our model relates aggregation decisions to the ensuing value of information and suggests natural thresholding strategies for the aggregation of the information collected by sets of network actors. A sensor network with the mission of intrusion detection is used throughout as an illustrative example. The accuracy of our theoretical predictions was confirmed by simulating a number of realistic scenarios.