Issue No. 10 - October (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.5980
The author addresses the problem, arising in the topology design of packet radio networks (PRNs) which use time-division multiplexing and have a diameter constraint, of what is the maximum number n/sub c/(f,k) of users which can be contained in a diameter-k PRN with f time slots per frame. The author assumed that users cannot transmit and receive simultaneously and cannot transmit/receive more
maximum size bounding; packet radio network; topology design; time-division multiplexing; f-edge colorable directed graph; graph colouring; packet switching; radio networks.
C. Prohazka, "Bounding the Maximum Size of a Packet Radio Network," in IEEE Transactions on Computers, vol. 37, no. , pp. 1184-1190, 1988.