Thermal Management of Electronics Using PCM-Based Heat Sink Subjected to Cyclic Heat Load

Designing a heat sink based on a phase change material (PCM) under cyclic loading is a critical issue. For cyclic operation, it is required that the fraction of the PCM melting during the heating cycle should completely resolidify during the cooling period, so that that thermal storage unit can be operated for an unlimited number of cycles. Accordingly, studies are carried out to find the parameters influencing the behavior of a PCM under cyclic loading. A number of parameters are identified in the process, the most important ones being the duty cycle and heat transfer coefficient (h) for cooling. The required h or the required cooling period for complete resolidification for infinite cyclic operation of a conventional PCM-based heat sink is found to be very high and unrealistic with air cooling from the surface. To overcome this problem, the conventional design is modified where h and the area exposed to heat transfer can be independently controlled. With this arrangement, the enhanced area provided for cooling keeps h within realistic limits. Analytical investigation is carried out to evaluate the thermal performance of this modified PCM-based heat sink in comparison to those with conventional designs. Experiments are also performed on both the conventional and the modified PCM-based heat sinks to validate the new findings.

Real-time monitoring of critical nodes with minimal number of Phasor Measurement Units

This paper presents a method for placement of Phasor Measurement Units, ensuring the monitoring of vulnerable buses which are obtained based on transient stability analysis of the overall system. Real-time monitoring of phase angles across different nodes, which indicates the proximity to instability, the very purpose will be well defined if the PMUs are placed at buses which are more vulnerable. The issue is to identify the key buses where the PMUs should be placed when the transient stability prediction is taken into account considering various disturbances. Integer Linear Programming technique with equality and inequality constraints is used to find out the optimal placement set with key buses identified from transient stability analysis. Results on IEEE-14 bus system are presented to illustrate the proposed approach.

Potential for increasing carbon sink in Himachal Pradesh, India

In this study, the potential for increasing the tree cover and thereby the biomass and carbon as a mitigation option of three categories of wastelands, irrespective of their tenure, are considered. The area under wastelands in Himachal Pradesh, according to NRSA (2005), is estimated to be 2.83 Mha. Among the 28 categories of wastelands reported by NRSA, only 15 categories exist in Himachal Pradesh. In the present study, three land categories are considered for estimating the mitigation potential. They include: (i) Degraded forestland, (ii) Degraded community land and (iii) Degraded and abandoned private land. Choice of species or the mix of species to be planted on the three land categories considered for reforestation is discussed. Carbon pools considered in the present study are those, which account only for aboveground biomass, belowground biomass and soil organic carbon. This study estimates the mitigation potential at the state level considering land available under more than one category. It also provides a roadmap for future work in support of mitigation analysis and implementation.

State Dependent Attempt Rate modeling of single cell IEEE 802.11 WLANs with homogeneous nodes and Poisson packet arrivals

We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol as standardized in the IEEE 802.11 Distributed Coordination Function (DCF). The approximation is that, when n of the M queues are non-empty, the (transmission) attempt probability of each of the n non-empty nodes is given by the long-term (transmission) attempt probability of n saturated nodes. With the arrival of packets into the M queues according to independent Poisson processes, the SDAR approximation reduces a single cell with non-saturated nodes to a Markovian coupled queueing system. We provide a sufficient condition under which the joint queue length Markov chain is positive recurrent. For the symmetric case of equal arrival rates and finite and equal buffers, we develop an iterative method which leads to accurate predictions for important performance measures such as collision probability, throughput and mean packet delay. We replace the MAC layer with the SDAR model of contention by modifying the NS-2 source code pertaining to the MAC layer, keeping all other layers unchanged. By this model-based simulation technique at the MAC layer, we achieve speed-ups (w.r.t. MAC layer operations) up to 5.4. Through extensive model-based simulations and numerical results, we show that the SDAR model is an accurate model for the DCF MAC protocol in single cells. (C) 2012 Elsevier B.V. All rights reserved.

Feedback Overhead-Aware, Distributed, Fast, and Reliable Selection

