Skip to main content

Robust Control in Sparse Mobile Ad-Hoc Networks

  • Conference paper
Decision and Game Theory for Security (GameSec 2010)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6442))

Included in the following conference series:

  • 1265 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  5. Başar, T., Bernhard, P.: H ∞ -Optimal Control and Relaxed Minimax Design Problems: A Dynamic Game Approach, 2nd edn. Birkhäuser, Boston (1995)

    MATH  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 

  9. Grossglauser, M., Tse, D.: Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. on Networking 10(4), 477–486 (2002)

    Article  Google Scholar 

  10. Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Trans. on Information Theory 46(2), 388–404 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Başar, T., Olsder, G.J.: Dynamic Noncooperative Game Theory. SIAM Series in Classics in Applied Mathematics. SIAM, Philadelphia (1999)

    MATH  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 

  15. Kurtz, T.G.: Solutions of Ordinary Differential Equations as Limits of Pure Jump Markov processes. J. Appl. Prob. 7, 49–58 (1970)

    Article  MathSciNet  MATH  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 

  17. Weiss, A., Shwartz, A.: Large Deviations for Performance Analysis. Chapman and Hall, Boca Raton (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Altman, E., Aram, A., Başar, T., Touati, C., Sarkar, S. (2010). Robust Control in Sparse Mobile Ad-Hoc Networks. In: Alpcan, T., Buttyán, L., Baras, J.S. (eds) Decision and Game Theory for Security. GameSec 2010. Lecture Notes in Computer Science, vol 6442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17197-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17197-0_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17196-3

  • Online ISBN: 978-3-642-17197-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics