article

A framework for time indexing in sensor networks

Authors:

Indranil Gupta,

Lui ShaAuthors Info & Claims

ACM Transactions on Sensor Networks (TOSN), Volume 1, Issue 1

Pages 101 - 133

https://doi.org/10.1145/1077391.1077396

Published: 01 August 2005 Publication History

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.

References

[1]

Abrams, Z., Goe, A., and Plotkin, S. 2004. Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In Proceedings of the IEEE International Symposium on Information Processing in Sensor Networks (IPSN'04).

[2]

Alon, N. and Spencer, J. H. 1992. The probablistic method. J. Wiley & Sons.

[3]

Alzoubi, K., Wan, P., and Frieder, O. 2002. Distributed heuristics for connected dominating set in wireless ad hoc networks. J. Comm. Netw. 4, 1 (Mar.).

[4]

Athuraliya, S. and Low, S. H. 2000. Optimization flow control with newton-like algorithm. Telecomm. Syst. 15, 3/4, 345--358.

[5]

Awerbuch, B. 1985. Complexity of network synchronization. J. ACM. 32, 804--823.

[6]

Chvatal, V. 1979. A greedy heuristic for the set covering problem. Math. Operat. Res. 4, 3, 233--235.

[7]

Das, B. and Bharghavan, V. 1997. Routing in ad-hoc networks using minimum connected dominating sets. In IEEE International Conference on Communication (ICC'97), 376--380.

[8]

Elson, J., Girod, L., and Estrin, D. 2002. Fine-grained network time synchronization using reference broadcasts. In Proceedings of Operating Systems Design and Implementation (OSDI'02).

[9]

Handy, M. J., Haase, M., and Timmermann, D. 2002. Low energy adaptive clustering hierarchy. Available at http://www-mtl.mit.edu/ wendi/leach/leach.html.

[10]

Ganesan, D., Greenstein, B., Perelyubskiy, D., Estrin, D., and Heidemann, J. 2003. An evaluation of multi-resolution storage for sensor networks. In Proceedings of the 1st International Conference on Embedded Networked Sensor Systems. ACM Press, 89--102.

[11]

Ghose, A., Grossklags, J., and Chuang, J. 2003. Resilient data-centric storage in wireless ad-hoc sensor networks. In Mobile Data Management (MDM'03). 45--62.

[12]

Greenstein, B., Estrin, D., Govindan, R., Ratanasamy, S., and Shenker, S. 2003. Difs: A distributed index for features in sensor networks. In IEEE Proceedings of the 1st International Workshop on Sensor Network Protocols and Applications (SNPA'03).

[13]

Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D. E., and Pister, K. S. J. 2000. System architecture directions for networked sensors. In Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IX).

[14]

Intanagonwiwat, C., Govindan, R., and Estrin, D. 2000. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of MOBICOM'00.

[15]

Karp, B. and Kung, H. T. 2000. Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th International ACM/IEEE Conference on Mobile Computing and Networking.

[16]

Kuhn, F., Wattenhofer, R., Zhang, Y., and Zollinger, A. 2003. Constant-time distributed dominating set approximation. In Proceedings of the 22nd ACM International Symposium on the Principles of Distributed Computing (PODC'03).

[17]

Li, X., Kim, Y. J., Govindan, R., and Hong, W. 2003. Multi-dimensional range queries in sensor networks. In Proceedings of ACM SenSys'03.

[18]

Low, S. H. and Lapsley, D. E. 1999. Optimization flow control---I: basic algorithm and convergence. IEEE/ACM Trans. Netw. 7, 6, 861--874.

[19]

Madden, S., Franklin, M. J., Hellerstein, J. M., and Hong, W. 2002. Tag: A tiny aggregation service for ad-hoc sensor networks. In Proceedings of Operating Systems Design and Implementation (OSDI'02).

[20]

Massoulie, L. and Roberts, J. 1999. Bandwidth sharing: objectives and algorithms. In Proceedings of IEEE INFOCOM'99.

[21]

Newsome, J. and Song, D. 2003. Gem: Graph embedding for routing and data-centric storage in sensor networks without geographic information. In Proceedings of ACM SenSys'03.

[22]

Polastre, J. 2003. Design and implementation of wireless sensor networks for habitat monitoring. Master's Thesis, University of California at Berkeley.

[23]

Ratnasamy, S., Karp, B., Yin, L., Yu, F., Estrin, D., Govindan, R., and Shenker, S. 2002. GHT: A geographic hash table for data-centric storage in sensornets. In the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA'02) (Sept.). Atlanta, GA.

[24]

Ratnasamy, S., Karp, B., Yin, L., Yu, F., Estrin, D., Govindan, R., and Shenker, S. 2003. Data-centric storage in sensornets with ght, a geographic hash table. In Mobile Networks and Applications (MONET'03), Special Issue on Wireless Sensor Networks.

[25]

Shenker, S., Ratnasamy, S., Karp, R. G. B., and Estrin, D. 2002. Data-centric storage in sensornets. In the 1st ACM SIGCOMM Workshop on Hot Topics in Networks (HotNets'02) (Oct).

[26]

Sinha, P., Sivakumar, R., and Bharghavan, V. 1999. CEDAR: a core-extraction distributed ad hoc routing algorithm. In INFOCOM'99. 202--209.

[27]

Zheng, R., Hou, J. C., and Sha, L. 2003. Asynchronous wakeup for ad hoc networks. In Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'03).

[28]

Zheng, R. and Kravets, R. 2003. On-demand power management for ad hoc network. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'03).

Cited By

Dadgar APhillips JCurrey J(2018)Lifeguard: Local Health Awareness for More Accurate Failure Detection2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W)10.1109/DSN-W.2018.00017(22-25)Online publication date: Jun-2018
https://doi.org/10.1109/DSN-W.2018.00017
Zhu R(2011)Intelligent Collaborative Event Query Algorithm in Wireless Sensor NetworksInternational Journal of Distributed Sensor Networks10.1155/2012/7285218:1(728521)Online publication date: 29-Sep-2011
https://doi.org/10.1155/2012/728521
Monti GMoro GRosetti MTufano G(2010)Self-Organizing Mobile Mesh Networks with Peer-to-Peer Routing and Information Search ServicesProceedings of the 2010 Third International Conference on Advances in Mesh Networks10.1109/MESH.2010.14(17-22)Online publication date: 18-Jul-2010
https://dl.acm.org/doi/10.1109/MESH.2010.14
Show More Cited By

Recommendations

SeRLoc: Robust localization for wireless sensor networks

Many distributed monitoring applications of Wireless Sensor Networks (WSNs) require the location information of a sensor node. In this article, we address the problem of enabling nodes of Wireless Sensor Networks to determine their location in an ...
A kernel-based learning approach to ad hoc sensor network localization

We show that the coarse-grained and fine-grained localization problems for ad hoc sensor networks can be posed and solved as a pattern recognition problem using kernel methods from statistical learning theory. This stems from an observation that the ...
Navigation protocols in sensor networks

We develop distributed algorithms for adaptive sensor networks that respond to directing a target through a region of space. We model this problem as an online distributed motion planning problem. Each sensor node senses values in its perception space ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Sensor Networks

ACM Transactions on Sensor Networks Volume 1, Issue 1

August 2005

152 pages

ISSN:1550-4859

EISSN:1550-4867

DOI:10.1145/1077391

Issue’s Table of Contents

Copyright © 2005 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 01 August 2005

Published in TOSN Volume 1, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
1,740
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Dadgar APhillips JCurrey J(2018)Lifeguard: Local Health Awareness for More Accurate Failure Detection2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W)10.1109/DSN-W.2018.00017(22-25)Online publication date: Jun-2018
https://doi.org/10.1109/DSN-W.2018.00017
Zhu R(2011)Intelligent Collaborative Event Query Algorithm in Wireless Sensor NetworksInternational Journal of Distributed Sensor Networks10.1155/2012/7285218:1(728521)Online publication date: 29-Sep-2011
https://doi.org/10.1155/2012/728521
Monti GMoro GRosetti MTufano G(2010)Self-Organizing Mobile Mesh Networks with Peer-to-Peer Routing and Information Search ServicesProceedings of the 2010 Third International Conference on Advances in Mesh Networks10.1109/MESH.2010.14(17-22)Online publication date: 18-Jul-2010
https://dl.acm.org/doi/10.1109/MESH.2010.14
Su IChung YLee CLin Y(2010)Efficient skyline query processing in wireless sensor networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2010.01.00170:6(680-698)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1016/j.jpdc.2010.01.001
Wu YGao XLi Y(2009)A framework of distributed indexing and data dissemination in large scale wireless sensor networksOptimization Letters10.1007/s11590-009-0149-24:3(335-345)Online publication date: 9-Oct-2009
https://doi.org/10.1007/s11590-009-0149-2
Monti GMoro GLempel RPerego RSilvestri F(2008)Scalable multi-dimensional range queries and routing in data-centric sensor networksProceedings of the 3rd international conference on Scalable information systems10.5555/1459693.1459726(1-9)Online publication date: 4-Jun-2008
https://dl.acm.org/doi/10.5555/1459693.1459726
Monti GMoro G(2008)Multidimensional Range Query and Load Balancing in Wireless Ad Hoc and Sensor NetworksProceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing10.1109/P2P.2008.27(205-214)Online publication date: 8-Sep-2008
https://dl.acm.org/doi/10.1109/P2P.2008.27
Liu JGreene DMosko MReich JYukio Hirokawa Tatsuo Mikami Tomoyoshi Takebayashi (2008)Using utility and microutility for information dissemination in Vehicle Ad Hoc Networks2008 IEEE Intelligent Vehicles Symposium10.1109/IVS.2008.4621149(755-762)Online publication date: Jun-2008
https://doi.org/10.1109/IVS.2008.4621149
Coman ASander JNascimento M(2007)Adaptive processing of historical spatial range queries in peer-to-peer sensor networksDistributed and Parallel Databases10.5555/1325033.132503822:2-3(133-163)Online publication date: 1-Dec-2007
https://dl.acm.org/doi/10.5555/1325033.1325038
Chung YSu ILee C(2007)Supporting Multi-Dimensional Range Query for Sensor NetworksProceedings of the 27th International Conference on Distributed Computing Systems10.1109/ICDCS.2007.143Online publication date: 25-Jun-2007
https://dl.acm.org/doi/10.1109/ICDCS.2007.143
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents