Theory and Algorithms for Hop-Count-Based Localization with Random Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.

Highly luminescent and thermally stable lanthanide coordination polymers designed from 4-(dipyridin-2-yl)aminobenzoate: efficient energy transfer from Tb3+ to Eu3+ in a mixed lanthanide coordination compound

Herein, a new aromatic carboxylate ligand, namely, 4-(dipyridin-2-yl)aminobenzoic acid (HL), has been designed and employed for the construction of a series of lanthanide complexes (Eu3+ = 1, Tb3+ = 2, and Gd3+ = 3). Complexes of 1 and 2 were structurally authenticated by single-crystal X-ray diffraction and were found to exist as infinite 1D coordination polymers with the general formulas {Eu(L)(3)(H2O)(2)]}(n) (1) and {Tb(L)(3)(H2O)]center dot(H2O)}(n) (2). Both compounds crystallize in monoclinic space group C2/c. The photophysical properties demonstrated that the developed 4-(dipyridin-2-yl)aminobenzoate ligand is well suited for the sensitization of Tb3+ emission (Phi(overall) = 64%) thanks to the favorable position of the triplet state ((3)pi pi*) of the ligand the energy difference between the triplet state of the ligand and the excited state of Tb3+ (Delta E) = (3)pi pi* - D-5(4) = 3197 cm(-1)], as investigated in the Gd3+ complex. On the other hand, the corresponding Eu3+ complex shows weak luminescence efficiency (Phi(overall) = 7%) due to poor matching of the triplet state of the ligand with that of the emissive excited states of the metal ion (Delta E = (3)pi pi* - D-5(0) = 6447 cm(-1)). Furthermore, in the present work, a mixed lanthanide system featuring Eu3+ and Tb3+ ions with the general formula {Eu0.5Tb0.5(L)(3)(H2O)(2)]}(n) (4) was also synthesized, and the luminescent properties were evaluated and compared with those of the analogous single-lanthanide-ion systems (1 and 2). The lifetime measurements for 4 strongly support the premise that efficient energy transfer occurs between Tb3+ and Eu3+ in a mixed lanthanide system (eta = 86%).

Nonuniform random geometric graphs with location-dependent radii

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function n f(center dot), where n is an element of N, and f is a probability density function on R-d. A vertex located at x connects via directed edges to other vertices that are within a cut-off distance r(n)(x). We prove strong law results for (i) the critical cut-off function so that almost surely, the graph does not contain any node with out-degree zero for sufficiently large n and (ii) the maximum and minimum vertex degrees. We also provide a characterization of the cut-off function for which the number of nodes with out-degree zero converges in distribution to a Poisson random variable. We illustrate this result for a class of densities with compact support that have at most polynomial rates of decay to zero. Finally, we state a sufficient condition for an enhanced version of the above graph to be almost surely connected eventually.

Further results on geometric properties of a family of relative entropies

This paper extends some geometric properties of a one-parameter family of relative entropies. These arise as redundancies when cumulants of compressed lengths are considered instead of expected compressed lengths. These parametric relative entropies are a generalization of the Kullback-Leibler divergence. They satisfy the Pythagorean property and behave like squared distances. This property, which was known for finite alphabet spaces, is now extended for general measure spaces. Existence of projections onto convex and certain closed sets is also established. Our results may have applications in the Rényi entropy maximization rule of statistical physics.

Vibrational spectroscopy and density functional theory analysis of 3-O-caffeoylquinic acid

Density functional theory (DFT) calculations are being performed to investigate the geometric, vibrational, and electronic properties of the chlorogenic acid isomer 3-CQA (1R,3R,4S,5R)-3-{(2E)-3-(3,4-dihydroxyphenyl)prop-2-enoyl]oxy}-1,4, 5-trihydroxycyclohexanecarboxylic acid), a major phenolic compound in coffee. DFT calculations with the 6-311G(d,p) basis set produce very good results. The electrostatic potential mapped onto an isodensity surface has been obtained. A natural bond orbital analysis (NBO) has been performed in order to study intramolecular bonding, interactions among bonds, and delocalization of unpaired electrons. HOMO-LUMO studies give insights into the interaction of the molecule with other species. The calculated HOMO and LUMO energies indicate that a charge transfer occurs within the molecule. (C) 2012 Elsevier B.V. All rights reserved.

Magnetic Structure and Properties of the Rechargeable Battery Insertion Compound Na2FePO4F

The magnetic structure and properties of sodium iron fluorophosphate Na2FePO4F (space group Pbcn), a cathode material for rechargeable batteries, were studied using magnetometry and neutron powder diffraction. The material, which can be described as a quasi-layered structure with zigzag Fe-octahedral chains, develops a long-range antiferromagnetic order below similar to 3.4 K. The magnetic structure is rationalized as a super-exchange-driven ferromagnetic ordering of chains running along the a-axis, coupled antiferromagnetically by super-super-exchange via phosphate groups along the c-axis, with ordering along the b-axis likely due to the contribution of dipole dipole interactions.

New Insights into Electronic and Geometric Effects in the Enhanced Photoelectrooxidation of Ethanol Using ZnO Nanorod/Ultrathin Au Nanowire Hybrids

