Fair channel and route selection algorithm using Nash bargaining solutions in multi-hop radio networks

A fair distributed channel, route, and power control algorithm for multi-hop radio networks is proposed in the present paper. Since adaptive channel and route control algorithms that maximize the total throughput allocate more resources to links with good quality, there will be a large difference in throughput among communication links, and thus these algorithms are not necessarily fair. In order to develop a fairer scheme, a combination of Nash bargaining solution (NBS) and an adaptive algorithm, which maximizes the network throughput, is proposed. It is shown that these adaptive algorithms can be used to maximize the product of the utility which is required to obtain NBS. Simulation results reveal that the introduction of multihop transmission into single-hop radio networks is more effective particularly when fairness is required.