TY - JOUR
T1 - The end-to-end rate control in multiple-hop wireless networks
T2 - Cross-layer formulation and optimal allocation
AU - Long, Chengnian
AU - Li, Bo
AU - Zhang, Qian
AU - Zhao, Bin
AU - Yang, Bo
AU - Guan, Xinping
PY - 2008/5
Y1 - 2008/5
N2 - In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control, random access and power control design with multihop transmissions and interference-limited link rates. In order to address both the end-to-end throughput maximization and energy efficiency, we formulate this problem into a cross-layer design problem under a realistic interference-based communication model, which captures the attainable link capacity in practice. There are primarily three challenges in this design: 1) how to formulate the cross-layer design; 2) how to solve the nonconvex and non-separable problem efficiently; more importantly 3) under a reasonably complexity, how to design a distributed algorithm that can realize this formulation while maintaining the architectural modularity among different layers. First, we propose a novel method that can convert a nonconvex and non-separable programming into an equivalent convex programming problem. The problem is solved by a dual decomposition technique. We show that the resulting algorithm can be practically realized. We then design a distributed algorithm that jointly considers random access and power control to adapt for the transport layer congestion status. Simulation results confirm that the proposed algorithm can achieve close to the global optimum within reasonable convergence times.
AB - In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control, random access and power control design with multihop transmissions and interference-limited link rates. In order to address both the end-to-end throughput maximization and energy efficiency, we formulate this problem into a cross-layer design problem under a realistic interference-based communication model, which captures the attainable link capacity in practice. There are primarily three challenges in this design: 1) how to formulate the cross-layer design; 2) how to solve the nonconvex and non-separable problem efficiently; more importantly 3) under a reasonably complexity, how to design a distributed algorithm that can realize this formulation while maintaining the architectural modularity among different layers. First, we propose a novel method that can convert a nonconvex and non-separable programming into an equivalent convex programming problem. The problem is solved by a dual decomposition technique. We show that the resulting algorithm can be practically realized. We then design a distributed algorithm that jointly considers random access and power control to adapt for the transport layer congestion status. Simulation results confirm that the proposed algorithm can achieve close to the global optimum within reasonable convergence times.
KW - Congestion control
KW - Cross-layer design
KW - Geometric programming
KW - Interferencebased communication model
KW - Multi-hop wireless networks
KW - Power control
KW - Random access
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:000255317700013
UR - https://openalex.org/W2125993456
UR - https://www.scopus.com/pages/publications/43349102371
U2 - 10.1109/JSAC.2008.080513
DO - 10.1109/JSAC.2008.080513
M3 - Journal Article
SN - 0733-8716
VL - 26
SP - 719
EP - 731
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 4
M1 - 4497796
ER -