Congestion based routing in packet radio networks

The authors develop a routing procedure that is sensitive to the performance of each link in the presence of multiuser interference. They consider a multihop network using code division multiple access (CDMA) and assume an inverse fourth power law for radio signal propagation. They measure link congestion by the mean number of schedulings per successful packet transmitted on the link. The routing algorithm selects the best links from any specified candidate set, and routes end-to-end traffic over the least congested paths. It is possible to have all links in the network as potential candidates. Even if a set of routing links is specified with a uniform routing range, the algorithm performs better than a minimum-hop routing