Advertisement

Telecommunication Systems

, Volume 44, Issue 3–4, pp 307–320 | Cite as

A distributed congestion and power control algorithm to achieve bounded average queuing delay in wireless networks

  • Behzad Mohammadi Dogahe
  • Manohar N. Murthi
  • Xingzhe Fan
  • Kamal Premaratne
Article

Abstract

Allocating limited resources such as bandwidth and power in a multi-hop wireless network can be formulated as a Network Utility Maximization (NUM) problem. In this approach, both transmitting source nodes and relaying link nodes exchange information allowing for the NUM problem to be solved in an iterative distributed manner. Some previous NUM formulations of wireless network problems have considered the parameters of data rate, reliability, and transmitter powers either in the source utility function which measures an application’s performance or as constraints. However, delay is also an important factor in the performance of many applications. In this paper, we consider an additional constraint based on the average queueing delay requirements of the sources. In particular, we examine an augmented NUM formulation in which rate and power control in a wireless network are balanced to achieve bounded average queueing delays for sources. With the additional delay constraints, the augmented NUM problem is non-convex. Therefore, we present a change of variable to transform the problem to a convex problem and we develop a solution which results in a distributed rate and power control algorithm tailored to achieving bounded average queueing delays. Simulation results demonstrate the efficacy of the distributed algorithm.

Network utility maximization Queuing delay Convex optimization Power management 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kelly, F. P., Maulloo, A., & Tan, D. (1998). Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49(3), 237–252. Google Scholar
  2. 2.
    Lee, J. W., Chiang, M., & Calderbank, R. A. (2006). Price-based distributed algorithm for optimal rate-reliability tradeoff in network utility maximization. IEEE Journal of Selected Areas in Communications, 24(5), 962–976. CrossRefGoogle Scholar
  3. 3.
    Chiang, M. (2005). Balancing transport and physical layers in wireless multihop networks: jointly optimal congestion control and power control. IEEE Journal of Selected Areas in Communications, 23(1), 104–116. CrossRefGoogle Scholar
  4. 4.
    Low, S. H. (2003). A duality model of TCP and queue management algorithms. IEEE/ACM Transactions on Networking, 11(4), 525–536. CrossRefGoogle Scholar
  5. 5.
    Low, S. H., & Lapsley, D. E. (1999). Optimization flow control, I: basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7(6), 861–874. CrossRefGoogle Scholar
  6. 6.
    Lee, J. W., Chiang, M., & Calderbank, R. A. (2006). Jointly optimal congestion and contention control in wireless ad hoc networks. IEEE Communications Letters, 10(3), 216–218. CrossRefGoogle Scholar
  7. 7.
    Saad, M., Leon-Garcia, A., & Yu, W. (2007). Optimal network rate allocation under end-to-end quality-of-service requirements. IEEE Transactions on Network and Service Management, 4(3), 40–49. CrossRefGoogle Scholar
  8. 8.
    Lee, W., Mazumdar, R. R., & Shroff, N. B. (2004). Opportunistic power scheduling for multi-server wireless systems with minimum performance constraints. In Proc. IEEE INFOCOM, Mar. 2004 (pp. 1067–1077). Google Scholar
  9. 9.
    Marbach, P., & Berry, R. (2002). Downlink resource allocation and pricing for wireless networks. In Proc. IEEE INFOCOM, Jun. 2002 (pp. 1470–1479). Google Scholar
  10. 10.
    Razavilar, J., Liu, K. J. R., & Marcus, S. I. (2002). Jointly optimized bit-rate/delay control policy for wireless packet networks with fading channels. IEEE Transactions on Communications, 50(3), 484–494. CrossRefGoogle Scholar
  11. 11.
    Julian, D., Chiang, M., O’Neill, D., & Boyd, S. (2002). QoS and fairness constrained convex optimization of resource allocation for wireless cellular and ad hoc networks. In Proc. IEEE INFOCOM, Jun. 2002 (pp. 477–486). Google Scholar
  12. 12.
    Li, Y., Chiang, M., Calderbank, A. R., & Diggavi, S. N. (2007). Optimal delay-rate-reliability tradeoff in networks with composite links. In Proc. IEEE INFOCOM, May 2007 (pp. 526–534). Google Scholar
  13. 13.
    Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press. Google Scholar
  14. 14.
    Bertsekas, D. (1999). Nonlinear programming. Nashua: Athena Scientific. Google Scholar
  15. 15.
    Papandriopoulos, J., Dey, S., & Evans, J. (2008). Optimal and distributed protocols for cross-layer design of physical and transport layers in MANETs. IEEE/ACM Transactions on Networking, 16(6), 1392–1405. CrossRefGoogle Scholar
  16. 16.
    Chiang, M., & Bell, J. (2004). Balancing supply and demand of bandwidth in wireless cellular networks: utility maximization over powers and rates. In Proc. IEEE INFOCOM, 2004 (Vol. 4, pp. 2800–2811). Google Scholar
  17. 17.
    Johansson, M., Xiao, L., & Boyd, S. (2003). Simultaneous routing and power allocation in CDMA wireless data networks. In IEEE int. conf. communications, May 2003. Google Scholar
  18. 18.
    Madan, R., Cui, S., Lall, S., & Goldsmith, A. (2005). Cross-layer design for lifetime maximization in interference-limited wireless sensor networks. In Proc. IEEE INFOCOM, Mar. 2005. Google Scholar
  19. 19.
    Dogahe, B. M., Fan, X., Murthi, M. N., & Premaratne, K. (2007). Balancing power and rate to achieve bounded average delay in wireless networks. In Proc. IEEE MILCOM, Oct. 2007 (pp. 1–7). Google Scholar
  20. 20.
    Goldsmith, A. (2004). Wireless communications. Cambridge: Cambridge Univ. Press. Google Scholar
  21. 21.
    Bambos, N. (1998). Toward power-sensitive network architectures in wireless communications: concepts, issues, and design aspects. IEEE Personal Communications Magazine, 5(3), 50–59. CrossRefGoogle Scholar
  22. 22.
    Gerla, M., & Kleinrock, L. (1977). On the topological design of distributed computer networks. IEEE Transactions on Communications, COM-25(1), 48–60. CrossRefGoogle Scholar
  23. 23.
    Bertsekas, D., & Gallager, R. (1992). Data networks. New York: Prentice Hall. Google Scholar
  24. 24.
    Palomar, D., & Chiang, M. (2006). A tutorial on decomposition methods and distributed network resource allocation. IEEE Journal of Selected Areas in Communications, 24(8), 1439–1451. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Behzad Mohammadi Dogahe
    • 1
  • Manohar N. Murthi
    • 1
  • Xingzhe Fan
    • 1
  • Kamal Premaratne
    • 1
  1. 1.Department of Electrical and Computer EngineeringUniversity of MiamiCoral GablesUSA

Personalised recommendations