اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMulti-Sensor Scheduling for State Estimation with Event-Based, Stochastic Triggers
163
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In networked systems, state estimation is hampered by communication limits. Past approaches, which consider scheduling sensors through deterministic event-triggers, reduce communication and maintain estimation quality. However, these approaches destroy the Gaussian property of the state, making it computationally intractable to obtain an exact minimum mean squared error estimate. We propose a stochastic event-triggered sensor schedule for state estimation which preserves the Gaussianity of the system, extending previous results from the single-sensor to the multi-sensor case.
قيم البحث
اقرأ أيضاً
We consider the problem of communication allocation for remote state estimation in a cognitive radio sensor network~(CRSN). A sensor collects measurements of a physical plant, and transmits the data to a remote estimator as a secondary user (SU) in t
he shared network. The existence of the primal users (PUs) brings exogenous uncertainties into the transmission scheduling process, and how to design an event-based scheduling scheme considering these uncertainties has not been addressed in the literature. In this work, we start from the formulation of a discrete-time remote estimation process in the CRSN, and then analyze the hidden information contained in the absence of data transmission. In order to achieve a better tradeoff between estimation performance and communication consumption, we propose both open-loop and closed-loop schedules using the hidden information under a Bayesian setting. The open-loop schedule does not rely on any feedback signal but only works for stable plants. For unstable plants, a closed-loop schedule is designed based on feedback signals. The parameter design problems in both schedules are efficiently solved by convex programming. Numerical simulations are included to illustrate the theoretical results.
This paper considers a remote state estimation problem with multiple sensors observing a dynamical process, where sensors transmit local state estimates over an independent and identically distributed (i.i.d.) packet dropping channel to a remote esti
mator. At every discrete time instant, the remote estimator decides whether each sensor should transmit or not, with each sensor transmission incurring a fixed energy cost. The channel is shared such that collisions will occur if more than one sensor transmits at a time. Performance is quantified via an optimization problem that minimizes a convex combination of the expected estimation error covariance at the remote estimator and expected energy usage across the sensors. For transmission schedules dependent only on the estimation error covariance at the remote estimator, this work establishes structural results on the optimal scheduling which show that 1) for unstable systems, if the error covariance is large then a sensor will always be scheduled to transmit, and 2) there is a threshold-type behaviour in switching from one sensor transmitting to another. Specializing to the single sensor case, these structural results demonstrate that a threshold policy (i.e. transmit if the error covariance exceeds a certain threshold and dont transmit otherwise) is optimal. We also consider the situation where sensors transmit measurements instead of state estimates, and establish structural results including the optimality of threshold policies for the single sensor, scalar case. These results provide a theoretical justification for the use of such threshold policies in variance based event triggered estimation. Numerical studies confirm the qualitative behaviour predicted by our structural results. An extension of the structural results to Markovian packet drops is also outlined.
This paper deals with the state estimation problem in discrete-event systems modeled with nondeterministic finite automata, partially observed via a sensor measuring unit whose measurements (reported observations) may be vitiated by a malicious attac
ker. The attacks considered in this paper include arbitrary deletions, insertions, or substitutions of observed symbols by taking into account a bounded number of attacks or, more generally, a total cost constraint (assuming that each deletion, insertion, or substitution bears a positive cost to the attacker). An efficient approach is proposed to describe possible sequences of observations that match the one received by the measuring unit, as well as their corresponding state estimates and associated total costs. We develop an algorithm to obtain the least-cost matching sequences by reconstructing only a finite number of possible sequences, which we subsequently use to efficiently perform state estimation. We also develop a technique for verifying tamper-tolerant diagnosability under attacks that involve a bounded number of deletions, insertions, and substitutions (or, more generally, under attacks of bounded total cost) by using a novel structure obtained by attaching attacks and costs to the original plant. The overall construction and verification procedure have complexity that is of O(|X|^2 C^2),where |X| is the number of states of the given finite automaton and C is the maximum total cost that is allowed for all the deletions, insertions, and substitutions. We determine the minimum value of C such that the attacker can coordinate its tampering action to keep the observer indefinitely confused while utilizing a finite number of attacks. Several examples are presented to demonstrate the proposed methods.
Spatial interference avoidance is a simple and effective way of mitigating interference in multi-antenna wireless networks. The deployment of this technique requires channel-state information (CSI) feedback from each receiver to all interferers, resu
lting in substantial network overhead. To address this issue, this paper proposes the method of distributive control that intelligently allocates CSI bits over multiple feedback links and adapts feedback to channel dynamics. For symmetric channel distributions, it is optimal for each receiver to equally allocate the average sum-feedback rate for different feedback links, thereby decoupling their control. Using the criterion of minimum sum-interference power, the optimal feedback-control policy is shown using stochastic-optimization theory to exhibit opportunism. Specifically, a specific feedback link is turned on only when the corresponding transmit-CSI error is significant or interference-channel gain large, and the optimal number of feedback bits increases with this gain. For high mobility and considering the sphere-cap-quantized-CSI model, the optimal feedback-control policy is shown to perform water-filling in time, where the number of feedback bits increases logarithmically with the corresponding interference-channel gain. Furthermore, we consider asymmetric channel distributions with heterogeneous path losses and high mobility, and prove the existence of a unique optimal policy for jointly controlling multiple feedback links. Given the sphere-cap-quantized-CSI model, this policy is shown to perform water-filling over feedback links. Finally, simulation demonstrates that feedback-control yields significant throughput gains compared with the conventional differential-feedback method.
The robustness of system throughput with scheduling is a critical issue. In this paper, we analyze the sensitivity of multi-user scheduling performance to channel misreporting in systems with massive antennas. The main result is that for the round-ro
bin scheduler combined with max-min power control, the channel magnitude misreporting is harmful to the scheduling performance and has a different impact from the purely physical layer analysis. Specifically, for the homogeneous users that have equal average signal-to-noise ratios (SNRs), underreporting is harmful, while overreporting is beneficial to others. In underreporting, the asymptotic rate loss on others is derived, which is tight when the number of antennas is huge. One interesting observation in our research is that the rate loss periodically increases and decreases as the number of misreporters grows. For the heterogeneous users that have various SNRs, both underreporting and overreporting can degrade the scheduler performance. We observe that strong misreporting changes the user grouping decision and hence greatly decreases some users rates regardless of others gaining rate improvements, while with carefully designed weak misreporting, the scheduling decision keeps fixed and the rate loss on others is shown to grow nearly linearly with the number of misreporters.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
