Robust control in sparse mobile ad-hoc networks

Eitan Altman, Alireza Aram, Tamer Başar, Corinne Touati, Saswati Sarkar

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


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.

Original languageEnglish (US)
Title of host publicationDecision and Game Theory for Security - First International Conference, GameSec 2010, Proceedings
Number of pages12
StatePublished - 2010
Event1st International Conference on Decision and Game Theory for Security, GameSec 2010 - Berlin, Germany
Duration: Nov 22 2010Nov 23 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6442 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other1st International Conference on Decision and Game Theory for Security, GameSec 2010

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Robust control in sparse mobile ad-hoc networks'. Together they form a unique fingerprint.

Cite this