• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks (2003)

Cached

  • Download as a PDF

Download Links

  • [www.cs.berkeley.edu]
  • [www.comet.columbia.edu]
  • [www.eecs.harvard.edu]
  • [cs.ucsb.edu]
  • [webs.cs.berkeley.edu]
  • [theory.csail.mit.edu]
  • [www.cs.berkeley.edu]
  • [pdos.lcs.mit.edu]
  • [now.cs.berkeley.edu]
  • [www.eecs.harvard.edu]
  • [www.cs.berkeley.edu]
  • [www.stanford.edu]
  • [web.eecs.umich.edu]
  • [www.ics.uci.edu]
  • [web.eecs.umich.edu]
  • [www.ocf.berkeley.edu]
  • [www.stanford.edu]
  • [galaxy.cs.lamar.edu]
  • [courses.csail.mit.edu]
  • [www.stanford.edu]
  • [www.ocf.berkeley.edu]
  • [pdos.csail.mit.edu]
  • [nest.cs.berkeley.edu]
  • [www.cs.berkeley.edu]
  • [www.eecs.harvard.edu]
  • [www.eecs.harvard.edu]
  • [www.ocf.berkeley.edu]
  • [web.eecs.umich.edu]
  • [wiki.cs.dartmouth.edu]
  • [web.eecs.umich.edu]
  • [www.ics.uci.edu]
  • [home.deib.polimi.it]
  • [www.comp.nus.edu.sg]
  • [www.cs.berkeley.edu]
  • [www.cs.berkeley.edu]
  • [www.cens.ucla.edu]
  • [galaxy.cs.lamar.edu]
  • [galaxy.cs.lamar.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Alec Woo , Terence Tong , David Culler
Venue:In SenSys
Citations:776 - 20 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Woo03tamingthe,
    author = {Alec Woo and Terence Tong and David Culler},
    title = {Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks},
    booktitle = {In SenSys},
    year = {2003},
    pages = {14--27},
    publisher = {ACM Press}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

The dynamic and lossy nature of wireless communication poses major challenges to reliable, self-organizing multihop networks. These non-ideal characteristics are more problematic with the primitive, low-power radio transceivers found in sensor networks, and raise new issues that routing protocols must address. Link connectivity statistics should be captured dynamically through an efficient yet adaptive link estimator and routing decisions should exploit such connectivity statistics to achieve reliability. Link status and routing information must be maintained in a neighborhood table with constant space regardless of cell density. We study and evaluate link estimator, neighborhood table management, and reliable routing protocol techniques. We focus on a many-to-one, periodic data collection workload. We narrow the design space through evaluations on large-scale, high-level simulations to 50-node, in-depth empirical experiments. The most effective solution uses a simple time averaged EWMA estimator, frequency based table management, and cost-based routing.

Keyphrases

sensor network    underlying challenge    reliable multihop routing    simple time    cell density    ewma estimator    design space    link estimator    neighborhood table    neighborhood table management    constant space regardless    lossy nature    non-ideal characteristic    connectivity statistic    adaptive link estimator    link status    link connectivity statistic    self-organizing multihop network    new issue    high-level simulation    cost-based routing    low-power radio transceivers    table management    effective solution    periodic data collection workload    protocol technique    wireless communication pose major challenge    in-depth empirical experiment   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

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

© 2007-2019 The Pennsylvania State University