On the achievable rates of sources having a group alphabet in a distributed source coding setting

We consider the problem of compression via homomorphic encoding of a source having a group alphabet. This is motivated by the problem of distributed function computation, where it is known that if one is only interested in computing a function of several sources, then one can at times improve upon the compression rate required by the Slepian-Wolf bound. The functions of interest are those which could be represented by the binary operation in the group. We first consider the case when the source alphabet is the cyclic Abelian group, Zpr. In this scenario, we show that the set of achievable rates provided by Krithivasan and Pradhan [1], is indeed the best possible. In addition to that, we provide a simpler proof of their achievability result. In the case of a general Abelian group, an improved achievable rate region is presented than what was obtained by Krithivasan and Pradhan. We then consider the case when the source alphabet is a non-Abelian group. We show that if all the source symbols have non-zero probability and the center of the group is trivial, then it is impossible to compress such a source if one employs a homomorphic encoder. Finally, we present certain non-homomorphic encoders, which also are suitable in the context of function computation over non-Abelian group sources and provide rate regions achieved by these encoders.

Training-Embedded, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks

Recently, a special class of complex designs called Training-Embedded Complex Orthogonal Designs (TE-CODs) has been introduced to construct single-symbol Maximum Likelihood decodable (SSD) distributed space-time block codes (DSTBCs) for two-hop wireless relay networks using the amplify and forward protocol. However, to implement DSTBCs from square TE-CODs, the overhead due to the transmission of training symbols becomes prohibitively large as the number of relays increase. In this paper, we propose TE-Coordinate Interleaved Orthogonal Designs (TE-CIODs) to construct SSD DSTBCs. Exploiting the block diagonal structure of TE-CIODs, we show that the overhead due to the transmission of training symbols to implement DSTBCs from TE-CIODs is smaller than that for TE-CODs. We also show that DSTBCs from TE-CIODs offer higher rate than those from TE-CODs for identical number of relays while maintaining the SSD and full-diversity properties.

A token-based distributed algorithm for total order atomic broadcast

In this paper, we propose a new token-based distributed algorithm for total order atomic broadcast. We have shown that the proposed algorithm requires lesser number of messages compared to the algorithm where broadcast servers use unicasting to send messages to other broadcast servers. The traditional method of broadcasting requires 3(N - 1) messages to broadcast an application message, where N is the number of broadcast servers present in the system. In this algorithm, the maximum number of token messages required to broadcast an application message is 2N. For a heavily loaded system, the average number of token messages required to broadcast an application message reduces to 2, which is a substantial improvement over the traditional broadcasting approach.

On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

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.

Functional Significance of an Evolutionarily Conserved Alanine (GCA) Resume Codon in tmRNA in Escherichia coli

Occasionally, ribosomes stall on mRNAs prior to the completion of the polypeptide chain. In Escherichia coli and other eubacteria, tmRNA-mediated trans-translation is a major mechanism that recycles the stalled ribosomes. The tmRNA possesses a tRNA-like domain and a short mRNA region encoding a short peptide (ANDENYALAA in E. coli) followed by a termination codon. The first amino acid (Ala) of this peptide encoded by the resume codon (GCN) is highly conserved in tmRNAs in different species. However, reasons for the high evolutionary conservation of the resume codon identity have remained unclear. In this study, we show that changing the E. coli tmRNA resume codon to other efficiently translatable codons retains efficient functioning of the tmRNA. However, when the resume codon was replaced with the low-usage codons, its function was adversely affected. Interestingly, expression of tRNAs decoding the low-usage codon from plasmid-borne gene copies restored efficient utilization of tmRNA. We discuss why in E. coli, the GCA (Ala) is one of the best codons and why all codons in the short mRNA of the tmRNA are decoded by the abundant tRNAs.

Manipulation of the Hydration Levels in Minerals of Sodium Cadmium Bisulfate toward the Design of Functional Materials

Several variants of hydrated sodium cadmium bisulfate, Na(2)Cd(2)(SO(4))(3) center dot 3H(2)O, Na(2)Cd(SO(4))(2) center dot 2H(2)O, and Na(2)Cd(SO(4))(2) center dot 4H(2)O have been synthesized, and their thermal properties followed by phase transitions have been invesigated. The formation of these phases depends on the stochiometry and the time taken for crystallization from water. Na(2)Cd(2)(SO(4))(3)center dot 3H(2)O, which crystallizes in the trigonal system, space group P3c, is grown from the aqueous solution in about four weeks. The krohnkite type mineral Na(2)Cd(SO(4))(2) center dot 2H(2)O and the mineral astrakhanite, also known as blodite, Na(2)Cd (SO(4))(2)center dot 4H(2)O, crystallize concomittantly in about 24 weeks. Both these minerals belong to the monoclinic system(space group P2(1)/c). Na(2)Cd(2)(SO(4))(3)center dot 3H(2)O loses water completely when heated to 250 degrees C and transforms to a dehydrated phase (cubic system, space group I (4) over bar 3d) whose structure has been established using ab initio powder diffration techniques. Na(2)Cd(SO(4))(2)center dot 2H(2)O transforms to alpha-Na(2)Cd(SO(4))(2) (space group C2/c) on heating to 150 degrees C which is a known high ionic conductor and remains intact over prolonged periods of exposure to moisture (over six months). However, when alpha-Na(2)Cd(SO(4))(2) is heated to 570 degrees C followed by sudden quenching in liquid nitrogen beta-Na(2)Cd(SO(4))(2) (P2(1)/c) is formed. beta-Na(2)Cd(SO(4))(2) takes up water from the atmosphere and gets converted completely to the krohnkite type mineral in about four weeks. Further, beta-Na(2)Cd(SO(4))(2) has a conductivity behavior comparable to the a-form up to 280 degrees C, the temperature required for the transformation of the beta- to alpha-form. These experiments demonstrate the possibility of utilizing the abundantly available mineral sources as precursors to design materials with special properties.

