اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAbnormality Detection in Correlated Gaussian Molecular Nano-Networks: Design and Analysis
36
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A nano abnormality detection scheme (NADS) in molecular nano-networks is studied. This is motivated by the fact that early detection of diseases such as cancer play a crucial role in their successful treatment. The proposed NADS is in fact a two-tier network of sensor nano-machines (SNMs) in the first tier and a data-gathering node (DGN) at the sink. The SNMs detect the presence of competitor cells (abnormality) by variations in input and/or parameters of a nano-communications channel (NCC). The noise of SNMs as their nature suggest is considered correlated in time and space and herein assumed additive Gaussian. In the second step, the SNMs transmit micro-scale messages over a noisy micro communications channel (MCC) to the DGN, where a decision is made upon fusing the received signals. We find an optimum design of detectors for each of the NADS tiers based on the end-to-end NADS performance. The detection performance of each SNM is analyzed by setting up a generalized likelihood ratio test. Next, taking into account the effect of the MCC, the overall performance of the NADS is analyzed in terms of probabilities of misdetection and false alarm. In addition, computationally efficient expressions to quantify the NADS performance is derived by providing respectively an approximation and an upper bound for the probabilities of misdetection and false alarm. This in turn enables formulating a design problem, where the optimized concentration of SNMs in a sample is obtained for a high probability of detection and a limited probability of false alarm. The results indicate that otherwise ignoring the spatial and temporal correlation of SNM noise in the analysis, leads to an NADS that noticeably underperforms in operations.
قيم البحث
اقرأ أيضاً
We analyze the performance of multiple input/multiple output (MIMO) communications systems employing spatial multiplexing and zero-forcing detection (ZF). The distribution of the ZF signal-to-noise ratio (SNR) is characterized when either the intende
d stream or interfering streams experience Rician fading, and when the fading may be correlated on the transmit side. Previously, exact ZF analysis based on a well-known SNR expression has been hindered by the noncentrality of the Wishart distribution involved. In addition, approximation with a central-Wishart distribution has not proved consistently accurate. In contrast, the following exact ZF study proceeds from a lesser-known SNR expression that separates the intended and interfering channel-gain vectors. By first conditioning on, and then averaging over the interference, the ZF SNR distribution for Rician-Rayleigh fading is shown to be an infinite linear combination of gamma distributions. On the other hand, for Rayleigh-Rician fading, the ZF SNR is shown to be gamma-distributed. Based on the SNR distribution, we derive new series expressions for the ZF average error probability, outage probability, and ergodic capacity. Numerical results confirm the accuracy of our new expressions, and reveal effects of interference and channel statistics on performance.
Covariance matrix estimation concerns the problem of estimating the covariance matrix from a collection of samples, which is of extreme importance in many applications. Classical results have shown that $O(n)$ samples are sufficient to accurately est
imate the covariance matrix from $n$-dimensional independent Gaussian samples. However, in many practical applications, the received signal samples might be correlated, which makes the classical analysis inapplicable. In this paper, we develop a non-asymptotic analysis for the covariance matrix estimation from correlated Gaussian samples. Our theoretical results show that the error bounds are determined by the signal dimension $n$, the sample size $m$, and the shape parameter of the distribution of the correlated sample covariance matrix. Particularly, when the shape parameter is a class of Toeplitz matrices (which is of great practical interest), $O(n)$ samples are also sufficient to faithfully estimate the covariance matrix from correlated samples. Simulations are provided to verify the correctness of the theoretical results.
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given rate. The n
ew objective captures the problem of how to deploy relays to provide a given level of service to a particular geographic area, where the relay locations become a design parameter that can be optimized. We evaluate the decode and forward (DF) and compress and forward (CF) strategies for the relay channel with respect to the new objective of maximizing coverage. When the objective is maximizing rate, different locations of the destination favor different strategies. When the objective is coverage for a given rate, and the relay is able to decode, DF is uniformly superior in that it provides coverage at any point served by CF. When the channel model is modified to include random fading, we show that the monotone ordering of coverage regions is not always maintained. While the coverage provided by DF is sensitive to changes in the location of the relay and the path loss exponent, CF exhibits a more graceful degradation with respect to such changes. The techniques used to approximate coverage regions are new and may be of independent interest.
Future wireless access networks will support simultaneously a large number of devices with heterogeneous service requirements. These include data rates, error rates, and latencies. While there exist achievable rate and capacity results for Gaussian b
roadcast channels in the asymptotic regime, the characterization of second-order achievable rate regions for different blocklength constraints are not available. Therefore, we investigate a two-user Gaussian broadcast channel (GBC) with heterogeneous blocklength constraints under a maximal input power constraint and an average error probability constraint. Unlike the traditional GBC where two users have the same blocklength constraints, here the user with higher output SNR has a shorter blocklength constraint. We show that with sufficiently large output SNR, the stronger user can invoke the technique named early decoding (ED) to decode the interference. Then the successive interference cancellation (SIC) can proceed. This leads to an improved achievable rate region compared to the state of the art. To achieve it, we derive an explicit lower bound on the necessary number of received symbols for a successful ED, using an independent and identically distributed Gaussian input. A second-order rate of the weaker user who suffers from an SNR change due to the heterogeneous blocklength constraint, is also derived. We then formulate the rate region of the considered setting with individual and also sum power constraints and compare to that of the hybrid non-orthogonal multiple access (HNOMA) scheme. Numerical results show that ED has a larger rate region than HNOMA partly when the gain of the better channel is sufficiently larger than the weaker one. Under the considered setting, about 7-dB SNR gain can be achieved. This makes ED with SIC a promising technique for future wireless network.
In this paper, a clustered wireless sensor network is considered that is modeled as a set of coupled Gaussian multiple-access channels. The objective of the network is not to reconstruct individual sensor readings at designated fusion centers but rat
her to reliably compute some functions thereof. Our particular attention is on real-valued functions that can be represented as a post-processed sum of pre-processed sensor readings. Such functions are called nomographic functions and their special structure permits the utilization of the interference property of the Gaussian multiple-access channel to reliably compute many linear and nonlinear functions at significantly higher rates than those achievable with standard schemes that combat interference. Motivated by this observation, a computation scheme is proposed that combines a suitable data pre- and post-processing strategy with a nested lattice code designed to protect the sum of pre-processed sensor readings against the channel noise. After analyzing its computation rate performance, it is shown that at the cost of a reduced rate, the scheme can be extended to compute every continuous function of the sensor readings in a finite succession of steps, where in each step a different nomographic function is computed. This demonstrates the fundamental role of nomographic representations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
