Optimal Power and Rate Allocation in the Degraded Gaussian Relay Channel with Energy Harvesting Nodes

Energy Harvesting (EH) is a novel technique to prolong the lifetime of the wireless networks such as wireless sensor networks or Ad-Hoc networks, by providing an unlimited source of energy for their nodes. In this sense, it has emerged as a promising technique for Green Communications, recently. On the other hand, cooperative communication with the help of relay nodes improves the performance of wireless communication networks by increasing the system throughput or the reliability as well as the range and efficient energy utilization. In order to investigate the cooperation in EH nodes, in this paper, we consider the problem of optimal power and rate allocation in the degraded full-duplex Gaussian relay channel in which source and relay can harvest energy from their environments. We consider the general stochastic energy arrivals at the source and the relay with known EH times and amounts at the transmitters before the start of transmission. This problem has a min-max optimization form that along with the constraints is not easy to solve. We propose a method based on a mathematical theorem proposed by Terkelsen [1] to transform it to a solvable convex optimization form. Also, we consider some special cases for the harvesting profile of the source and the relay nodes and find their solutions efficiently.Comment: 6 pages, 2 figures, submitted to IWCIT 201

Optimum Functions for Radial Wires of Monopole Antennas with Arbitrary Elevation Angles

Monopole antennas on the earth usually use ground screen with simple radial wires to improve their radiation performance. The number of radials,N, is usually considered a constant in the screen. This paper studies the effect of changing N and considering it as a function of distance, ρ, from the monopole using a simple and yet a fast method. The function N(ρ) is optimized for different beam angles of an HF monopoleantenna. The theoretical functions are converted to practical functions to be formed using meandered lines. Practicable calculated results are validated bymethod of moments. Furthermore it is shown that for low angle radiation aconstant N(ρ) with optimized radius of the ground screen is the best choice. The results can be used for higher frequencies, i.e. VHF and UHF frequency bands as well

Anonymity-Preserving Public-Key Encryption: A Constructive Approach

Abstract. A receiver-anonymous channel allows a sender to send a message to a receiver without an adversary learning for whom the message is intended. Wireless broadcast channels naturally provide receiver anonymity, as does multi-casting one message to a receiver population containing the intended receiver. While anonymity and confidentiality appear to be orthogonal properties, making anonymous communication confidential is more involved than one might expect, since the ciphertext might reveal which public key has been used to encrypt. To address this problem, public-key cryptosystems with enhanced security properties have been proposed. We investigate constructions as well as limitations for preserving receiver anonymity when using public-key encryption (PKE). We use the constructive cryptography approach by Maurer and Renner and interpret cryptographic schemes as constructions of a certain ideal resource (e.g. a confidential anonymous channel) from given real resources (e.g. a broadcast channel). We define appropriate anonymous communication resources and show that a very natural resource can be constructed by using a PKE scheme which fulfills three properties that appear in cryptographic literature (IND-CCA, key-privacy, weak robustness). We also show that a desirable stronger variant, preventing the adversary from selective “trial-deliveries ” of messages, is unfortunately unachievable by any PKE scheme, no matter how strong. The constructive approach makes the guarantees achieved by applying a cryptographic scheme explicit in the constructed (ideal) resource; this specifies the exact requirements for the applicability of a cryptographic scheme in a given context. It also allows to decide which of the existing security properties of such a cryptographic scheme are adequate for the considered scenario, and which are too weak or too strong. Here, we show that weak robustness is necessary but that so-called strong robustness is unnecessarily strong in that it does not construct a (natural) stronger resource

Rate-limited secure function evaluation

We introduce the notion of rate-limited secure function evaluation (RL-SFE). Loosely speaking, in an RL-SFE protocol participants can monitor and limit the number of distinct inputs (i.e., rate) used by their counterparts in multiple executions of an SFE, in a private and verifiable manner. The need for RL-SFE naturally arises in a variety of scenarios: e.g., it enables service providers to “meter” their customers’ usage without compromising their privacy, or can be used to prevent oracle attacks against SFE constructions. We consider three variants of RL-SFE providing different levels of security. As a stepping stone, we also formalize the notion of commit-first SFE (CF-SFE) wherein parties are committed to their inputs before each SFE execution. We provide compilers for transforming any CF-SFE protocol into each of the three RL-SFE variants. Our compilers are accompanied with simulation-based proofs of security in the standard model and show a clear tradeoff between the level of security offered and the overhead required. Moreover, motivated by the fact that in many client-server applications clients do not keep state, we also describe a general approach for transforming the resulting RL-SFE protocols into stateless ones. As a case study, we take a closer look at the oblivious polynomial evaluation (OPE) protocol of Hazay and Lindell, show that it is commit-first, and instantiate efficient ratelimited variants of it

Rate-limited secure function evaluation

We introduce the notion of rate-limited secure function evaluation (RL-SFE). Loosely speaking, in an RL-SFE protocol participants can monitor and limit the number of distinct inputs (i.e., rate) used by their counterparts in multiple executions of an SFE, in a private and verifiable manner. The need for RL-SFE naturally arises in a variety of scenarios: e.g., it enables service providers to “meter” their customers’ usage without compromising their privacy, or can be used to prevent oracle attacks against SFE constructions. We consider three variants of RL-SFE providing different levels of security. As a stepping stone, we also formalize the notion of commit-first SFE (CF-SFE) wherein parties are committed to their inputs before each SFE execution. We provide compilers for transforming any CF-SFE protocol into each of the three RL-SFE variants. Our compilers are accompanied with simulation-based proofs of security in the standard model and show a clear tradeoff between the level of security offered and the overhead required. Moreover, motivated by the fact that in many client-server applications clients do not keep state, we also describe a general approach for transforming the resulting RL-SFE protocols into stateless ones. As a case study, we take a closer look at the oblivious polynomial evaluation (OPE) protocol of Hazay and Lindell, show that it is commit-first, and instantiate efficient ratelimited variants of it

Modeling of bend discontinuity in plasmonic and spoof plasmonic waveguides

The paper proposes a method to characterize the bend discontinuity for plasmonic and spoof plasmonic waveguides in terms of scattering parameters. By means of this method, the waveguide is modelled by a two-port network and its scattering parameters are extracted. The parameters for the L-shaped sharp curved bends at different frequencies and under different bending angles are determined

COVID-19 Diagnosis: ULGFBP-ResNet51 approach on the CT and the Chest X-ray Images Classification

The contagious and pandemic COVID-19 disease is currently considered as the main health concern and posed widespread panic across human-beings. It affects the human respiratory tract and lungs intensely. So that it has imposed significant threats for premature death. Although, its early diagnosis can play a vital role in revival phase, the radiography tests with the manual intervention are a time-consuming process. Time is also limited for such manual inspecting of numerous patients in the hospitals. Thus, the necessity of automatic diagnosis on the chest X-ray or the CT images with a high efficient performance is urgent. Toward this end, we propose a novel method, named as the ULGFBP-ResNet51 to tackle with the COVID-19 diagnosis in the images. In fact, this method includes Uniform Local Binary Pattern (ULBP), Gabor Filter (GF), and ResNet51. According to our results, this method could offer superior performance in comparison with the other methods, and attain maximum accuracy.Comment: 16 pages, 8 figures, submitted for possible journal publicatio