Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Bandwidth partitioning in decentralized wireless networks
IEEE Transactions on Wireless Communications - Part 2
Fractional power control for decentralized wireless networks
IEEE Transactions on Wireless Communications - Part 2
An Aloha protocol for multihop mobile wireless networks
IEEE Transactions on Information Theory
The Effect of Fading, Channel Inversion, and Threshold Scheduling on Ad Hoc Networks
IEEE Transactions on Information Theory
Dynamic spectrum access models: toward an engineering perspective in the spectrum debate
IEEE Communications Magazine
Distributed multiuser power control for digital subscriber lines
IEEE Journal on Selected Areas in Communications
Spectrum sharing for unlicensed bands
IEEE Journal on Selected Areas in Communications
Radio resource sharing games: enabling QoS support in unlicensed bands
IEEE Network: The Magazine of Global Internetworking
Spectrum sharing games on the interference channel
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Inter-operator spectrum sharing from a game theoretical perspective
EURASIP Journal on Advances in Signal Processing - Special issue on dynamic spectrum access for wireless networking
| Hi-index | 0.00 |
We consider the problem of two wireless networks operating on the same (presumably unlicensed) frequency band. Pairs within a given network cooperate to schedule transmissions, but between networks there is competition for spectrum. To make the problem tractable, we assume transmissions are scheduled according to a random access protocol where each network chooses an access probability for its users. A game between the two networks is defined. We characterize the Nash Equilibrium behavior of the system. Three regimes are identified: one in which both networks simultaneously schedule all transmissions, one in which the denser network schedules all transmissions and the sparser only schedules a fraction, and one in which both networks schedule only a fraction of their transmissions. The regime of operation depends on the path loss exponent α, the latter regime being desirable but attainable only for α 4. This suggests that in certain environments, rival wireless networks may end up naturally cooperating. To substantiate our analytical results, we simulate a system where networks iteratively optimize their access probabilities in a greedy manner. We also discuss a distributed scheduling protocol that employs carrier sensing and demonstrate via simulations that again a near cooperative equilibrium exists for sufficiently large α.