• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Data gathering tours in sensor networks (2006)

Cached

  • Download as a PDF

Download Links

  • [www.cs.berkeley.edu]
  • [www.eecs.berkeley.edu]
  • [www.cs.berkeley.edu]
  • [www.cs.washington.edu]
  • [www.cs.cmu.edu]
  • [select.cs.cmu.edu]
  • [www.select.cs.cmu.edu]
  • [www.eecs.berkeley.edu]
  • [www.eecs.berkeley.edu]
  • [www.cs.berkeley.edu]
  • [www.cs.washington.edu]
  • [www.eecs.berkeley.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Alexandra Meliou , David Chu , Carlos Guestrin , Joseph Hellerstein , Wei Hong
Venue:IN IPSN
Citations:13 - 4 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Meliou06datagathering,
    author = {Alexandra Meliou and David Chu and Carlos Guestrin and Joseph Hellerstein and Wei Hong},
    title = {Data gathering tours in sensor networks},
    booktitle = {IN IPSN},
    year = {2006},
    publisher = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

A basic task in sensor networks is to interactively gather data from a subset of the sensor nodes. When data needs to be gathered from a selected set of nodes in the network, existing communication schemes often behave poorly. In this paper, we study the algorithmic challenges in efficiently routing a fixed-size packet through a small number of nodes in a sensor network, picking up data as the query is routed. We show that computing the optimal routing scheme to visit a specific set of nodes is NP-complete, but we develop approximation algorithms that produce plans with costs within a constant factor of the optimum. We enhance the robustness of our initial approach to accommodate the practical issues of limited-sized packets as well as network link and node failures, and examine how different approaches behave with dynamic changes in the network topology. Our theoretical results are validated via an implementation of our algorithms on the TinyOS platform and a controlled simulation study using Matlab and TOSSIM.

Citations

8882 Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
1469 Directed diffusion: a scalable and robust communication paradigm for sensor networks - Intanagonwiwat, Govindan, et al. - 2000
492 Taming the underlying challenges of reliable multihop routing in sensor networks - Woo, Tong, et al.
429 TOSSIM: Accurate and scalable simulation of entire TinyOS applications - Levis, Lee, et al. - 2003
406 Adaptive protocols for information dissemination in wireless sensor networks - Heinzelman, Kulik, et al. - 1999
371 The design of an acquisitional query processor for sensor networks - Madden, Franklin, et al. - 2003
275 Query processing in Sensor Networks - Gehrke, Madden
267 GHT: a geographic hash table for data-centric storage - Ratnasamy, Karp, et al. - 2002
260 Model-driven data acquisition in sensor networks - Desphande, Guestrin, et al. - 2004
244 A Survey of Gossiping and Broadcasting in Communication Networks - Hedetniemi, Hedetniemi, et al. - 1988
231 Rumor Routing Algorithm for Sensor Networks - Braginsky, Estrin - 2002
131 NegotiationBased Protocols for Disseminating Information in Wireless Sensor Networks - Heinzelman, Balakrishnan - 2013
106 Multi-dimensional range queries in sensor networks - Li, Kim, et al. - 2003
103 R.: Performance of Multihop Wireless Networks: Shortest Path is Not Enough - Couto, Aguayo, et al. - 2002
92 On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks. Wireless Networks - Scaglione, Servetto - 2005
75 On network correlated data gathering - Cristescu, Beferull-Lozano, et al.
56 Energy-latency tradeoffs for data gathering in wireless sensor networks - Yu, Krishnamachari, et al. - 2004
36 Bounds and heuristics for capacitated routing problems - HAIMOVICH, KAN, et al. - 1985
33 Rumor routing algorthim for sensor networks - Braginsky, Estrin - 2002
30 Worst case analysis of a new heuristic for the traveling salesman problem - Christofides - 1976
26 Multiresolution Storage and Search in Sensor Networks - Ganesan, Greenstein, et al. - 2005
26 On the capacitated vehicle routing problem - Ralphs, Kopman, et al. - 2003
13 Algorithms for capacitated vehicle routing - Charikar, Khuller, et al. - 1998
7 On the interaction of data representation and routing in sensor networks - Cristescu, Beferull-Lozano, et al. - 2005
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University