The joint resource allocation problem in wireless networks

The fundamental problem underlying any phase of a dynamic resource allocation algorithm in a wireless network is to assign transmission powers, forward and reverse channels, and base stations such that every mobile of the system can establish a connection. The author considers the joint resource allocation problem in a system with two base stations. An algorithm that achieves the optimal assignment is provided. It involves the computation of a maximum 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. It turns out that when the transmission power is fixed, the capacities of the forward and reverse channel are different, while when power control is allowed they are the same. Finally several versions of the two way channel assignment problem are studied.