In a communication system in which K nodes communicate with a central sink node, the following problem of selection often occurs. Each node maintains a preference number called a metric, which is not known to other nodes. The sink node must find the `best' node with the largest metric. The local nature of the metrics requires the selection process to be distributed. Further, the selection needs to be fast in order to increase the fraction of time available for data transmission using the selected node and to handle time-varying environments. While several selection schemes have been proposed in the literature, each has its own shortcomings. We propose a novel, distributed selection scheme that generalizes the best features of the timer scheme, which requires minimal feedback but does not guarantee successful selection, and the splitting scheme, which requires more feedback but guarantees successful selection. The proposed scheme introduces several new ideas into the design of the timer and splitting schemes. It explicitly accounts for feedback overheads and guarantees selection of the best node. We analyze and optimize the performance of the scheme and show that it is scalable, reliable, and fast. We also present new insights about the optimal timer scheme.

Relay Selection for Geographical Forwarding in Sleep-Wake Cycling Wireless Sensor Networks

Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the hop count or total energy. Our approach is to solve, at each forwarding node enroute to the sink, the local forwarding problem of minimizing one-hop waiting delay subject to a lower bound constraint on a suitable reward offered by the next-hop relay; the constraint serves to tune the tradeoff. The reward metric used for the local problem is based on the end-to-end total cost objective (for instance, when the total cost is hop count, we choose to use the progress toward sink made by a relay as the reward). The forwarding node, to begin with, is uncertain about the number of relays, their wake-up times, and the reward values, but knows the probability distributions of these quantities. At each relay wake-up instant, when a relay reveals its reward value, the forwarding node's problem is to forward the packet or to wait for further relays to wake-up. In terms of the operations research literature, our work can be considered as a variant of the asset selling problem. We formulate our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy. Motivated by the computational complexity involved in the policies derived out of these bounds, we formulate an alternate simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the inner and outer bound policies against the simple policy, and also against the optimal policy when the source knows the exact number of relays. Observing the good performance and the ease of implementation of the simple policy, we apply it to our motivating problem, i.e., local geographical routing of sporadic alarm packets in a large WSN. We compare the end-to-end performance (i.e., average total delay and average total cost) obtained by the simple policy, when used for local geographical forwarding, against that obtained by the globally optimal forwarding algorithm proposed by Kim et al. 1].

Queuing theoretic and information theoretic capacity of energy harvesting sensor nodes

Energy harvesting sensor networks provide near perpetual operation and reduce carbon emissions thereby supporting `green communication'. We study such a sensor node powered with an energy harvesting source. We obtain energy management policies that are throughput optimal. We also obtain delay-optimal policies. Next we obtain the Shannon capacity of such a system. Further we combine the information theoretic and queuing theoretic approaches to obtain the Shannon capacity of an energy harvesting sensor node with a data queue. Then we generalize these results to models with fading and energy consumption in activities other than transmission.

Information capacity of energy harvesting sensor nodes

