Skip to main content
Log in

A new probabilistic broadcasting scheme for mobile ad hoc on-demand distance vector (AODV) routed networks

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

Abstract

Broadcast is a fundamental operation used in Mobile Ad hoc NETworks (MANETs) for many services, such as route discovery and sending information messages. The direct method to perform broadcast is a simple flooding, which can decrease the performance of MANET. Recently, a probabilistic approach to flooding has been proposed as one of most important suggested solutions to solve the broadcast storm problem, which leads to the collision, contention and duplicated messages. This paper presents the Smart Probabilistic Broadcasting (SPB) as a new probabilistic method to improve the performance of existing on-demand routing protocols by reducing the RREQ overhead during the rout discovery operation. The simulation results show that the combination of AODV and a suitable probabilistic rout discovery can reduce the average end-to-end delay as well as overhead, while achieving low normalized routing load, compared to AODV that uses fixed probability and blind flooding. Simulation experiments have been conducted to examine our proposed scheme. The results show that SPB outperforms its counterparts and opens up a promising framework towards optimal probabilistic broadcasting.

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.

Similar content being viewed by others

References

  1. Williams B, Camp T (2002) Comparison of broadcasting techniques for mobile ad hoc networks. In: MOBIHOC, pp 194–205

  2. Sasson Y, Cavin D, Schiper A (1987) Probabilistic broadcast for flooding in wireless mobile ad hoc networks. Swiss Federal Institute of Technology (EPFL), Technical Report IC/2002/54

  3. Jubin J, Tornow JD (1987) The DARPA packet radio network protocol. In: Proceedings of the IEEE, pp 21–32

  4. Johnson D, Hu Y, Maltz D (2007) The dynamic source routing protocol (DSR). http://www.ietf.org/rfc/rfc4728.txt. Accessed December 2007

  5. Perkins C, Belding-Royer E, Das S (2007) Ad hoc on-demand distance vector (AODV) routing. http://www.ietf.org/rfc/rfc3561.txt. Accessed October 2007

  6. Ni S-Y, Tseng Y-C, Chen Y-S, Sheu J-P (2002) The broadcast storm problem in mobile ad hoc networks. In: Proceedings of the 5th annual ACM/IEEE international conference on mobile computing and networking, pp 152–162

  7. Bani-Yassein M, Ould-Khaoua M, Mackenzei LM, Papanastasiou S (2006) Performance analysis of adjusted probabilistic broadcasting in mobile ad hoc networks. Int J Wireless Inf Netw 127–140

  8. Sasson Y, Schiper A (2003) Probabilistic broadcast for flooding in wireless mobile ad hoc networks. In: Proceedings of IEEE wireless communications and networking conference

  9. Bani Yassein M, Bani Khalaf M (2009) Performance evolution of multiple probabilities of ad hoc on demand distance vector protocol (AODV). In: Proceedings of the 4th international conference on information technology

  10. Zhang Q, Agrawal DP (2005) Dynamic probabilistic broadcasting in MANETs. J Parallel Distrib Comput 220–233

  11. Yassein B, Ould-Khaoua M, Papanastasiou SM (2005) On the performance of probabilistic flooding in mobile ad hoc networks. In: Proceedings of 1st int workshop on performance modelling in wired, wireless, mobile networking and computing, held in conjunction with ICPADS

  12. Zhang Q, Agrawal DP (2004) Analysis of leveled probabilistic routing in mobile ad hoc networks. In: Proceedings of the IEEE international conference on communications, pp 20–24

  13. Cartigny J, Simplot D (2003) Border node retransmission based probabilistic broadcast protocols in ad hoc networks. Telecommun Syst 189–204

  14. Aminu M, Ould-Khaoua M, Mackenzie LM, Abdulai J (2008) Performance evaluation of an efficient counter-based scheme for mobile ad hoc networks based on realistic mobility model. In: Proceedings of the international symposium on performance evaluation of computer and telecommunication systems, Edinburgh, UK. IEEE, New York, pp 181–188

    Google Scholar 

  15. Tseng Y-C, Ni S-Y, Shih E-Y (2003) Adaptive approaches to relieving broadcast vol.storm in a wireless multihop mobile ad hoc network. IEEE Trans Comput 299–312

  16. Castañeda R, Das SR (1999) Query localization techniques for on-demand routing protocols in ad hoc networks. In: Proceedings of the 5th annual ACM/IEEE international conference on mobile computing and networking, pp 186–194

  17. Abdulai J, Ould-Khaoua M, Mackenzie LM (2008) Adjusted probabilistic route discovery in mobile ad hoc networks. J Comput Elect Eng 168–182

  18. The network simulator Ns-2-the VINT pro. http://www.isi.edu/nsnam/ns/ns-build.html. Accessed December 2007

  19. Colagrosso MD (2007) Intelligent broadcasting in mobile ad hoc networks: Three classes of adaptive protocols. EURASIP. J Wireless Commun Netw 1–16

  20. Haas ZJ, Pearlman MR (2001) The performance of query control schemes for the zone routing protocol. IEEE/ACM Trans Netw 427–438

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ahmed Y. Al-Dubai.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bani Yassein, M., Bani Khalaf, M. & Al-Dubai, A.Y. A new probabilistic broadcasting scheme for mobile ad hoc on-demand distance vector (AODV) routed networks. J Supercomput 53, 196–211 (2010). https://doi.org/10.1007/s11227-010-0408-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-010-0408-0

Keywords

Navigation