State dependent multiple access algorithms for dynamic networks

Presents and analyzes the DROP (dependent receiver oriented protocol), a random assignment algorithm, and the SDROP (selective dependent receiver oriented protocol) a state-dependent assignment algorithm. These two distributed multiple-resource multiple-access algorithms are applicable to dynamic networks connected by point-to-point radio links. The authors derive the maximum channel utilization of both algorithms and show that although the SDROP uses more information than the DROP, they both have the same maximum throughput. They also show that no algorithm that uses the additional SDROP information has better performance than the DROP