Sensor nodes with energy harvesting sources are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting `green communication'. We study such a sensor node with an energy harvesting source and compare various architectures by which the harvested energy is used. We find its Shannon capacity when it is transmitting its observations over an AWGN channel and show that the capacity achieving energy management policies are related to the throughput optimal policies. We also obtain the capacity when energy conserving sleep-wake modes are supported and an achievable rate for the system with inefficiencies in energy storage.

Optimal design of timer-based, distributed selection with unknown number of nodes

The timer-based selection scheme is a popular, simple, and distributed scheme that is used to select the best node from a set of available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal timer mapping that maximizes the average success probability for the practical scenario in which the number of nodes in the system is unknown but only its probability distribution is known. We show that it has a special discrete structure, and present a recursive characterization to determine it. We benchmark its performance with ad hoc approaches proposed in the literature, and show that it delivers significant gains. New insights about the optimality of some ad hoc approaches are also developed.

Solvent-templated supramolecular isomerism in 2D coordination polymer constructed by (Ni2CoII)-Co-II nodes and dicyanamido spacers: drastic change in magnetic behaviours

Two heterometallic coordination polymers (CPs) have been prepared using (NiL)-L-II](2)Co-II (where H2L = N,N'-bis(salicylidene)-1,3-propanediamine) as nodes and dicyanamido spacers by varying the solvent for synthesis. Structural characterizations revealed that methanol assisted the formation of a two-dimensional (4,4) connected rhombic grid network of (NiL)(2)Co(NCNCN)2](infinity) (1a) whereas relatively less polar acetonitrile afforded a different superstructure {(NiL)(2)Co(NCNCN)(2)]center dot CH3CN}(infinity) (1b) with a two-dimensional (4,4) connected square grid network. The presence of acetonitrile molecules in the structure of 1b seems to change the spatial orientation of the terminal metalloligands NiL] from pseudo-eclipsed in 1a to staggered-like in 1b around the central Co(II). These structural changes in the nodes together with the conformationally flexible dicyanamido spacers, which are cis coordinated to the Co(II) in both trinuclear units, led to the differences in the final 2D network. Variable-temperature magnetic susceptibility measurements revealed that this supramolecular isomerism led to a drastic transition from spin-frustrated antiferromagnetism for 1a to a dominant ferromagnetic behaviour for 1b. The geometrical differences in Ni2Co coordination clusters (CCs) which are scalene triangular in 1a but nearly linear in 1b, are held responsible for the changes of the magnetic properties. The DFT calculations of exchange interactions between metal centres provide a clear evidence of the role played by the fundamental geometrical factors on the nature and magnitude of the magnetic coupling in these pseudo-polymorphic CPs.

Role of melt convection on optimization of PCM-based heat sink under cyclic heat load

In this article, we study the thermal performance of phase-change material (PCM)-based heat sinks under cyclic heat load and subjected to melt convection. Plate fin type heat sinks made of aluminum and filled with PCM are considered in this study. The heat sink is heated from the bottom. For a prescribed value of heat flux, design of such a heat sink can be optimized with respect to its geometry, with the objective of minimizing the temperature rise during heating and ensuring complete solidification of PCM at the end of the cooling period for a given cycle. For given length and base plate thickness of a heat sink, a genetic algorithm (GA)-based optimization is carried out with respect to geometrical variables such as fin thickness, fin height, and the number of fins. The thermal performance of the heat sink for a given set of parameters is evaluated using an enthalpy-based heat transfer model, which provides the necessary data for the optimization algorithm. The effect of melt convection is studied by taking two cases, one without melt convection (conduction regime) and the other with convection. The results show that melt convection alters the results of geometrical optimization.

On the k(1)(-1) scaling in sink-flow turbulent boundary layers

Scaling of the streamwise velocity spectrum phi(11)(k(1)) in the so-called sink-flow turbulent boundary layer is investigated in this work. The present experiments show strong evidence for the k(1)(-1) scaling i.e. phi(11)(k(1)) = Lambda(1)U(tau)(2)k(1)(-1), where k(1)(-1) is the streamwise wavenumber and U-tau is the friction velocity. Interestingly, this k(1)(-1) scaling is observed much farther from the wall and at much lower flow Reynolds number (both differing by almost an order of magnitude) than what the expectations from experiments on a zero-pressure-gradient turbulent boundary layer flow would suggest. Furthermore, the coefficient A(1) in the present sink-flow data is seen to be non-universal, i.e. A(1) varies with height from the wall; the scaling exponent -1 remains universal. Logarithmic variation of the so-called longitudinal structure function, which is the physical-space counterpart of spectral k(1)(-1) scaling, is also seen to be non-universal, consistent with the non-universality of A(1). These observations are to be contrasted with the universal value of A(1) (along with the universal scaling exponent of 1) reported in the literature on zero-pressure-gradient turbulent boundary layers. Theoretical arguments based on dimensional analysis indicate that the presence of a streamwise pressure gradient in sink-flow turbulent boundary layers makes the coefficient A(1) non-universal while leaving the scaling exponent -1 unaffected. This effect of the pressure gradient on the streamwise spectra, as discussed in the present study (experiments as well as theory), is consistent with other recent studies in the literature that are focused on the structural aspects of turbulent boundary layer flows in pressure gradients (Harun etal., J. Flui(d) Mech., vol. 715, 2013, pp. 477-498); the present paper establishes the link between these two. The variability of A(1) accommodated in the present framework serves to clarify the ideas of universality of the k(1)(-1) scaling.

Measurement Based Impromptu Deployment of a Multi-Hop Wireless Relay Network

We study the problem of optimal sequential (''as-you-go'') deployment of wireless relay nodes, as a person walks along a line of random length (with a known distribution). The objective is to create an impromptu multihop wireless network for connecting a packet source to be placed at the end of the line with a sink node located at the starting point, to operate in the light traffic regime. In walking from the sink towards the source, at every step, measurements yield the transmit powers required to establish links to one or more previously placed nodes. Based on these measurements, at every step, a decision is made to place a relay node, the overall system objective being to minimize a linear combination of the expected sum power (or the expected maximum power) required to deliver a packet from the source to the sink node and the expected number of relay nodes deployed. For each of these two objectives, two different relay selection strategies are considered: (i) each relay communicates with the sink via its immediate previous relay, (ii) the communication path can skip some of the deployed relays. With appropriate modeling assumptions, we formulate each of these problems as a Markov decision process (MDP). We provide the optimal policy structures for all these cases, and provide illustrations of the policies and their performance, via numerical results, for some typical parameters.

Network, nodes and nexus: systems approach to multitarget therapeutics

Systems biology is revealing multiple layers of regulatory networks that manifest spatiotemporal variations. Since genes and environment also influence the emergent property of a cell, the biological output requires dynamic understanding of various molecular circuitries. The metabolic networks continually adapt and evolve to cope with the changing milieu of the system, which could also include infection by another organism. Such perturbations of the functional networks can result in disease phenotypes, for instance tuberculosis and cancer. In order to develop effective therapeutics, it is important to determine the disease progression profiles of complex disorders that can reveal dynamic aspects and to develop mutitarget systemic therapies that can help overcome pathway adaptations and redundancy.

Capacity of a Gaussian MAC with energy harvesting transmit nodes

We consider a Gaussian multiple access channel (GMAC) where the users are sensor nodes powered by energy harvesters. The energy harvesters may have finite or infinite buffer to store the harvested energy. First, we find the capacity region of a GMAC powered by transmit nodes with an infinite energy buffer. Next, we consider a GMAC with the transmitting nodes equipped with a finite energy buffer. Initially we assume perfect knowledge of the buffer state information at both the encoders and the decoder. We provide an achievable region for this case. We also generalize the achievable region when only partial information about buffer state is available at both the encoders and the decoder.