Showing papers by "Laurent Viennot published in 1998"
01 Jan 1998
TL;DR: This paper proves that the computation of a multipoint relay set with minimal size is NP-complete and makes the analysis of a heuristic proposed by A. Qayyum.
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.
56 citations