Secure Compute-and-Forward in a Bidirectional Relay

We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two messages using the naturally occurring sum of symbols simultaneously transmitted by user nodes in a Gaussian multiple-access channel (MAC), and the computed function value is forwarded to the user nodes in an ensuing broadcast phase. In this paper, we study the problem under an additional security constraint, which requires that each user's message be kept secure from the relay. We consider two types of security constraints: 1) perfect secrecy, in which the MAC channel output seen by the relay is independent of each user's message and 2) strong secrecy, which is a form of asymptotic independence. We propose a coding scheme based on nested lattices, the main feature of which is that given a pair of nested lattices that satisfy certain goodness properties, we can explicitly specify probability distributions for randomization at the encoders to achieve the desired security criteria. In particular, our coding scheme guarantees perfect or strong secrecy even in the absence of channel noise. The noise in the channel only affects reliability of computation at the relay, and for Gaussian noise, we derive achievable rates for reliable and secure computation. We also present an application of our methods to the multihop line network in which a source needs to transmit messages to a destination through a series of intermediate relays.

Optimal power allocation for protective jamming in wireless networks: A flow based model

We address the problem of passive eavesdroppers in multi-hop wireless networks using the technique of friendly jamming. The network is assumed to employ Decode and Forward (DF) relaying. Assuming the availability of perfect channel state information (CSI) of legitimate nodes and eavesdroppers, we consider a scheduling and power allocation (PA) problem for a multiple-source multiple-sink scenario so that eavesdroppers are jammed, and source-destination throughput targets are met while minimizing the overall transmitted power. We propose activation sets (AS-es) for scheduling, and formulate an optimization problem for PA. Several methods for finding AS-es are discussed and compared. We present an approximate linear program for the original nonlinear, non-convex PA optimization problem, and argue that under certain conditions, both the formulations produce identical results. In the absence of eavesdroppers' CSI, we utilize the notion of Vulnerability Region (VR), and formulate an optimization problem with the objective of minimizing the VR. Our results show that the proposed solution can achieve power-efficient operation while defeating eavesdroppers and achieving desired source-destination throughputs simultaneously. (C) 2015 Elsevier B.V. All rights reserved.

Analysis of absorption characteristics of stacked patch arrays on moderately lossy dielectric layers

It is demonstrated that a square patch array on a moderately lossy dielectric can be transformed into a near-perfect absorber by the addition of a metallic square loop layer between the patch array and the metal back. In this configuration, the condition of perfect absorption can be easily obtained by modifying loop dimensions. The absorption properties of this configuration are analyzed theoretically using an equivalent circuit model and full-wave electromagnetic simulations. Experimental investigations included a bistatic radar cross-section measurement, which ensured that there are no scattered fields in other directions. An array structure built on a commercially available FR4 substrate with copper metallization is used to experimentally validate these results.

Outer Bounds on the Secrecy Rate of the 2-User Symmetric Deterministic Interference Channel with Transmitter Cooperation

This paper derives outer bounds for the 2-user symmetric linear deterministic interference channel (SLDIC) with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. Five outer bounds are derived, under different assumptions of providing side information to receivers and partitioning the encoded message/output depending on the relative strength of the signal and the interference. The usefulness of these outer bounds is shown by comparing the bounds with the inner bound on the achievable secrecy rate derived by the authors in a previous work. Also, the outer bounds help to establish that sharing random bits through the cooperative link can achieve the optimal rate in the very high interference regime.

Redox-Active Metal-Organic Frameworks: Highly Stable Charge-Separated States through Strut/Guest-to-Strut Electron Transfer

Molecular organization of donor and acceptor chromophores in self-assembled materials is of paramount interest in the field of photovoltaics or mimicry of natural light-harvesting systems. With this in mind, a redox-active porous interpenetrated metal-organic framework (MOF), {Cd(bpdc)(bpNDI)]4.5H(2)ODMF}(n) (1) has been constructed from a mixed chromophoric system. The -oxo-bridged secondary building unit, {Cd-2(-OCO)(2)}, guides the parallel alignment of bpNDI (N,N-di(4-pyridyl)-1,4,5,8-naphthalenediimide) acceptor linkers, which are tethered with bpdc (bpdcH(2)=4,4-biphenyldicarboxylic acid) linkers of another entangled net in the framework, resulting in photochromic behaviour through inter-net electron transfer. Encapsulation of electron-donating aromatic molecules in the electron-deficient channels of 1 leads to a perfect donor-acceptor co-facial organization, resulting in long-lived charge-separated states of bpNDI. Furthermore, 1 and guest encapsulated species are characterised through electrochemical studies for understanding of their redox properties.

