A peer-peer particle swarm optimizer

Particle Swarm Optimization is a parallel algorithm that spawns particles across a search space searching for an optimized solution. Though inherently parallel, they have distinct synchronizations points which stumbles attempts to create completely distributed versions of it. In this paper, we attempt to create a completely distributed peer-peer particle swarm optimization in a cluster of heterogeneous nodes. Since, the original algorithm requires explicit synchronization points we modified the algorithm in multiple ways to support a peer-peer system of nodes. We also modify certain aspect of the basic PSO algorithm and show how certain numerical problems can take advantage of the same thereby yielding fast convergence.

Yanai waves in the western equatorial Indian Ocean

Observations and models have shown the presence of intraseasonal fluctuations in 20-30-day and 10-20-day bands in the equatorial Indian Ocean west of 60 degrees E (WEIO). Their spatial and temporal structures characterize them as Yanai waves, which we label low-frequency (LFYW) and high-frequency (HFYW) Yanai waves, respectively. We explore the dynamics of these intraseasonal signals, using an ocean general circulation model (Modular Ocean Model) and a linear, continuously stratified model. Yanai waves are forced by the meridional wind tau(y) everywhere in the WEIO most strongly during the monsoon seasons. They are forced both directly in the interior ocean and by reflection of the interior response from the western boundary; interference between the interior and boundary responses results in a complex surface pattern that propagates eastward and has nodes. Yanai waves are also forced by instabilities primarily during June/July in a region offshore from the western boundary (52-55 degrees E). At that time, eddies, generated by barotropic instability of the Southern Gyre, are advected southward to the equator. There, they generate a westward-propagating, cross-equatorial flow field, v(eq), with a wave number/frequency spectrum that fits the dispersion relation of a number of Yanai waves, and these waves are efficiently excited. Typically, Yanai waves associated with several baroclinic modes are excited by both wind and eddy forcing; and typically, they superpose to create beams that carry energy vertically and eastward along ray paths. The same processes generate LFYWs and HFYWs, and hence, their responses are similar; differences are traceable to the property that HFYWs have longer wavelengths than LFYWs for each baroclinic mode.

Origin of enhanced photocatalytic activity and photoconduction in high aspect ratio ZnO nanorods

Faceted ZnO nanorods with different aspect ratios were synthesized by a solvothermal method by tuning the reaction time. Increased reaction leads to the formation of high aspect ratio ZnO nanorods largely bound by the prism planes. The high aspect ratio rods showed significantly higher visible light photocatalytic activity when compared to the lower aspect ratio structures. It is proposed that the higher activity is due to better charge separation in the elongated 1D structure. In addition, the fraction of unsaturated Zn2+ sites is higher on the {10 (1) over bar0} facets, leading to better adsorption of oxygen-containing species. These species enhance the production of reactive radicals that are responsible for photodegradation. The photocurrent for these ZnO nanostructures under solar light was measured and a direct correlation between photocurrent and aspect ratio was observed. Since the underlying mechanisms for photodegradation and photocurrent generation are directly related to the efficiency of electron-hole creation and separation, this observation corroborates that the charge separation processes are indeed enhanced in the high aspect ratio structures. The efficiency of photoconduction (electron-hole pair separation) could be further improved by attaching Au nanoparticles on ZnO, which can act as a sink for the electrons. This heterostructure exhibits a high chemisorption of oxygen, which facilitates the production of highly reactive radicals contributing to the high photoreactivity. The suggested mechanisms are applicable to other n-type semiconductor nanostructures with important implications for applications relating to energy and the environment.

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.

Preliminary study of the effects of carbon nanotubes on Cpu cooling

