Search arXivSearch

arXiv · 0907.2896

Decentralized Admission Control for Power-Controlled Wireless Links

Abstract

This paper deals with the problem of admission control/channel access in power-controlled decentralized wireless networks, in which the quality-of-service (QoS) is expressed in terms of the signal-to-interference ratio (SIR). We analyze a previously proposed admission control algorithm, which was designed to maintain the SIR of operational (active) links above some given threshold at all times (protection of active links). This protection property ensures that as new users attempt to join the network, the already established links sustain their quality. The considered scheme may be thus applicable in some cognitive radio networks, where the fundamental premise is that secondary users may be granted channel access only if it does not cause disturbance to primary users. The admission control algorithm was previously analyzed under the assumption of affine interference functions. This paper extends all the previous results to arbitrary standard interference functions, which capture many important receiver designs, including optimal linear reception in the sense of maximizing the SIR and the worst-case receiver design. Furthermore, we provide novel conditions for protection of active users under the considered control scheme when individual power constraints are imposed on each link. Finally, we consider the possibility of a joint optimization of transmitters and receivers in networks with linear transceivers, which includes linear beamforming in multiple antenna systems. Transmitter optimization is performed alternately with receiver optimization to generate non-decreasing sequences of SIRs. Numerical evaluations show that additional transmitter side optimization has potential for significant performance gains.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sławomir Stańczak, Michał Kaliszan, Nicholas Bambos. 2010-01-06. Decentralized Admission Control for Power-Controlled Wireless Links. https://arxiv.org/abs/0907.2896

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT