Trickle: a self-regulating algorithm for code propagation and maintenance in wireless sensor networks Export

@inproceedings{citeulike:2881633, abstract = {We present Trickle, an algorithm for propagating and maintaining code updates in wireless sensor networks. Borrowing techniques from the epidemic/gossip, scalable multicast, and wireless broadcast literature, Trickle uses a "polite gossip" policy, where motes periodically broadcast a code summary to local neighbors but stay quiet if they have recently heard a summary identical to theirs. When a mote hears an older summary than its own, it broadcasts an update. Instead of flooding a network with packets, the algorithm controls the send rate so each mote hears a small trickle of packets, just enough to stay up to date. We show that with this simple mechanism, Trickle can scale to thousand-fold changes in network density, propagate new code in the order of seconds, and impose a maintenance cost on the order of a few sends an hour.}, address = {Berkeley, CA, USA}, author = {Levis, Philip and Patel, Neil and Culler, David and Shenker, Scott}, booktitle = {NSDI'04: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation}, citeulike-article-id = {2881633}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1251177}, keywords = {code-propagation, dynamic-code-loading, gossip}, location = {San Francisco, California}, pages = {2}, posted-at = {2008-08-02 19:31:24}, priority = {0}, publisher = {USENIX Association}, title = {Trickle: a self-regulating algorithm for code propagation and maintenance in wireless sensor networks}, url = {http://portal.acm.org/citation.cfm?id=1251177}, year = {2004} }

TY - CONF ID - citeulike:2881633 L3 - citeulike-article-id:2881633 N2 - We present Trickle, an algorithm for propagating and maintaining code updates in wireless sensor networks. Borrowing techniques from the epidemic/gossip, scalable multicast, and wireless broadcast literature, Trickle uses a "polite gossip" policy, where motes periodically broadcast a code summary to local neighbors but stay quiet if they have recently heard a summary identical to theirs. When a mote hears an older summary than its own, it broadcasts an update. Instead of flooding a network with packets, the algorithm controls the send rate so each mote hears a small trickle of packets, just enough to stay up to date. We show that with this simple mechanism, Trickle can scale to thousand-fold changes in network density, propagate new code in the order of seconds, and impose a maintenance cost on the order of a few sends an hour. CY - San Francisco, California AD - Berkeley, CA, USA EP - 2 TI - Trickle: a self-regulating algorithm for code propagation and maintenance in wireless sensor networks PB - USENIX Association T2 - NSDI'04: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation SP - 2 KW - code-propagation KW - dynamic-code-loading KW - gossip AU - Levis, Philip AU - Patel, Neil AU - Culler, David AU - Shenker, Scott PY - 2004/// UR - http://portal.acm.org/citation.cfm?id=1251177 ER -