Amazon in the White Space: Social Recommendation Aided Distributed Spectrum Access

Xu Chen, Xiaowen Gong, Lei Yang, Junshan Zhang

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Distributed spectrum access (DSA) is challenging, since an individual secondary user often has limited sensing capabilities only. One key insight is that channel recommendation among secondary users can help to take advantage of the inherent correlation structure of spectrum availability in both time and space, and enable users to obtain more informed spectrum opportunities. With this insight, we advocate to leverage the wisdom of crowds, and devise social recommendation aided DSA mechanisms to orient secondary users to make more intelligent spectrum access decisions, for both strong and weak network information cases. We start with the strong network information case where secondary users have the statistical information. To mitigate the difficulty due to the curse of dimensionality in the stochastic game approach, we take the one-step Nash approach and cast the social recommendation aided DSA decision making problem at each time slot as a strategic game. We show that it is a potential game, and then devise an algorithm to achieve the Nash equilibrium by exploiting its finite improvement property. For the weak information case where secondary users do not have the statistical information, we develop a distributed reinforcement learning mechanism for social recommendation aided DSA based on the local observations of secondary users only. Appealing to the maximum-norm contraction mapping, we also derive the conditions under which the distributed mechanism converges and characterize the equilibrium therein. Numerical results reveal that the proposed social recommendation aided DSA mechanisms can achieve a superior performance using real social data traces and its performance loss in the weak network information case is insignificant, compared with the strong network information case.

Original languageEnglish (US)
Article number7548352
Pages (from-to)536-549
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume25
Issue number1
DOIs
StatePublished - Feb 1 2017

Fingerprint

Reinforcement learning
Decision making
Availability

Keywords

  • Distributed spectrum access
  • game theory
  • social channel recommendation

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Amazon in the White Space : Social Recommendation Aided Distributed Spectrum Access. / Chen, Xu; Gong, Xiaowen; Yang, Lei; Zhang, Junshan.

In: IEEE/ACM Transactions on Networking, Vol. 25, No. 1, 7548352, 01.02.2017, p. 536-549.

Research output: Contribution to journalArticle

@article{ff518675d37c408883072b7f816923fa,
title = "Amazon in the White Space: Social Recommendation Aided Distributed Spectrum Access",
abstract = "Distributed spectrum access (DSA) is challenging, since an individual secondary user often has limited sensing capabilities only. One key insight is that channel recommendation among secondary users can help to take advantage of the inherent correlation structure of spectrum availability in both time and space, and enable users to obtain more informed spectrum opportunities. With this insight, we advocate to leverage the wisdom of crowds, and devise social recommendation aided DSA mechanisms to orient secondary users to make more intelligent spectrum access decisions, for both strong and weak network information cases. We start with the strong network information case where secondary users have the statistical information. To mitigate the difficulty due to the curse of dimensionality in the stochastic game approach, we take the one-step Nash approach and cast the social recommendation aided DSA decision making problem at each time slot as a strategic game. We show that it is a potential game, and then devise an algorithm to achieve the Nash equilibrium by exploiting its finite improvement property. For the weak information case where secondary users do not have the statistical information, we develop a distributed reinforcement learning mechanism for social recommendation aided DSA based on the local observations of secondary users only. Appealing to the maximum-norm contraction mapping, we also derive the conditions under which the distributed mechanism converges and characterize the equilibrium therein. Numerical results reveal that the proposed social recommendation aided DSA mechanisms can achieve a superior performance using real social data traces and its performance loss in the weak network information case is insignificant, compared with the strong network information case.",
keywords = "Distributed spectrum access, game theory, social channel recommendation",
author = "Xu Chen and Xiaowen Gong and Lei Yang and Junshan Zhang",
year = "2017",
month = "2",
day = "1",
doi = "10.1109/TNET.2016.2587736",
language = "English (US)",
volume = "25",
pages = "536--549",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Amazon in the White Space

T2 - Social Recommendation Aided Distributed Spectrum Access

AU - Chen, Xu

AU - Gong, Xiaowen

AU - Yang, Lei

AU - Zhang, Junshan

PY - 2017/2/1

Y1 - 2017/2/1

N2 - Distributed spectrum access (DSA) is challenging, since an individual secondary user often has limited sensing capabilities only. One key insight is that channel recommendation among secondary users can help to take advantage of the inherent correlation structure of spectrum availability in both time and space, and enable users to obtain more informed spectrum opportunities. With this insight, we advocate to leverage the wisdom of crowds, and devise social recommendation aided DSA mechanisms to orient secondary users to make more intelligent spectrum access decisions, for both strong and weak network information cases. We start with the strong network information case where secondary users have the statistical information. To mitigate the difficulty due to the curse of dimensionality in the stochastic game approach, we take the one-step Nash approach and cast the social recommendation aided DSA decision making problem at each time slot as a strategic game. We show that it is a potential game, and then devise an algorithm to achieve the Nash equilibrium by exploiting its finite improvement property. For the weak information case where secondary users do not have the statistical information, we develop a distributed reinforcement learning mechanism for social recommendation aided DSA based on the local observations of secondary users only. Appealing to the maximum-norm contraction mapping, we also derive the conditions under which the distributed mechanism converges and characterize the equilibrium therein. Numerical results reveal that the proposed social recommendation aided DSA mechanisms can achieve a superior performance using real social data traces and its performance loss in the weak network information case is insignificant, compared with the strong network information case.

AB - Distributed spectrum access (DSA) is challenging, since an individual secondary user often has limited sensing capabilities only. One key insight is that channel recommendation among secondary users can help to take advantage of the inherent correlation structure of spectrum availability in both time and space, and enable users to obtain more informed spectrum opportunities. With this insight, we advocate to leverage the wisdom of crowds, and devise social recommendation aided DSA mechanisms to orient secondary users to make more intelligent spectrum access decisions, for both strong and weak network information cases. We start with the strong network information case where secondary users have the statistical information. To mitigate the difficulty due to the curse of dimensionality in the stochastic game approach, we take the one-step Nash approach and cast the social recommendation aided DSA decision making problem at each time slot as a strategic game. We show that it is a potential game, and then devise an algorithm to achieve the Nash equilibrium by exploiting its finite improvement property. For the weak information case where secondary users do not have the statistical information, we develop a distributed reinforcement learning mechanism for social recommendation aided DSA based on the local observations of secondary users only. Appealing to the maximum-norm contraction mapping, we also derive the conditions under which the distributed mechanism converges and characterize the equilibrium therein. Numerical results reveal that the proposed social recommendation aided DSA mechanisms can achieve a superior performance using real social data traces and its performance loss in the weak network information case is insignificant, compared with the strong network information case.

KW - Distributed spectrum access

KW - game theory

KW - social channel recommendation

UR - http://www.scopus.com/inward/record.url?scp=85013472545&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85013472545&partnerID=8YFLogxK

U2 - 10.1109/TNET.2016.2587736

DO - 10.1109/TNET.2016.2587736

M3 - Article

AN - SCOPUS:85013472545

VL - 25

SP - 536

EP - 549

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 1

M1 - 7548352

ER -