Skip to main content

The Evaluation of Unconstrained Multicast Routing Algorithms in Ad-Hoc Networks

  • Conference paper
Computer Networks (CN 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 291))

Included in the following conference series:

Abstract

Wireless ad-hoc networks are playing an important role in extending the implementation of traditional wireless infrastructure (cellular networks, wireless LAN, etc). Routing design in ad-hoc networks is a challenge because of limited node resources. Thus efficient data transmission techniques like multicasting are under scrutiny. The article analyzes and explores the performance of multicast heuristic algorithms without constraints and quality of multicast trees in ad-hoc networks and proves the thesis that well-known multicast heuristic algorithms designed for packet networks have a good performance in ad-hoc networks with grid structure.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hakimi, S.L.: Steiner’s Problem in Graphs and Its Implications. Networks 1, 113–133 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  2. Crawford, J.S., Waters, A.G.: Heuristics for ATM Multicast Routing. In: Proceedings of 6th IFIP Workshop on Performance Modeling and Evaluation of ATM Networks, pp. 5/1–5/18 (July 1998)

    Google Scholar 

  3. Vachaspathi, P., Kompella, J.P., George, C.P.: Multicasting for Multimedia Applications. In: INFOCOM, pp. 2078–2085 (1992)

    Google Scholar 

  4. Mokbel, M.F., El-Haweet, W.A., El-Derini, M.N.: A Delay Constrained Shortest Path Algorithm for Multicast Routing in Multimedia Applications. In: Proceedings of IEEE Middle East Workshop on Networking. IEEE Computer Society (1999)

    Google Scholar 

  5. Piechowiak, M., Stasiak, M., Zwierzykowski, P.: The Application of K–Shortest Path Algorithm in Multicast Routing. Theoretical and Applied Informatics 21(2), 69–82 (2009)

    Google Scholar 

  6. Piechowiak, M., Stasiak, M., Zwierzykowski, P.: Analysis of the Influence of Group Members Arrangement on the Multicast Tree Cost. In: Proceedings of The Fifth Advanced International Conference on Telecommunications, AICT (2009)

    Google Scholar 

  7. Royer, E.M., Perkins, C.: Multicast Ad hoc On-Demand Distance Vector (MAODV) Routing. Network Working Group, RFC: draft (July 2000)

    Google Scholar 

  8. Lee, S., Su, W., Gerla, M.: On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks. Network Working Group, RFC: draft (July 2000)

    Google Scholar 

  9. Bur, K., Ersoy, C.: Ad Hoc Quality of Service Multicast Routing. Computer Communications 29(1), 136–148 (2005)

    Article  Google Scholar 

  10. Bur, K., Ersoy, C.: Performance Evaluation of a Mesh-Evolving Quality-of-Service-Aware Multicast Routing Protocol for Mobile Ad Hoc Networks. Performance Evaluation 66(12), 701–721 (2009)

    Article  Google Scholar 

  11. Zwierzykowski, P., Piechowiak, M.: Performance of Fast Multicast Algorithms in Real Networks. In: Proceedings of EUROCON 2007 the International Conference on: Computer as a Tool, Warsaw, Poland, pp. 956–961 (September 2007)

    Google Scholar 

  12. Zwierzykowski, P., Piechowiak, M.: Efficiency Analysis of Multicast Routing Algorithms in Large Networks. In: Proceedings of The Third International Conference on Networking and Services, ICNS 2007, Athens, Greece, pp. 101–106 (June 2007)

    Google Scholar 

  13. Kou, L., Markowsky, G., Berman, L.: A Fast Algorithm for Steiner Trees. Acta Informatica (15), 141–145 (1981)

    Google Scholar 

  14. Santi, P.: Topology Control in Wireless Ad Hoc and Sensor Networks. ACM Computing Surveys 37, 164–194 (2005)

    Article  Google Scholar 

  15. Rajaraman, R.: Topology Control and Routing in Ad Hoc Networks: A Survey. ACM SIGACT News 33, 60–73 (2002)

    Article  Google Scholar 

  16. WING – Wireless Mesh Network for Next-Generation Internet (2012), http://www.wing-project.org

  17. Riggio, R., Rasheed, T., Testi, S., Granelli, F., Chlamtac, I.: Interference and Traffic Aware Channel Assignment in WiFi-based Wireless Mesh Networks. In: Elsevier Ad Hoc Networks (2010)

    Google Scholar 

  18. Gomez, K., Riggio, R., Rasheed, T., Miorandi, D., Chlamtac, I., Granelli, F.: Analysing the Energy Consumption Behaviour of WiFi Networks. In: Proceedings of IEEE Greencom 2011 (2011)

    Google Scholar 

  19. Waxmann, B.: Routing of Multipoint Connections. IEEE Journal on Selected Area in Communications 6, 1617–1622 (1988)

    Article  Google Scholar 

  20. Rouskas, G., Baldine, I.: Multicast Routing with End-to-End Delay and Delay Variation Constraints. IEEE Journal on Selected Areas in Communications 15, 346–356 (1997)

    Article  Google Scholar 

  21. Wei, L., Estrin, D.: The Trade-Offs of Multicast Trees and Algorithms. In: Proceedings of ICCCN 1994, pp. 55–64. IEEE (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Piechowiak, M., Zwierzykowski, P. (2012). The Evaluation of Unconstrained Multicast Routing Algorithms in Ad-Hoc Networks. In: Kwiecień, A., Gaj, P., Stera, P. (eds) Computer Networks. CN 2012. Communications in Computer and Information Science, vol 291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31217-5_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31217-5_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31216-8

  • Online ISBN: 978-3-642-31217-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics