Routing strategies in multi-hop CDMA networks

Multi-hop relaying routing protocols have been investigated for CDMA air interfaces in conventional cellular scenarios, as described in Chapter 6 and in (Harold and Nix, 2000a) (Harold and Nix, 2000b). This chapter compares the performance of ODMA with direct transmission for cases where links maybe required directly to other nodes, as well as to a controlling (backbone) node, and presents two new routing algorithms. For an interference-limited system, it is shown that the topology cannot be supported by a conventional (single-hop) system, but that a relayed system is able to provide service. As an enhancement to path loss routing, a new admission control and routing algorithm based on receiver interference is presented which is shown to further enhance performance. A second new routing algorithm, which considers the interaction between all receivers in the system by means of a ‘congestion’ measure is presented. This approach allows for routing that is optimised for the entire system, not just a particular route under arbitrary starting conditions. This is possible under both central and local parameter gathering scenarios. Through formulating this measure into the power control equations it is possible to determine system feasibility, although this is a conservative criterion due to approximations in the formulation. This congestion-based routing is shown to outperform non-relaying and any previous routing technique in available capacity for the new network topologies, and has the lowest transmitted power requirement of all investigated methods.