Robust multi-priority topology-independent transmission schedules for packet radio networks

Packet radio networks (PRNs) are characterized by their dynamically changing topology. Transmission scheduling (TS) is a key aspect or the design of such networks and determines network performance to a substantial degree. Most existing TS algorithms are topology dependent and necessitate adjustment when the network topology changes, which leads to added computational burden on network resources. We propose a generalization of a topology invariant TS algorithm to a multi-priority environment such as mobile multimedia networks. We then examine the performance of the generalized TS algorithm