Managing heat produced by computer processors is an important issue today, especially when the size of processors is decreasing rapidly while the number of transistors in the processor is increasing rapidly. This poster describes a preliminary study of the process of adding carbon nanotubes (CNTs) to a standard silicon paste covering a CPU. Measurements were made in two rounds of tests to compare the rate of cool-down with and without CNTs present. The silicon paste acts as an interface between the CPU and the heat sink, increasing the heat transfer rate away from the CPU. To the silicon paste was added 0.05% by weight of CNTs. These were not aligned. A series of K-type thermocouples was used to measure the temperature as a function of time in the vicinity of the CPU, following its shut-off. An Omega data acquisition system was attached to the thermocouples. The CPU temperature was not measured directly because attachment of a thermocouple would have prevented its automatic shut-off A thermocouple in the paste containing the CNTs actually reached a higher temperature than the standard paste, an effect easily explained. But the rate of cooling with the CNTs was about 4.55% better.

Dynamics of the Indian-Ocean oxygen minimum zones

In the Indian Ocean, mid-depth oxygen minimum zones (OMZs) occur in the Arabian Sea and the Bay of Bengal. The lower part of the Arabian-Sea OMZ (ASOMZ; below 400 m) intensifies northward across the basin; in contrast, its upper part (above 400 m) is located in the central/eastern basin, well east of the most productive regions along the western boundary. The Bay-of-Bengal OMZ (BBOMZ), although strong, is weaker than the ASOMZ. To investigate the processes that maintain the Indian-Ocean OMZs, we obtain a suite of solutions to a coupled biological/physical model. Its physical component is a variable-density, 6 1/2-layer model, in which each layer corresponds to a distinct dynamical regime or water-mass type. Its biological component has six compartments: nutrients, phytoplankton, zooplankton, two size classes of detritus, and oxygen. Because the model grid is non-eddy resolving (0.5 degrees), the biological model also includes a parameterization of enhanced mixing based on the eddy kinetic energy derived from satellite observations. To explore further the impact of local processes on OMZs, we also obtain analytic solutions to a one-dimensional, simplified version of the biological model. Our control run is able to simulate basic features of the oxygen, nutrient, and phytoplankton fields throughout the Indian Ocean. The model OMZs result from a balance, or lack thereof, between a sink of oxygen by remineralization and subsurface oxygen sources due primarily to northward spreading of oxygenated water from the Southern Hemisphere, with a contribution from Persian-Gulf water in the northern Arabian Sea. The northward intensification of the lower ASOMZ results mostly from horizontal mixing since advection is weak in its depth range. The eastward shift of the upper ASOMZ is due primarily to enhanced advection and vertical eddy mixing in the western Arabian Sea, which spread oxygenated waters both horizontally and vertically. Advection carries small detritus from the western boundary into the central/eastern Arabian Sea, where it provides an additional source of remineralization that drives the ASOMZ to suboxic levels. The model BBOMZ is weaker than the ASOMZ because the Bay lacks a remote source of detritus from the western boundary. Although detritus has a prominent annual cycle, the model OMZs do not because there is not enough time for significant remineralization to occur.

Codes with local regeneration

Regenerating codes and codes with locality are schemes recently proposed for a distributed storage network. While regenerating codes minimize the data downloaded for node repair, codes with locality minimize the number of nodes accessed during repair. In this paper, we provide some constructions of codes with locality, in which the local codes are regenerating codes, thereby combining the advantages of both classes of codes. The proposed constructions achieve an upper bound on minimum distance and are hence optimal. The constructions include both the cases when the local regenerating codes correspond to the MSR point as well as the MBR point on the storage repair-bandwidth tradeoff curve.

Design and Analysis of an Acknowledgment-Aware Asynchronous MPR MAC Protocol for Distributed WLANs

