Skip to main content
SpringerLink
Log in

Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

We present in this paper three deterministic broadcast and a gossiping algorithm suitable for ad hoc networks where topology changes range from infrequent to very frequent. The proposed algorithms are designed to work in networks where the mobile nodes possessing collision detection capabilities. Our first broadcast algorithm accomplishes broadcast in O(nlog n) for networks where topology changes are infrequent. We also present an O(nlog n) worst case time broadcast algorithms that is resilient to mobility. For networks where topology changes are frequent, we present a third algorithm that accomplishes broadcast in O(Δ·nlog n + n·|M|) in the worst case scenario, where |M| is the length of the message to be broadcasted and Δ the maximum node degree. We then extend one of our broadcast algorithms to develop an O(Dn log n + D2) algorithm for gossiping in the same network model.

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

Access this article

Log in via an institution

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. L. Gasieniec and A. Lingas. On adaptive deterministic gossiping in ad hoc radio networks. Information Processing Letters, 83:89—93, (2002).

  2. M. Chorabak, L. Gasieniec and W. Rytter. Fast broadcasting and gossiping in radio networks. In Proc. 41st IEEE Symp. on Found. Of Computer Science (FOCS’2000), 575–581, 2000.

  3. A. E. F. Clementi, A. Monti and R. Silvestri. Distributed multi-broadcast in unknown radio networks. In Proc. 20th ACM Symp. on Principles of Distributed Computing (PODC’2001), 255–263, 2001.

  4. A. E. F. Clementi, A. Monti and R. Silvestri. Selective families, superimposed codes, and broadcasting in unknown radio networks. In Proc. 12th ACM—SIAM Symp. on Discrete Algorithms (SODA’2001), 709–718, 2001.

  5. I. Gaber and Y. Mansour. Broadcast in radio networks, In Proc. 6th Annual ACM-SIAM Symp. Discrete Algorithms, 577–585, 1995.

  6. I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Comm., 39:426—433, Mar. 1991.

    Article  Google Scholar 

  7. S. Basagni, D. Bruschi and I. Chlamtac. A mobility–transparent deterministic broadcast mechanism for ad hoc networks. IEEE Trans. on Networking,7(6):799-807, Dec. 1999.

    Google Scholar 

  8. R. Bar-Yehuda, O. Goldreich and A. Itai. On the time-complexity of broadcast in multi-hop radio networks : an exponential gap between determinism and randomization, in J. computer Syst. Sci., 45:104–126, Aug. 1992.

    Google Scholar 

  9. E. Kushilevitz and Y. Mansour. An Ω(Dlog n/D) lower bound for broadcast in radio networks, in SIAM J. Computing, 27:702–712, June 1998.

  10. B. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc and W. Rytter. Deterministic broadcasting in unknown radio networks. Proc. of SODA, 861–870, 2000.

  11. M. Chrobak, L. Gasieniec and W. Rytter. A randomized algorithm for gossiping in radio networks. In Proc. 7th Annual International Computing and Combinatorics Conference (COCOON 2001), 483–492, 2001 .

  12. B. S. Chlebus, L. Gasieniec, A. Lingas and A. Pagourtzis. Oblivious gossiping in ad hoc radio networks. In Proc. 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM 2001), 44–51, 2001.

  13. A. E. F. Clementi, A. Monti and R. Silvestri. Round robin is optimal for fault-tolerant broadcasting on wireless networks. In Proc. 9th Annual European Symp. on Algorithms (ESA 2001), 452–463, 2001.

  14. B. S. Chlebus. Randomized communication in radio networks. P. M. Pardalos, S. Rajasekaran, J. H. Reif, J. D. P. Rolim (Eds.), Handbook on Randomized Computing, Kluwer Academic Publishers, 2001.

  15. A. Pelc. Broadcasting in radio networks. I. Stojmenovic (Ed.), Handbook of Wireless Networks and Mobile Computing, John Wiley, New York, 2002.

    Google Scholar 

  16. S. K. S. Gupta and P. K. Srimani. Adaptive core selection and migration method for multi-cast routing in mobile ad hoc networks. To appear in IEEE Transactions on Parallel and Distributed Systems, 2003.

  17. P. Indyk. Explicit constructions of selectors and related combinatorial structures, with applications. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA 2002), 697–704, 2002.

  18. Rajnish Kumar, Arnab Paul and Umakishore Ramachandran. Fountain broadcast for wireless sensor networks. Technical Report—GIT-CERCS-05-02, Georgia Institute of Technology, 2005.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Clemson University, Clemson, SC, 29634-0974

    Koushik Sinha & Pradip K. Srimani

Authors
  1. Koushik Sinha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pradip K. Srimani
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sinha, K., Srimani, P.K. Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks. J Supercomput 37, 115–144 (2006). https://doi.org/10.1007/s11227-006-6255-3

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-006-6255-3

Keywords

Search

Navigation