Physical Layer Data Fusion Via Distributed Co-Phasing With General Signal Constellations

This paper studies a pilot-assisted physical layer data fusion technique known as Distributed Co-Phasing (DCP). In this two-phase scheme, the sensors first estimate the channel to the fusion center (FC) using pilots sent by the latter; and then they simultaneously transmit their common data by pre-rotating them by the estimated channel phase, thereby achieving physical layer data fusion. First, by analyzing the symmetric mutual information of the system, it is shown that the use of higher order constellations (HOC) can improve the throughput of DCP compared to the binary signaling considered heretofore. Using an HOC in the DCP setting requires the estimation of the composite DCP channel at the FC for data decoding. To this end, two blind algorithms are proposed: 1) power method, and 2) modified K-means algorithm. The latter algorithm is shown to be computationally efficient and converges significantly faster than the conventional K-means algorithm. Analytical expressions for the probability of error are derived, and it is found that even at moderate to low SNRs, the modified K-means algorithm achieves a probability of error comparable to that achievable with a perfect channel estimate at the FC, while requiring no pilot symbols to be transmitted from the sensor nodes. Also, the problem of signal corruption due to imperfect DCP is investigated, and constellation shaping to minimize the probability of signal corruption is proposed and analyzed. The analysis is validated, and the promising performance of DCP for energy-efficient physical layer data fusion is illustrated, using Monte Carlo simulations.

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U. The goal is to find a subset of U of the smallest possible size that intersects every set in F. The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of S with each set in the family F. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

QEP Based Solution for Power Allocation in Amplify and Forward Networks

The problem of cooperative beamforming for maximizing the achievable data rate of an energy constrained two-hop amplify-and-forward (AF) network is considered. Assuming perfect channel state information (CSI) of all the nodes, we evaluate the optimal scaling factor for the relay nodes. Along with individual power constraint on each of the relay nodes, we consider a weighted sum power constraint. The proposed iterative algorithm initially solves a set of relaxed problems with weighted sum power constraint and then updates the solution to accommodate individual constraints. These relaxed problems in turn are solved using a sequence of Quadratic Eigenvalue Problems (QEP). The key contribution of this letter is the generalization of cooperative beamforming to incorporate both the individual and weighted sum constraint. Furthermore, we have proposed a novel algorithm based on Quadratic Eigenvalue Problem (QEP) and discussed its convergence.

Universal anomalous dimensions at large spin and large twist

In this paper we consider anomalous dimensions of double trace operators at large spin (l) and large twist (tau) in CFTs in arbitrary dimensions (d >= 3). Using analytic conformal bootstrap methods, we show that the anomalous dimensions are universal in the limit l >> tau >> 1. In the course of the derivation, we extract an approximate closed form expression for the conformal blocks arising in the four point function of identical scalars in any dimension. We compare our results with two different calculations in holography and find perfect agreement.

Structural and optical characterization of nonpolar (10-10) m-InN/m-GaN epilayers grown by PAMBE

Plasma-assisted molecular beam epitaxy growth of (10-10) m-InN/(10-10) m-GaN was carried out on bare (10-10) m-sapphire substrate. The high resolution X-ray diffraction studies confirmed the orientation of the as-grown films. Nonpolar InN layer was grown at different growth temperatures ranging from 390 degrees C to 440 degrees C and the FWHM of rocking curve revealed good quality film at low temperatures. An in-plane relationship was established for the hetrostructures using phi-scan and a perfect alignment was found for the epilayers. Change of morphology of the films grown at different temperatures was observed using an atomic force microscopy technique showing the smoothest film grown at 400 degrees C. InN optical band gap was found to be vary from 0.79-0.83 eV from absorption spectra. The blue-shift of absorption edge was found to be induced by excess background electron concentration. (C) 2015 Elsevier B.V. All rights reserved.

Power Allocation in MIMO Wiretap Channel with Statistical CSI and Finite-Alphabet Input

