Learn More
AfWract-Transmissions scheduling is a key design problem in packet radio networks, relevant to TDMA and CDMA systems. A large number of topology-dependent scheduling algorithms are available, in which changes of topology inevitably require reeomptrtation of transmission schedules. The need for constant adaptation of schedules to mobile topologies entails(More)
worst-case number of channels required to acconunodate all possible configurations of N calls in a cell cluster, and the set of cell states that can be accommodated with M channels. We first measure two extreme policies, fixed channel allocation and m~b\imum packing, under these metrics. We then prove a new lower bound, under the first metric, on any(More)
This paper introduces a new model and methodological approach for dealing with the probabilistic nature of mobile networks based on the theory of random graphs. Probabilistic dependence between the random links prevents the direct application of the theory of random graphs to communication networks. The new model, termed Random Network Model, generalizes(More)
—We prove that the buffer bound in the above paper, can be improved by using a modification of the proofs in the original paper together with so-called network calculus bounds. We also show that the delay bound in the above paper, is the sum of worst-case queueing delays at all nodes along the path of a connection.