Surfactant-mediated Synthesis of Functional Metal Oxide Nanostructures via Microwave Irradiation-assisted Chemical Synthesis

Nanostructured materials have attracted considerable interest in recent years due to their properties which differ strongly from their bulk phase and potential applications in nanoscale electronic and optoelectronic devices. Metal oxide nanostructures can be synthesized by variety of different synthesis techniques developed in recent years such as thermal decomposition, sol-gel technique, chemical coprecipitation, hydrothermal process, solvothermal process, spray pyrolysis, polyol process etc. All the above processes go through a tedious synthesis procedure followed by prolonged heat treatment at elevated temperature and are time consuming. In the present work we describe a rapid microwave irradiation-assisted chemical synthesis technique for the growth of nanoparticles, nanorods, and nanotubes of a variety of metal oxides in the presence of an appropriate surfactant, without the use of any templates The method is simple, inexpensive, and helps one to prepare nanostructures in a very simple way, and in a very short time, measured in minutes. The synthesis procedure employs high quality metalorganic complexes (typically -diketonates) featuring a direct metal-to-oxygen bond in its molecular structure. The complex is dissolved in a suitable solvent, often with a surfactant added, and the solution then subjected to microwave irradiation in a domestic microwave oven operating at 2.45 GHz frequency with power varying from 160-800 W, from a few seconds to a few minutes, leading to the formation of corresponding metal oxides. This method has been used successfully to synthesize nanostructures of a variety of binary and ternary metal oxides such as ZnO, CdO, Fe2O3, CuO, Ga2O3, Gd2O3, ZnFe2O4, etc. There is an observed variation in the morphology of the nanostructures with the change of different parameters such as microwave power, irradiation time, appropriate solvent, surfactant type and concentration. Cationic, anionic, nonionic and polymeric surfactants have been used to generate a variety of nanostructures. Even so, to remove the surfactant, there is either no need of heat treatment or a very brief exposure to heat suffices, to yield highly pure and crystalline oxide materials as prepared. By adducting the metal complexes, the shape of the nanostructures can be controlled further. In this manner, very well formed, single-crystalline, hexagonal nanorods and nanotubes of ZnO have been formed. Adducting the zinc complex leads to the formation of tapered ZnO nanorods with a very fine tip, suitable for electron emission applications. Particle size and their monodispersity can be controlled by a suitable choice of a precursor complex, the surfactant, and its concentration. The resulting metal oxide nanostructures have been characterized by X-ray diffraction, field emission scanning electron microscopy, transmission electron microscopy, FTIR spectroscopy, photoluminescence, and electron emission measurements.

Interference Alignment as a Tool in Network Coding as Applied to Distributed Storage

In this paper, we outline an approach to the task of designing network codes in a non-multicast setting. Our approach makes use of the concept of interference alignment. As an example, we consider the distributed storage problem where the data is stored across the network in n nodes and where a data collector can recover the data by connecting to any k of the n nodes and where furthermore, upon failure of a node, a new node can replicate the data stored in the failed node while minimizing the repair bandwidth.

Comparative Analysis of Pilot-Assisted Distributed Cophasing Approaches in Wireless Sensor Networks

This paper compares and analyzes the performance of distributed cophasing techniques for uplink transmission over wireless sensor networks. We focus on a time-division duplexing approach, and exploit the channel reciprocity to reduce the channel feedback requirement. We consider periodic broadcast of known pilot symbols by the fusion center (FC), and maximum likelihood estimation of the channel by the sensor nodes for the subsequent uplink cophasing transmission. We assume carrier and phase synchronization across the participating nodes for analytical tractability. We study binary signaling over frequency-flat fading channels, and quantify the system performance such as the expected gains in the received signal-to-noise ratio (SNR) and the average probability of error at the FC, as a function of the number of sensor nodes and the pilot overhead. Our results show that a modest amount of accumulated pilot SNR is sufficient to realize a large fraction of the maximum possible beamforming gain. We also investigate the performance gains obtained by censoring transmission at the sensors based on the estimated channel state, and the benefits obtained by using maximum ratio transmission (MRT) and truncated channel inversion (TCI) at the sensors in addition to cophasing transmission. Simulation results corroborate the theoretical expressions and show the relative performance benefits offered by the various schemes.

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.