On Improving Wireless Broadcast Reliability of Sensor Networks Using Erasure Codes

  • Rajnish Kumar
  • Arnab Paul
  • Umakishore Ramachandran
  • David Kotz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4325)


Efficient and reliable dissemination of information over a large area is a critical ability of a sensor network for various reasons such as software updates and transferring large data objects (e.g., surveillance images). Thus efficiency of wireless broadcast is an important aspect of sensor network deployment. In this paper, we study FBcast, a new broadcast protocol based on the principles of modern erasure codes. We show that our approach provides high reliability, often considered critical for disseminating codes. In addition FBcast offers limited data confidentiality. For a large network, where every node may not be reachable by the source, we extend FBcast with the idea of repeaters to improve reliable coverage. Simulation results on TOSSIM show that FBcast offers higher reliability with lower number of retransmissions than traditional broadcasts.


Sensor Network Wireless Sensor Network Data Packet Erasure Code Broadcast Protocol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kouznetsov, P., Kermarrec, A.-M.: Lightweight probabilistic broadcast. ACM Trans. Comput. Syst. 21(4), 341–374 (2003)CrossRefGoogle Scholar
  2. 2.
    Ganesan, D., Krishnamachari, B., Woo, A., Culler, D., Estrin, D., Wicker, S.: An empirical study of epidemic algorithms in large scale multihop wireless networks, Technical Report, Intel Research (2002)Google Scholar
  3. 3.
    Chang, J.-H., Tassiulas, L.: Trickle: A self-regulating algorithm for code propagation and maintenance in wireless sensor networks. In: Proceedings of the First ACM/Usenix Symposium on Networked Systems Design and Implementation (NSDI) (2004)Google Scholar
  4. 4.
    Levis, P., Lee, N., Welsh, M., Culler, D.: Tossim: accurate and scalable simulation of entire tinyos applications. In: Proceedings of the first international conference on Embedded networked sensor systems, pp. 126–137. ACM Press, New York (2003)CrossRefGoogle Scholar
  5. 5.
    Li, L., Halpern, J., Haas, Z.: Gossip-based ad hoc routing. In: Proceedings of the 21st Conference of the IEEE Communications Society (INFOCOM 2002) (2002)Google Scholar
  6. 6.
    Lim, H., Kim, C.: Flooding in wireless networks. Computer Communicatins 24(3-4), 353–363 (2001)CrossRefGoogle Scholar
  7. 7.
    Lou, W., Wu, J.: On reducing broadcast redundancy in ad hoc wireless networks. IEEE Transactions on Mobile ComputingGoogle Scholar
  8. 8.
    Luby, M.: Lt codes. In: Proceedings of 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2002)Google Scholar
  9. 9.
    Maymounkov, P., Mazieres, D.: Rateless codes and big downloads. In: Proc. of the 2nd International Workshop on Peer-to-Peer Systems (2003)Google Scholar
  10. 10.
    Obraczka, K., Viswanath, K., Tsudik, G.: Flooding for reliable multicast in multi-hop ad hoc networks. Wireless Networks 7(6), 627–634 (2001)MATHCrossRefGoogle Scholar
  11. 11.
    Orecchia, L., Panconesi, A., Petrioli, C., Vitaletti, A.: Localized techniques for broadcasting in wireless sensor networks. In: Proceedings of the 2004 joint workshop on Foundations of mobile computing, pp. 41–51. ACM Press, New York (2004)CrossRefGoogle Scholar
  12. 12.
    Park, S.-J., Vedantham, R., Sivakumar, R., Akyildiz, I.F.: A scalable approach for reliable downstream data delivery in wireless sensor networks. In: MobiHoc 2004: Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, pp. 78–89. ACM Press, New York (2004)CrossRefGoogle Scholar
  13. 13.
    Peng, W., Lu, X.-C.: On the reduction of broadcast redundancy in mobile ad hoc networks. In: Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing, pp. 129–130. IEEE Press, Los Alamitos (2000)Google Scholar
  14. 14.
    Tseng, Y.-C., Ni, S.-Y., Chen, Y.-S., Sheu, J.-P.: The broadcast storm problem in a mobile ad hoc network. Wirel. Netw. 8(2/3), 153–167 (2002)MATHCrossRefGoogle Scholar
  15. 15.
    Wan, C.-Y., Campbell, A.T., Krishnamurthy, L.: PSFQ: a reliable transport protocol for wireless sensor networks. In: WSNA 2002: Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications, pp. 1–11. ACM Press, New York (2002)CrossRefGoogle Scholar
  16. 16.
    Williams, B., Camp, T.: Comparison of broadcasting techniques for mobile ad hoc networks. In: Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, pp. 194–205. ACM Press, New York (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Rajnish Kumar
    • 1
  • Arnab Paul
    • 2
  • Umakishore Ramachandran
    • 1
  • David Kotz
    • 3
  1. 1.College of Computing, Georgia TechAtlantaUSA
  2. 2.Intel Corp.HillsboroUSA
  3. 3.Computer Science DepratmentDartmouth CollegeHanoverUSA

Personalised recommendations