JOINT OPTIMAL CHANNEL BASE STATION AND POWER ASSIGNMENT FOR WIRELESS ACCESS

The fundamental problem underlying any phase (hand-off, new connection , etc.) of a dynamic resource allocation algorithm in a wireless netwo rk is to assign transmission powers, forward (downstream) and reverse (upstream) channels, and base stations such that every mobile of the s ystem can establish a connection, Each one of these problems separatel y has been studied extensively, In this work we consider the joint pro blem in a system with two base stations, An algorithm that achieves th e optimal assignment is provided, It involves the computation of a max imum matching in a graph that captures the topological characteristics of the mobile locations, The traffic capacities, in terms of expected number of connections per channel, of the forward and reverse channel are obtained and compared, for both cases of power control and nonpow er control, It turns out that when the transmission power is fixed, th e capacities of the forward and reverse channel are different, while w hen power control is allowed they are the same, For systems with two m obiles the capacities of the forward and reverse channels are studied analytically, Finally, several versions of the two-way channel assignm ent problem are studied.