Multiple access algorithms for dynamic networks

摘要

The authors present and analyze two distributed multiple-access algorithms that are applicable to dynamic networks which are connected using point-to-point radio links. The algorithms are adaptive receiver-oriented link access protocols. Adaptive refers to the capability of dynamically adapting to a changing topology and varying link capacity requirements, and receiver-oriented means that the receiver schedules the transmissions on a link. The two algorithms presented, the receiver oriented protocol (ROP) and the dependent receiver oriented protocol (DROP), are synchronously slotted at the receiver. The authors derive the maximum channel utilization and bounds on the throughput vs. delay characteristics of the algorithms.