Novel tetranuclear distorted open-cubane copper complex containing oximate bridges: Synthesis, crystal structure, DNA binding and cleavage activity

The synthesis, molecular structure, DNA binding and nuclease activity of Cu4O4 open-cubane tetranuclear copper(II) complex with 3-2-(ethyl amino)ethyl]imino]-2-butanoneoxime (HL) are reported for the first time. The neutral tetranuclear Cu4L4(ClO4)(4)] complex crystallizes in tetragonal space group P (4) over bar2(1)c with the unit cell parameters; a = 13.798(4) angstrom, b = 13.798(4) angstrom, c = 14.119(6) angstrom, V = 2688(16) angstrom(3), Z = 8, R = 0.0636. Symmetrically equivalent copper atoms exhibit a CuN3O3 elongated distorted octahedral coordination environment, with three nitrogen atoms of the L ligand and one oxime-oxygen atom of second L ligand at equatorial positions, one oxime-oxygen atom of the third L ligand and perchlorate oxygen at axial positions. The complex shows quasireversible cyclic voltammetric response at 0.805 V (Delta E-p = 277 mV) at 100 mV s (1) in DMF for the Cu(II)/Cu(I) redox couple. The binding study of the complex with calf-thymus DNA has been investigated using absorption spectrophotometry. The complex shows strong nuclease activity on stranded pBR 322 plasmid DNA in the presence of hydrogen peroxide and marginal nuclease activity in the presence of reducing agent (dithiothreitol). (C) 2012 Elsevier B. V. All rights reserved.

Self-Assembled Pd6 Open Cage with Triimidazole Walls and the Use of Its Confined Nanospace for Catalytic Knoevenagel- and Diels-Alder Reactions in Aqueous Medium

The two-component self-assembly of a 90 degrees PdII acceptor and a triimidazole donor led to the formation of a water-soluble semi-cylindrical cage with a hydrophobic cavity, which was separately crystallized with hydrophilic- and hydrophobic guests. The parent cage was found to catalyze the Knoevenagel condensation reaction of a series of aromatic mono-aldehydes with active methylene compounds, such as Meldrum's acid or 1,3-dimethylbarbituric acid. The confined hydrophobic nanospace within this cage was also used in the catalytic DielsAlder reactions of 9-hydroxymethylanthracene with N-phenylmaleimide or N-cyclohexylmaleimide.

Co-evolution of content popularity and delivery in mobile P2P networks

Mobile P2P technology provides a scalable approach for content delivery to a large number of users on their mobile devices. In this work, we study the dissemination of a single item of content (e. g., an item of news, a song or a video clip) among a population of mobile nodes. Each node in the population is either a destination (interested in the content) or a potential relay (not yet interested in the content). There is an interest evolution process by which nodes not yet interested in the content (i.e., relays) can become interested (i.e., become destinations) on learning about the popularity of the content (i.e., the number of already interested nodes). In our work, the interest in the content evolves under the linear threshold model. The content is copied between nodes when they make random contact. For this we employ a controlled epidemic spread model. We model the joint evolution of the copying process and the interest evolution process, and derive joint fluid limit ordinary differential equations. We then study the selection of parameters under the content provider's control, for the optimization of various objective functions that aim at maximizing content popularity and efficient content delivery.

Spatial SINR Games of Base Station Placement and Mobile Association

We study the question of determining locations of base stations (BSs) that may belong to the same or to competing service providers. We take into account the impact of these decisions on the behavior of intelligent mobile terminals that can connect to the base station that offers the best utility. The signal-to-interference-plus-noise ratio (SINR) is used as the quantity that determines the association. We first study the SINR association-game: We determine the cells corresponding to each base stations, i.e., the locations at which mobile terminals prefer to connect to a given base station than to others. We make some surprising observations: 1) displacing a base station a little in one direction may result in a displacement of the boundary of the corresponding cell to the opposite direction; 2) a cell corresponding to a BS may be the union of disconnected subcells. We then study the hierarchical equilibrium in the combined BS location and mobile association problem: We determine where to locate the BSs so as to maximize the revenues obtained at the induced SINR mobile association game. We consider the cases of single frequency band and two frequency bands of operation. Finally, we also consider hierarchical equilibria in two frequency systems with successive interference cancellation.

Mobile node authentication using key distribution scheme in wireless sensor networks

