rumor-routing - Rumor Routing Algorithm For Sensor Networks...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Rumor Routing Algor i thm For Sensor Networks David Braginsky University of California, Los Angeles Computer Science Department, UCLA, LA CA 90095-1596 daveey@lecs.cs.ucla.edu Deborah Estrin University of California, Los Angeles Computer Science Department, UCLA, LA CA 90095-1596 destrin@lecs.cs.ucla.edu 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. Categories and Subject Descriptors Networks General Terms Algorithms, Reliability. Keywords SensorNets, Wireless, Routing. 1. INTRODUCTION The emerging low-power and small form-factor processors, equipped with wireless communication capabilities and sensors allow for large-scale, extremely dense networks for environment monitoring. While most current sensing networks involve small numbers of sensors, supported by centralized processing and analysis hardware [14], these new networks will distribute computation among a high number of nodes. Applications for these networks must use algorithms that are highly distributed, since only short-ranged communication is preferred in the context of the stringent power constraints.[5][10] Furthermore, each node has limited high SNR sensing range, so sensing is best distributed and coordinated amongst a potentially large set of nodes. The algorithms these networks employ must be highly localized [1], as large distance transmissions are very expensive, and diminish the network’s overall lifespan. Due to the size of these networks, they must be self-configuring, highly scalable, redundant, and robust in dealing with shifting topologies due to node failure and environment changes. [2] Applications utilizing these networks must be able to gather data from different parts of the network, without taxing the network’s limited bandwidth and power. The communication channels are noisy, failure rates high, and routes ephemeral. Furthermore, ad-hoc deployment, required for dealing with networks of this size, may not provide global localization information to individual nodes.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 10

rumor-routing - Rumor Routing Algorithm For Sensor Networks...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online