Oxidation of small organic molecules in a fuel cell is a viable method for energy production. However, the key issue is the development of suitable catalysts that exhibit high efficiencies and remain stable during operation. Here, we demonstrate that amine-modified ZnO nanorods on which ultrathin Au nanowires are grown act as an excellent catalyst for the oxidation of ethanol. We show that the modification of the ZnO nanorods with oleylamine not only modifies the electronic structure favorably but also serves to anchor the Au nanowires on the nanorods. The adsorption of OH- species on the Au nanowires that is essential for ethanol oxidation is facilitated at much lower potentials as compared to bare Au nanowires leading to high activity. While ZnO shows negligible electrocatalytic activity under normal conditions, there is significant enhancement in the activity under light irradiation. We demonstrate a synergistic enhancement in the photoelectrocatalytic activity of the ZnO/Au nanowire hybrid and provide mechanistic explanation for this enhancement based on both electronic as well as geometric effects. The principles developed are applicable for tuning the properties of other metal/semiconductor hybrids with potentially interesting applications beyond the fuel cell application demonstrated here.

Lower bounds on Ricci flow invariant curvatures and geometric applications

We consider Ricci flow invariant cones C in the space of curvature operators lying between the cones ``nonnegative Ricci curvature'' and ``nonnegative curvature operator''. Assuming some mild control on the scalar curvature of the Ricci flow, we show that if a solution to the Ricci flow has its curvature operator which satisfies R + epsilon I is an element of C at the initial time, then it satisfies R + epsilon I is an element of C on some time interval depending only on the scalar curvature control. This allows us to link Gromov-Hausdorff convergence and Ricci flow convergence when the limit is smooth and R + I is an element of C along the sequence of initial conditions. Another application is a stability result for manifolds whose curvature operator is almost in C. Finally, we study the case where C is contained in the cone of operators whose sectional curvature is nonnegative. This allows us to weaken the assumptions of the previously mentioned applications. In particular, we construct a Ricci flow for a class of (not too) singular Alexandrov spaces.

A note on D1-D5 entropy and geometric quantization

We quantize the space of 2-charge fuzzballs in IIB supergravity on K3. The resulting entropy precisely matches the D1-D5 black hole entropy, including a specific numerical coefficient. A partial match (ie., a smaller coefficient) was found by Rychkov a decade ago using the Lunin-Mathur subclass of solutions - we use a simple observation to generalize his approach to the full moduli space of K3 fuzzballs, filling a small gap in the literature.

On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

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.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

Order-disorder phase transition and multiferroic behaviour in a metal organic framework compound (CH3)(2)NH2Co(HCOO)(3)

We have investigated the multiferroic and glassy behaviour of metal-organic framework (MOF) material (CH3)(2)NH2Co(CHOO)(3). The compound has perovskite-like architecture in which the metal-formate forms a framework. The organic cation (CH3)(2)NH2+ occupies the cavities in the formate framework in the framework via N-H center dot center dot center dot O hydrogen bonds. At room temperature, the organic cation is disordered and occupies three crystallographically equivalent positions. Upon cooling, the organic cation is ordered which leads to a structural phase transition at 155 K. The structural phase transition is associated with a para-ferroelectric phase transition and is revealed by dielectric and pyroelectric measurements. Further, a PE hysteresis loop below 155 K confirms the ferroelectric behaviour of the material. Analysis of dielectric data reveal large frequency dispersion in the values of dielectric constant and tan delta which signifies the presence of glassy dielectric behaviour. The material displays a antiferromagnetic ordering below 15 K which is attributed to the super-exchange interaction between Co2+ ions mediated via formate linkers. Interestingly, another magnetic transition is also found around 11 K. The peak of the transition shifts to lower temperature with increasing frequency, suggesting glassy magnetism in the sample. (C) 2016 AIP Publishing LLC.

Ionothermal Synthesis of High-Voltage Alluaudite Na2+2xFe2-x(SO4)(3) Sodium Insertion Compound: Structural, Electronic, and Magnetic Insights

Exploring future cathode materials for sodium-ion batteries, alluaudite class of Na2Fe2II(SO4)(3) has been recently unveiled as a 3.8 V positive insertion candidate (Barpanda et al. Nat. Commun. 2014, 5, 4358). It forms an Fe-based polyanionic compound delivering the highest Fe-redox potential along with excellent rate kinetics and reversibility. However, like all known SO4-based insertion materials, its synthesis is cumbersome that warrants careful processing avoiding any aqueous exposure. Here, an alternate low temperature ionothermal synthesis has been described to produce the alluaudite Na2+2xFe2-xII(SO4)(3). It marks the first demonstration of solvothermal synthesis of alluaudite Na2+2xM2-xII(SO4)(3) (M = 3d metals) family of cathodes. Unlike classical solid-state route, this solvothermal route favors sustainable synthesis of homogeneous nanostructured alluaudite products at only 300 degrees C, the lowest temperature value until date. The current work reports the synthetic aspects of pristine and modified ionothermal synthesis of Na2+2xFe2-xII(SO4)(3) having tunable size (300 nm similar to 5 mu m) and morphology. It shows antiferromagnetic ordering below 12 K. A reversible capacity in excess of 80 mAh/g was obtained with good rate kinetics and cycling stability over 50 cycles. Using a synergistic approach combining experimental and ab initio DFT analysis, the structural, magnetic, electronic, and electrochemical properties and the structural limitation to extract full capacity have been described.