Multi-packet reception (MPR) promises significant throughput gains in wireless local area networks (WLANs) by allowing nodes to transmit even in the presence of ongoing transmissions in the medium. However, the medium access control (MAC) layer must now be redesigned to facilitate rather than discourage - these overlapping transmissions. We investigate asynchronous MPR MAC protocols, which successfully accomplish this by controlling the node behavior based on the number of ongoing transmissions in the channel. The protocols use the backoff timer mechanism of the distributed coordination function, which makes them practically appealing. We first highlight a unique problem of acknowledgment delays, which arises in asynchronous MPR, and investigate a solution that modifies the medium access rules to reduce these delays and increase system throughput in the single receiver scenario. We develop a general renewal-theoretic fixed-point analysis that leads to expressions for the saturation throughput, packet dropping probability, and average head-of-line packet delay. We also model and analyze the practical scenario in which nodes may incorrectly estimate the number of ongoing transmissions.

Physical Layer Network Coding for the K-User Multiple Access Relay Channel

We propose a Physical layer Network Coding (PNC) scheme for the K-user wireless Multiple Access Relay Channel, in which K source nodes want to transmit messages to a destination node D with the help of a relay node R. The proposed scheme involves (i) Phase 1 during which the source nodes alone transmit and (ii) Phase 2 during which the source nodes and the relay node transmit. At the end of Phase 1, the relay node decodes the messages of the source nodes and during Phase 2 transmits a many-to-one function of the decoded messages. To counter the error propagation from the relay node, we propose a novel decoder which takes into account the possibility of error events at R. It is shown that if certain parameters are chosen properly and if the network coding map used at R forms a Latin Hypercube, the proposed decoder offers the maximum diversity order of two. Also, it is shown that for a proper choice of the parameters, the proposed decoder admits fast decoding, with the same decoding complexity order as that of the reference scheme based on Complex Field Network Coding (CFNC). Simulation results indicate that the proposed PNC scheme offers a large gain over the CFNC scheme.

Interplay Between Optimal Selection Scheme, Selection Criterion, and Discrete Rate Adaptation in Opportunistic Wireless Systems

An opportunistic, rate-adaptive system exploits multi-user diversity by selecting the best node, which has the highest channel power gain, and adapting the data rate to selected node's channel gain. Since channel knowledge is local to a node, we propose using a distributed, low-feedback timer backoff scheme to select the best node. It uses a mapping that maps the channel gain, or, in general, a real-valued metric, to a timer value. The mapping is such that timers of nodes with higher metrics expire earlier. Our goal is to maximize the system throughput when rate adaptation is discrete, as is the case in practice. To improve throughput, we use a pragmatic selection policy, in which even a node other than the best node can be selected. We derive several novel, insightful results about the optimal mapping and develop an algorithm to compute it. These results bring out the inter-relationship between the discrete rate adaptation rule, optimal mapping, and selection policy. We also extensively benchmark the performance of the optimal mapping with several timer and opportunistic multiple access schemes considered in the literature, and demonstrate that the developed scheme is effective in many regimes of interest.

Wireless Network Coding for MIMO Two-Way Relaying

The design of modulation schemes for the physical layer network-coded two-way MIMO relaying scenario is considered, with the denoise-and-forward protocol which employs two phases: Multiple Access phase and Broadcast phase. It is shown that for MIMO two-way relaying, the minimum distance of the effective constellation at the relay becomes zero when all the rows of the channel fade coefficient matrix belong to a finite number of vector subspaces referred to as the singular fade subspaces. The singular fade subspaces can be classified into two kinds based on whether their harmful effects can be removed or not: (i) the removable and (ii) the non-removable singular fade subspaces. It is shown that network coding maps obtained by the completion of appropriate partially filled Latin Rectangles can remove the harmful effects of all the removable singular fade subspaces. For 2(lambda)-PSK signal set, the removable and non-removable singular fade subspaces are characterized and, it is shown that the number of non-removable singular fade subspaces is a small fraction of the total number of singular fade subspaces and this fraction tends to zero as the constellation size tends to infinity. The Latin Rectangles for the case when the end nodes use different number of antennas are shown to be obtainable from the Latin Squares for the case when they use the same number of antennas. Also, the network coding maps which remove all the removable singular singular fade subspaces are shown to be obtainable from a small set of Latin Squares. The removal of all the singular fade subspaces by properly choosing the network coding map, provides a gain of 5.5 dB over the conventional Exclusive-OR network coding, in a Rayleigh fading scenario with 2 antennas at the end nodes and one antenna at the relay node, for 4-PSK signal set.

