TY - GEN

T1 - Adversarial control in a delay tolerant network

AU - Altman, Eitan

AU - Başar, Tamer

AU - Kavitha, Veeraruna

N1 - Funding Information:
★ The work of the second author is supported by an INRIA-UIUC research collabo-ration grant, as well as by an AFOSR Grant. The other authors were supported by the Indo-French Centre for the Promotion of Advanced Research (IFCPAR), project 4000-IT-1 and by the INRIA association program DAWN.

PY - 2010

Y1 - 2010

N2 - We consider a multi-criteria control problem that arises in a delay tolerant network with two adversarial controllers: the source and the jammer. The source's objective is to choose transmission probabilities so as to maximize the probability of successful delivery of some content to the destination within a deadline. These transmissions are subject to interference from a jammer who is a second, adversarial type controller, We solve three variants of this problem: (1) the static one, where the actions of both players, u and w, are constant in time; (2) the dynamic open loop problem in which all policies may be time varying, but independent of state, the number of already infected mobiles; and (3) the dynamic closed-loop feedback policies where actions may change in time and may be specified as functions of the current value of the state (in which case we look for feedback Nash equilibrium). We obtain some explicit expressions for the solution of the first game, and some structural results as well as explicit expressions for the others. An interesting outcome of the analysis is that the latter two games exhibit switching times for the two players, where they switch from pure to mixed strategies and vice versa. Some numerical examples included in the paper illustrate the nature of the solutions.

AB - We consider a multi-criteria control problem that arises in a delay tolerant network with two adversarial controllers: the source and the jammer. The source's objective is to choose transmission probabilities so as to maximize the probability of successful delivery of some content to the destination within a deadline. These transmissions are subject to interference from a jammer who is a second, adversarial type controller, We solve three variants of this problem: (1) the static one, where the actions of both players, u and w, are constant in time; (2) the dynamic open loop problem in which all policies may be time varying, but independent of state, the number of already infected mobiles; and (3) the dynamic closed-loop feedback policies where actions may change in time and may be specified as functions of the current value of the state (in which case we look for feedback Nash equilibrium). We obtain some explicit expressions for the solution of the first game, and some structural results as well as explicit expressions for the others. An interesting outcome of the analysis is that the latter two games exhibit switching times for the two players, where they switch from pure to mixed strategies and vice versa. Some numerical examples included in the paper illustrate the nature of the solutions.

KW - Delay-tolerant networks

KW - nonzero-sum game

KW - switching strategies

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

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

U2 - 10.1007/978-3-642-17197-0_6

DO - 10.1007/978-3-642-17197-0_6

M3 - Conference contribution

AN - SCOPUS:78650722276

SN - 3642171966

SN - 9783642171963

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 87

EP - 106

BT - Decision and Game Theory for Security - First International Conference, GameSec 2010, Proceedings

T2 - 1st International Conference on Decision and Game Theory for Security, GameSec 2010

Y2 - 22 November 2010 through 23 November 2010

ER -