Skip to main content
SpringerLink
Log in

Ad Hoc Networks: Optimization Problems and Solution Methods

  • Chapter
Book cover Combinatorial Optimization in Communication Networks

Part of the book series: Combinatorial Optimization ((COOP,volume 18))

5 Concluding Remarks

Ad hoc networks are an area of telecommunications that has grown in popularity due to its wide applicability. It also presents some interesting and difficult optimization problems. In this chapter we presented some of the optimization issues related to ad hoc networks, as well as techniques employed in their solution. This is an active area of research, and certainly will see many developments in the near future in terms of improved formulations and algorithms.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. A. Y. Alfakih, A. Khandani, and H. Wolkowicz. Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Optim. Appl., 12:13–30, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  2. K. M. Alzoubi, P.-J. Wan, and O. Frieder. Distributed heuristics for connected dominating set in wireless ad hoc networks. IEEE ComSoc/KICS J. Communication Networks, 4(1):22–29, 2002.

    Google Scholar 

  3. S. Arora. Approximation schemes for NP-hard geometric optimization problems: A survey. Math. Program., 97:1436–4646, 2003.

    MATH  MathSciNet  Google Scholar 

  4. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM (JACM), 41(1):153–180, 1994.

    Article  MATH  Google Scholar 

  5. S. Bandyopadhyay and E. J. Coyle. Minimizing communication costs in hierarchically-clustered networks of wireless sensors. Comput. Networks, 44(1):1–16, 2004.

    Article  Google Scholar 

  6. R. Bellman. Dynamic Programming. Princeton University Press, Princeton, NJ, 1957.

    Google Scholar 

  7. P. Biswas and Y. Ye. A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization. Technical report, Dept. of Management Science and Engineering, Stanford University, 2003.

    Google Scholar 

  8. P. Biswas and Y. Ye. Semidefinite programming for ad hoc wireless sensor network localization. In Proceedings of the Third Tnternational Symposium on Information Processing in Sensor Networks, pages 46–54. ACM Press, 2004.

    Google Scholar 

  9. S. Butenko, X. Cheng, D.-Z. Du, and P. M. Pardalos. On the construction of virtual backbone for ad hoc wireless network. In S. Butenko, R. Murphey, and P. M. Pardalos, editors, Cooperative Control: Models, Applications and Algorithms, pages 43–54. Kluwer Academic, 2002.

    Google Scholar 

  10. S. Butenko, X. Cheng, C. A. Oliveira, and P. M. Pardalos. A new algorithm for connected dominating sets on ad hoc networks. In S. Butenko, R. Murphey, and P. Pardalos, editors, Recent Developments in Cooperative Control and Optimization, pages 61–73. Kluwer Academic, 2003.

    Google Scholar 

  11. X. Cheng and D. Du. Virtual backbone-based routing in multihop ad hoc wireless networks. Technical report, Department of Computer Science and Engineering, University of Minnesota, 2002.

    Google Scholar 

  12. B. Das and V. Bharghavan. Routing in ad-hoc networks using minimum connected dominating sets. In IEEE International Conference on Communications, 1997.

    Google Scholar 

  13. E. W. Dijkstra. A note on two problems in connexion with graphs. Numer. Math., 1:269–271, 1959.

    Article  MATH  MathSciNet  Google Scholar 

  14. A. Ephremides, J. Wieselthier, and D. Backer. A design concept to reliable mobile radio networks with frequency hopping signaling. Proceedings of the IEEE, 75(1):56–73, 1987.

    Article  Google Scholar 

  15. M. Frodigh, P. Johansson, and P. Larsson. Wireless ad hoc networking: The art of networking without a network. Ericsson Rev., 4:248–263, 2000.

    Google Scholar 

  16. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-completeness. W. H. Freeman, 1979.

    Google Scholar 

  17. M. Gerla and J.-C. Tsai. Multicluster, mobile, multimedia radio network. ACM J. Wireless Networks, 1(3):255–265, 1995.

    Article  Google Scholar 

  18. S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374–387, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  19. P. Hansen and N. Mladenovic. An introduction to VNS. In S. Voss, S. Martello, I. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic, 1998.

    Google Scholar 

  20. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan. Energy-efficient communication protocol for wireless microsensor networks. In Proceedings of the 33rd Hawaii International Conference on System Sciences, Volume 8, page 8020. IEEE Computer Society, 2000.

    Google Scholar 

  21. P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark. Scenario based performance analysis of routing protocols for mobile ad hoc networks. In Proceedings of IEEE MOBICOM, pages 195–206, Seattle, 1999.

    Google Scholar 

  22. D. B. Johnson. Routing in ad hoc networks of mobile hosts. In Proceedings of the IEEE Workshop on Mobile Computing Systems and Applications. IEEE, 1994.

    Google Scholar 

  23. V. Kawadia and P. Kumar. Power control and clustering in ad hoc networks. In Proceedings of IEEE INFOCOM, 2003.

    Google Scholar 

  24. M. Laurent. Matrix completion problems. In The Encyclopedia of Optimization, volume 3, pages 221–229. Kluwer Academic, 2001.

    Google Scholar 

  25. X.-Y. Li, P.-J. Wan, and O. Frieder. Coverage in wireless ad hoc sensor networks. IEEE Trans. Comput., 52:753–763, 2003.

    Article  Google Scholar 

  26. B. Liang and Z. Haas. Virtual backbone generation and maintenance in ad hoc network mobility management. In Proceedings of IEEE INFOCOM, pages 1293–1302, 2000.

    Google Scholar 

  27. T.-C. Liang, T.-C. Wang, and Y. Ye. A gradient search method to round the semidefinite programming relaxation solution for ad hoc wireless sensor network localization. Manuscript available at http://www.stanford.edu/~yyye, 2004.

    Google Scholar 

  28. A. Man-Cho So and Y. Ye. Theory of semidefinite programming for sensor network localization. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 405–414, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.

    Google Scholar 

  29. H. Matsuo and K. Mori. Accelerated ants routing in dynamic networks. In Proceedings of the International Conference On Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, pages 333–339, 2001.

    Google Scholar 

  30. S. Moguerdichian, S. Slijepcevic, V. Karayan, and M. Potkonjak. Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure. In Proceedings of the 2nd ACM International Symposium on Mobile ad Hoc Networking & Computing, pages 106–116. ACM Press, 2001.

    Google Scholar 

  31. M. Min, F. Wang, D.-Z. Du, and P. M. Pardalos. A reliable virtual backbone scheme in mobile ad-hoc networks. In Proceedings of the 1st IEEE International Conference on Mobile Ad hoc and Sensor Systems, pages 60–69, 2004.

    Google Scholar 

  32. S. Narayanaswamy, V. Kawadia, R. S. Sreenivas, and P. R. Kumar. Power control in ad hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol. In European Wireless Conference, 2002.

    Google Scholar 

  33. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu. The broadcast storm problem in a mobile ad hoc network. In Proceedings of IEEE MOBICOM, pages 151–162, Seattle, 1999.

    Google Scholar 

  34. D. Niculescu and B. Nath. Ad hoc positioning system (APS). IEEE GLOBECOM, 1:2926–2931, 2001.

    Google Scholar 

  35. C. A. Oliveira and P. M. Pardalos. A distributed optimization algorithm for power control in wireless ad hoc networks. In Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS’04), volume 7, page 177. IEEE Computer Society, 2004.

    Article  Google Scholar 

  36. N. Patwari and Y. Wang. Relative location in wireless networks. In Proceedings of the IEEE Spring VTC, pages 1149–1153, 2001.

    Google Scholar 

  37. G. J. Pottie and W. J. Kaiser. Wireless integrated network sensors. Commun. ACM, 43(5):51–58, 2000.

    Article  Google Scholar 

  38. S. Ramanathan and M. Steenstrup. A survey of routing techniques for mobile communications networks. Baltzer/ACM Mobile Networks and Applications, 1:89–104, 1996.

    Article  Google Scholar 

  39. C. Savarese, J. Rabay, and K. Langendoen. Robust positioning algorithms for distributed ad-hoc wireless sensor networks. In USENIX Technical Annual Conference, 2002.

    Google Scholar 

  40. A. Savvides, C.-C. Han, and M. B. Srivastava. Dynamic fine-grained localization in ad-hoc networks of sensors. Mobile Comput. Netw., pages 166–179, 2001.

    Google Scholar 

  41. A. Savvides, H. Park, and M. B. Srivastava. The bits and flops of the n-hop multilateration primitive for node localization problems. In Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, pages 112–121. ACM Press, 2002.

    Google Scholar 

  42. S. Singh, M. Woo, and C. Raghavendra. Power aware routing in mobile ad hoc networks. In Proceedings of IEEE MOBICOM, 1998.

    Google Scholar 

  43. P. Sinha, R. Sivakumar, and V. Bharghavan. Enhancing ad hoc routing with dynamic virtual infrastructures. In Proceedings of IEEE INFOCOM, volume 3, pages 1763–1772, 2001.

    Google Scholar 

  44. I. Söderkvist. On algorithms for generalized least squares problems with ill-conditioned covariance matrices. Computational Statistics, 11:303–313, 1996.

    MATH  Google Scholar 

  45. B. Warneke, M. Last, B. Liebowitz, and K. S. J. Pister. Smart dust: Communicating with a cubic-millimeter computer. Computer, 34(1):44–51, 2001.

    Article  Google Scholar 

  46. J. Wu, F. Dai, M. Gao, and I. Stojmenovic. On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. IEEE/KICS J. Commun. Netw., 4(1):59–70, 2002.

    Google Scholar 

  47. J. Wu and H. Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 7–14, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Industrial Engineering and Management, Oklahoma State University, Stillwater, OK, 74078

    Carlos A. S. Oliveira

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611

    Panos M. Pardalos

Authors
  1. Carlos A. S. Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Missouri, Rolla, Missouri

    Maggie Xiaoyan Cheng

  2. Georgia State University, Atlanta, Georgia

    Yingshu Li

  3. University of Texas at Dallas, Richardson, Texas

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Oliveira, C.A.S., Pardalos, P.M. (2006). Ad Hoc Networks: Optimization Problems and Solution Methods. In: Cheng, M.X., Li, Y., Du, DZ. (eds) Combinatorial Optimization in Communication Networks. Combinatorial Optimization, vol 18. Springer, Boston, MA. https://doi.org/10.1007/0-387-29026-5_6

Download citation

  • DOI: https://doi.org/10.1007/0-387-29026-5_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-29025-6

  • Online ISBN: 978-0-387-29026-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation