TY - GEN
T1 - Robust control in sparse mobile ad-hoc networks
AU - Altman, Eitan
AU - Aram, Alireza
AU - Başar, Tamer
AU - Touati, Corinne
AU - Sarkar, Saswati
N1 - Funding Information:
Acknowledgement. The work of the first and third authors has been supported in part by an INRIA-UIUC collaborative research grant. The work of the first author has been partially supported by the European Commission within the framework of the BIONETS project IST-FET-SAC-FP6-027748, see URL:-www.bionets.eu. The work of the second author was supported by the DAWN associated team program between INRIA, UPenn and IISc. The work of the third author was also supported by an AFOSR Grant.
PY - 2010
Y1 - 2010
N2 - We consider a two-hop routing delay-tolerant network. When the source encounters a mobile then it transmits, with some probability, a file to that mobile, with the probability itself being a decision variable. The number of mobiles is not fixed, with new mobiles arriving at some constant rate. The file corresponds to some software that is needed for offering some service to some clients, which themselves may be mobile or fixed. We assume that mobiles have finite life time due to limited energy, but that the rate at which they die is unknown. We use an H∞ approach which transforms the problem into a worst case analysis, where the objective is to find a policy for the transmitter which guarantees the best performance under worst case conditions of the unknown rate. This problem is formulated as a zero-sum differential game, for which we obtain the value as well as the saddle-point policies for both players.
AB - We consider a two-hop routing delay-tolerant network. When the source encounters a mobile then it transmits, with some probability, a file to that mobile, with the probability itself being a decision variable. The number of mobiles is not fixed, with new mobiles arriving at some constant rate. The file corresponds to some software that is needed for offering some service to some clients, which themselves may be mobile or fixed. We assume that mobiles have finite life time due to limited energy, but that the rate at which they die is unknown. We use an H∞ approach which transforms the problem into a worst case analysis, where the objective is to find a policy for the transmitter which guarantees the best performance under worst case conditions of the unknown rate. This problem is formulated as a zero-sum differential game, for which we obtain the value as well as the saddle-point policies for both players.
UR - http://www.scopus.com/inward/record.url?scp=78650725826&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78650725826&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-17197-0_8
DO - 10.1007/978-3-642-17197-0_8
M3 - Conference contribution
AN - SCOPUS:78650725826
SN - 3642171966
SN - 9783642171963
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 123
EP - 134
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 -