Energy-Efficient Decentralized Cooperative Routing in Wireless Networks

Wireless adhoc networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem - the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node. In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels, where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information (CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a c- - orresponding factored class of control poli.

Energy-Efficient Decentralized Routing with Localized Cooperation Suitable for Fast Fading

Wireless networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem – the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node.In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels,where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information(CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a corresponding factored class of control policies corresponding to local cooperation between nodes with a local outage constraint. The resulting optimal scheme in this class can again be computed efficiently in a decentralized manner. We demonstrate significant energy savings for both slow and fast fading channels through numerical simulations of randomly distributed networks.

Cadmium deoxycholate: a new and efficient precursor for highly luminescent CdSe nanocrystals

We have demonstrated that cadmium deoxycholate (1), a Cd-salt, provides a convenient and inexpensive route to high quality CdSe nanocrystals with photoluminescence (PL) in the blue to red region of the visible spectrum, with reproducible quantum yields as high as similar to 47%. Owing to the high thermal stability of the bile acid based cadmium precursor (decomposition point: 332 degrees C), it was possible to achieve high injection and growth temperatures (similar to 300 degrees C) for the nanocrystals, which was essential for obtaining larger CdSe nanocrystals emitting in the red region (625-650 nm) with a sharp full width at half maximum (FWHM) (23 nm) and multiple (6-7) excitonic absorption features. The as-prepared CdSe nanocrystals synthesized from cadmium deoxycholate represent a series of highly efficient emitters with pure colours and controllable sizes, shapes and structures.

alpha-Tocopherol derived lipid dimers as efficient gene transfection agents. Mechanistic insights into lipoplex internalization and therapeutic induction of apoptotic activity

In this report, we present cationic dimeric (gemini) lipids for significant plasmid DNA (pDNA) delivery to different cell lines without any marked toxicity in the presence of serum. Six gemini lipids based on alpha-tocopherol were synthesized, which differed in their spacer chain lengths. Each of these gemini lipids mixed with a helper lipid, 1,2-dioleoyl phosphatidyl ethanolamine (DOPE), was capable of forming stable aqueous suspensions. These co-liposomal systems were examined for their potential to transfect pEGFP-C3 plasmid DNA into nine cell lines of different origins. The transfection efficacies noticed in terms of EGFP expression levels using flow cytometry were well corroborated using independent fluorescence microscopy studies. Significant EGFP expression levels were reported using the gemini co-liposomes, which counted significantly better than one well known commercial formulation, Lipofectamine 2000 (L2 K). Transfection efficacies were also analyzed in terms of the degree of intracellular delivery of labeled plasmid DNA (pDNA) using confocal microscopy, which revealed an efficient internalization in the presence of serum. The cell viability assays performed using optimized formulations demonstrated no significant toxicity towards any of the cell lines used in the study. We also had a look at the lipoplex internalization pathway to profile the uptake characteristics. A caveolae/lipid raft route was attributed to their excellent gene transfection capabilities. The study was further advanced by using a therapeutic p53-EGFP-C3 plasmid and the apoptotic activity was observed using FACS and growth inhibition assay.

Investigations into the structural and down-shifting and up-conversion luminescence properties of Ba2Na1-3xErxNb5O15 (0 <= x <= 0.06) nanocrystalline phosphor synthesized via sol-gel route

The present work deals with the structural and efficient down-shifting (DS) and up-conversion (UC) luminescence properties of erbium ion (Er3+) doped nanocrystalline barium sodium niobate (Ba2Na1-3xErxNb5O15, where x = 0, 0.02, 0.04 and 0.06) powders synthesized via novel citrate-based sol-gel route. The monophasic nature of the title compound was confirmed via x-ray powder diffraction followed by FT-IR studies. High-resolution transmission electron microscopy (HRTEM) facilitated the establishment of the nanocrystalline phase and the morphology of the crystallites. The Kubelka-Munk function, based on diffused reflectance studies and carried out on nano-sized crystallites, was employed to obtain the optical band-gap. The synthesized nanophosphor showed efficient DS/PL-photoluminescence and UC luminescence properties, which have not yet been reported so far in this material. The material emits intense DS green emission on excitation with 378 nm radiation. Interestingly, the material gives intense UC emission in the visible region dominated by green emission and relatively weak red emission on 976 nm excitation (NIR laser excitation). Such a dual-mode emitting nanophosphor could be very useful in display devices and for many other applications.

An Efficient Load Distribution Strategy for a Distributed Linear Network of Processors with Communication Delays

In this paper, we present an improved load distribution strategy, for arbitrarily divisible processing loads, to minimize the processing time in a distributed linear network of communicating processors by an efficient utilization of their front-ends. Closed-form solutions are derived, with the processing load originating at the boundary and at the interior of the network, under some important conditions on the arrangement of processors and links in the network. Asymptotic analysis is carried out to explore the ultimate performance limits of such networks. Two important theorems are stated regarding the optimal load sequence and the optimal load origination point. Comparative study of this new strategy with an earlier strategy is also presented.

Preparation of lamellar and hexagonal forms of mesoporous silica and zirconiaby the neutral amine route: lamellar-hexagonal transformation in the solid state

The chain length of the surfactant and the solvent composition are two of the factors that determine whether the lamellar or the hexagonal form of mesoporous SiO2 (or ZrO2) is formed by the neutral amine route; a lamellar-hexagonal transformation occurs on removal of the amine from the former.

Model Predictive Static Programming: A Computationally Efficient Technique For Suboptimal Control Design

Combining the philosophies of nonlinear model predictive control and approximate dynamic programming, a new suboptimal control design technique is presented in this paper, named as model predictive static programming (MPSP), which is applicable for finite-horizon nonlinear problems with terminal constraints. This technique is computationally efficient, and hence, can possibly be implemented online. The effectiveness of the proposed method is demonstrated by designing an ascent phase guidance scheme for a ballistic missile propelled by solid motors. A comparison study with a conventional gradient method shows that the MPSP solution is quite close to the optimal solution.

Highly efficient C-8 oxidation of substituted xanthines with substitution at the 1-, 3-, and 7- positions using biocatalysts

A bacterial consortium consisting of strains belongings to the genus Klebsiella and Rhodococcus quantitatively converts 1-, 3- and 7-substituted xanthines to their respective 8-oxo compounds.

Efficient use of correlation entropy for analysing time series data

The correlation dimension D 2 and correlation entropy K 2 are both important quantifiers in nonlinear time series analysis. However, use of D 2 has been more common compared to K 2 as a discriminating measure. One reason for this is that D 2 is a static measure and can be easily evaluated from a time series. However, in many cases, especially those involving coloured noise, K 2 is regarded as a more useful measure. Here we present an efficient algorithmic scheme to compute K 2 directly from a time series data and show that K 2 can be used as a more effective measure compared to D 2 for analysing practical time series involving coloured noise.

Efficient Output-Sensitive Construction of Reeb Graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. This paper describes a near-optimal two-step algorithm that constructs the Reeb graph of a Morse function defined over manifolds in any dimension. The algorithm first identifies the critical points of the input manifold, and then connects these critical points in the second step to obtain the Reeb graph. A simplification mechanism based on topological persistence aids in the removal of noise and unimportant features. A radial layout scheme results in a feature-directed drawing of the Reeb graph. Experimental results demonstrate the efficiency of the Reeb graph construction in practice and its applications.

Homogeneous precipitation from solution by urea hydrolysis: a novel chemical route to the a-hydroxides of nickel and cobalt

Homogeneous precipitation from solution by hydrolysis of urea at elevated temperatures (T=120 degrees C) yields novel ammonia-intercalated alpha-type hydroxide phases of the formula M(OH)(x)(NH3)(0.4)(H2O)(y)(NO3)(2-x) where x=2, y=0.68 for M=Ni and x=1.85, y=0 for M=Co. These triple-layered hexagonal phases (a=3.08+/-0.01 Angstrom, c=21.7+/-0.05 Angstrom) are more crystalline than similar phases obtained by chemical precipitation or electrosynthesis. This method can be adapted as a convenient chemical route to the bulk synthesis of alpha-hydroxides.

Synthesis of nanoparticles of the giant dielectric material, CaCu3Ti4O12 from a precursor route

A complex oxalate precursor, CaCu3(TiO)(4)(C2O4)(8)center dot 9H(2)O, (CCT-OX), was synthesized and the precipitate that obtained was confirmed to be monophasic by the wet chemical analyses, X-ray diffraction, FTIR absorption and TG/DTA analyses. The thermal decomposition of this oxalate precursor led to the formation of phase-pure calcium copper titanate, CaCu3Ti4O12, (CCTO) at a parts per thousand yen680A degrees C. The bright-field TEM micrographs revealed that the size of the as synthesized crystallites to be in the 30-80 nm range. The powders so obtained had excellent sinterability resulting in high density ceramics which exhibited giant dielectric constants upto 40000 (1 kHz) at 25A degrees C, accompanied by low dielectric losses.

Efficient Hg and Ag ion detection with luminescent PbS quantum dots grown in poly vinyl alcohol and capped with mercaptoethanol

PbS quantum dots capped with mercaptoethanol (C2H5OSH) have been synthesized in poly vinyl alcohol and used to investigate their photoluminescence (PL) response to various ions such as zinc (Zn), cadmium (Cd), mercury (Hg), silver (Ag), copper (Cu), iron (Fe), manganese (Mn), cobalt (Co), chromium (Cr) and nickel (Ni). The enhancement in the PL intensity was observed with specific ions namely Zn, Cd, Hg and Ag. Among these four ions, the PL response to Hg and Ag even at sub-micro-molar concentrations was quite high, compared to that of Zn and Cd. It was observed that the change in Pb and S molar ratio has profound effect on the sensitivity of these ions. These results indicate that the sensitivity of these QDs could be fine-tuned by controlling the S concentration at the surface. Contrary to the above, Cu quenched the photoluminescence. In Cd based QDs related ion probing, Hg and Cu was found to have quenching properties, however, our PbS QDs have quenching property only for Cu ions. This was attributed to the formation HgS at the surface that has bandgap higher than PbS. Another interesting property of PbS in PVA observed is photo-brightening mechanism due to the curing of the polymer with laser. However, the presence of excess ions at the surface changes its property to photo-darkening/brightening that depends on the direction of carrier transfer mechanism (from QDs to the surface adsorbed metal ions or vice-versa). which is an interesting feature for metal ion detectivity.

Efficient algorithms for computing Reeb graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. We describe an algorithm that constructs the Reeb graph of a Morse function defined on a 3-manifold. Our algorithm maintains connected components of the two dimensional levels sets as a dynamic graph and constructs the Reeb graph in O(nlogn+nlogg(loglogg)3) time, where n is the number of triangles in the tetrahedral mesh representing the 3-manifold and g is the maximum genus over all level sets of the function. We extend this algorithm to construct Reeb graphs of d-manifolds in O(nlogn(loglogn)3) time, where n is the number of triangles in the simplicial complex that represents the d-manifold. Our result is a significant improvement over the previously known O(n2) algorithm. Finally, we present experimental results of our implementation and demonstrate that our algorithm for 3-manifolds performs efficiently in practice.