Skip to Main Content
A Communication network with certain number (M) of sub-channels and several transmitter-receiver pairs (N), each of unit transmit power constraint is considered. This paper aims to investigate the throughput of this network in the case of decentralized single-hop and one-shot game, assuming 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. It is proved that for the case of strong interference assumption, the optimum power allocation strategy is a threshold based sub-channel selection together with an on-off scheme, meaning each user sends with full power over the best sub-channel as long as the corresponding channel gain exceeds a certain threshold, otherwise it remains silent. Accordingly, it is shown the achievable sum-rate of this strategy scales as Mlog(N)-Θ(loglog(N)).