Search results for "Data_CODINGANDINFORMATIONTHEORY"
showing 6 items of 196 documents
Maximum Lifetime Problem in Sensor Networks with Limited Channel Capacity
2016
We analyze the maximum lifetime problem in sensor networks with limited channel capacity for multipoint-to-multipoint and broadcast data transmission services. For the transmission model in which the transmitter adjust the power of its radio signal to the distance to the receiver we propose a new Signal to Interference plus Noise Ratio function and use it to modify the Shannon-Hartley channel capacity formula. We show, that in order to achieve an optimal data transmission regarding considered the maximum lifetime problem we cannot allow for any interference of signals. For considered transmission model and the modified capacity formula we solve the maximum lifetime problem in one dimensiona…
Analysis and Performance Evaluation of the IEEE 802.16 ARQ Mechanism
2008
The IEEE 802.16 standard defines the ARQ mechanismas a part of the MAC layer. The functioning of the ARQmechanism depends on a number of parameters. The IEEE802.16 specification defines them but it does not provide concrete values and solutions. This paper studies the key features and parameters of the 802.16 ARQ mechanism. In particular, we consider a choice for the ARQ feedback type, an algorithm to build block sequences, the ARQ feedback intensity, a scheduling of the ARQ feedbacks and retransmissions, the ARQ block rearrangement, ARQ transmission window and the ARQ block size. We ran simulation scenarios to study these parameters and how they impact the performance of application protoc…
A Channel-Aware Adaptive Modem for Underwater Acoustic Communications
2021
Acoustic underwater channels are very challenging, because of limited bandwidth, long propagation delays, extended multipath, severe attenuation, rapid time variation and large Doppler shifts. A plethora of underwater communication techniques have been developed for dealing with such a complexity, mostly tailoring specific applications scenarios which can not be considered as one-size-fits-all solutions. Indeed, the design of environment-specific solutions is especially critical for modulations with high spectral efficiency, which are very sensitive to channel characteristics. In this paper, we design and implement a software-defined modem able to dynamically estimate the acoustic channel c…
Performance of an asymmetric and asynchronous decode-and-forward FBMC relay system
2014
End-to-end link performance of an asymmetric and asynchronous dual-hop decode-and-forward (DF) relay system built up using a causal multirate filter bank multicarrier (FBMC) technique operated under Rayleigh fading is presented. Three main performance measures namely bit error rate (BER), outage probability and channel capacity are used for this evaluation and approximate closed-form expressions for them are also made available. FBMC setup is modeled in exact form without any approximations while customizing to one of the most efficient subcarrier filter. Simulations are carried out in quasi-static multipath fading channels under symmetric, asymmetric, synchronous and asynchronous condition…
Sparsity-aware multiple relay selection in large multi-hop decode-and-forward relay networks
2016
In this paper, we propose and investigate two novel techniques to perform multiple relay selection in large multi-hop decode-and-forward relay networks. The two proposed techniques exploit sparse signal recovery theory to select multiple relays using the orthogonal matching pursuit algorithm and outperform state-of-the-art techniques in terms of outage probability and computation complexity. To reduce the amount of collected channel state information (CSI), we propose a limited-feedback scheme where only a limited number of relays feedback their CSI. Furthermore, a detailed performance-complexity tradeoff investigation is conducted for the different studied techniques and verified by Monte …
On the Amount of Nonconstructivity in Learning Recursive Functions
2011
Nonconstructive proofs are a powerful mechanism in mathematics. Furthermore, nonconstructive computations by various types of machines and automata have been considered by e.g., Karp and Lipton [17] and Freivalds [11]. They allow to regard more complicated algorithms from the viewpoint of much more primitive computational devices. The amount of nonconstructivity is a quantitative characterization of the distance between types of computational devices with respect to solving a specific problem. In the present paper, the amount of nonconstructivity in learning of recursive functions is studied. Different learning types are compared with respect to the amount of nonconstructivity needed to lea…