Robust Control in Sparse Mobile Ad-Hoc Networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Robust Control in Sparse Mobile Ad-Hoc Networks

(1) , (2) , (3) , (4) , (5)
1
2
3
4
5

Abstract

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.

Dates and versions

hal-00788877 , version 1 (15-02-2013)

Identifiers

Cite

Eitan Altman, Alireza Aram, Tamer Basar, Corinne Touati, Saswati Sarkar. Robust Control in Sparse Mobile Ad-Hoc Networks. Conference on Decision and Game Theory for Security (GameSec) - 2010, 2010, Berlin, Germany. pp.123-134, ⟨10.1007/978-3-642-17197-0_8⟩. ⟨hal-00788877⟩
112 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More