Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

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

Authors

[ 1 ] Katedra Sieci Telekomunikacyjnych i Komputerowych, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Year of publication

2012

Chapter type

paper

Publication language

english

Keywords
EN
  • ad-hoc networks
  • multicast
  • routing algorithms
  • network topology
Abstract

EN 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.

Pages (from - to)

344 - 351

DOI

10.1007/978-3-642-31217-5_36

URL

https://link.springer.com/chapter/10.1007/978-3-642-31217-5_36

Book

Computer Networks. 19th International Conference, CN 2012, Szczyrk, Poland, June 19-23, 2012. Proceedings

Presented on

19th International Conference on Computer Networks, CN 2012, 19-23.06.2012, Szczyrk, Poland

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.