Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/a-framework-for-time-indexing-in-sensor-networks-aFhit9S2Ol
References (30)
-
B. Karp (2000)
GPSR: greedy perimeter stateless routing for wireless networks -
Raghupathy Sivakumar, P. Sinha, V. Bharghavan (1999)
CEDAR: a core-extraction distributed ad hoc routing algorithmIEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320), 1
-
C. Intanagonwiwat, R. Govindan, D. Estrin (2000)
Directed diffusion: a scalable and robust communication paradigm for sensor networks -
S. Athuraliya, S. Low (2000)
Optimization flow control with Newton‐like algorithmTelecommunication Systems, 15
-
J. Polastre (2003)
Design and implementation ofwireless sensor networks for habitat monitoring -
Noga Alon, J. Spencer (2000)
The Probablistic Method -
Xin Li, Young-jin Kim, R. Govindan, W. Hong (2003)
Multi-dimensional range queries in sensor networks -
J. Newsome, D. Song (2003)
GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information -
K. Alzoubi, P. Wan, O. Frieder (2002)
Distributed heuristics for connected dominating sets in wireless ad hoc networksJournal of Communications and Networks, 4
-
Jason Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, K. Pister (2000)
System architecture directions for networked sensors -
J. Elson, Lewis Girod, D. Estrin
Proceedings of the 5th Symposium on Operating Systems Design and Implementation Fine-grained Network Time Synchronization Using Reference Broadcasts -
(2004)
Received November ACM Transactions on Sensor Networks -
Deepak Ganesan, Ben Greenstein, Denis Perelyubskiy, D. Estrin, J. Heidemann (2003)
An evaluation of multi-resolution storage for sensor networks -
V. Chvátal (1979)
A Greedy Heuristic for the Set-Covering ProblemMath. Oper. Res., 4
-
Rong Zheng, J. Hou, L. Sha (2003)
Asynchronous wakeup for ad hoc networks -
S. Madden, M. Franklin, J. Hellerstein, W. Hong
Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks -
L. Massoulié, James Roberts (1999)
Bandwidth sharing: objectives and algorithmsIEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320), 3
-
Constant Time Distributed Dominating Set Approximation -
Z. Abrams, Ashish Goel, Serge Plotkin (2003)
Set k-cover algorithms for energy efficient monitoring in wireless sensor networksThird International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004
-
S. Low, D. Lapsley (1999)
Optimization flow control—I: basic algorithm and convergenceIEEE/ACM Trans. Netw., 7
-
S. Ratnasamy, B. Karp, Li Yin, Fang Yu, D. Estrin, R. Govindan, S. Shenker (2002)
GHT: a geographic hash table for data-centric storage -
Rong Zheng, R. Kravets (2003)
On-demand power management for ad hoc networksIEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 1
-
Ben Greenstein, S. Ratnasamy, S. Shenker, Ramesh Govindan, Deborah Estrin (2003)
DIFS: a distributed index for features in sensor networksProceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.
-
B. Awerbuch (1985)
Complexity of network synchronizationJ. ACM, 32
-
(2005)
A Framework for Time Indexing in Sensor Networks @BULLET 133 -
S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, Li Yin, Fang Yu (2003)
Data-Centric Storage in Sensornets with GHT, a Geographic Hash TableMobile Networks and Applications, 8
-
M. Handy, M. Haase, D. Timmermann (2002)
Low energy adaptive clustering hierarchy with deterministic cluster-head selection4th International Workshop on Mobile and Wireless Communications Network
-
S. Shenker, S. Ratnasamy, B. Karp, R. Govindan, D. Estrin (2003)
Data-centric storage in sensornetsComput. Commun. Rev., 33
-
A. Ghose, Jens Grossklags, J. Chuang (2003)
Resilient Data-Centric Storage in Wireless Ad-Hoc Sensor Networks -
Bevan Das, V. Bharghavan (1997)
Routing in ad-hoc networks using minimum connected dominating setsProceedings of ICC'97 - International Conference on Communications, 1
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2005 by ACM Inc.
- ISSN
- 1550-4859
- DOI
- 10.1145/1077391.1077396
- Publisher site
- See Article on Publisher Site
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.
Journal
ACM Transactions on Sensor Networks (TOSN) – Association for Computing Machinery
Published: Aug 1, 2005