Complexity Results on Election of Multipoint Relays in Wireless Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

Complexity Results on Election of Multipoint Relays in Wireless Networks

Laurent Viennot

Abstract

The election of multipoint relays allows to decrease the cost of broadcasting in wireless networks. For each source, the fewer elements the set has, the greater the gain is. In this paper, we prove that the computation of a multipoint relay set with minimal size is NP-complete. We also make the analysis of a heuristic proposed by A. Qayyum.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3584.pdf (202.74 Ko) Télécharger le fichier

Dates and versions

inria-00073097 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073097 , version 1

Cite

Laurent Viennot. Complexity Results on Election of Multipoint Relays in Wireless Networks. [Research Report] RR-3584, INRIA. 1998. ⟨inria-00073097⟩
149 View
239 Download

Share

Gmail Facebook X LinkedIn More