The firecracker protocol

ABSTRACT

We propose the Firecracker protocol for data dissemination in wireless sensor networks. Firecracker uses a combination of routing and broadcasts to rapidly deliver a piece of data to every node in a network. To start dissemination, the data source sends data to distant points in the network. Once the data reaches its destinations, broadcast-based dissemination begins along the paths, like a string of firecrackers.By using an initial routing phase, Firecracker can disseminate at a faster rate than scalable broadcasts while sending fewer packets. The selection of points to route to has a large effect on performance, indicating possible requirements for any-to-any routing protocols in wireless sensor networks.

References

1. J. Hill and D. E. Culler. Mica: a wireless platform for deeply embedded networks. IEEE Micro, 22(6):12--24, nov/dec 2002.
2. J. W. Hui and D. Culler. The dynamic behavior of a data dissemination protocol for network programming at scale. In Proceedings of the Second ACM Conference on Embedded Networked Sensor Systems, 2004.
3. C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: a scalable and robust communication paradigm for sensor networks. In Proceedings of the International Conference on Mobile Computing and Networking, Aug. 2000.
4. J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. W. O'Toole, Jr. Overcast: Reliable multicasting with an overlay network. In Proceedings of the 4th Operating Systems Design and Implementation (OSDI 2000), pages 197--212.
5. B. Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In International Conference on Mobile Computing and Networking (MobiCom 2000), pages 243--254, Boston, MA, USA, 2000.
6. P. Levis and D. Culler. Maté: a tiny virtual machine for sensor networks. In Proceedings of the ACM Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS X), Oct. 2002.
7. P. Levis, N. Patel, D. Culler, and S. Shenker. Trickle: A self-regulating algorithm for code maintenance and propagation in wireless sensor networks. In First USENIX/ACM Symposium on Network Systems Design and Implementation (NSDI 2004).
8. A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, and J. Anderson. Wireless Sensor Networks for Habitat Monitoring. In Proceedings of the ACM International Workshop on Wireless Sensor Networks and Applications, Sept. 2002.
9. J. Newsome and D. Song. Gem: graph embedding for routing and data-centric storage in sensor networks without geographic information. In Proceedings of the first international conference on Embedded networked sensor systems, pages 76--88. ACM Press, 2003.
10. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu. The broadcast storm problem in a mobile ad hoc network. In Proceedings of the fifth annual ACM/IEEE international conference on Mobile computing and networking, pages 151--162. ACM Press, 1999.
11. S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker. GHT: a geographic hash table for data-centric storage. In Proceedings of the first ACM international workshop on Wireless sensor networks and applications, pages 78--87. ACM Press, 2002.
12. T. Stathopoulos, J. Heidemann, and D. Estrin. A remote code update mechanism for wireless sensor networks. Technical Report CENS Technical Report 30, 2003.
13. A. Woo, T. Tong, and D. Culler. Taming the underlying challenges of reliable multihop routing in sensor networks. In Proceedings of the first international conference on Embedded networked sensor systems, pages 14--27. ACM Press, 2003.

• Networks

  • Network protocols

    • Network layer protocols

  • Network types

• Software and its engineering

  • Software organization and properties

    • Software system structures