Game-theoretic quorum-based frequency hopping for anti-jamming rendezvous in DSA networks

Mohammad J. Abdel-Rahman, Marwan Krunz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Scopus citations

Abstract

Establishing communications in a dynamic spectrum access (DSA) network requires the communicating parties to 'rendezvous' before transmitting their data packets. Frequency hopping (FH) is an effective rendezvous method that does not rely on a predetermined control channel. Recently, 'quorum-based' FH approaches have been proposed for asynchronous rendezvous in DSA networks. These approaches are highly vulnerable to jamming, especially when the attacker is an insider node (i.e., a compromised node). In this paper, we investigate the problem of two secondary users (SUs), a transmitter and a receiver, try to rendezvous in the presence of a third SU acting as a jammer. The jammer is aware of the underlying (quorum-based) rendezvous design. First, we consider the case when all SUs are time-synchronized and are aware of the 'rendezvous channel.' We formulate the problem as a three-player game between the transmitter, receiver, and jammer. The transmitter and receiver try to maximize the number of successful rendezvous slots, while minimizing the number of jammed rendezvous slots. The jammer has the opposite objective. We show that this game does not have a pure Nash equilibrium (NE). Accordingly, we formulate a simplified two-player game between the receiver and jammer (assuming a uniform strategy by the transmitter), and derive multiple pure NE strategies. Next, we study the case when the rendezvous channel is unknown and obtain the Bayesian NE. Finally, the asynchronous case is addressed by exploiting the 'rotation closure property' of quorum systems. Our numerical experiments show that uncertainty about the transmitter's strategy improves the anti-jamming rendezvous performance. They also show that the rendezvous performance improves if the receiver and jammer are time-synchronized, and also improves if the receiver and jammer have a common guess about the transmitter's strategy.

Original languageEnglish (US)
Title of host publication2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014
PublisherIEEE Computer Society
Pages248-258
Number of pages11
ISBN (Print)9781479926619
DOIs
StatePublished - Jan 1 2014
Event2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014 - McLean, VA, United States
Duration: Apr 1 2014Apr 4 2014

Publication series

Name2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014

Other

Other2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014
CountryUnited States
CityMcLean, VA
Period4/1/144/4/14

Keywords

  • Bayesian games
  • frequency hopping
  • quorum systems
  • rendezvous
  • three-player games

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Game-theoretic quorum-based frequency hopping for anti-jamming rendezvous in DSA networks'. Together they form a unique fingerprint.

  • Cite this

    Abdel-Rahman, M. J., & Krunz, M. (2014). Game-theoretic quorum-based frequency hopping for anti-jamming rendezvous in DSA networks. In 2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014 (pp. 248-258). [6817801] (2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014). IEEE Computer Society. https://doi.org/10.1109/DySPAN.2014.6817801