Issue No.03 - March (1989 vol.38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.21132
An aspect of the problem of constructing a minimal length link schedule for a PRN (packet radio network) is examined. Specifically, it is assumed that a PRN of unrestricted topology is given, including a set of users, a set of channels, a set of interference links, a frequency band assignment, and an initial link schedule. It is required that any link schedule satisfies two constraints. The fir
multihop packet radio networks; minimal length link schedule; interference links; frequency band assignment; computer networks; packet switching; radio networks.
C.G. Prohazka, "Decoupling Link Scheduling Constraints in Multi-Hop Packet Radio Networks", IEEE Transactions on Computers, vol.38, no. 3, pp. 455-458, March 1989, doi:10.1109/12.21132