Time indexing in sensor networks

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI:10.1109/MAHSS.2004.1392166

Rong L. Zheng, Guanghui He, Indranil Gupta, L. Sha

{"title":"Time indexing in sensor networks","authors":"Rong L. Zheng, Guanghui He, Indranil Gupta, L. Sha","doi":"10.1109/MAHSS.2004.1392166","DOIUrl":null,"url":null,"abstract":"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 sub-problems 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.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MAHSS.2004.1392166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

Abstract

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 sub-problems 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.

查看原文本刊更多论文

传感器网络中的时间分度

我们将时间索引问题定义为仅基于时间属性的传感器网络数据在网络中的存储和查询。我们定性地讨论了为什么现有的存储方案可能不足以作为解决方案。然后，我们提出、分析和评估用于时间索引的存储和查询子问题的新颖轻量级解决方案。首先，对时间索引存储问题进行了正式定义，并提出了两种公式，寻求优化源自对能源、带宽使用和存储平衡的关注的通用效用函数。我们提出并分析去中心化协议来解决这些公式，并证明我们的一些解决方案的最优性。其次，讨论了集合点节点之间简单覆盖的维护和使用，以实现容错和高效的时间索引查询。最后，给出了仿真结果来量化协议的性能特征，我们发现我们提出的方案具有低的查询开销，可以随系统大小和密度的变化而变化，同时具有非常好的负载平衡和容错特性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)

自引率

0.00%

发文量