SpringerLink
Log in

Recursive estimation algorithms for power controls of wireless communication networks

  • Published:
Journal of Control Theory and Applications Aims and scope Submit manuscript

Abstract

Power control problems for wireless communication networks are investigated in direct-sequence code-division multiple-access (DS/CDMA) channels. It is shown that the underlying problem can be formulated as a constrained optimization problem in a stochastic framework. For effective solutions to this optimization problem in real time, recursive algorithms of stochastic approximation type are developed that can solve the problem with unknown system components. Under broad conditions, convergence of the algorithms is established by using weak convergence methods.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (France)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. G. Proakis. Digital Communications[M]. 4th ed. New York: McGraw Hill, 2001.

    Google Scholar 

  2. V. Krishnamurthy, G. Yin, S. Singh. Adaptive step size algorithms for blind interference suppression in DS/CDMA systems[J]. IEEE Transactions on Signal Processing, 2001, 49(1): 190–201.

    Article  Google Scholar 

  3. H. V. Poor, X. Wang. Code-aided interference suppression for DS/CDMA communications-Part I: Interference suppression capability[J]. IEEE Transactions on Communication, 1997, 45(9): 1101–1111.

    Article  Google Scholar 

  4. H. V. Poor, X. Wang. Code-aided interference suppression for DS/CDMA communications-Part II: Parallel blind adaptive implementations[J]. IEEE Transactions on Communication, 1997, 45(9): 1112–1122.

    Article  Google Scholar 

  5. S. Ulukus, R. D. Yates. Stochastic power control for cellular radio systems[J]. IEEE Transactions on Communication, 1998, 46(6): 784–798.

    Article  Google Scholar 

  6. P. Billingsley. Convergence of Probability Measures[M]. New York: John Wiley & Sons, 1968.

    Google Scholar 

  7. M. Iosifescu. Finite Markov Processes and Their Applications[M]. New York: John Wiley & Sons, 1980.

    Google Scholar 

  8. H. J. Kushner, D. S. Clark. Stochastic Approximation for Constrained and Unconstrained Systems[M]. New York: Springer, 1978.

    Google Scholar 

  9. H. J. Kushner, G. Yin. Stochastic Approximation and Recursive Algorithms and Applications[M]. 2nd ed. New York: Springer, 2003.

    Google Scholar 

  10. F. Babich, G. Lombardi. A Markov model for the mobile propagation channel[J]. IEEE Transactions on Vehicular Technology, 2000, 49(1): 63–73.

    Article  Google Scholar 

  11. M. Zorzi, A Chockalingam, R. R. Rao. Throughput analysis of TCP on channels with memory[J]. IEEE Journal on Selected Areas in Communications, 2000, 18(7): 1289–1300.

    Article  Google Scholar 

  12. A. Graham. Kronecker Products and Matrix Calculus with Applications[M]. Chinchester: Ellis Horwood Ltd., 1981.

    Google Scholar 

  13. H. J. Kushner. Approximation and Weak Convergence Methods for Random Processes, with Applications to Stochastic Systems Theory[M]. Cambridge: MIT Press, 1984.

    Google Scholar 

  14. G. Yin. Rates of convergence for a class of global stochastic optimization algorithms[J]. SIAM Journal on Optimization, 1999: 10(1): 99–120.

    Article  MATH  MathSciNet  Google Scholar 

  15. G. Yin. Convergence of a global stochastic optimization algorithm with partial step size restarting[J]. Advances in Applied Probability., 2000, 32(2): 480–498.

    Article  MATH  MathSciNet  Google Scholar 

  16. P. L’Ecuyer, G. Yin. Budget-dependent convergence rate of stochastic approximation[J]. SIAM Journal on Optimization, 1998, 8(1): 217–247.

    Article  MATH  MathSciNet  Google Scholar 

  17. G. Yin, V. Krishnamurthy, C. Ion. Iterate-averaging sign algorithms for adaptive filtering with applications to blind multiuser detection[J]. IEEE Transactions on Information Theory, 2003, 49(3): 657–671.

    Article  MATH  MathSciNet  Google Scholar 

  18. G. Yin, V. Krishnamurthy. Least mean square algorithms with Markov regime switching limit[J]. IEEE Transactions on Automatic Control, 2005, 50(5): 577–593.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Wayne State University, Detroit, Michigan, 48202, USA

    Gang George Yin

  2. Department of Mechanical Engineering, Wayne State University, Detroit, Michigan, 48202, USA

    Chin-An Tan

  3. Department of Electrical and Computer Engineering, Wayne State University, Detroit, Michigan, 48202, USA

    Le Yi Wang & Chengzhong Xu

