DISTRIBUTED SCHEDULING OF CDMA NETWORKS WITH MINIMAL INFORMATION

An algorithm is presented which produces conflict-free communication schedules in mobile multihop radio networks. These schedules are produced in a completely distributed manner. The algorithm is based on a globally known permutation on the nodes of the network. As a result the only knowledge needed on the part of individual nodes is the number of nodes in the network. This permutation guarantees that conflict-free schedules may be produced in a distributed manner. We then discuss two extensions to this basic permutation. The first enables neighboring nodes to enhance their communication schedules in a fast, robust, distributed manner. The second extension allows the algorithm to operate in the presence of secondary conflicts.