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.
Unable to display preview. Download preview PDF.
- 1.Albers, S., Leonardi, S.: On-line algorithms. ACM Computing Surveys (CSUR) archive 31(3) (September 1999)Google Scholar
- 2.Al-Hanbali, A., Nain, P., Altman, E.: Performance of ad hoc networks with two-hop relay routing and limited packet lifetime. In: Proc. of Valuetools, Pisa, Italy, October 11-13 (2006)Google Scholar
- 3.Altman, E., Başar, T., Hovakimian, N.: Worst-case rate-based flow control with an ARMA model of the available bandwidth. In: Gaitsgory, et al. (eds.) Annals of Dynamic Games, vol. 5, pp. 3–29. Birkhäuser, Basel (2000)Google Scholar
- 4.Altman, E., Başar, T., De Pellegrini, F.: Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks. In: Proc. of ACM/ICST Inter-Perf, Athens, Greece, October 24 (2008)Google Scholar
- 6.Biberovic, E., Iftar, A., Özbay, H.: A solution to the robust flow control problem for networks with multiple bottlenecks. In: Proceedings of the IEEE Conference on Decision and Control, Orlando, FL, pp. 2303–2308 (December 2001)Google Scholar
- 7.Fawal, A.E., Boudec, J.-Y.L., Salamatian, K.: Performance analysis of self limiting epidemic forwarding. EPFL, Tech. Rep. LCA-REPORT-2006-127 (2006)Google Scholar
- 8.Groenevelt, R., Nain, P., Koole, G.: The message delay in mobile ad hoc networks. In Posters ACM SIGMETRICS 2005, Canada (2005)Google Scholar
- 12.Musolesi, M., Mascolo, C.: Controlled Epidemic-style Dissemination Middleware for Mobile Ad Hoc Networks. In: Proc. of ACM Mobiquitous, San Jose, California, July 17-21 (2006)Google Scholar
- 13.Zhang, X., Neglia, G., Kurose, J., Towsley, D.: Performance modeling of epidemic routing. Computer Networks 51(10) (July 2007)Google Scholar
- 14.Altman, E., Neglia, G., De Pellegrini, F., Miorandi, D.: Decentralized stochastic control of delay tolerant networks. In: Proc. of Infocom, Rio de Janeiro, April 15-19 (2009)Google Scholar
- 16.Quet, P.-F., Ramakrishnan, S., Özbay, H., Kalyanaraman, S.: On the H controller design for congestion control with a capacity predictor. In: Proceedings of the IEEE Conference on Decision and Control, Orlando, FL, pp. 598–603 (December 2001)Google Scholar