Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

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.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Juha Leino. Applications of game theory in ad hoc networks [Thesis]. Department of Engineering Physics and Mathematics, Helsinki University of Technology.

  2. Bay area wireless users group. http://www.bawug.org/.

  3. Seattle wireless. http://www.seattlewireless.net/.

  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.

  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.

  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. 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.

  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.

  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.

  10. Hajck B, Wieselthier J. Link scheduling in polynomial time. IEEE Trans. Information Theory, September 1988, 34(5): 910–917.

    Google Scholar 

  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.

  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.

  13. Toumpis S, Goldsmith A J. Capacity regions for wireless ad hoc networks. International Symposium on Communication Theory and Applications, Ambleside, UK, April 2001. http://citeseer.ist.psu.edu/toumpis01capacity.html

  14. Elbatt T, Ephremides A. Joint scheduling and power control for wireless ad-hoc networks. In Proc. IEEE INFOCOM, New York, 2002.

  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.

  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.

  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.

  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.

  19. Fourer R, Gay D M, Kernighan W. AMPL—A Modeling Language for Mathematical Programming. Danvers, MA: Boyd & Fraser, 1993.

    Google Scholar 

  20. http://www.ntia.doc.gov/osmhome/reports/uwb/uwb.pdf

  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.

  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. Marco E Lubbecke. Selected topics in column generation. Department of Mathematical Optimization, Braunschweig University of Technology, Technical Report 008-2004.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Science and Technology of China, Hefei, 230027, P.R. China

    Heng-Chang Liu & Bao-Hua Zhao

  2. Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100080, P.R. China

    Heng-Chang Liu & Bao-Hua Zhao

Authors
  1. Heng-Chang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bao-Hua Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Heng-Chang Liu.

Additional information

This paper is supported by the National Natural Science Foundation of China under Grant Nos. 60241004 and 90104010, the National Basic Research 973 Program of China under Grant No. 2003CB314801, and the State Key Laboratory of Networking and Switching Technology.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, HC., Zhao, BH. A Near-Optimal Optimization Algorithm for Link Assignment in Wireless Ad-Hoc Networks. J Comput Sci Technol 21, 89–94 (2006). https://doi.org/10.1007/s11390-006-0089-6

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-006-0089-6

Keywords

Search

Navigation