Balancing Power and Rate to Achieve Bounded Average Delay in Wireless Networks

Dogahe, Behzad Mohammadi; Fan, Xingzhe; Murthi, Manohar N.; Premaratne, Kamal

doi:10.1109/milcom.2007.4454959

Cited by 1 publication

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We utilize this approach to step-sizes throughout the paper. The source problem in (19) can itself be separated to be solved at each source independently by just the feedback information of λ , i.e., max…”

Section: Distributed Resource Allocation Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

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

et al. 2010

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Distributed Resource Allocation Algorithmmentioning

confidence: 99%

“…Our preliminary results on this work appeared in [19]. The rest of the paper is organized as follows.…”

Section: Introductionmentioning

confidence: 99%