Robust, metallic Pd17Se15 and Pd7Se4 phases from a single source precursor and their use as counter electrodes in dye sensitized solar cells

Thin films of conducting palladium selenide phases (Pd17Se15 and Pd7Se4) are prepared using a single source molecular precursor by thermolysis. Varying the mole ratios of palladium and selenium precursors results in palladium organo-selenolate complexes which on thermolysis at different temperatures yield Pd17Se15 and Pd7Se4 phases that are very stable and adherent to the substrate. The organo-selenolate complexes are characterized using small angle XRD, Se-77 NMR and thermogravimetric analysis (TGA). The palladium selenide films are characterized by various techniques such as XRD, XPS, TEM and SEM. Electrical conductivities of the films are determined using the four probe method. The strong adherence of the films to glass substrates coupled with high corrosion resistant behavior towards strong acid and alkaline environments render them to be very effective as electrocatalysts. The catalytic activity towards the I-3(-)/I- redox couple, which is an important reaction in the regeneration of the dye in a dye-sensitized solar cell, is studied. Between the two phases, the Pd17Se15 film shows superior activity as the counter electrode for dye sensitized solar cells with a photocurrent conversion efficiency of 7.45%.

Accelerating Information Diffusion in Social Networks Under the Susceptible-Infected-Susceptible Epidemic Model

Standard Susceptible-Infected-Susceptible (SIS) epidemic models assume that a message spreads from the infected to the susceptible nodes due to only susceptible-infected epidemic contact. We modify the standard SIS epidemic model to include direct recruitment of susceptible individuals to the infected class at a constant rate (independent of epidemic contacts), to accelerate information spreading in a social network. Such recruitment can be carried out by placing advertisements in the media. We provide a closed form analytical solution for system evolution in the proposed model and use it to study campaigning in two different scenarios. In the first, the net cost function is a linear combination of the reward due to extent of information diffusion and the cost due to application of control. In the second, the campaign budget is fixed. Results reveal the effectiveness of the proposed system in accelerating and improving the extent of information diffusion. Our work is useful for devising effective strategies for product marketing and political/social-awareness/crowd-funding campaigns that target individuals in a social network.

Performance of New Dynamic Benefit-Weighted Scheduling Scheme in DiffServ Networks

In this paper, we design a new dynamic packet scheduling scheme suitable for differentiated service (DiffServ) network. Designed dynamic benefit weighted scheduling (DBWS) uses a dynamic weighted computation scheme loosely based on weighted round robin (WRR) policy. It predicts the weight required by expedited forwarding (EF) service for the current time slot (t) based on two criteria; (i) previous weight allocated to it at time (t-1), and (ii) the average increase in the queue length of EF buffer. This prediction provides smooth bandwidth allocation to all the services by avoiding overbooking of resources for EF service and still providing guaranteed services for it. The performance is analyzed for various scenarios at high, medium and low traffic conditions. The results show that packet loss is minimized, end to end delay is minimized and jitter is reduced and therefore meet quality of service (QoS) requirement of a network.

QoS Aware Trust Metric based Framework for Wireless Sensor Networks

Wireless Sensor Networks have gained popularity due to their real time applications and low-cost nature. These networks provide solutions to scenarios that are critical, complicated and sensitive like military fields, habitat monitoring, and disaster management. The nodes in wireless sensor networks are highly resource constrained. Routing protocols are designed to make efficient utilization of the available resources in communicating a message from source to destination. In addition to the resource management, the trustworthiness of neighboring nodes or forwarding nodes and the energy level of the nodes to keep the network alive for longer duration is to be considered. This paper proposes a QoS Aware Trust Metric based Framework for Wireless Sensor Networks. The proposed framework safeguards a wireless sensor network from intruders by considering the trustworthiness of the forwarder node at every stage of multi-hop routing. Increases network lifetime by considering the energy level of the node, prevents the adversary from tracing the route from source to destination by providing path variation. The framework is built on NS2 Simulator. Experimental results show that the framework provides energy balance through establishment of trustworthy paths from the source to the destination. (C) 2015 The Authors. Published by Elsevier B.V.

A Perspective to Adopt Continuous Dynamic Cognition for Malicious Node Detection in Heterogeneous Networks

The current day networks use Proactive networks for adaption to the dynamic scenarios. The use of cognition technique based on the Observe, Orient, Decide and Act loop (OODA) is proposed to construct proactive networks. The network performance degradation in knowledge acquisition and malicious node presence is a problem that exists. The use of continuous time dynamic neural network is considered to achieve cognition. The variance in service rates of user nodes is used to detect malicious activity in heterogeneous networks. The improved malicious node detection rates are proved through the experimental results presented in this paper. (C) 2015 The Authors. Published by Elsevier B.V.

The two-component signalling networks of Mycobacterium tuberculosis display extensive cross-talk in vitro

