Robust control in sparse mobile ad-hoc networks

Authors:
Eitan Altman;Alireza Aram;Tamer Başar;Corinne Touati;Saswati Sarkar
Affiliations:
INRIA, Sophia Antipolis, France;Finance Department, The Wharton School, Univ of Pennsylvania,;University of Illinois, Urbana, IL;ENSIMAG, Montbonnot du St Martiin, France;Dept. of Electrical and Systems Eng., University of Pennsylvania
Venue:
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
Year:
2010

Citing 5
Cited 0

On-line algorithms

ACM Computing Surveys (CSUR)
Mobility increases the capacity of ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
Performance modeling of epidemic routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
The capacity of wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.