Forming Networks of Strategic Agents with Desired Topologies

Many networks such as social networks and organizational networks in global companies consist of self-interested agents. The topology of these networks often plays a crucial role in important tasks such as information diffusion and information extraction. Consequently, growing a stable network having a certain topology is of interest. Motivated by this, we study the following important problem: given a certain desired network topology, under what conditions would best response (link addition/deletion) strategies played by self-interested agents lead to formation of a stable network having that topology. We study this interesting reverse engineering problem by proposing a natural model of recursive network formation and a utility model that captures many key features. Based on this model, we analyze relevant network topologies and derive a set of sufficient conditions under which these topologies emerge as pairwise stable networks, wherein no node wants to delete any of its links and no two nodes would want to create a link between them.

Scalable Preference Aggregation in Social Networks

In social choice theory, preference aggregation refers to computing an aggregate preference over a set of alternatives given individual preferences of all the agents. In real-world scenarios, it may not be feasible to gather preferences from all the agents. Moreover, determining the aggregate preference is computationally intensive. In this paper, we show that the aggregate preference of the agents in a social network can be computed efficiently and with sufficient accuracy using preferences elicited from a small subset of critical nodes in the network. Our methodology uses a model developed based on real-world data obtained using a survey on human subjects, and exploits network structure and homophily of relationships. Our approach guarantees good performance for aggregation rules that satisfy a property which we call expected weak insensitivity. We demonstrate empirically that many practically relevant aggregation rules satisfy this property. We also show that two natural objective functions in this context satisfy certain properties, which makes our methodology attractive for scalable preference aggregation over large scale social networks. We conclude that our approach is superior to random polling while aggregating preferences related to individualistic metrics, whereas random polling is acceptable in the case of social metrics.

Closed-form solutions for non-uniform Euler-Bernoulli free-free beams

In this paper, the free vibration of a non-uniform free-free Euler-Bernoulli beam is studied using an inverse problem approach. It is found that the fourth-order governing differential equation for such beams possess a fundamental closed-form solution for certain polynomial variations of the mass and stiffness. An infinite number of non-uniform free-free beams exist, with different mass and stiffness variations, but sharing the same fundamental frequency. A detailed study is conducted for linear, quadratic and cubic variations of mass, and on how to pre-select the internal nodes such that the closed-form solutions exist for the three cases. A special case is also considered where, at the internal nodes, external elastic constraints are present. The derived results are provided as benchmark solutions for the validation of non-uniform free-free beam numerical codes. (C) 2013 Elsevier Ltd. All rights reserved.

Transmit Power Control Policies for Energy Harvesting Sensors With Retransmissions

This paper addresses the problem of finding outage-optimal power control policies for wireless energy harvesting sensor (EHS) nodes with automatic repeat request (ARQ)-based packet transmissions. The power control policy of the EHS specifies the transmission power for each packet transmission attempt, based on all the information available at the EHS. In particular, the acknowledgement (ACK) or negative acknowledgement (NACK) messages received provide the EHS with partial information about the channel state. We solve the problem of finding an optimal power control policy by casting it as a partially observable Markov decision process (POMDP). We study the structure of the optimal power policy in two ways. First, for the special case of binary power levels at the EHS, we show that the optimal policy for the underlying Markov decision process (MDP) when the channel state is observable is a threshold policy in the battery state. Second, we benchmark the performance of the EHS by rigorously analyzing the outage probability of a general fixed-power transmission scheme, where the EHS uses a predetermined power level at each slot within the frame. Monte Carlo simulation results illustrate the performance of the POMDP approach and verify the accuracy of the analysis. They also show that the POMDP solutions can significantly outperform conventional ad hoc approaches.