The Mathematics of Routing in Massively Dense Ad-Hoc Networks

  • Eitan Altman
  • Pierre Bernhard
  • Alonso Silva
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5198)


Computing optimal routes in massively dense adhoc networks becomes intractable as the number of nodes becomes very large. One recent approach to solve this problem is to use a fluid type approximation in which the whole network is replaced by a continuum plain. Various paradigms from physics have been used recently in order to solve the continuum model. We propose in this paper an alternative modeling and solution approach similar to a model by Beckmann [3] developed more than fifty years ago from the area of road traffic.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Altman, E., Bernhard, P., Debbah, M., Silva, A.: Continuum Equilibria for Routing in Dense Ad-Hoc Networks. In: 45th Allerton Conference on Communication, Control and Computing, Illinois, USA, September 26 - 28 (2007)Google Scholar
  2. 2.
    Bardi, M., Capuzzo-Dolcetta, I.: Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations. Birkhauser, Basel (1994)Google Scholar
  3. 3.
    Beckmann, M.: A continuous model of transportation. Econometrica 20, 643–660 (1952)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics and Transportation. Yale Univ. Press (1956)Google Scholar
  5. 5.
    Dafermos, S.C.: Continuum Modeling of Transportation Networks. Transpn Res. 14B, 295–301 (1980)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Daniele, P., Maugeri, A.: Variational Inequalities and discrete and continuum models of network equilibrium protocols. Mathematical and Computer Modelling 35, 689–708 (2002)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Evans, L.C.: Partial Differentiali Equations. Graduate Studies in Mathematics, vol. 19. Ameriacn Mathematical Society (1998)Google Scholar
  8. 8.
    Gupta, P., Kumar, P.R.: A system and traffic dependent adaptive routing algorithm for ad hoc networks. In: Proceedings of the 36th IEEE Conference on Decision and Control, San Diego, December 1997, pp. 2375–2380 (1997)Google Scholar
  9. 9.
    Gupta, G.A., Toumpis, S.: Optimal placement of nodes in large sensor networks under a general physical layer model. In: IEEE Secon, Santa Clara, CA (September 2005)Google Scholar
  10. 10.
    Jacquet, P.: Geometry of information propagation in massively dense ad hoc networks. In: MobiHoc 2004: Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, pp. 157–162. ACM Press, New York (2004)CrossRefGoogle Scholar
  11. 11.
    Fleming, W.H., Soner, H.M.: Controlled Markov Processes and Viscosity Solutions, 2nd edn. Springer, Heidelberg (2006)MATHGoogle Scholar
  12. 12.
    Haurie, A., Marcott, P.: On the relationship between Nash-Cournot and Wardrop equilibria. Networks 15, 295–308 (1985)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Ho, H.W., Wong, S.C.: Two-Dimensional Continuum Modeling Approach to Transportation Problems. Journal of Transportation Systems Engineering and Information Technology 6(6), 53–72 (2006)CrossRefGoogle Scholar
  14. 14.
    Idone, G.: Variational inequalities and applications to a continuum model of transportation network with capacity constraints. Journal of Global Optimization 28, 45–53 (2004)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Hyytia, E., Virtamo, J.: On load balancing in a dense wireless multihop network. In: Proceeding of the 2nd EuroNGI conference on Next Generation Internet Design and Engineering, Valencia, Spain (April 2006)Google Scholar
  16. 16.
    Patriksson, M.: The Traffic Assignment Problem: Models and Methods, VSP BV, The Netherlands (1994)Google Scholar
  17. 17.
    Tassiulas, L., Toumpis, S.: Packetostatics: Deployment of massively dense sensor networks as an electrostatic problem. IEEE INFOCOM 4, 2290–2301 (2005)Google Scholar
  18. 18.
    Tassiulas, L., Toumpis, S.: Optimal deployment of large wireless sensor networks. IEEE Transactions on Information Theory 52(7), 2935–2953 (2006)CrossRefMathSciNetGoogle Scholar
  19. 19.
    Toumpis, S.: Mother nature knows best: A survey of recent results on wireless networks based on analogies with physics. Computer Networks 52, 360–383 (2008)MATHCrossRefGoogle Scholar
  20. 20.
    Toumpis, S.: Optimal design and operation of massively dense wireless networks: or how to solve 21st century problems using 19th century mathematics. In: interperf 2006: Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications systems. ACM Press, New York (2006)Google Scholar
  21. 21.
    Toumpis, S., Catanuto, R., Morabito, G.: Optical routing in massively dense networks: Practical issues and dynamic programming interpretation. In: Proc. of IEEE ISWCS 2006 (September 2006)Google Scholar
  22. 22.
    Wardrop, J.G.: Some theoretial aspects of road traffic research. In: Proceedings of the Institution of Civil Engineers, pp. 325–378 (1952)Google Scholar
  23. 23.
    Wong, S.C.: Multi-Commodity Traffic Assignment by Continuum Approximation of Network Flow with Variable Demand. Transpn Res. -B. 32(8), 567–581 (1998)CrossRefGoogle Scholar
  24. 24.
    Wong, S.C., Du, Y.C., Sun, J.J., Loo, B.P.Y.: Sensitivity analysis for a continuum traffic equilibrium problem. Ann. Reg. Sci. 40, 493–514 (2006)CrossRefGoogle Scholar
  25. 25.
    Wong, S.C., Lee, C.K., Tong, C.O.: Finite element solution for the continuum traffic equilibrium problems. International Journal for Numerical Methods in Engineering 43(7), 1253–1273 (1998)MATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Yang, H., Juang, H.-J.: The multi-class, multi-criteria traffic network equilibrium and systems optimum problem. Transportation Research Part B 38, 1–15 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Eitan Altman
    • 1
  • Pierre Bernhard
    • 2
  • Alonso Silva
    • 1
  1. 1.INRIASophia AntipolisFrance
  2. 2.I3S, University of Nice-Sophia Antipolis and CNRSFrance

Personalised recommendations