اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEnd-to-End Performance Optimization in Hybrid Molecular and Electromagnetic Communications
115
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Telemedicine refers to the use of information and communication technology to assist with medical information and services. In health care applications, high reliable communication links between the health care provider and the desired destination in the human body play a central role in designing end-to-end (E2E) telemedicine system. In the advanced health care applications, $text{e.g.}$ drug delivery, molecular communication becomes a major building block in bio-nano-medical applications. In this paper, an E2E communication link consisting of the electromagnetic and the molecular link is investigated. This paradigm is crucial when the body is a part of the communication system. Based on the quality of service (QoS) metrics, we present a closed-form expression for the E2E BER of the combination of molecular and wireless electromagnetic communications. textcolor{black}{ Next, we formulate an optimization problem with the aim of minimizing the E2E BER of the system to achieve the optimal symbol duration for EC and DMC regarding the imposing delivery time from telemedicine services.} The proposed problem is solved by an iterative algorithm based on the bisection method. Also, we study the impact of the system parameters, including drift velocity, detection threshold at the receiver in molecular communication, on the performance of the system. Numerical results show that the proposed method obtains the minimum E2E bit error probability by selecting an appropriate symbol duration of electromagnetic and molecular communications.
قيم البحث
اقرأ أيضاً
Parking lots (PLs) are usually full with cars. If these cars are formed into a self-organizing vehicular network, they can be new kind of road side units (RSUs) in urban area to provide communication data forwarding between mobile terminals nearby an
d a base station. However cars in PLs can leave at any time, which is neglected in the existing studies. In this paper, we investigate relay cooperative communication based on parked cars in PLs. Taking the impact of the cars leaving behavior into consideration, we derive the expressions of outage probability in a two-hop cooperative communication and its link capacity. Finally, the numerical results show that the impact of a cars arriving time is greater than the impact of the duration the car has parked on outage probability.
In this paper, an unsupervised machine learning method for geometric constellation shaping is investigated. By embedding a differentiable fiber channel model within two neural networks, the learning algorithm is optimizing for a geometric constellati
on shape. The learned constellations yield improved performance to state-of-the-art geometrically shaped constellations, and include an implicit trade-off between amplification noise and nonlinear effects. Further, the method allows joint optimization of system parameters, such as the optimal launch power, simultaneously with the constellation shape. An experimental demonstration validates the findings. Improved performances are reported, up to 0.13 bit/4D in simulation and experimentally up to 0.12 bit/4D.
Relay-assisted free-space optical (FSO) communication systems are exploited as a means to mitigate the limiting effects of the turbulence induced atmospheric scintillation. However, conventional ground relays are stationary, and their optimal placeme
nt is not always feasible. Due to their mobility and flexibility, unmanned aerial vehicles (UAVs) provide new opportunities for FSO relaying systems. In this paper, a hovering UAV-based serial FSO decode-and-forward relaying system is investigated. In the channel modelling for such a system, four types of impairments (i.e., atmospheric loss, atmospheric turbulence, pointing error, and link interruption due to angle-of-arrival fluctuation) are considered. Based on the proposed channel model, a tractable expression for the probability density function of the total channel gain is obtained. Closed-form expressions of the link outage probability and end-to-end outage probability are derived. Asymptotic outage performance bounds for each link and the overall system are also presented to reveal insights into the impacts of different impairments. To improve system performance, we optimize the beam width, field-of-view and UAVs locations. Numerical results show that the derived theoretical expressions are accurate to evaluate the outage performance of the system. Moreover, the proposed optimization schemes are efficient and can improve performance significantly.
Measuring performance of an automatic speech recognition (ASR) system without ground-truth could be beneficial in many scenarios, especially with data from unseen domains, where performance can be highly inconsistent. In conventional ASR systems, sev
eral performance monitoring (PM) techniques have been well-developed to monitor performance by looking at tri-phone posteriors or pre-softmax activations from neural network acoustic modeling. However, strategies for monitoring more recently developed end-to-end ASR systems have not yet been explored, and so that is the focus of this paper. We adapt previous PM measures (Entropy, M-measure and Auto-encoder) and apply our proposed RNN predictor in the end-to-end setting. These measures utilize the decoder output layer and attention probability vectors, and their predictive power is measured with simple linear models. Our findings suggest that decoder-level features are more feasible and informative than attention-level probabilities for PM measures, and that M-measure on the decoder posteriors achieves the best overall predictive performance with an average prediction error 8.8%. Entropy measures and RNN-based prediction also show competitive predictability, especially for unseen conditions.
With the increasing popularity of machine learning techniques, it has become common to see prediction algorithms operating within some larger process. However, the criteria by which we train these algorithms often differ from the ultimate criteria on
which we evaluate them. This paper proposes an end-to-end approach for learning probabilistic machine learning models in a manner that directly captures the ultimate task-based objective for which they will be used, within the context of stochastic programming. We present three experimental evaluations of the proposed approach: a classical inventory stock problem, a real-world electrical grid scheduling task, and a real-world energy storage arbitrage task. We show that the proposed approach can outperform both traditional modeling and purely black-box policy optimization approaches in these applications.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
