Performance metrics in a hybrid MPI-OpenMP based molecular dynamics simulation with short-range interactions

We discuss the computational bottlenecks in molecular dynamics (MD) and describe the challenges in parallelizing the computation-intensive tasks. We present a hybrid algorithm using MPI (Message Passing Interface) with OpenMP threads for parallelizing a generalized MD computation scheme for systems with short range interatomic interactions. The algorithm is discussed in the context of nano-indentation of Chromium films with carbon indenters using the Embedded Atom Method potential for Cr-Cr interaction and the Morse potential for Cr-C interactions. We study the performance of our algorithm for a range of MPI-thread combinations and find the performance to depend strongly on the computational task and load sharing in the multi-core processor. The algorithm scaled poorly with MPI and our hybrid schemes were observed to outperform the pure message passing scheme, despite utilizing the same number of processors or cores in the cluster. Speed-up achieved by our algorithm compared favorably with that achieved by standard MD packages. (C) 2013 Elsevier Inc. All rights reserved.

Strength and fatigue life evaluation of composite laminate with embedded sensors

Prognosis regarding durability of composite structures using various Structural Health Monitoring (SHM) techniques is an important and challenging topic of research. Ultrasonic SHM systems with embedded transducers have potential application here due to their instant monitoring capability, compact packaging potential toward unobtrusiveness and non-invasiveness as compared to non-contact ultrasonic and eddy current techniques which require disassembly of the structure. However, embedded sensors pose a risk to the structure by acting as a flaw thereby reducing life. The present paper focuses on the determination of strength and fatigue life of the composite laminate with embedded film sensors like CNT nanocomposite, PVDF thin films and piezoceramic films. First, the techniques of embedding these sensors in composite laminates is described followed by the determination of static strength and fatigue life at coupon level testing in Universal Testing Machine (UTM). Failure mechanisms of the composite laminate with embedded sensors are studied for static and dynamic loading cases. The coupons are monitored for loading and failure using the embedded sensors. A comparison of the performance of these three types of embedded sensors is made to study their suitability in various applications. These three types of embedded sensors cover a wide variety of applications, and prove to be viable in embedded sensor based SHM of composite structures.

Timer-Based Distributed Node Selection Scheme Exploiting Power Control and Capture

Opportunistic selection in multi-node wireless systems improves system performance by selecting the ``best'' node and by using it for data transmission. In these systems, each node has a real-valued local metric, which is a measure of its ability to improve system performance. Our goal is to identify the best node, which has the largest metric. We propose, analyze, and optimize a new distributed, yet simple, node selection scheme that combines the timer scheme with power control. In it, each node sets a timer and transmit power level as a function of its metric. The power control is designed such that the best node is captured even if. other nodes simultaneously transmit with it. We develop several structural properties about the optimal metric-to-timer-and-power mapping, which maximizes the probability of selecting the best node. These significantly reduce the computational complexity of finding the optimal mapping and yield valuable insights about it. We show that the proposed scheme is scalable and significantly outperforms the conventional timer scheme. We investigate the effect of. and the number of receive power levels. Furthermore, we find that the practical peak power constraint has a negligible impact on the performance of the scheme.

Temperature compensation in CNT-composite distributed strain sensors

A temperature compensation method is proposed for CNT-composite strain sensors. CNT-composite sensors are fabricated on an elastic polymer substrate having known thermo-mechanical properties to introduce thermo-mechanical strain and further calibration of the sensor. Strain is induced on the sensor by bending the substrate as a cantilever configuration. Response of the sensor is measured using a bridge circuit method. Induced strain in the beam is determined using beam theory. The sensors are characterized for different CNT concentrations and at various temperatures. A model based temperature compensation scheme is proposed and verified experimentally. The result proves the ability of CNT-nanocomposite strain sensors to be used under varying temperature applications. A method is proposed to determine the strain and temperature simultaneously. The CNT sensors are simple to fabricate in complex patterns with excellent repeatability and do not require bonding layer.

Algorithm for Autonomous Reorganization of Mobile Wireless Camera Sensor Networks to Improve Coverage

In this paper, sensing coverage by wireless camera-embedded sensor networks (WCSNs), a class of directional sensors is studied. The proposed work facilitates the autonomous tuning of orientation parameters and displacement of camera-sensor nodes in the bounded field of interest (FoI), where the network coverage in terms of every point in the FoI is important. The proposed work is first of its kind to study the problem of maximizing coverage of randomly deployed mobile WCSNs which exploits their mobility. We propose an algorithm uncovered region exploration algorithm (UREA-CS) that can be executed in centralized and distributed modes. Further, the work is extended for two special scenarios: 1) to suit autonomous combing operations after initial random WCSN deployments and 2) to improve the network coverage with occlusions in the FoI. The extensive simulation results show that the performance of UREA-CS is consistent, robust, and versatile to achieve maximum coverage, both in centralized and distributed modes. The centralized and distributed modes are further analyzed with respect to the computational and communicational overheads.

A Fast and Fault-Tolerant Distributed Algorithm for Near-Optimal TDMA Scheduling in WSNs

The time division multiple access (TDMA) based channel access mechanisms perform better than the contention based channel access mechanisms, in terms of channel utilization, reliability and power consumption, specially for high data rate applications in wireless sensor networks (WSNs). Most of the existing distributed TDMA scheduling techniques can be classified as either static or dynamic. The primary purpose of static TDMA scheduling algorithms is to improve the channel utilization by generating a schedule of smaller length. But, they usually take longer time to schedule, and hence, are not suitable for WSNs, in which the network topology changes dynamically. On the other hand, dynamic TDMA scheduling algorithms generate a schedule quickly, but they are not efficient in terms of generated schedule length. In this paper, we propose a novel scheme for TDMA scheduling in WSNs, which can generate a compact schedule similar to static scheduling algorithms, while its runtime performance can be matched with those of dynamic scheduling algorithms. Furthermore, the proposed distributed TDMA scheduling algorithm has the capability to trade-off schedule length with the time required to generate the schedule. This would allow the developers of WSNs, to tune the performance, as per the requirement of prevalent WSN applications, and the requirement to perform re-scheduling. Finally, the proposed TDMA scheduling is fault-tolerant to packet loss due to erroneous wireless channel. The algorithm has been simulated using the Castalia simulator to compare its performance with those of others in terms of generated schedule length and the time required to generate the TDMA schedule. Simulation results show that the proposed algorithm generates a compact schedule in a very less time.