اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCapacity of Remote Classification Over Wireless Channels
185
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Wireless connectivity creates a computing paradigm that merges communication and inference. A basic operation in this paradigm is the one where a device offloads classification tasks to the edge servers. We term this remote classification, with a potential to enable intelligent applications. Remote classification is challenged by the finite and variable data rate of the wireless channel, which affects the capability to transfer high-dimensional features and thus limits the classification resolution. We introduce a set of metrics under the name of classification capacity that are defined as the maximum number of classes that can be discerned over a given communication channel while meeting a target classification error probability. The objective is to choose a subset of classes from a library that offers satisfactory performance over a given channel. We treat two cases of subset selection. First, a device can select the subset by pruning the class library until arriving at a subset that meets the targeted error probability while maximizing the classification capacity. Adopting a subspace data model, we prove the equivalence of classification capacity maximization to Grassmannian packing. The results show that the classification capacity grows exponentially with the instantaneous communication rate, and super-exponentially with the dimensions of each data cluster. This also holds for ergodic and outage capacities with fading if the instantaneous rate is replaced with an average rate and a fixed rate, respectively. In the second case, a device has a preference of class subset for every communication rate, which is modeled as an instance of uniformly sampling the library. Without class selection, the classification capacity and its ergodic and outage counterparts are proved to scale linearly with their corresponding communication rates instead of the exponential growth in the last case.
قيم البحث
اقرأ أيضاً
The problem of characterising the zero-error capacity region for multiple access channels even in the noiseless case has remained an open problem for over three decades. Motivated by this challenging question, a recently developed theory of nonstocha
stic information is applied to characterise the zero-error capacity region for the case of two correlated transmitters. Unlike previous contributions, this analysis does not assume that the blocklength is asymptotically large. Finally, a new notion of nonstochastic information is proposed for a noncooperative problem involving three agents. These results are preliminary steps towards understanding information flows in worst-case distributed estimation and control problems.
In this letter, we consider an intelligent reflecting surface (IRS)-aided wireless relaying system, where a decode-and-forward relay (R) is employed to forward data from a source (S) to a destination (D), aided by M passive reflecting elements. We co
nsider two practical IRS deployment strategies, namely, single-IRS deployment where all reflecting elements are mounted on one single IRS that is deployed near S, R, or D, and multi-IRS deployment where the reflecting elements are allocated over three separate IRSs which are deployed near S, R, and D, respectively. Under the line-of-sight (LoS) channel model, we characterize the capacity scaling orders with respect to an increasing M for the IRS-aided relay system with different IRS deployment strategies. For single-IRS deployment, we show that deploying the IRS near R achieves the highest capacity as compared to that near S or D. While for multi-IRS deployment, we propose a practical cooperative IRS passive beamforming design which is analytically shown to achieve a larger capacity scaling order than the optimal single-IRS deployment (i.e., near R) when M is sufficiently large. Numerical examples are provided, which validate our theoretical results.
We present the statistical characterization of a 2x2 Multiple-Input Multiple-Output wireless link operated in a mode-stirred enclosure, with channel state information available only at the receiver (agnostic transmitter). Our wireless channel measure
ments are conducted in absence of line of sight and varying the inter-element spacing between the two antenna elements in both the transmit and receive array. The mode-stirred cavity is operated: i) at a low number of stirrer positions to create statistical inhomogeneity; ii) at two different loading conditions, empty and with absorbers, in order to mimic a wide range of realistic equipment level enclosures. Our results show that two parallel channels are obtained within the confined space at both the operating conditions. The statistical characterization of the wireless channel is presented in terms of coherence bandwidth, path loss, delay spread and Rician factor, and wideband channel capacity. It is found that the severe multipath fading supported by a highly reflecting environment creates unbalance between the two Multiple-Input Multiple-Output channels, even in presence of substantial losses. Furthermore, the channel capacity has a multi-modal distribution whose average and variance scale monotonically with the number of absorbers. Results are of interest in IoT devices, including wireless chip-to-chip and device-to-device communications, operating in highly reflective environments.
This note studies the use of relays to improve the performance of Kalman filtering over packet dropping links. Packet reception probabilities are governed by time-varying fading channel gains, and the sensor and relay transmit powers. We consider sit
uations with multiple sensors and relays, where each relay can either forward one of the sensors measurements to the gateway/fusion center, or perform a simple linear network coding operation on some of the sensor measurements. Using an expected error covariance performance measure, we consider optimal and suboptimal methods for finding the best relay configuration, and power control problems for optimizing the Kalman filter performance. Our methods show that significant performance gains can be obtained through the use of relays, network coding and power control, with at least 30-40$%$ less power consumption for a given expected error covariance specification.
In this paper, we consider a networked control system (NCS) in which an dynamic plant system is connected to a controller via a temporally correlated wireless fading channel. We focus on communication power design at the sensor to minimize a weighted
average state estimation error at the remote controller subject to an average transmit power constraint of the sensor. The power control optimization problem is formulated as an infinite horizon average cost Markov decision process (MDP). We propose a novel continuous-time perturbation approach and derive an asymptotically optimal closed-form value function for the MDP. Under this approximation, we propose a low complexity dynamic power control solution which has an event- driven control structure. We also establish technical conditions for asymptotic optimality, and sufficient conditions for NCS stability under the proposed scheme.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
