اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRobust Analog Function Computation via Wireless Multiple-Access Channels
28
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Various wireless sensor network applications involve the computation of a pre-defined function of the measurements without the need for reconstructing each individual sensor reading. Widely-considered examples of such functions include the arithmetic mean and the maximum value. Standard approaches to the computation problem separate computation from communication: quantized sensor readings are transmitted interference-free to a fusion center that reconstructs each sensor reading and subsequently computes the sought function value. Such separation-based computation schemes are generally highly inefficient as a complete reconstruction of individual sensor readings is not necessary for the fusion center to compute a function of them. In particular, if the mathematical structure of the wireless channel is suitably matched (in some sense) to the function, then channel collisions induced by concurrent transmissions of different nodes can be beneficially exploited for computation purposes. Therefore, in this paper a practically relevant analog computation scheme is proposed that allows for an efficient estimate of linear and nonlinear functions over the wireless multiple-access channel. After analyzing the asymptotic properties of the estimation error, numerical simulations are presented to show the potential for huge performance gains when compared with time-division multiple-access based computation schemes.
قيم البحث
اقرأ أيضاً
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.
We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is possible
for one sender to send classical information while the other sends quantum information. The second region gives the rates at which each sender can send quantum information. We give an example of a channel for which each region has a single-letter description, concluding with a characterization of the rates at which each user can simultaneously send classical and quantum information.
The fading cognitive multiple-access channel with confidential messages (CMAC-CM) is investigated, in which two users attempt to transmit common information to a destination and user 1 also has confidential information intended for the destination. U
ser 1 views user 2 as an eavesdropper and wishes to keep its confidential information as secret as possible from user 2. The multiple-access channel (both the user-to-user channel and the user-to-destination channel) is corrupted by multiplicative fading gain coefficients in addition to additive white Gaussian noise. The channel state information (CSI) is assumed to be known at both the users and the destination. A parallel CMAC-CM with independent subchannels is first studied. The secrecy capacity region of the parallel CMAC-CM is established, which yields the secrecy capacity region of the parallel CMAC-CM with degraded subchannels. Next, the secrecy capacity region is established for the parallel Gaussian CMAC-CM, which is used to study the fading CMAC-CM. When both users know the CSI, they can dynamically change their transmission powers with the channel realization to achieve the optimal performance. The closed-form power allocation function that achieves every boundary point of the secrecy capacity region is derived.
This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper. In this se
tting, an active cooperation between two trusted users is enabled through using channel feedback in order to improve the communication efficiency. Based on rate-splitting and decode-and-forward strategies, achievable secrecy rate regions are derived for both discrete memoryless and Gaussian channels. Results show that channel feedback improves the achievable secrecy rates.
Over-the-air computation (AirComp) has been recognized as a low-latency solution for wireless sensor data fusion, where multiple sensors send their measurement signals to a receiver simultaneously for computation. Most existing work only considered p
erforming AirComp over a single frequency channel. However, for a sensor network with a massive number of nodes, a single frequency channel may not be sufficient to accommodate the large number of sensors, and the AirComp performance will be very limited. So it is highly desirable to have more frequency channels for large-scale AirComp systems to benefit from multi-channel diversity. In this letter, we propose an $M$-frequency AirComp system, where each sensor selects a subset of the $M$ frequencies and broadcasts its signal over these channels under a certain power constraint. We derive the optimal sensors transmission and receivers signal processing methods separately, and develop an algorithm for joint design to achieve the best AirComp performance. Numerical results show that increasing one frequency channel can improve the AirComp performance by threefold compared to the single-frequency case.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
