NP-Completeness of ad hoc multicast routing problems

Rapport Année : 2005

(1) ,

Guillaume Chelius

Architectures of networks of services

Eric Fleury

In this research report, we study the algorithmic complexity of different broadcast and multicast ad hoc routing problems given a wireless medium.

AD HOC NETWORKS MULTICAST ROUTING COMPLEXITY NP-COMPLETENESS

Autre [cs.OH]

Fichier principal

RR-5665.pdf (86.18 Ko)

https://inria.hal.science/inria-00070343

Soumis le : vendredi 19 mai 2006-20:10:58

Dernière modification le : mercredi 15 mars 2023-08:53:37

Archivage à long terme le : dimanche 4 avril 2010-19:54:53

inria-00070343 , version 1 (19-05-2006)

Guillaume Chelius, Eric Fleury. NP-Completeness of ad hoc multicast routing problems. RR-5665, INRIA. 2005, pp.8. ⟨inria-00070343⟩

INRIA INSA-LYON INRIA-RRRT INRIA2 LARA CITI INSA-GROUPE UDL

83 Consultations

346 Téléchargements