Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret

  • Authors:
  • A. Anandkumar;N. Michael;A. K. Tang;A. Swami

  • Affiliations:
  • Dept. of Electr. Eng. & Com puter Sci., Univ. of California, Irvine, CA, USA;-;-;-

  • Venue:
  • IEEE Journal on Selected Areas in Communications
  • Year:
  • 2011

Quantified Score

Hi-index 0.07

Visualization

Abstract

The problem of distributed learning and channel access is considered in a cognitive network with multiple secondary users. The availability statistics of the channels are initially unknown to the secondary users and are estimated using sensing decisions. There is no explicit information exchange or prior agreement among the secondary users and sensing and access decisions are undertaken by them in a completely distributed manner. We propose policies for distributed learning and access which achieve order-optimal cognitive system throughput (number of successful secondary transmissions) under self play, i.e., when implemented at all the secondary users. Equivalently, our policies minimize the sum regret in distributed learning and access, which is the loss in secondary throughput due to learning and distributed access. For the scenario when the number of secondary users is known to the policy, we prove that the total regret is logarithmic in the number of transmission slots. This policy achieves order-optimal regret based on a logarithmic lower bound for regret under any uniformly-good learning and access policy. We then consider the case when the number of secondary users is fixed but unknown, and is estimated at each user through feedback. We propose a policy whose sum regret grows only slightly faster than logarithmic in the number of transmission slots.