Congestion free routing in multi-hop radio CDMA/TDMA networks by virtual capacity assignment

In a CDMA/TDMA (code division multiple access/time division multiple access) data-link protocol of radio networks, collision/conflict-free transmission schedules are created using a cyclic, time-oriented scheduling of transmissions. It is shown how routing considerations can be incorporated in determining data-link schedules allowing the use of shortest paths while avoiding congestion on heavily occupied links. This results in reduced end-to-end delays and increased network capacity in radio networks. The authors introduce a novel approach which allows the performance of such networks to be derived analytically, using recursion relations. The approximate solution provides a tractable way to analyze general topology radio networks with a finite number of buffers, using fixed routes and arbitrary datalink schedules