Deceptive routing games

Quanyan Zhu, Andrew Clark, Radha Poovendran, Tamer Basar

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

Abstract

The use of a shared medium leaves wireless networks, including mobile ad hoc and sensor networks, vulnerable to jamming attacks. In this paper, we introduce a jamming defense mechanism for multiple-path routing networks based on maintaining deceptive flows, consisting of fake packets, between a source and a destination. An adversary observing a deceptive flow will expend energy on disrupting the fake packets, allowing the real data packets to arrive at the destination unharmed. We model this deceptive flow-based defense within a multi-stage stochastic game framework between the network nodes, which choose a routing path and flow rates for the real and fake data, and an adversary, which chooses which fraction of each flow to target at each hop. We develop an efficient, distributed procedure for computing the optimal routing at each hop and the optimal flow allocation at the destination. Furthermore, by studying the equilibria of the game, we quantify the benefit arising from deception, as reflected in an increase in the valid throughput. Our results are demonstrated via a simulation study.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Conference on Decision and Control
Pages2704-2711
Number of pages8
DOIs
StatePublished - 2012
Event51st IEEE Conference on Decision and Control, CDC 2012 - Maui, HI, United States
Duration: Dec 10 2012Dec 13 2012

Other

Other51st IEEE Conference on Decision and Control, CDC 2012
CountryUnited States
CityMaui, HI
Period12/10/1212/13/12

Fingerprint

Jamming
Routing
Game
Network routing
Mobile ad hoc networks
Sensor networks
Wireless networks
Flow rate
Throughput
Choose
Deception
Path
Stochastic Games
Mobile Ad Hoc Networks
Flow Rate
Sensor Networks
Wireless Networks
Quantify
Attack
Simulation Study

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

Zhu, Q., Clark, A., Poovendran, R., & Basar, T. (2012). Deceptive routing games. In Proceedings of the IEEE Conference on Decision and Control (pp. 2704-2711). [6426515] https://doi.org/10.1109/CDC.2012.6426515

Deceptive routing games. / Zhu, Quanyan; Clark, Andrew; Poovendran, Radha; Basar, Tamer.

Proceedings of the IEEE Conference on Decision and Control. 2012. p. 2704-2711 6426515.

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

Zhu, Q, Clark, A, Poovendran, R & Basar, T 2012, Deceptive routing games. in Proceedings of the IEEE Conference on Decision and Control., 6426515, pp. 2704-2711, 51st IEEE Conference on Decision and Control, CDC 2012, Maui, HI, United States, 12/10/12. https://doi.org/10.1109/CDC.2012.6426515
Zhu Q, Clark A, Poovendran R, Basar T. Deceptive routing games. In Proceedings of the IEEE Conference on Decision and Control. 2012. p. 2704-2711. 6426515 https://doi.org/10.1109/CDC.2012.6426515
Zhu, Quanyan ; Clark, Andrew ; Poovendran, Radha ; Basar, Tamer. / Deceptive routing games. Proceedings of the IEEE Conference on Decision and Control. 2012. pp. 2704-2711
@inproceedings{0773a38d1d9c40ce86cdcbcbe2808269,
title = "Deceptive routing games",
abstract = "The use of a shared medium leaves wireless networks, including mobile ad hoc and sensor networks, vulnerable to jamming attacks. In this paper, we introduce a jamming defense mechanism for multiple-path routing networks based on maintaining deceptive flows, consisting of fake packets, between a source and a destination. An adversary observing a deceptive flow will expend energy on disrupting the fake packets, allowing the real data packets to arrive at the destination unharmed. We model this deceptive flow-based defense within a multi-stage stochastic game framework between the network nodes, which choose a routing path and flow rates for the real and fake data, and an adversary, which chooses which fraction of each flow to target at each hop. We develop an efficient, distributed procedure for computing the optimal routing at each hop and the optimal flow allocation at the destination. Furthermore, by studying the equilibria of the game, we quantify the benefit arising from deception, as reflected in an increase in the valid throughput. Our results are demonstrated via a simulation study.",
author = "Quanyan Zhu and Andrew Clark and Radha Poovendran and Tamer Basar",
year = "2012",
doi = "10.1109/CDC.2012.6426515",
language = "English (US)",
pages = "2704--2711",
booktitle = "Proceedings of the IEEE Conference on Decision and Control",

}

TY - GEN

T1 - Deceptive routing games

AU - Zhu, Quanyan

AU - Clark, Andrew

AU - Poovendran, Radha

AU - Basar, Tamer

PY - 2012

Y1 - 2012

N2 - The use of a shared medium leaves wireless networks, including mobile ad hoc and sensor networks, vulnerable to jamming attacks. In this paper, we introduce a jamming defense mechanism for multiple-path routing networks based on maintaining deceptive flows, consisting of fake packets, between a source and a destination. An adversary observing a deceptive flow will expend energy on disrupting the fake packets, allowing the real data packets to arrive at the destination unharmed. We model this deceptive flow-based defense within a multi-stage stochastic game framework between the network nodes, which choose a routing path and flow rates for the real and fake data, and an adversary, which chooses which fraction of each flow to target at each hop. We develop an efficient, distributed procedure for computing the optimal routing at each hop and the optimal flow allocation at the destination. Furthermore, by studying the equilibria of the game, we quantify the benefit arising from deception, as reflected in an increase in the valid throughput. Our results are demonstrated via a simulation study.

AB - The use of a shared medium leaves wireless networks, including mobile ad hoc and sensor networks, vulnerable to jamming attacks. In this paper, we introduce a jamming defense mechanism for multiple-path routing networks based on maintaining deceptive flows, consisting of fake packets, between a source and a destination. An adversary observing a deceptive flow will expend energy on disrupting the fake packets, allowing the real data packets to arrive at the destination unharmed. We model this deceptive flow-based defense within a multi-stage stochastic game framework between the network nodes, which choose a routing path and flow rates for the real and fake data, and an adversary, which chooses which fraction of each flow to target at each hop. We develop an efficient, distributed procedure for computing the optimal routing at each hop and the optimal flow allocation at the destination. Furthermore, by studying the equilibria of the game, we quantify the benefit arising from deception, as reflected in an increase in the valid throughput. Our results are demonstrated via a simulation study.

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

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

U2 - 10.1109/CDC.2012.6426515

DO - 10.1109/CDC.2012.6426515

M3 - Conference contribution

AN - SCOPUS:84874232867

SP - 2704

EP - 2711

BT - Proceedings of the IEEE Conference on Decision and Control

ER -