Skip to main content
Springer Nature Link
Log in

Efficient Broadcasting by Selective Forwarding

  • Conference paper
Intelligent Distributed Computing III

Part of the book series: Studies in Computational Intelligence ((SCI,volume 237))

Abstract

A major challenge faced in MANETs is locating devices for communication, especially in the case of high node mobility and sparse node density. We propose to develop a strategy to reduce the redundant transmission of packets in normal flooding used in broadcasting and we describe strategies for choosing only a minimal set of nodes to re-broadcast in grid networks. Our strategies reduce the redundant transmission of packets, thus packets are forwarded with a minimal number of transmissions. To determine theminimal set of nodeswe propose a new algorithm called Efficient Broadcasting by Selective Forwarding (EBSF) that uses a distancebased approach in selecting the nodes among all the nodes in a grid network.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 290–298 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Gaber, I., Mansour, Y.: Broadcast in radio networks. In: Proceedings of SODA, January 1995, pp. 577–585 (1995)

    Google Scholar 

  3. GLOMOSIM, http://pcl.cs.ucla.edu/projects/GLOMOSIM/

  4. GLOMOSIM, http://www.sm.luth.se/csee/courses/smd/161_wireless/glomoman.pdf

  5. GLOMOSIM. Installation of glomosim 2.03 in windows xp, http://www.cs.ndsu.edu/~ahmed/GLOMOSIM.html

  6. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. In: Proceedings of ESA (1996)

    Google Scholar 

  7. Haas, J.: A new routing protocol for the reconfigurable wireless networks. In: Proceedings of 6th IEEE International Conference on Universal Personal Communications (ICUPC), October 1997, pp. 562–566 (1997)

    Google Scholar 

  8. Johnson, D.B.: Routing in ad hoc networks of mobile hosts. In: Proceedings of the Workshop on Mobile Computing Systems and Applications, December 1994, pp. 158–163 (1994)

    Google Scholar 

  9. Ko, Y.-B., Vaidya, N.H.: Location-aided routing (lar) in mobile ad hoc networks. In: Proceedings of ACM/IEEE Mobicom, October 1998, pp. 66–75 (1998)

    Google Scholar 

  10. Ko, Y.-B., Vaidya, N.H.: Location-aided routing (lar) in mobile ad hoc networks. Wireless Networks 6, 307–321 (2000)

    Article  MATH  Google Scholar 

  11. Lim, H., Kim, C.: Multicast tree construction and flooding in wireless ad hoc networks. In: Proceedings of the ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWIM (2000)

    Google Scholar 

  12. Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., Sheu, J.-P.: The broadcast storm problem in a mobile ad hoc network. In: Proceedings of ACM MOBICOM, August 1999, pp. 151–162 (1999)

    Google Scholar 

  13. Peng, W., Lu, X.: On the reduction of broadcast redundancy in mobile ad hoc networks. In: Proceedings of MOBIHOC (2000)

    Google Scholar 

  14. Peng, W., Lu, X.: Ahbp: an efficient broadcast protocol for mobile ad hoc networks. Journal of Science and Technology (2002)

    Google Scholar 

  15. Perkins, C., Das, S.: Ad hoc on-demand distance vector (aodv) routing (July 2003), http://tools.ietf.org/html/rfc3561

  16. Qayyum, A., Viennot, L., Laouiti, A.: Multipoint relaying: an efficient technique for flooding in mobile wireless networks. Technical Report Technical Report 3898, INRIA - Rapport de recherche (2000)

    Google Scholar 

  17. Sucec, J., Marsic, I.: An efficient distributed networkwide broadcast algorithm for mobile ad hoc networks. Technical Report CAIP Technical Report 248, Rutgers University (September 2000)

    Google Scholar 

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

    Google Scholar 

  19. Wu, J., Dai, F.: Broadcasting in ad hoc networks based on self-pruning. In: Proceedings of IEEE INFOCOM (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Applied Research Laboratory, The Pennsylvania State University, University Park, PA, 16802, USA

    Doina Bein

  2. School of Computer Science, University of Nevada, Las Vegas, NV, 89154, USA

    Ajoy K. Datta & Balaji ashok Sathyanarayanan

Authors
  1. Doina Bein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ajoy K. Datta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Balaji ashok Sathyanarayanan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Cyprus, 75 Kallipoleos Str., P.O. Box 20537, CY-1678, Nicosia, Cyprus

    George Angelos Papadopoulos

  2. Software Engineering Department, Faculty of Automatics, Computers and Electronics, University of Craiova, Bvd. Decebal,Nr. 107, RO-200440, Craiova, Romania

    Costin Badica

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bein, D., Datta, A.K., Sathyanarayanan, B.a. (2009). Efficient Broadcasting by Selective Forwarding. In: Papadopoulos, G.A., Badica, C. (eds) Intelligent Distributed Computing III. Studies in Computational Intelligence, vol 237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03214-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03214-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03213-4

  • Online ISBN: 978-3-642-03214-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics