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

Mohammad J. Abdel-Rahman, Marwan M Krunz

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

21 Citations (Scopus)

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 - 2014
Event2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014 - McLean, VA, United States
Duration: Apr 1 2014Apr 4 2014

Other

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

Fingerprint

Frequency hopping
Jamming
Transmitters
Transceivers
Communication
Experiments

Keywords

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

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Abdel-Rahman, M. J., & Krunz, M. 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] IEEE Computer Society. https://doi.org/10.1109/DySPAN.2014.6817801

Game-theoretic quorum-based frequency hopping for anti-jamming rendezvous in DSA networks. / Abdel-Rahman, Mohammad J.; Krunz, Marwan M.

2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014. IEEE Computer Society, 2014. p. 248-258 6817801.

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

Abdel-Rahman, MJ & Krunz, MM 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., 6817801, IEEE Computer Society, pp. 248-258, 2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014, McLean, VA, United States, 4/1/14. https://doi.org/10.1109/DySPAN.2014.6817801
Abdel-Rahman MJ, Krunz MM. 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. IEEE Computer Society. 2014. p. 248-258. 6817801 https://doi.org/10.1109/DySPAN.2014.6817801
Abdel-Rahman, Mohammad J. ; Krunz, Marwan M. / Game-theoretic quorum-based frequency hopping for anti-jamming rendezvous in DSA networks. 2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014. IEEE Computer Society, 2014. pp. 248-258
@inproceedings{5e0a395ac9054a9083384f15895d49d8,
title = "Game-theoretic quorum-based frequency hopping for anti-jamming rendezvous in DSA networks",
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.",
keywords = "Bayesian games, frequency hopping, quorum systems, rendezvous, three-player games",
author = "Abdel-Rahman, {Mohammad J.} and Krunz, {Marwan M}",
year = "2014",
doi = "10.1109/DySPAN.2014.6817801",
language = "English (US)",
isbn = "9781479926619",
pages = "248--258",
booktitle = "2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014",
publisher = "IEEE Computer Society",

}

TY - GEN

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

AU - Abdel-Rahman, Mohammad J.

AU - Krunz, Marwan M

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Bayesian games

KW - frequency hopping

KW - quorum systems

KW - rendezvous

KW - three-player games

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

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

U2 - 10.1109/DySPAN.2014.6817801

DO - 10.1109/DySPAN.2014.6817801

M3 - Conference contribution

AN - SCOPUS:84902142792

SN - 9781479926619

SP - 248

EP - 258

BT - 2014 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2014

PB - IEEE Computer Society

ER -