Two-component systems (TCSs), which contain paired sensor kinase and response regulator proteins, form the primary apparatus for sensing and responding to environmental cues in bacteria. TCSs are thought to be highly specific, displaying minimal cross-talk, primarily due to the co-evolution of the participating proteins. To assess the level of cross-talk between the TCSs of Mycobacterium tuberculosis, we mapped the complete interactome of the M. tuberculosis TCSs using phosphotransfer profiling. Surprisingly, we found extensive crosstalk among the M. tuberculosis TCSs, significantly more than that in the TCSs in Escherichia coli or Caulobacter crescentus, thereby offering an alternate to specificity paradigm in TCS signalling. Nearly half of the interactions we detected were significant novel cross-interactions, unravelling a potentially complex signalling landscape. We classified the TCSs into specific `one-to-one' and promiscuous `one-to-many' and `many-to-one' circuits. Using mathematical modelling, we deduced that the promiscuous signalling observed can explain several currently confounding observations about M. tuberculosis TCSs. Our findings suggest an alternative paradigm of bacterial signalling with significant cross-talk between TCSs yielding potentially complex signalling landscapes.

QEP Based Solution for Power Allocation in Amplify and Forward Networks

The problem of cooperative beamforming for maximizing the achievable data rate of an energy constrained two-hop amplify-and-forward (AF) network is considered. Assuming perfect channel state information (CSI) of all the nodes, we evaluate the optimal scaling factor for the relay nodes. Along with individual power constraint on each of the relay nodes, we consider a weighted sum power constraint. The proposed iterative algorithm initially solves a set of relaxed problems with weighted sum power constraint and then updates the solution to accommodate individual constraints. These relaxed problems in turn are solved using a sequence of Quadratic Eigenvalue Problems (QEP). The key contribution of this letter is the generalization of cooperative beamforming to incorporate both the individual and weighted sum constraint. Furthermore, we have proposed a novel algorithm based on Quadratic Eigenvalue Problem (QEP) and discussed its convergence.

QoS Constrained Optimal Sink and Relay Placement in Planned Wireless Sensor Networks

We are given a set of sensors at given locations, a set of potential locations for placing base stations (BSs, or sinks), and another set of potential locations for placing wireless relay nodes. There is a cost for placing a BS and a cost for placing a relay. The problem we consider is to select a set of BS locations, a set of relay locations, and an association of sensor nodes with the selected BS locations, so that the number of hops in the path from each sensor to its BS is bounded by h(max), and among all such feasible networks, the cost of the selected network is the minimum. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard, and is hard to even approximate within a constant factor. For this problem, we propose a polynomial time approximation algorithm (SmartSelect) based on a relay placement algorithm proposed in our earlier work, along with a modification of the greedy algorithm for weighted set cover. We have analyzed the worst case approximation guarantee for this algorithm. We have also proposed a polynomial time heuristic to improve upon the solution provided by SmartSelect. Our numerical results demonstrate that the algorithms provide good quality solutions using very little computation time in various randomly generated network scenarios.

Secure Communication in Amplify-and-Forward Networks with Multiple Eavesdroppers: Decoding with SNR Thresholds

The problem of secure unicast communication over a two hop Amplify-and-Forward wireless relay network with multiple eavesdroppers is considered. Assuming that a receiver (destination or eavesdropper) can decode a message only if the received SNR is above a predefined threshold, we consider this problem in two scenarios. In the first scenario, we maximize the SNR at the legitimate destination, subject to the condition that the received SNR at each eavesdropper is below the target threshold. Due to the non-convex nature of the objective function and eavesdroppers' constraints, we transform variables and obtain a quadratically constrained quadratic program (QCQP) with convex constraints, which can be solved efficiently. When the constraints are not convex, we consider a semidefinite relaxation (SDR) to obtain computationally efficient approximate solution. In the second scenario, we minimize the total power consumed by all relay nodes, subject to the condition that the received SNR at the legitimate destination is above the threshold and at every eavesdropper, it is below the corresponding threshold. We propose a semidefinite relaxation of the problem in this scenario and also provide an analytical lower bound.

A fast and accurate performance analysis of beaconless IEEE 802.15.4 multi-hop networks

We develop an approximate analytical technique for evaluating the performance of multi-hop networks based on beaconless IEEE 802.15.4 ( the ``ZigBee'' PHY and MAC), a popular standard for wireless sensor networks. The network comprises sensor nodes, which generate measurement packets, relay nodes which only forward packets, and a data sink (base station). We consider a detailed stochastic process at each node, and analyse this process taking into account the interaction with neighbouring nodes via certain time averaged unknown variables (e.g., channel sensing rates, collision probabilities, etc.). By coupling the analyses at various nodes, we obtain fixed point equations that can be solved numerically to obtain the unknown variables, thereby yielding approximations of time average performance measures, such as packet discard probabilities and average queueing delays. The model incorporates packet generation at the sensor nodes and queues at the sensor nodes and relay nodes. We demonstrate the accuracy of our model by an extensive comparison with simulations. As an additional assessment of the accuracy of the model, we utilize it in an algorithm for sensor network design with quality-of-service (QoS) objectives, and show that designs obtained using our model actually satisfy the QoS constraints (as validated by simulating the networks), and the predictions are accurate to well within 10% as compared to the simulation results in a regime where the packet discard probability is low. (C) 2015 Elsevier B.V. All rights reserved.

