Distributed De La Garza algorithm for load-balancing routing in wireless sensor networks

Large scale wireless sensor networks raise many challenges in the design of efficient and effective routing algorithm due to their complexity and hardware constraints. However, the scalability challenge may be mitigated from a macroscopic perspective. One example is the distributed De la Garza iteration (DDLGI) algorithm for global routing load-balancing, based on a set of partial differential equations iteratively solved by the De la Garza method. We theoretically analyze the parallelism of DDLGI and illustrate that the region of interest may impact the degree of parallelism and error. Furthermore, though DDLGI always converges, the slow convergence and long-range information exchange problems may lead to excess energy consumption in communication. Thus, we propose various enhanced De la Garza routing (E-DLGR) algorithms to alleviate the energy consumption problem by which nodes may exchange less information and only need to exchange information with closer nodes to complete each iteration. Our theoretical analysis and simulation results show that the proposed E-DLGR algorithms may have less transmission overhead, thus further reducing energy consumption, and converge faster while still maintaining adequate accuracy.

     

Cobalt Based Nanoparticles Embedded Reduced Graphene Oxide Aerogel for Hydrogen Evolution Electrocatalyst

Efficient water electrolysis catalyst is highly demanded for the production of hydrogen as a sustainable energy fuel. It is reported that cobalt derived nanoparticle (CoS₂, CoP, CoS|P) decorated reduced graphene oxide (rGO) composite aerogel catalysts for highly active and reliable hydrogen evolution reaction electrocatalysts. 7 nm level cobalt derived nanoparticles are synthesized over graphene aerogel surfaces with excellent surface coverage and maximal expose of active sites. CoS|P/rGO hybrid aerogel composites show an excellent catalytic activity with overpotential of ≈169 mV at a current density of ≈10 mA cm^?2. Accordingly, efficient charge transfer is attained with Tafel slope of ≈52 mV dec^?1 and a charge transfer resistance (R_ct) of ≈12 Ω. This work suggests a viable route toward ultrasmall, uniform nanoparticles decorated graphene surfaces with well‐controlled chemical compositions, which can be generally useful for various applications commonly requiring large exposure of active surface area as well as robust interparticle charger transfer.     

Performance analysis of OFDMA uplink systems with symbol timing misalignment

This letter presents our investigation for the effect of symbol timing errors in orthogonal frequency-division multiple access (OFDMA) uplink systems. We express the symbol timing errors between users as the symbol timing misalignments with respect to the desired user. Then, we derive an explicit expression of the signal-to-noise ratio (SNR) as a function of the maximum value of the symbol timing misalignments. Analyses and simulation results show that, to achieve an SNR of 20 dB, the maximum value of the symbol timing misalignments must be less than the cyclic prefix duration plus 6.25% of the useful symbol duration. Based on the resulting SNR degradation, we evaluate the SNR gain with guard subcarriers in order to mitigate the effect of the symbol timing misalignments.     

On the option valuation and decomposition of exchange option

In this paper, we shall find the uniquerational price associated with the exchange option. Also, we find the decomposition of Snell envelope and value function of the American exchange option.     

Efficient microwave induced direct α-halogenation of carbonyl compounds

A novel and direct method for the synthesis of α-halocarbonyl compounds using sequential treatment of carbonyl compounds with [hydroxy(tosyloxy)iodo]benzene followed by magnesium halides under solvent-free microwave irradiation conditions is described.     

Distributed self-stabilizing placement of replicated resources in emerging networks

Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionality, or configuration to enact or optimize communication tasks. The placement of these replicated resources can significantly impact performance. We present a novel self-stabilizing, fully distributed, asynchronous, scalable protocol that can be used to place replicated resources such that each node is "close" to some copy of any object. We describe our protocol in the context of a graph with colored nodes, where a node's color indicates the replica/task that it is assigned. Our combination of theoretical results and simulation prove stabilization of the protocol, and evaluate its performance in the context of convergence time, message transmissions, and color distance. Our results show that the protocol generates colorings that are close to the optimal under a set of metrics, making such a protocol ideal for emerging networking systems.