A Framework for Time Indexing in Sensor Networks

Guanghui He, Indranil Gupta, Lui Sha, Rong Zheng

Research output: Contribution to journalArticlepeer-review

Abstract

In this article, we define the time-indexing problem as the in-network storage and querying of sensor network data based solely on the time attribute. We argue qualitatively why existing storage schemes may be insufficient as solutions. We then present, analyze, and evaluate novel and lightweight solutions to both the storage and the querying subproblems for time indexing. First, the time-indexed storage problem is formally defined and two formulations are presented seeking to optimize generic utility functions that are derived from concerns about energy, bandwidth usage, and storage balancing. We present and analyze decentralized protocols to solve these formulations and prove the optimality of some of our solutions. Secondly, maintenance and use of simple overlays among rendezvous point nodes in order to enable fault-tolerant and efficient time-indexed queries are discussed. Finally, simulation results are presented to quantify performance characteristics of the protocols, and we find that our proposed scheme has low query overhead that scales with system size and density while exhibiting very good load-balancing and fault-tolerance properties. The use of time-indexed structure is shown to achieve more than double the lifetime of sensor networks compared to existing approaches in some scenarios.

Original languageEnglish (US)
Pages (from-to)101-133
Number of pages33
JournalACM Transactions on Sensor Networks
Volume1
Issue number1
DOIs
StatePublished - Aug 1 2005

Keywords

  • Design
  • Time indexing
  • information retrieval
  • rendezvous point

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'A Framework for Time Indexing in Sensor Networks'. Together they form a unique fingerprint.

Cite this