Relay Load Balancing in Queued Cooperative Wireless Networks with Rateless Codes

Relay selection combined with buffering of packets of relays can substantially increase the throughput of a cooperative network that uses rateless codes. However, buffering also increases the end-to-end delays due to the additional queuing delays at the relay nodes. In this paper we propose a novel method that exploits a unique property of rateless codes that enables a receiver to decode a packet from non-contiguous and unordered portions of the received signal. In it, each relay, depending on its queue length, ignores its received coded bits with a given probability. We show that this substantially reduces the end-to-end delays while retaining almost all of the throughput gain achieved by buffering. In effect, the method increases the odds that the packet is first decoded by a relay with a smaller queue. Thus, the queuing load is balanced across the relays and traded off with transmission times. We derive explicit necessary and sufficient conditions for the stability of this system when the various channels undergo fading. Despite encountering analytically intractable G/GI/1 queues in our system, we also gain insights about the method by analyzing a similar system with a simpler model for the relay-to-destination transmission times.

Network Error Correction for Unit-Delay, Memory-Free Networks Using Convolutional Codes

A single source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the symbols received at their incoming edges on their outgoing edges. In this work, we introduce network-error correction for single source, acyclic, unit-delay, memory-free networks with coherent network coding for multicast. A convolutional code is designed at the source based on the network code in order to correct network- errors that correspond to any of a given set of error patterns, as long as consecutive errors are separated by a certain interval which depends on the convolutional code selected. Bounds on this interval and the field size required for constructing the convolutional code with the required free distance are also obtained. We illustrate the performance of convolutional network error correcting codes (CNECCs) designed for the unit-delay networks using simulations of CNECCs on an example network under a probabilistic error model.

X-Codes: A Low Complexity Full-Rate High-Diversity Achieving Precoder for TDD MIMO Systems

We consider a time division duplex multiple-input multiple-output (nt × nr MIMO). Using channel state information (CSI) at the transmitter, singular value decomposition (SVD) of the channel matrix is performed. This transforms the MIMO channel into parallel subchannels, but has a low overall diversity order. Hence, we propose X-Codes which achieve a higher diversity order by pairing the subchannels, prior to SVD preceding. In particular, each pair of information symbols is encoded by a fixed 2 × 2 real rotation matrix. X-Codes can be decoded using nr very low complexity two-dimensional real sphere decoders. Error probability analysis for X-Codes enables us to choose the optimal pairing and the optimal rotation angle for each pair. Finally, we show that our new scheme outperforms other low complexity precoding schemes.

Implications of the half-duplex constraint on relay-aided cooperation using rateless codes

The half-duplex constraint, which mandates that a cooperative relay cannot transmit and receive simultaneously, considerably simplifies the demands made on the hardware and signal processing capabilities of a relay. However, the very inability of a relay to transmit and receive simultaneously leads to a potential under-utilization of time and bandwidth resources available to the system. We analyze the impact of the half-duplex constraint on the throughput of a cooperative relay system that uses rateless codes to harness spatial diversity and efficiently transmit information from a source to a destination. We derive closed-form expressions for the throughput of the system, and show that as the number of relays increases, the throughput approaches that of a system that uses more sophisticated full-duplex nodes. Thus, half-duplex nodes are well suited for cooperation using rateless codes despite the simplicity of both the cooperation protocol and the relays.

Explicit codes uniformly reducing repair bandwidth in distributed storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit codes minimizing repair bandwidth for distributed storage

We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.

Single real-symbol decodable, high-rate, distributed space-time block codes

A scheme to apply the rate-1 real orthogonal designs (RODs) in relay networks with single real-symbol decodability of the symbols at the destination for any arbitrary number of relays is proposed. In the case where the relays do not have any information about the channel gains from the source to themselves, the best known distributed space time block codes (DSTBCs) for k relays with single real-symbol decodability offer an overall rate of complex symbols per channel use. The scheme proposed in this paper offers an overall rate of 2/2+k complex symbol per channel use, which is independent of the number of relays. Furthermore, in the scenario where the relays have partial channel information in the form of channel phase knowledge, the best known DSTBCs with single real-symbol decodability offer an overall rate of 1/3 complex symbols per channel use. In this paper, making use of RODs, a scheme which achieves the same overall rate of 1/3 complex symbols per channel use but with a decoding delay that is 50 percent of that of the best known DSTBCs, is presented. Simulation results of the symbol error rate performance for 10 relays, which show the superiority of the proposed scheme over the best known DSTBC for 10 relays with single real-symbol decodability, are provided.

Dendritic encapsulation of amino acid-metal complexes. Synthesis and studies of dendron-functionalized L-tyrosine-metal (Zn-II, Co-II) complexes

This paper describes the synthesis, characterization and studies of dendrimers possessing an amino acid-metal complex as the core. Using Frechet-type polyaryl ether dendrons, L-tyrosine-metal (Zn-II and Co-II) complex cored dendrimers of 0-4 generations were synthesized. The metal complexation of the tyrosine unit at the focal point of these dendrons took place smoothly, in excellent yields, even though the sizes of the dendrons increase as the generations advance. Spectrophotometric titrations with CoII metal ion confirmed the formation of a 2 : 1 dendritic ligand to metal complex and the existence of a pseudotetrahedral geometry at the metal centre is also inferred. Cyclic voltammetric studies of dendrimer-Co-II complexes showed that while the electron transfer of Co-II to Co-I was facile for generations 0-2, such a process was difficult with generations 3 and 4, indicating a rigid encapsulation of the metal ion centre by proximal dendron groups. Further reduction of Co-I to Co-0 and the corresponding oxidation processes appear to be limited by adsorption at the surfaces of the electrodes.