Authors
  1. Gang George Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chin-An Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Le Yi Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chengzhong Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gang George Yin.

Additional information

Research of G. Yin was supported by the National Science Foundation (CMS-0510655, DMS-0624849), the National Security Agency (MSPF-068-029), and the National Natural Science Foundation of China (No.60574069); research of C.-A. Tan was supported by the National Science Foundation (CMS-0510655); research of L. Y. Wang was supported by the National Science Foundation (ECS-0329597, DMS-0624849); research of C. Z. Xu was supported by the National Science Foundation (CCF-0611750, DMS-0624849, CNS-0702488, CRI-0708232).

Gang George YIN received his B.S. degree in Mathematics from the University of Delaware in 1983, M.S. degree in Electrical Engineering and Ph.D. degree in Applied Mathematics from Brown University in 1987. He then joined the Department of Mathematics, Wayne State University, and became a professor in 1996. He is a fellow of IEEE. He severed on the Mathematical Review Date Base Committee, IFAC Technical Committee on Modeling, Identification and Signal Processing, and various conference program committees; he was the editor of SIAM Activity Group on Control and Systems Theory Newsletters, Co-Chair of 1996 AMS-SIAM Summer Seminar in Applied Mathematics, Co-Chair of 2003 AMS-IMS-SIAM Summer Research Conference: Mathematics of Finance, and Co-organizer of 2005 IMA Workshop on Wireless Communications. He is an associate editor of Journal of Control Theory and Applications, Automatica, and SIAM Journal on Control and Optimization, was an associate editor of IEEE Transactions on Automatic Control from 1994 to 1998, and is on the editorial board of several other journals.

Chin-An TAN received the Ph.D. degree in Mechanical Engineering in 1989 from the University of California at Berkeley. Upon graduation, he joined the Mechanical Engineering Department at Wayne State University in Detroit, Michigan and is currently a professor. His research interests are in system dynamics and control, with applications to structural health monitoring and power harvesting for sensor networks. He is a fellow of the American Society of Mechanical Engineers (ASME).

Le Yi WANG received the Ph.D. degree in Electrical Engineering from McGill University, Montreal, Canada, in 1990. Since 1990, he has been with Wayne State University, Detroit, Michigan, where he is currently a professor in the Department of Electrical and Computer Engineering. His research interests are in the areas of complexity and information, system identification, robust control, H-infinity optimization, time-varying systems, adaptive systems, hybrid and nonlinear systems, information processing and learning, as well as medical, automotive, communications, and computer applications of control methodologies. He was a keynote speaker in four international conferences. He serves on the IFAC Technical Committee on Modeling, Identification and Signal Processing. He was an associate editor of the IEEE Transactions on Automatic Control, and currently is an editor of the Journal of System Sciences and Complexity, an associate editor of Journal of Control Theory and Applications, an associate editor of International Journal of Control and Intelligent Systems.

Chengzhong XU is a professor in the Department of Electrical and Computer Engineering of Wayne State University. His research interest includes networked computing systems and applications, in particular scalable and secure Internet services and architecture, scheduling and resource management in distributed, parallel, and embedded systems. He has published more than 120 peer-reviewed scientific papers in these areas. He is the author of “Scalable and Secure Internet Services and Architecture” and the leading coauthor of “Load Balancing in Parallel Computers: Theory and Practice.“ He serves on a number of editorial boards, including IEEE Transactions on Parallel and Distributed Systems and Journal of Parallel and Distributed Computing. He was a recipient of President’s “Award for Excellence in Teaching” of WSU in 2002 and “Career Development Chair Award” in 2003. He received the Ph.D. degree in Computer Science from the University of Hong Kong in 1993.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yin, G.G., Tan, CA., Wang, L.Y. et al. Recursive estimation algorithms for power controls of wireless communication networks. J. Control Theory Appl. 6, 225–232 (2008). https://doi.org/10.1007/s11768-008-7125-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11768-008-7125-8

Keywords

Search

Navigation