Distributed assignment algorithms for multi-hop packet-radio networks

Abstract

Distributed dynamic channel assignment algorithms for a multihop packet radio network are introduced. The algorithms ensure conflict-free transmissions by the nodes of the network. The basic idea of the algorithms is to split the shared channel into a control segment and a transmission segment. The control segment is used to avoid conflicts among the nodes and to increase the utilization of the transmission segment. It is shown how these algorithms can be used to determine time-division multiaccess cycles with spatial reuse of the channel.< >