We consider the problem of secure communication in mobile Wireless Sensor Networks (WSNs). Achieving security in WSNs requires robust encryption and authentication standards among the sensor nodes. Severe resources constraints in typical Wireless Sensor nodes hinder them in achieving key agreements. It is proved from past studies that many notable key management schemes do not work well in sensor networks due to their limited capacities. The idea of key predistribution is not feasible considering the fact that the network could scale to millions. We prove a novel algorithm that provides robust and secure communication channel in WSNs. Our Double Encryption with Validation Time (DEV) using Key Management Protocol algorithm works on the basis of timed sessions within which a secure secret key remains valid. A mobile node is used to bootstrap and exchange secure keys among communicating pairs of nodes. Analysis and simulation results show that the performance of the DEV using Key Management Protocol Algorithm is better than the SEV scheme and other related work.

Mobile agent based TCP attacker identification in MANET using the traffic history (MAITH)

TCP attacks are the major problem faced by Mobile Ad hoc Networks (MANETs) due to its limited network and host resources. Attacker traceback is a promising solution which allows a victim to identify the exact location of the attacker and hence enables the victim to take proper countermeasure near attack origins, for forensics and to discourage attackers from launching the attacks. However, attacker traceback in MANET is a challenging problem due to dynamic network topology, limited network and host resources such as memory, bandwidth and battery life. We introduce a novel method of TCP attacker Identification in MANET using the Traffic History - MAITH. Based on the comprehensive evaluation based on simulations, we showed that MAITH can successfully track down the attacker under diverse mobile multi-hop network environment with low communication, computation, and memory overhead.

A trust model for routing in MANETs: a cognitive agents based approach

Mobile ad hoc networks (MANETs) is one of the successful wireless network paradigms which offers unrestricted mobility without depending on any underlying infrastructure. MANETs have become an exciting and im- portant technology in recent years because of the rapid proliferation of variety of wireless devices, and increased use of ad hoc networks in various applications. Like any other networks, MANETs are also prone to variety of attacks majorly in routing side, most of the proposed secured routing solutions based on cryptography and authentication methods have greater overhead, which results in latency problems and resource crunch problems, especially in energy side. The successful working of these mechanisms also depends on secured key management involving a trusted third authority, which is generally difficult to implement in MANET environ-ment due to volatile topology. Designing a secured routing algorithm for MANETs which incorporates the notion of trust without maintaining any trusted third entity is an interesting research problem in recent years. This paper propose a new trust model based on cognitive reasoning,which associates the notion of trust with all the member nodes of MANETs using a novel Behaviors-Observations- Beliefs(BOB) model. These trust values are used for detec- tion and prevention of malicious and dishonest nodes while routing the data. The proposed trust model works with the DTM-DSR protocol, which involves computation of direct trust between any two nodes using cognitive knowledge. We have taken care of trust fading over time, rewards, and penalties while computing the trustworthiness of a node and also route. A simulator is developed for testing the proposed algorithm, the results of experiments shows incorporation of cognitive reasoning for computation of trust in routing effectively detects intrusions in MANET environment, and generates more reliable routes for secured routing of data.

Optimal forwarding in delay tolerant networks with multiple destinations

We study the trade-off between delivery delay and energy consumption in a delay tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there are several other nodes in the network that can assist in relaying the message. We first assume that, at every instant, all the nodes know the number of relays carrying the packet and the number of destinations that have received the packet. We formulate the problem as a controlled continuous time Markov chain and derive the optimal closed loop control (i.e., forwarding policy). However, in practice, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this issue, we obtain an ODE (i.e., fluid) approximation for the optimally controlled Markov chain. This fluid approximation also yields an asymptotically optimal open loop policy. Finally, we evaluate the performance of the deterministic policy over finite networks. Numerical results show that this policy performs close to the optimal closed loop policy.

Foot-mounted INS for everybody - an open-source embedded implementation

We present an open-source, realtime, embedded implementation of a foot-mounted, zero-velocity-update-aided inertial navigation system. The implementation includes both hardware design and software, uses off-the-shelf components and assembly methods, and features a standard USB interface. The software is written in C and can easily be modified to run user implemented algorithms. The hardware design and the software are released under permissive open-source licenses and production files, source code, documentation, and further resources are available at www.openshoe.org. The reproduction cost for a single unit is below $800, with the inertial measurement unit making up the bulk ($700). The form factor of the implementation is small enough for it to be integrated in the sole of a shoe. A performance evaluation of the system shows a position errors for short trajectories (<;100 [m]) of ± 0.2-1% of the traveled distance, depending on the shape of trajectory.

A THREE-WHEELED MOBILE ROBOT FOR TRAVERSING UNEVEN TERRAIN WITHOUT SLIP: SIMULATION AND EXPERIMENTS

