Discrete Optimization Models for Cooperative Communication in Ad Hoc Networks

  • Carlos A. S. Oliveira
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4104)


Ad hoc networks have recently been used as a communications medium on tasks that require high levels of communication and coordination. We study the problem of determining an optimal route for a group of wireless units, such that the total connection time among nodes in the resulting mobile ad hoc network is maximized, subject to a limit on the traveled distance. This problem, called the cooperative communication problem in mobile ad hoc networks (CCPM), is modeled using combinatorial optimization and mathematical programming techniques. Applications occur on the coordination of rescue groups, geographical exploration and recognition, unmanned air vehicles (UAVs), and mission coordination. The problem is shown to be NP-hard, and a dynamic programming algorithm is proposed for the problem. Mathematical programming models are presented and computational experiments performed.


Optimization cooperative control integer programming ad hoc networks unit graphs 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alzoubi, K.M., Wan, P.-J., Frieder, O.: Distributed heuristics for connected dominating set in wireless ad hoc networks. IEEE ComSoc/KICS Journal on Communication Networks 4(1), 22–29 (2002)Google Scholar
  2. 2.
    Butenko, S., Cheng, X., Du, D.-Z., Pardalos, P.M.: On the construction of virtual backbone for ad hoc wireless network. In: Butenko, S., Murphey, R., Pardalos, P.M. (eds.) Cooperative Control: Models, Applications and Algorithms, pp. 43–54. Kluwer Academic Publishers, Dordrecht (2002)Google Scholar
  3. 3.
    Butenko, S., Cheng, X., Oliveira, C.A.S., Pardalos, P.M.: A new algorithm for connected dominating sets on ad hoc networks. In: Butenko, S., Murphey, R., Pardalos, P. (eds.) Recent Developments in Cooperative Control and Optimization, pp. 61–73. Kluwer Academic Publishers, Dordrecht (2003)Google Scholar
  4. 4.
    Camp, T., Boleng, J., Davies, V.: A survey of mobility models for ad hoc network research. Wireless Communications and Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications 2(5), 483–502 (2002)Google Scholar
  5. 5.
    Chiang, C.-C., Gerla, M.: Routing and multicast in multihop, mobile wireless networks. In: Proceedings of ICUPC 1997 (1997)Google Scholar
  6. 6.
    Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: International Conference on Communications, pp. 376–380 (1997)Google Scholar
  7. 7.
    Dash Optimization Inc. Xpress-Optimizer Reference Manual (2003)Google Scholar
  8. 8.
    Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)zbMATHGoogle Scholar
  9. 9.
    Johnson, D.B.: Routing in ad hoc networks of mobile hosts. In: Proceedings of the IEEE Workshop on Mobile Computing Systems and Applications (1994)Google Scholar
  10. 10.
    Kim, D.K.: A new mobile environment: Mobile ad hoc networks (manet). IEEE Vehic. Tech. Soc. News, 29–35 (2003)Google Scholar
  11. 11.
    Oliveira, C.A.S., Pardalos, P.M.: A distributed optimization algorithm for power control in wireless ad hoc networks. In: Carlos, A.S. (ed.) Proc. of the 6th Workshop on Advances in Parallel and Distributed Computational Models (WAPDCM 2004), Santa Fe, New Mexico (2004)Google Scholar
  12. 12.
    Rajan, H.: Effects of applying mobility localization to source routing algorithms in mobile ad hoc networks. In: Proceedings of IEEE Symposium on Computers and Communication (ISCC) (2003)Google Scholar
  13. 13.
    Royer, E.M., Toh, C.K.: A review of current routing protocols for adhoc mobile wireless networks. IEEE Personal Communications 6(2), 46–55 (1999)CrossRefGoogle Scholar
  14. 14.
    Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. In: Proc. IEEE Hawaii Int. Conf. on System Sciences (2001)Google Scholar
  15. 15.
    Tian, J., Hhner, J., Becker, C., Stepanov, I., Rothermel, K.: Graph-based mobility model for mobile ad hoc network simulation. In: Proceedings of 35th Annual Simulation Symposium, San Diego, California (2002)Google Scholar
  16. 16.
    Wan, P.-J., Alzoubi, K., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: IEEE INFOCOM 2002 (2002)Google Scholar
  17. 17.
    Zhou, L., Haas, Z.J.: Securing ad hoc networks. IEEE Networks 13(6), 24–30 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Carlos A. S. Oliveira
    • 1
  1. 1.School of Industrial Engineering and ManagementOklahoma State UniversityStillwaterUSA

Personalised recommendations