Structural and dielectric studies on poly(l-lithocholic acid)

In this paper, we report the results pretaining to the study of the structural, microstructural and the dielectric properties of poly(I-lithocholic acid) (PL), and the composite of PL dispersed in PMMA. The density of the composites was measured using Archimedes principle. The microstructural properties of the composities were studied using XRD and SEM techniques, which give an idea about the dispersion of the polymer PL in the PMMA matrix. The dielectric constants er of the composites were measured with a HP 4194A Impedance/Gain-Phase Analyzer in the frequency range 100 Hz-40 MHz at room temperature. The dielectric constants of the composites at different frequencies were predicted using Clasius-Mossotti and Maxwell's models.

Solution combustion synthesis of gamma(L)-Bi(2)MoO(6) and photocatalytic activity under solar radiation

The facile method of solution combustion was used to synthesize gamma(L)-Bi(2)MoO(6). The material was crystallized in a purely crystalline orthorhombic phase with sizes varying from 300 to 500 nm. Because the band gap was 2.51 eV, the degradation of wide variety of cationic and anionic dyes was investigated under solar radiation. Despite the low surface area (< 1 m(2)/g) of the synthesized material, gamma(L)-Bi(2)MoO(6) showed high photocatalytic activity under solar radiation due to its electronic and morphological properties. (C) 2011 Elsevier Ltd. All rights reserved.

The requirements for Ca2+, protein phosphorylation and concurrent protein synthesis for zeatin signaling of acidic chitinase transcript accumulation in Cucumis sativus L

We have previously reported that both Ca2+ and staurosporine-sensitive protein kinase(s) are involved in the cytokinin zeatin induction of cucumber chitinase activity and its protein content (Barwe et al. 2001). To further characterize signal transduction events involved in this cytokinin induction of chitinase gene expression, Northern hybridizations of total RNAs prepared from excised, dark-grown cucumber cotyledons treated with cytokinins and/or various agonists and antagonists of signal transduction components, were carried out using a cucumber acidic chitinase (CACHT) cDNA probe (Metraux et al. 1989). CACHT mRNA increased by approximately 5- to 6-fold in response to exogenous zeatin (Z), zeatin riboside (ZR), and benzyladenine (BA) treatment, but failed to accumulate in response to kinetin (K). Among the cytokinins tested, Z was most effective. The Z-induced accumulation of CACHT mRNA was inhibited by a plasma membrane Ca2+ channel blocker verapamil. Treatment of cotyledons with exogenous CaCl2 and calcium ionophore A23187 in the presence and absence of cytokinin enhanced CACHT mRNA accumulation. These two observations suggest the participation of extracellular calcium in signaling Z-induction. Furthermore, the presence of staurosporine (an inhibitor of protein kinase) in Z treatment reduced CACHT mRNA, suggesting the involvement of phosphorylation of one or more cellular proteins. In addition, we provide evidence that the Z-induction of CACHT mRNA is blocked by protein synthesis inhibitor cycloheximide treatment. Taken together, these results suggest that Ca2+ influx from extracellular space, protein phosphorylation, and concurrent protein synthesis events participate in cytokinin signaling during Z-induced CACHT transcript accumulation.

Trans -> Cis isomerization of trans-[(dPPM)(2)Ru(H)(L)][BF4] (L = P(OR)(3)) Complexes: Preparation of cis-[(dppm)(2)Ru(eta(2)-H-2)(L)][BF4](2)

A series of new dicationic dihydrogen complexes of ruthenium of the type cis-[(dppm)(2)Ru(eta(2)-H-2)(L)][BF4](2) (dppm = Ph2PCH2PPh2; L = P(OMe)(3), P(OEt)(3), PF((OPr)-Pr-i)(2)) have been prepared by protonating the precursor hydride complexes cis-[(dppm)(2)Ru(H)(L)][BF4] (L = P(OMe)(3), P(OEt)(3), P((OPr)-Pr-i)(3)) using HBF4.Et2O. The cis-[(dppm)(2)Ru(H)(L)][BF4] complexes were obtained from the trans hydrides via an isomerization reaction that is acid-accelerated. This isomerization reaction gives mixtures of cis and trans hydride complexes, the ratios of which depend on the cone angles of the phosphite ligands: the greater the cone angle, the greater is the amount of the cis isomer. The eta(2)-H-2 ligand in the dihydrogen complexes is labile, and the loss of H-2 was found to be reversible. The protonation reactions of the starting hydrides with trans PMe3 or PMe2Ph yield mixtures of the cis and the trans hydride complexes; further addition of the acid, however, give trans-[(dPPM)(2)Ru(BF4)Cl]. The roles of the bite angles of the dppm ligand as well as the steric and the electronic properties of the monodentate phosphorus ligands in this series of complexes are discussed. X-ray crystal structures of trans-[(dppm)(2)Ru(H)(P(OMe)(3))][BF4], cis-[(dppm)(2)Ru-(H)(P(OMe)(3))][BF4], and cis-[(dppm)(2)Ru(H)(P((OPr)-Pr-i)(3))][BF4] complexes have been determined.

Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.