• 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

Rumor Routing Algorithm for Sensor Networks (2002)

Cached

  • Download as a PDF

Download Links

  • [www.cse.nd.edu]
  • [www.cs.sunysb.edu]
  • [www.ece.northwestern.edu]
  • [research.cens.ucla.edu]
  • [www.cs.ucf.edu]
  • [www.cs.sunysb.edu]
  • [lecs.cs.ucla.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by David Braginsky , Deborah Estrin
Citations:231 - 2 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Braginsky02rumorrouting,
    author = {David Braginsky and Deborah Estrin},
    title = {Rumor Routing Algorithm for Sensor Networks},
    booktitle = {},
    year = {2002},
    pages = {22--31}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Advances in micro-sensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. In order to constrain communication overhead, dense sensor networks call for new and highly efficient methods for distributing queries to nodes that have observed interesting events in the network. A highly efficient data-centric routing mechanism will offer significant power cost reductions [17], and improve network longevity. Moreover, because of the large amount of system and data redundancy possible, data becomes disassociated from specific node and resides in regions of the network [10][7][8]. This paper describes and evaluates through simulation a scheme we call Rumor Routing, which allows for queries to be delivered to events in the network. Rumor Routing is tunable, and allows for tradeoffs between setup overhead and delivery reliability. It's intended for contexts in which geographic routing criteria are not applicable because a coordinate system is not available or the phenomenon of interest is not geographically correlated.

Citations

1248 GPSR: greedy perimeter stateless routing for wireless networks - Karp, Kung - 2000
647 The Ant System: Optimization by a Colony of Cooperating Agents - Dorigo, Maniezzo, et al. - 1996
638 Geography-Informed Energy Conservation for Ad Hoc Routing - Xu, Heidemann - 2001
61 Ants and reinforcement learning: A case study in routing in dynamic networks - Subramanian, Druschel, et al. - 1997
24 Power-conscious design of wireless circuits and systems - Abidi, Pottie, et al.
2 Ascent: Adaptive SelfConfiguring sEnsor Network Topologies - unknown authors - 2001
1 Next Century Challenges: Scalable Coordination in Sensor Networks - Ganesan, Woo, et al. - 1999
1 Large Scale Network Discovery: Design Tradeoffs in Wireless Sensor Systems - Estrin, S - 2001
1 7] GRAdient Broadcast: A Robust, Long-lived Large Sensor Network, http://irl.cs.ucla.edu/papers/grab-techreport.ps [8 - Heinzelman, A, et al. - 2000
1 A Gerographic Hash Table for DataCentric storage in SensorNets. Under submission to the First - Ratnasamy, Estrin, et al. - 2002
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