Autor:	Maurizio A. Bonuccelli, Stefano Leonardi
Rok vydání:	1997
Předmět:	Wireless network Computer science business.industry Distributed computing Time division multiple access Demand vector Variable length Scheduling (computing) Electrical and Electronic Engineering Heuristics business Computer communication networks Packet radio Computer network
Zdroj:	Telecommunication Systems. 8:211-227
ISSN:	1018-4864
DOI:	10.1023/a:1019113521414
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c20f9e0af3004db35b7364fcb414f33e https://doi.org/10.1023/a:1019113521414 Zobrazit plný text záznamu Full text from SpringerLink