Skip to main content

Advertisement

Log in

NBgossip: An Energy-Efficient Gossip Algorithm for Wireless Sensor Networks

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Gossip-based algorithms for information dissemination have recently received significant attention for sensor and ad hoc network applications because of their simplicity and robustness. However, a common drawback of many gossip-based protocols is the waste of energy in passing redundant information over the network. Thus gossip algorithms need to be re-engineered in order to become applicable to energy constrained networks. In this paper, we consider a scenario where each node in the network holds a piece of information (message) at the beginning, and the objective is to simultaneously disseminate all information (messages) among all nodes quickly and cheaply. To provide a practical solution to this problem for ad hoc and sensor networks, NBgossip algorithm is proposed, which is based on network coding and neighborhood gossip. In NBgossip, nodes do not simply forward messages they receive, instead, the linear combinations of the messages are sent out. In addition, every node exchanges messages with its neighboring nodes only. Mathematical proof and simulation studies show that the proposed NBgossip terminates in the optimal O(n)-order rounds and outperforms the existing gossip-based approaches in terms of energy consumption incurred in spreading all the information.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Demers A, Greene D, Houser C, Irish W, Larson J. Epidemic algorithms for replicated database maintenance. In ACM Symp. Principles of Distributed Computing, Vancouver, Canada, Aug. 1987, pp.1–12.

  2. Kempe D, Kleinberg J, Demers A. Spatial gossip and resource location protocols. In Proc. ACM Symp. Theory of Computing, Heraklion, Crete, Greece, Jul. 2001, pp.163–172.

  3. Kempe D, Kleinberg J, Demers A. Spatial gossip and resource location protocols. Journal of the ACM, Nov. 2004, 51(6): 934–967.

    Article  MathSciNet  Google Scholar 

  4. Deb S, Mdard M, Chout C. Algebraic gossip: A network coding approach to optimal multiple rumor mongering. IEEE Trans. Information Theory, Jun. 2006, 52(6): 2486–2507.

    Article  Google Scholar 

  5. Karp R, Schindelhauer C, Shenker S, Vocking B. Randomized rumor spreading. In Proc. Foundations of Computer Science, Redondo Beach, CA, Nov. 2000, pp.565–574.

  6. Boyd S, Ghosh A, Prabhakar B, Shah D. Gossip algorithms: Design, analysis and applications. In Proc. IEEE INFOCOM, Miami, USA, 2005, pp.1653–1664.

  7. Dimakis AG, Sarwate AD, Wainwright MJ. Geographic gossip: Efficient aggregation for sensor networks. In Proc. Information Processing on Sensor Networks, Nashville, Tennessee, USA, 2006, pp.69–76.

  8. Kempe D, Dobra A, Gehrke J. Gossip-based computation of aggregate information. In Proc. the 44th Annu. IEEE Symp. Foundations of Computer Science, Cambridge, MA, USA, 2003, pp.482–491.

  9. Fernandess C, Malkhi D. On collaborative content distribution using multi-message gossip. In Proc. Parallel and Distributed Processing Symp., Greece, Apr. 2006, p.9.

  10. Ahlswede R, Cai N, Li SYR, Yeung RW. Network information flow. IEEE Trans. Information Theory, Jul. 2000, 46(4): 1204–1216.

    Article  MATH  MathSciNet  Google Scholar 

  11. Wu Y. Network coding for multicasting [Dissertation]. Princeton University, 2006.

  12. Fragouli C, Widmer J. Network coding: An instant primer. ACM SIGCOMM Computer Communication Review, Jan. 2006, 36(1): 63–68.

    Article  Google Scholar 

  13. SYRY Li, RWN Cai. Linear network coding. IEEE Trans. Information Theory, Feb. 2003, 49(2): 371–381.

    Article  MATH  MathSciNet  Google Scholar 

  14. Ho T, Koetter R, Medard M, Karger DR, Efferos M. The benefits of coding over routing in a randomized setting. In Proc. IEEE Symp. Information Theory, Yokohama, Japan, Jun. 2003, pp.442–446.

  15. Ho T, Medard M, Shi J, Efferos M, Karger MR. On randomized network coding. In Proc. 41st Allerton Annu. Conf. Communication, Control and Computing, Monticelo, IL, Oct. 2003.

  16. Gupta P, Kumar PR. The capacity of wireless networks. IEEE Trans. Information Theory, Mar. 2000, 46(2): 388–404.

    Article  MATH  MathSciNet  Google Scholar 

  17. Penrose M. Random Geometric Graphss. Oxford Studies in Probability, Oxford: Oxford University Press, 2003.

    Google Scholar 

  18. Crossbow Technology Inc. http://www.xbow.com.

  19. Stallings W. Cryptography and Network Security: Principles and Practice. 3rd Edition, Ch. 4, Prentice Hall, 2003, pp.132–134.

  20. Gentle J. Numerical Linear Algebra for Application in Statistics. Springer-Verlag, 1998, pp.87–91.

  21. Widmer J, Boudec J. Network coding for efficient communication in extreme networks. In Proc. ACM SIGCOMM Workshop WTDN’05, Philadelphia, PN, USA, Aug. 2005, pp.284–291.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Feng Lu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lu, F., Chia, LT., Tay, KL. et al. NBgossip: An Energy-Efficient Gossip Algorithm for Wireless Sensor Networks. J. Comput. Sci. Technol. 23, 426–437 (2008). https://doi.org/10.1007/s11390-008-9144-9

Download citation

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-008-9144-9

Keywords

Navigation