Routing and Uplink-Downlink Scheduling in Ad Hoc CDMA Networks

In multihop ad hoc CDMA networks, uplink-downlink schedules are needed to forward packet flows throughout the network without conflict. Also, a routing algorithm and a power control mechanism are required to route the flows while satisfying the QoS needs of the users. To maximize bandwidth utilization efficiency, scheduling tables of minimum length are desired. We suggest an incremental contention-based algorithm as a heuristic distributed solution to the NP-hard uplink-downlink scheduling problem. Also, we propose a routing strategy that considers these schedules, i.e., integrated routing and scheduling.