On the achievable throughput of multi-bands decentralized wireless networks

A communication network with a fixed number of sub-channels and several transmitter-receiver pairs under unit power constraint is considered. The achievable throughput of this network in the case of decentralized single-hop and one-shot game is investigated. It is assumed the number of links, N, as well as the number of sub-channels, M, are the common information among users. Moreover, direct channel gains of M sub-channels to the affiliated receiver are assumed to be the only transmit side information, while transmitters are unaware of cross gains. In this regard, various power allocation strategies are investigated, showing the best achievable sum-rate of the dominant strategy scales as Mlog(N) - Theta_N(loglog(N)).