The Community for Technology Leaders
Green Image
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. Prohazka, "Decoupling Link Scheduling Constraints in Multi-Hop Packet Radio Networks," in IEEE Transactions on Computers, vol. 38, no. , pp. 455-458, 1989.
91 ms
(Ver 3.3 (11022016))