Strategic Contention Resolution in Multiple Channels
share
We consider the problem of resolving contention in communication networks with selfish users. In a contention game each of n ≥ 2 identical players has a single information packet that she wants to transmit using one of k ≥ 1 multiple-access channels. To do that, a player chooses a slotted-time protocol that prescribes the probabilities with which at a given time-step she will attempt transmission at each channel. If more than one players try to transmit over the same channel (collision) then no transmission happens on that channel. Each player tries to minimize her own expected latency, i.e. her expected time until successful transmission, by choosing her protocol. The natural problem that arises in such a setting is, given n and k, to provide the players with a common, anonymous protocol (if it exists) such that no one would unilaterally deviate from it (equilibrium protocol). All previous theoretical results on strategic contention resolution examine only the case of a single channel and show that the equilibrium protocols depend on the feedback that the communication system gives to the players. Here we present multi-channel equilibrium protocols in two main feedback classes, namely acknowledgement-based and ternary. In particular, we provide equilibrium characterizations for more than one channels, and give specific anonymous, equilibrium protocols with finite and infinite expected latency. In the equilibrium protocols with infinite expected latency, all players transmit successfully in optimal time, i.e. Θ(n/k), with probability tending to 1 as n/k →∞.
READ FULL TEXT