A wheeled mobile robot (WMR) can move on uneven terrains without slip if the wheels are allowed to tilt laterally. This paper deals with the analysis, design and experimentations with a WMR where the wheels can tilt laterally. The wheels of such a WMR must be equipped with two degrees of freedom suspension mechanism. A prototype three-wheeled mobile robot is fabricated with a two degree-of-freedom suspension mechanism. Simulations show that the three-wheeled mobile robot can traverse uneven terrains with very little slip and experiments with the prototype on a representative uneven terrain confirm that the slip is significantly reduced.

Computational fluid dynamics simulation of open ended thermoacoustic prime mover with straight and tapered resonator

A thermoacoustic refrigerator driven by a thermoacoustic primemover is an effective way to produce durable and long lasting refrigeration due to high reliability, no exotic materials, and no moving parts. Resonator geometry is also one of the important factors that influence the performance of a thermoacoustic prime mover, namely, frequency. Computational fluid dynamics simulation of performance comparison of thermoacoustic prime mover with a straight and tapered resonator is chosen for the present study under an identical stack condition with the air as a working fluid. The frequency and pressure amplitude of oscillations obtained from simulation results were found to be more in the tapered resonator than the straight resonator. Apart from computational fluid dynamics simulation, the simulation studies have also been conducted using design environment for low-amplitude thermoacoustic energy conversion, which predicts the performance of thermoacoustic primemover comparatively well. Simulation results from computational fluid dynamics and design environment for low-amplitude thermoacoustic energy conversion were compared and found to be matching well, representing the good validity of computational fluid dynamics modeling.

Advances in base- and mobile-station aided cooperative wireless communications : An overview

In recent years, there has been an upsurge of research interest in cooperative wireless communications in both academia and industry. This article presents a simple overview of the pivotal topics in both mobile station (MS)- and base station (BS)- assisted cooperation in the context of cellular radio systems. Owing to the ever-increasing amount of literature in this particular field, this article is by no means exhaustive, but is intended to serve as a roadmap by assembling a representative sample of recent results and to stimulate further research. The emphasis is initially on relay-base cooperation, relying on network coding, followed by the design of cross-layer cooperative protocols conceived for MS cooperation and the concept of coalition network element (CNE)-assisted BS cooperation. Then, a range of complexity and backhaul traffic reduction techniques that have been proposed for BS cooperation are reviewed. A more detailed discussion is provided in the context of MS cooperation concerning the pros and cons of dispensing with high-complexity, power-hungry channel estimation. Finally, generalized design guidelines, conceived for cooperative wireless communications, are presented.

A nine-level inverter topology for medium-voltage induction motor drive with open-end stator winding

A new scheme for nine-level voltage space-vector generation for medium-voltage induction motor (IM) drives with open-end stator winding is presented in this paper. The proposed nine-level power converter topology consists of two conventional three-phase two-level voltage source inverters powered by isolated dc sources and six floating-capacitor-connected H-bridges. The H-bridge capacitor voltages are effectively maintained at the required asymmetrical levels by employing a space vector modulation (SVPWM) based control strategy. An interesting feature of this topology is its ability to function in five-or three-level mode, in the entire modulation range, at full-power rating, in the event of any failure in the H-bridges. This feature significantly improves the reliability of the proposed drive system. Each leg of the three-phase two-level inverters used in this topology switches only for a half cycle of the reference voltage waveform. Hence, the effective switching frequency is reduced by half, resulting in switching loss reduction in high-voltage devices. The transient as well as the steady-state performance of the proposed nine-level inverter-fed IM drive system is experimentally verified in the entire modulation range including the overmodulation region.

Mobile agent based node monitoring protocol for MANETs

Mobile ad-hoc network is a wireless ad-hoc network with dynamic network topology. The Dynamicity, due to the random node movement, and scarcity of resources lead to a challenge in monitoring the nodes in a MANET. Monitoring the lack of resources (bandwidth, buffer, and energy), misbehavior, and mobility at node level remains, a challenge. In a MANET the proposed protocol uses both static as well as mobile agents, where the mobile agents migrate to different clusters of the zones respectively, collect the node status information periodically, and provide a high level information to the static agent (which resides at the central node) by analyzing the raw information at the nodes. This, in turn, reduces the network traffic and conserves the workload of the central node, where a static agent is available with high level information and in coordination with other modules. The protocol has been tested in different size MANETs with variable number of nodes and applications. The results shown in the simulation indicates the effectiveness of the protocol.