اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Distributed Power Control and Transmission Rate Allocation Algorithm over Multiple Channels
184
0
0.0
(
0
)
نشر من قبل
Themistoklis Charalambous
تاريخ النشر
2011
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we consider multiple channels and wireless nodes with multiple transceivers. Each node assigns one transmitter at each available channel. For each assigned transmitter the node decides the power level and data rate of transmission in a distributed fashion, such that certain Quality of Service (QoS) demands for the wireless node are satisfied. More specifically, we investigate the case in which the average SINR over all channels for each communication pair is kept above a certain threshold. A joint distributed power and rate control algorithm for each transmitter is proposed that dynamically adjusts the data rate to meet a target SINR at each channel, and to update the power levels allowing for variable desired SINRs. The algorithm is fully distributed and requires only local interference measurements. The performance of the proposed algorithm is shown through illustrative examples.
قيم البحث
اقرأ أيضاً
Although state estimation in networked control systems is a fundamental problem, few efforts have been made to study distributed state estimation via multiple access channels (MACs). In this article, we give a characterization of the zero-error capac
ity region of an M-input, single-output MAC at any finite block-length. To this end, nonstochastic information-theoretic tools are used to derive the converse and achievability proofs. Next, a tight condition to be able to achieve uniformly bounded state estimation errors over such a MAC is provided. The obtained condition establishes a connection between the intrinsic topological entropies of the linear systems and the zero-error capacity region of the MAC.
Rate-splitting multiple access (RSMA) is a general multiple access scheme for downlink multi-antenna systems embracing both classical spatial division multiple access and more recent non-orthogonal multiple access. Finding a linear precoding strategy
that maximizes the sum spectral efficiency of RSMA is a challenging yet significant problem. In this paper, we put forth a novel precoder design framework that jointly finds the linear precoders for the common and private messages for RSMA. Our approach is first to approximate the non-smooth minimum function part in the sum spectral efficiency of RSMA using a LogSumExp technique. Then, we reformulate the sum spectral efficiency maximization problem as a form of the log-sum of Rayleigh quotients to convert it into a tractable non-convex optimization problem. By interpreting the first-order optimality condition of the reformulated problem as an eigenvector-dependent nonlinear eigenvalue problem, we reveal that a leading eigenvector is a local optimal solution. To find the leading eigenvector, we propose a computationally efficient algorithm inspired by a power iteration method. Simulation results show that the proposed RSMA transmission strategy provides significant improvement in the sum spectral efficiency compared to the state-of-the-art RSMA transmission methods, while requiring considerably less computational complexity.
This paper considers state estimation of linear systems using analog amplify and forwarding with multiple sensors, for both multiple access and orthogonal access schemes. Optimal state estimation can be achieved at the fusion center using a time vary
ing Kalman filter. We show that in many situations, the estimation error covariance decays at a rate of $1/M$ when the number of sensors $M$ is large. We consider optimal allocation of transmission powers that 1) minimizes the sum power usage subject to an error covariance constraint and 2) minimizes the error covariance subject to a sum power constraint. In the case of fading channels with channel state information the optimization problems are solved using a greedy approach, while for fading channels without channel state information but with channel statistics available a sub-optimal linear estimator is derived.
In the paper we study a deep learning based method to solve the multicell power control problem for sum rate maximization subject to per-user rate constraints and per-base station (BS) power constraints. The core difficulty of this problem is how to
ensure that the learned power control results by the deep neural network (DNN) satisfy the per-user rate constraints. To tackle the difficulty, we propose to cascade a projection block after a traditional DNN, which projects the infeasible power control results onto the constraint set. The projection block is designed based on a geometrical interpretation of the constraints, which is of low complexity, meeting the real-time requirement of online applications. Explicit-form expression of the backpropagated gradient is derived for the proposed projection block, with which the DNN can be trained to directly maximize the sum rate via unsupervised learning. We also develop a heuristic implementation of the projection block to reduce the size of DNN. Simulation results demonstrate the advantages of the proposed method over existing deep learning and numerical optimization~methods, and show the robustness of the proposed method with the model mismatch between training and testing~datasets.
Jointly optimal transmission power control and remote estimation over an infinite horizon is studied. A sensor observes a dynamic process and sends its observations to a remote estimator over a wireless fading channel characterized by a time-homogene
ous Markov chain. The successful transmission probability depends on both the channel gains and the transmission power used by the sensor. The transmission power control rule and the remote estimator should be jointly designed, aiming to minimize an infinite-horizon cost consisting of the power usage and the remote estimation error. A first question one may ask is: Does this joint optimization problem have a solution? We formulate the joint optimization problem as an average cost belief-state Markov decision process and answer the question by proving that there exists an optimal deterministic and stationary policy. We then show that when the monitored dynamic process is scalar, the optimal remote estimates depend only on the most recently received sensor observation, and the optimal transmission power is symmetric and monotonically increasing with respect to the innovation error.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
