Robust Control in Sparse Mobile Ad-Hoc Networks

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.

[1]  H. Özbay,et al.  On the H ∞ Controller Design for Congestion Control in Communication Networks with a Capacity Predictor 1 , 2001 .

[2]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[3]  Eitan Altman,et al.  Worst-Case Rate-Based Flow Control with an ARMA Model of the Available Bandwidth , 2000 .

[4]  Jean-Yves Le Boudec,et al.  Performance Analysis of Self Limiting Epidemic Forwarding , 2006 .

[5]  Michel Mandjes,et al.  Large Deviations for Performance Analysis: Queues, Communications, and Computing , Adam Shwartz and Alan Weiss (New York: Chapman and Hall, 1995). , 1996, Probability in the Engineering and Informational Sciences.

[6]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Tamer Başar,et al.  H1-Optimal Control and Related Minimax Design Problems , 1995 .

[8]  Donald F. Towsley,et al.  Performance Modeling of Epidemic Routing , 2006, Networking.

[9]  T. Basar,et al.  H∞-0ptimal Control and Related Minimax Design Problems: A Dynamic Game Approach , 1996, IEEE Trans. Autom. Control..

[10]  T. Kurtz.  Solutions of ordinary differential equations as limits of pure jump markov processes , 1970, Journal of Applied Probability.

[11]  Eitan Altman,et al.  Decentralized Stochastic Control of Delay Tolerant Networks , 2009, IEEE INFOCOM 2009.

[12]  Mirco Musolesi,et al.  Controlled Epidemic-style Dissemination Middleware for Mobile Ad Hoc Networks , 2006, 2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services.

[13]  Eitan Altman,et al.  Performance of Ad Hoc Networks with Two-Hop Relay Routing and Limited Packet Lifetime , 2006, 200614th IEEE International Workshop on Quality of Service.

[14]  Adam Shwartz,et al.  Large Deviations For Performance Analysis , 2019 .

[15]  H. Ozbay,et al.  A solution to the robust flow control problem for networks with multiple bottlenecks , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[16]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[17]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[18]  Eitan Altman,et al.  Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks , 2008, Valuetools 2008.

[19]  Susanne Albers,et al.  On‐Line Algorithms , 2013 .