In this paper the problem of generating a schedule for a given set of broadcasts in a Packet Radio Network is considered. The schedule must be free from primary and secondary interference. Both fixed and variable frame length cases are investigated. We show that this problem is NP-complete even in its decision version. We also present several fast suboptimal centralized and distributed heuristics, as well as their average performances obtained through computer simulation.
On scheduling variable length broadcasts in wireless networks
BONUCCELLI, MAURIZIO ANGELO;
1997-01-01
Abstract
In this paper the problem of generating a schedule for a given set of broadcasts in a Packet Radio Network is considered. The schedule must be free from primary and secondary interference. Both fixed and variable frame length cases are investigated. We show that this problem is NP-complete even in its decision version. We also present several fast suboptimal centralized and distributed heuristics, as well as their average performances obtained through computer simulation.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