In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical knowledge of the eavesdroppers CSI are assumed. We first consider the MIMO wiretap channel with Gaussian input. Using Jensen's inequality, we transform the secrecy rate max-min optimization problem to a single maximization problem. We use generalized singular value decomposition and transform the problem to a concave maximization problem which maximizes the sum secrecy rate of scalar wiretap channels subject to linear constraints on the transmit covariance matrix. We then consider the MIMO wiretap channel with finite-alphabet input. We show that the transmit covariance matrix obtained for the case of Gaussian input, when used in the MIMO wiretap channel with finite-alphabet input, can lead to zero secrecy rate at high transmit powers. We then propose a power allocation scheme with an additional power constraint which alleviates this secrecy rate loss problem, and gives non-zero secrecy rates at high transmit powers.

Urea-Functionalized Self-Assembled Molecular Prism for Heterogeneous Catalysis in Water

Reaction of a ditopic urea ``strut'' (L-1) with cis-(tmen)Pd(NO3)(2) yielded a 3+3] self-assembled molecular triangle (T)L-1 = 1,4-di(4-pyridylureido)benzene; tmen = N,N,N',N'-tetrame-thylethane-1,2-diamine]. Replacing cis-(tmen)Pd(NO3)(2) in the above reaction with an equimolar mixture of Pd(NO3)(2) and a clip-type donor (L-2) yielded a template-free multicomponent 3D trigonal prism (P) decorated with multiple urea moieties L-2 = 3,3'-(1H-1,2,4-triazole-3,5-diyl)dipyridine]. This prism (P) was characterized by NMR. spectroscopy, and the structure was confirmed by X-ray crystallography. The P was employed as an effective hydrogen-bond-donor catalyst for Michael reactions of a series of water-insoluble nitro-olefins in an aqueous medium. The P showed better catalytic activity compared to the urea based ligand L-1 and the triangle T. Moreover, the confined nanospace of P in addition to large product outlet windows makes this 3D architecture a perfect molecular vessel to catalyze Diels-Alder reactions of 9-hydroxymethylanthracene with N-substituted maleimide in the aqueous medium. The present results demonstrate new observations on catalytic aqueous Diels-Alder and Michael reactions in heterogeneous fashion employing a discrete 3D architecture of Pd(II). The prism was recycled by simple filtration and reused several tithes without significant loss of activity.

Theoretical insights on the electro-thermal transport properties of monolayer MoS2 with line defects

Two dimensional (2D) materials demonstrate several novel electrical, mechanical, and thermal properties which are quite distinctive to those of their bulk form. Among many others, one important potential application of the 2D material is its use in the field of energy harvesting. Owing to that, here we present a detailed study on electrical as well as thermal transport of monolayer MoS2, in quasi ballistic regime. Besides the perfect monolayer in its pristine form, we also consider various line defects which have been experimentally observed in mechanically exfoliated MoS2 samples. For calculating various parameters related to the electrical transmission, we employ the non-equilibrium Green's function-density functional theory combination. However, to obtain the phonon transmission, we take help of the parametrized Stillinger-Weber potential which can accurately delineate the inter-atomic interactions for the monolayer MoS2. Due to the presence of line defects, we observed significant reductions in both the charge carrier and the phonon transmissions through a monolayer MoS2 flake. Moreover, we also report a comparative analysis showing the temperature dependency of the thermoelectric figure of merit values, as obtained for the perfect as well as the other defective 2D samples. (C) 2016 AIP Publishing LLC.

Generalization of Response Number for Dynamic Plastic Response of Shells Subjected to impulsive Loading

A dimensionless number, termed as response number in Zhao [Archive of Applied Mechanics 68 (1998) 524], has been suggested for the dynamic plastic response of beams and plates made up of rigidly perfect plastic materials subjected to dynamic loading. Many theoretical and experimental results can be reformulated into new concise forms with the response number. The concept of a new dimensionless number, response number, termed as Rn(n), is generalized in Zhao [Forschung im Ingenieurwesen 65 (1999) 107] to study the elastic, plastic, dynamic elastic as well as dynamic plastic buckling problems of columns, plates as well as shells. The response number Rn(n) is generalized to the dynamic behaviour of shells of various shapes in the present paper.