Autoregressive cascades on random networks

A network cascade model that captures many real-life correlated node failures in large networks via load redistribution is studied. The considered model is well suited for networks where physical quantities are transmitted, e.g., studying large scale outages in electrical power grids, gridlocks in road networks, and connectivity breakdown in communication networks, etc. For this model, a phase transition is established, i.e., existence of critical thresholds above or below which a small number of node failures lead to a global cascade of network failures or not. Theoretical bounds are obtained for the phase transition on the critical capacity parameter that determines the threshold above and below which cascade appears or disappears, respectively, that are shown to closely follow numerical simulation results. (C) 2015 Elsevier B.V. All rights reserved.

Autoregressive cascades on random networks

A network cascade model that captures many real-life correlated node failures in large networks via load redistribution is studied. The considered model is well suited for networks where physical quantities are transmitted, e.g., studying large scale outages in electrical power grids, gridlocks in road networks, and connectivity breakdown in communication networks, etc. For this model, a phase transition is established, i.e., existence of critical thresholds above or below which a small number of node failures lead to a global cascade of network failures or not. Theoretical bounds are obtained for the phase transition on the critical capacity parameter that determines the threshold above and below which cascade appears or disappears, respectively, that are shown to closely follow numerical simulation results. (C) 2015 Elsevier B.V. All rights reserved.

Complex patterns arise through spontaneous symmetry breaking in dense homogeneous networks of neural oscillators

There has been much interest in understanding collective dynamics in networks of brain regions due to their role in behavior and cognitive function. Here we show that a simple, homogeneous system of densely connected oscillators, representing the aggregate activity of local brain regions, can exhibit a rich variety of dynamical patterns emerging via spontaneous breaking of permutation or translational symmetries. Upon removing just a few connections, we observe a striking departure from the mean-field limit in terms of the collective dynamics, which implies that the sparsity of these networks may have very important consequences. Our results suggest that the origins of some of the complicated activity patterns seen in the brain may be understood even with simple connection topologies.

Campaigning in Heterogeneous Social Networks: Optimal Control of SI Information Epidemics

We study the optimal control problem of maximizing the spread of an information epidemic on a social network. Information propagation is modeled as a susceptible-infected (SI) process, and the campaign budget is fixed. Direct recruitment and word-of-mouth incentives are the two strategies to accelerate information spreading (controls). We allow for multiple controls depending on the degree of the nodes/individuals. The solution optimally allocates the scarce resource over the campaign duration and the degree class groups. We study the impact of the degree distribution of the network on the controls and present results for Erdos-Renyi and scale-free networks. Results show that more resource is allocated to high-degree nodes in the case of scale-free networks, but medium-degree nodes in the case of Erdos-Renyi networks. We study the effects of various model parameters on the optimal strategy and quantify the improvement offered by the optimal strategy over the static and bang-bang control strategies. The effect of the time-varying spreading rate on the controls is explored as the interest level of the population in the subject of the campaign may change over time. We show the existence of a solution to the formulated optimal control problem, which has nonlinear isoperimetric constraints, using novel techniques that is general and can be used in other similar optimal control problems. This work may be of interest to political, social awareness, or crowdfunding campaigners and product marketing managers, and with some modifications may be used for mitigating biological epidemics.

Stabilization of Cu-7 clusters in azide networks: syntheses, structures and magnetic behaviour

Two new azide bridged copper(II) coordination polymer compounds, Cu-7(N-3)(14)(C3H10N2)(C4H13N3)]n (I) and Cu-7(N-3)(14)(C3H10N2)(C5H15N3)(2)](n) (II) where C3H10N2 = 1,2-diaminopropane (1,2-DAP); C4H13N3 = di-ethylenetriamine (DETA); C5H15N3 = N-2-aminoethyl-1,3-propanediamine (AEDAP)] were prepared by employing a room temperature diffusion technique involving three layers. Single crystal studies reveal that both compounds I and II, have similar connectivity forming Cu7 clusters through end-on (EO) bonding of the azide. The Cu-7 clusters are connected through end-to-end (EE) connectivity of the azides forming three-dimensional structures. Magnetic studies confirmed the ferromagnetic interactions within the Cu-7 units and revealed the occurrence of concomitant ferro- and antiferro-magnetic interactions between these clusters. As a result I behaves as a weak-ferromagnet with T-C = 10 K.