Journal of Computer Science and Technology

, Volume 21, Issue 1, pp 89–94 | Cite as

A Near-Optimal Optimization Algorithm for Link Assignment in Wireless Ad-Hoc Networks

  • Heng-Chang LiuEmail author
  • Bao-Hua Zhao


Over the past few years, wireless networking technologies have made vast forays in our daily lives. In wireless ad-hoc networks, links are set up by a number of units without any permanent infrastructures. In this paper, the resource optimization is considered to maximize the network throughput by efficiently using the network capacity, where multi-hop functionality and spatial TDMA (STDMA) access scheme are used. The objective is to find the minimum frame length with given traffic distributions and corresponding routing information. Because of the complex structure of the underlying mathematical problem, previous work and analysis become intractable for networks of realistic sizes. The problem is addressed through mathematical programming approach, the linear integer formulation is developed for optimizing the network throughput, and then the similarity between the original problem and the graph edge coloring problem is shown through the conflict graph concept. A column generation solution is proposed and several enhancements are made in order to fasten its convergence. Numerical results demonstrate that the theoretical limit of the throughput can be efficiently computed for networks of realistic sizes.


link scheduling STDMA wireless network mathematical modeling column generation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Juha Leino. Applications of game theory in ad hoc networks [Thesis]. Department of Engineering Physics and Mathematics, Helsinki University of Technology.Google Scholar
  2. 2.
    Bay area wireless users group.
  3. 3.
  4. 4.
    Honghai Zhang, Jennifer Hou. On deriving the upper bound of alpha-lifetime for large sensor networks. UIUC Computer Science Technical Report UIUC DCS-R-2004-2410.Google Scholar
  5. 5.
    Howard A, Mataric M J, Sukhatme G S. Mobile sensor network deployment using potential fields: A distributed scalable solution to the area coverage problem. In Proc. Int. Conf. Distributed Autonomous Robotic Systems, Fukuoka, Japan, June 2002, pp.299–308.Google Scholar
  6. 6.
    Goldsmith A J, Wicker S B. Design challenges for energy-constrained ad-hoc wireless networks. IEEE Trans. Wireless Communications, August 2002, 9(4): 8–27.Google Scholar
  7. 7.
    Somarriba O, Giles T C. Transmission power control for spatial TDMA in wireless radio networks. In Proc. the 4th IEEE Conf. Mobile and Wireless Communications Networks, Stockholm, Sweden, September 2002.Google Scholar
  8. 8.
    Somarriba O. Multi-hop packet radio systems in rough terrain [Thesis]. Radio Communications Systems, Department of Signals, Sensors and Systems, Royal Institute of Technology, 10044 Stockholm, Sweden, October 1995.Google Scholar
  9. 9.
    Gronkvist J. Assignment strategies for spatial reuse TDMA [Thesis]. Radio Communications Systems, Department of Signals, Sensors and Systems, Royal Institute of Technology, 10044 Stockholm, Sweden, October 2002.Google Scholar
  10. 10.
    Hajck B, Wieselthier J. Link scheduling in polynomial time. IEEE Trans. Information Theory, September 1988, 34(5): 910–917.Google Scholar
  11. 11.
    Baker D J, Wieselthier J, Ephremides A. A distributed algorithm for scheduling the activation of links in a self-organizing mobile radio network. In Proc. the IEEE Int. Conf. Communications, Philadelphia, PA, June 1982, pp.2.F.6.1–2.F.6.5.Google Scholar
  12. 12.
    Liu H C, Zhao B H. Optimal scheduling for link assignment in traffic-sensitive STDMA wireless ad-hoc networks. In Int. Conf. Computer Networks and Mobile Computing, Zhangjiajie, China. August, 2005, pp.218–228.Google Scholar
  13. 13.
    Toumpis S, Goldsmith A J. Capacity regions for wireless ad hoc networks. International Symposium on Communication Theory and Applications, Ambleside, UK, April 2001.
  14. 14.
    Elbatt T, Ephremides A. Joint scheduling and power control for wireless ad-hoc networks. In Proc. IEEE INFOCOM, New York, 2002.Google Scholar
  15. 15.
    Cruz R L, Santhnam A. Optimal routing, link scheduling, and power control in multi-hop wireless networks. In Proc. the IEEE INFOCOM, San Francisco, CA, April 1–3, 2003.Google Scholar
  16. 16.
    Varbrand P, Yuan D, Bjorklund P. Resource optimization of spatial TDMA in ad hoc radio networks: A column generation approach. In Proc. IEEE INFOCOM, San Francisco, CA, April 1–3, 2003.Google Scholar
  17. 17.
    Johansson M, Xiao L. Cross-layer optimization of wireless networks using nonlinear column generation. In Proc. Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks, Oct. 2004.Google Scholar
  18. 18.
    Bjorklund P, Varbrand P, Yuan D. Resource optimization of spatial TDMA in ad hoc radio networks. In Proc. the 2003 Infocom, San Francisco, CA, April 1–3, 2003.Google Scholar
  19. 19.
    Fourer R, Gay D M, Kernighan W. AMPL—A Modeling Language for Mathematical Programming. Danvers, MA: Boyd & Fraser, 1993.Google Scholar
  20. 20.
  21. 21.
    Kamal Jain, Jitendra Padhye, Venkat Padmanabhan, Lili Qiu. Impact of interference on multihop wireless network performance. In Proc. MobiHoc 2003, Maryland, USA, June 1–3, 2003.Google Scholar
  22. 22.
    Mehrotra A, Trick M A. A column generation approach for graph coloring. INFORMS Journal on Computing, 1996, 8(4): 344–354.Google Scholar
  23. 23.
    Marco E Lubbecke. Selected topics in column generation. Department of Mathematical Optimization, Braunschweig University of Technology, Technical Report 008-2004.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2006

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of Science and Technology of ChinaHefeiP.R. China
  2. 2.Laboratory of Computer Science, Institute of SoftwareChinese Academy of SciencesBeijingP.R. China

Personalised recommendations