Channel access algorithms with active link protection for wireless communication networks with power control

Bambos, Nicholas; Chen, Shou C.; Pottie, Gregory J.

doi:10.1109/90.879345

Cited by 280 publications

(356 citation statements)

References 23 publications

Supporting

Mentioning

353

Contrasting

Order By: Relevance

“…For example, the DPC/ALP algorithm of Bambos et al [3], which involves two separate modes for active and inactive links, can be viewed as a case of (13), with γ i (k) given by the piecewise linear function…”

Section: Design For Transientsmentioning

confidence: 99%

“…In particular, this algorithm has been extended for other network models, e.g., [7], [8], [9] examined asynchronous implementation, bursty transmissions, and multiclass traffic; [13], [14] considered joint power and base station assignment, and [1], [2] studied admission control with power control. As a key paper that started to examine non-equilibrium properties of DPC algorithms, [3] tackled the issue of protecting active links while new links are introduced, by modifying the FoschiniMiljanic algorithm to include two different update rules for active and inactive links. The present work further shifts the attention to what happens to DPC before reaching the equilibrium.…”

Section: Background and Related Workmentioning

confidence: 99%

“…Many iterative [5], [3] and distributed [5], [6], [9] algorithms have been proposed; some of these converge to a globally optimal power allocation, while others converge to a Nash equilibrium. In all cases, efficiency and fairness of power allocation and Signal-Interference-Ratio (SIR) configuration at equilibrium have been the focus.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

WLC39-1: Transient Analysis for Wireless Power Control

2006

View full text Add to dashboard Cite

Abstract-Power control mitigates interference and maintains required QoS levels in cellular wireless networks. An important class of distributed power control (DPC) was proposed by Foschini and Miljanic in 1993, with many variants developed since. Almost all related work focuses on the equilibrium and asymptotic convergence properties. However, for many applications transient behavior is more important. If a link's SIR drops below a critical threshold for too long, the connections over this link will be dropped, rendering the entire concept of equilibrium resource allocation meaningless. This paper proposes a systematic approach to the analysis of transient properties of DPC algorithms, in particular Foschini-Miljanic, based on tools from control theory. Analytically, we present a sufficient condition to ensure that after links reach their minimum SIR levels, their SIR requirements can be guaranteed for future time steps. Computationally, we pose this problem as verifying the invariance of certain regions in the SIR space, which for the basic DPC algorithm can be cast as a Linear Program (LP). Furthermore, using insights gained from the analysis, we propose a preliminary design framework for new iterative power control schemes.

show abstract

Section: Design For Transientsmentioning

confidence: 99%

Section: Background and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

WLC39-1: Transient Analysis for Wireless Power Control

2006

View full text Add to dashboard Cite

show abstract

“…For this, we will make use of the Perron Frobenius theory (see [15]), by analogy with the characterization of power feasibility for the uplink in [2,8,9].…”

Section: Downlink Transmit Power Feasibilitymentioning

confidence: 99%

A Combinatorial Approximation Algorithm for CDMA Downlink Rate Allocation

Boucherie

Bumb

Endrayanto

et al. 2006

Operations Research/Computer Science Interfaces Series

View full text Add to dashboard Cite

This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression for the so-called Perron-Frobenius eigenvalue of that matrix, which provides a quick assessment of the feasibility of the power assignment for a given downlink rate allocation. Based on the Perron-Frobenius eigenvalue, we reduce the downlink rate allocation problem to a set of multiple-choice knapsack problems. The solution of these problems provides an approximation of the optimal downlink rate allocation and cell borders for which the system throughput, expressed in terms of utility functions of the users, is maximized.

show abstract

“…The work to date on joint admission and power control has focused on gradual removals (e.g., [1], [7], [3]) until the problem becomes feasible, or gradual admissions (e.g., [30], [27], [2], [24], [25], [26]) when possible. In both cases, the issue is whether or not to remove or admit a single user, and adjust transmission powers if necessary.…”

mentioning

confidence: 99%

Joint Power and Admission Control for Ad-Hoc and Cognitive Underlay Networks: Convex Approximation and Distributed Implementation

Mitliagkas

Sidiropoulos

Swami

2011

IEEE Trans. Wireless Commun.

109

View full text Add to dashboard Cite

Abstract-Power control is important in interference-limited cellular, ad-hoc, and cognitive underlay networks, when the objective is to ensure a certain quality of service to each connection. Power control has been extensively studied in this context, including distributed algorithms that are particularly appealing in adhoc and cognitive settings. A long-standing issue is that the power control problem may be infeasible, thus requiring appropriate admission control. The power and admission control parts of the problem are tightly coupled, but the joint optimization problem is NP-hard. We begin with a convenient reformulation which enables a disciplined convex approximation approach. This leads to a centralized approximate solution that is numerically shown to outperform the prior art, and even yield close to optimal results in certain cases -at affordable complexity. The issue of imperfect channel state information is also considered. A distributed implementation is then developed, which alternates between distributed approximation and distributed deflationreaching consensus on a user to drop, when needed. Both phases require only local communication and computation, yielding a relatively lightweight distributed algorithm with the same performance as its centralized counterpart.

show abstract

Channel access algorithms with active link protection for wireless communication networks with power control

Cited by 280 publications

References 23 publications

WLC39-1: Transient Analysis for Wireless Power Control

WLC39-1: Transient Analysis for Wireless Power Control

A Combinatorial Approximation Algorithm for CDMA Downlink Rate Allocation

Joint Power and Admission Control for Ad-Hoc and Cognitive Underlay Networks: Convex Approximation and Distributed Implementation

Contact Info

Product

Resources

About