Efficient spreading code assignment algorithm for packet radio networks

摘要

Multihop spread spectrum packet radio networks with a large number of stations would require a large number of spreading codes, even with code reuse beyond the interference range. In this work, the code assignment problem is related to the graph colouring problem and a very efficient algorithm is proposed for assigning codes to the stations. A very tight lower bound on the number of codes needed is also derived.