Advertisement

Communication Models for a Cooperative Network of Autonomous Agents

  • Ashwin Arulselvan
  • Clayton W. Commander
  • Michael J. Hirsch
  • Panos M. Pardalos
Chapter
Part of the Springer Optimization and Its Applications book series (SOIA, volume 30)

Summary

We consider the problem of maximizing the total connectivity for a set of wireless agents in a mobile ad hoc network. That is, given a set of wireless units each having a start point and a destination point, our goal is to determine a set of routes for the units which maximizes the overall connection time between them. Known as the cooperative communication problem in mobile ad hoc networks (ccpm), this problem has several military applications including coordination of rescue groups, path planning for unmanned air vehicles, and geographical exploration and target recognition. The CCPM is NP-hard; therefore heuristic development has been the major focus of research. In this work, we survey the CCPM examining first some early combinatorial formulations and solution techniques. Then we introduce new continuous formulations and compare the results of several case studies. By removing the underlying graph structure, we are able to create a more realistic model of the problem as supported by the numerical evidence.

Keywords

Local Search Path Planning Mixed Integer Linear Program Greedy Randomize Adaptive Search Procedure Cooperative Communication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Refereneces

  1. 1.
    R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, 1993.Google Scholar
  2. 2.
    A. Arulselvan, C.W. Commander, M.J. Hirsch, P.M. Pardalos, and M.G.C. Resende. Cooperative communication in ad-hoc networks. In National Fire Control Symposium Proceedings, 2007.Google Scholar
  3. 3.
    A. Arulselvan, C.W. Commander, and P.M. Pardalos. A random keys based genetic algorithm for the target visitation problem. In M.J. Hirsch, P.M. Pardalos, R. Murphey, and D. Grundel, editors, Advances in Cooperative Control and Optimization. Springer, Inc., 2007.Google Scholar
  4. 4.
    S.I. Butenko, X. Cheng, C.A.S. Oliveira, and P.M. Pardalos. A new algorithm for connected dominating sets in ad hoc networks. In S. Butenko, R. Murphey, and P. Pardalos, editors, Recent Developments in Cooperative Control and Optimization, pages 61–73. Kluwer Academic Publishers, 2003.Google Scholar
  5. 5.
    S.I. Butenko, R.A. Murphey, and P.M. Pardalos, editors. Cooperative Control: Models, Applications, and Algorithms. Springer, 2003.Google Scholar
  6. 6.
    S.I. Butenko, R.A. Murphey, and P.M. Pardalos, editors. Recent Developments in Cooperative Control and Optimization. Springer, 2004.Google Scholar
  7. 7.
    B.N. Clark, C.J. Colbourn, and D.S. Johnson. Unit disk graphs. Discrete Mathematics, 86:165–177, 1990.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    C.W. Commander. Optimization Problems in Telecommunications with Military Applications. Ph.D. dissertation, University of Florida, August 2007.Google Scholar
  9. 9.
    C.W. Commander, C.A.S. Oliveira, P.M. Pardalos, and M.G.C. Resende. A greedy randomized algorithm for the cooperative communication problem on ad hoc networks. In 8th INFORMS Telecommunications Conference, 2006.Google Scholar
  10. 10.
    C.W. Commander, C.A.S. Oliveira, P.M. Pardalos, and M.G.C. Resende. A one-pass heuristic for cooperative communication in mobile ad hoc networks. In D.A. Grundel, R.A. Murphey, P.M. Pardalos, and O.A. Prokopyev, editors, Cooperative Systems: Control and Optimization. Springer, 2007.Google Scholar
  11. 11.
    C.W. Commander, P.M. Pardalos, V. Ryabchenko, S. Uryasev, and G. Zrazhevsky. The wireless network jamming problem. Journal of Combinatorial Optimization, to appear, 2007.Google Scholar
  12. 12.
    C.W. Commander, P.M. Pardalos, O. Shylo, and S. Uryasev. Recent advances in eavesdropping and jamming communication networks. In P.M. Pardalos D.A. Grundel, R.A. Murphey and O.A. Prokopyev, editors, 6th International Conference on Cooperative Control and Optimization. World Scientific, 2006.Google Scholar
  13. 13.
    ILOG CPLEX. http://www.ilog.com/products/cplex , Accessed October 2006.
  14. 14.
    P. Festa and M.G.C. Resende. GRASP: An annotated bibliography. In C. Ribeiro and P.Hansen, editors, Essays and Surveys in Metaheuristics, pages 325–367. Kluwer Academic Publishers, 2002.Google Scholar
  15. 15.
    R.W. Floyd. Algorithm 97 (shortest path). Communications of the ACM, 5(6):345, 1962.Google Scholar
  16. 16.
    M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.Google Scholar
  17. 17.
    D.A. Grundel, R.A. Murphey, and P.M. Pardalos, editors. Theory and Algorithms for Cooperative Systems. World Scientific, 2004.Google Scholar
  18. 18.
    F.S. Hillier and G.J. Lieberman. Introduction to Operations Research. McGraw Hill, 2001.Google Scholar
  19. 19.
    M.J. Hirsch. GRASP-based Heuristics for Continuous Global Optimization Problems. Ph.D. dissertation, University of Florida, December 2006.Google Scholar
  20. 20.
    M.J. Hirsch, C.N. Meneses, P.M. Pardalos, and M.G.C. Resende. Global optimization by continuous GRASP. Optimization Letters, 1(2):201–212, 2007.MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    R. Horst, P.M. Pardalos, and N.V. Thoai. Introduction to Global Optimization, volume 3 of Nonconvex Optimization and its Applications. Kluwer Academic Publishers, 1995.Google Scholar
  22. 22.
    R.A. Murphey and P.M. Pardalos, editors. Cooperative Control and Optimization. Springer, 2002.Google Scholar
  23. 23.
    C.A.S. Oliveira and P.M. Pardalos. An optimization approach for cooperative communication in ad hoc networks. Technical report, School of Industrial Engineering and Management, Oklahoma State University, 2005.Google Scholar
  24. 24.
    C.A.S. Oliveira, P.M. Pardalos, and T.M. Querido. A combinatorial algorithm for message scheduling on controller area networks. International Journal of Operations Research, 1(1/2):160–171, 2005.Google Scholar
  25. 25.
    M.G.C. Resende and P.M. Pardalos. Handbook of Optimization in Telecommunications. Springer, 2006.Google Scholar
  26. 26.
    M.G.C. Resende and C.C. Ribeiro. Greedy randomized adaptive search procedures. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 219–249. Kluwer Academic Publishers, 2003.Google Scholar
  27. 27.
    S. Warshall. A theorem on boolean matrices. Journal of the ACM, 9(1):11–12, 1962.Google Scholar
  28. 28.
    L. Wolsey. Integer Programming. Wiley, 1998.Google Scholar

Copyright information

© Springer-Verlag US 2009

Authors and Affiliations

  • Ashwin Arulselvan
    • 1
  • Clayton W. Commander
    • 2
  • Michael J. Hirsch
    • 3
  • Panos M. Pardalos
    • 1
  1. 1.Department of Industrial and Systems EngineeringUniversity of FloridaGainesville
  2. 2.Air Force Research LaboratoryMunitions DirectorateEglin AFB
  3. 3.Network Centric SystemsRaytheon IncSt. Petersburg

Personalised recommendations