Ultrasonic performance of the PVDF thin film sensors under thermal fatigue

In the present work, the ultrasonic strain sensing performance of the large area PVDF thin film subjected to the thermal fatigue is studied. The PVDF thin film is prepared using hot press and the piezoelectric phase (beta-phase) has been achieved by thermo-mechanical treatment and poling under DC field. The sensors used in aircrafts for structural health monitoring applications are likely to be subjected to a wide range of temperature fluctuations which may create thermal fatigue in both aircraft structures and in the sensors. Thus, the sensitivity of the PVDF sensors for thermal fatigue needs to be studied for its effective implementation in the structural health monitoring applications. In present work, the fabricated films have been subjected to certain number of thermal cycles which serve as thermal fatigue and are further tested for ultrasonic strain sensitivity at various different frequencies. The PVDF sensor is bonded on the beam specimen at one end and the ultrasonic guided waves are launched with a piezoelectric wafer bonded on another end of the beam. Sensitivity of PVDF sensor in terms of voltage is obtained for increasing number of thermal cycles. Sensitivity variation is studied at various different extent of thermal fatigue. The variation of the sensor sensitivity with frequency due to thermal fatigue at different temperatures is also investigated. The present investigation shows an appropriate temperature range for the application of the PVDF sensors in structural health monitoring.

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.

Performance of a class of multi-robot deploy and search strategies based on centroidal voronoi configurations

This article considers a class of deploy and search strategies for multi-robot systems and evaluates their performance. The application framework used is deployment of a system of autonomous mobile robots equipped with required sensors in a search space to gather information. The lack of information about the search space is modelled as an uncertainty density distribution. The agents are deployed to maximise single-step search effectiveness. The centroidal Voronoi configuration, which achieves a locally optimal deployment, forms the basis for sequential deploy and search (SDS) and combined deploy and search (CDS) strategies. Completeness results are provided for both search strategies. The deployment strategy is analysed in the presence of constraints on robot speed and limit on sensor range for the convergence of trajectories with corresponding control laws responsible for the motion of robots. SDS and CDS strategies are compared with standard greedy and random search strategies on the basis of time taken to achieve reduction in the uncertainty density below a desired level. The simulation experiments reveal several important issues related to the dependence of the relative performances of the search strategies on parameters such as the number of robots, speed of robots and their sensor range limits.

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.

Fluorescent Tris-Imidazolium Sensors for Picric Acid Explosive

Two new anthracene-functionalized fluorescent tris-imidazolium salts have been synthesized, characterized, and proven to be selective sensors for picric acid, which is a common constituent of many powerful explosives. Theoretical studies revealed an unusual ground-state electron transfer from picrate anion to the sensor molecules.

Packet scheduling for priority based transmission in energy harvesting sensors

In this paper, we determine packet scheduling policies for efficient power management in Energy Harvesting Sensors (EHS) which have to transmit packets of high and low priorities over a fading channel. We assume that incoming packets are stored in a buffer and the quality of service for a particular type of message is determined by the expected waiting time of packets of that type of message. The sensors are constrained to work with the energy that they garner from the environment. We derive transmit policies which minimize the sum of expected waiting times of the two types of messages, weighted by penalties. First, we show that for schemes with a constant rate of transmission, under a decoupling approximation, a form of truncated channel inversion is optimal. Using this result, we derive optimal solutions that minimize the weighted sum of the waiting times in the different queues.

Duty cycling and power management with a network of energy harvesting sensors

In this paper, we study duty cycling and power management in a network of energy harvesting sensor (EHS) nodes. We consider a one-hop network, where K EHS nodes send data to a destination over a wireless fading channel. The goal is to find the optimum duty cycling and power scheduling across the nodes that maximizes the average sum data rate, subject to energy neutrality at each node. We adopt a two-stage approach to simplify the problem. In the inner stage, we solve the problem of optimal duty cycling of the nodes, subject to the short-term power constraint set by the outer stage. The outer stage sets the short-term power constraints on the inner stage to maximize the long-term expected sum data rate, subject to long-term energy neutrality at each node. Albeit suboptimal, our solutions turn out to have a surprisingly simple form: the duty cycle allotted to each node by the inner stage is simply the fractional allotted power of that node relative to the total allotted power. The sum power allotted is a clipped version of the sum harvested power across all the nodes. The average sum throughput thus ultimately depends only on the sum harvested power and its statistics. We illustrate the performance improvement offered by the proposed solution compared to other naive schemes via Monte-Carlo simulations.

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 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.

Electron rich supramolecular polymers as fluorescent sensors for nitroaromatics

Three pi-electron rich fluorescent supramolecular polymers (1-3) have been synthesized incorporating 2-methyl-3-butyn-2-ol groups in reasonable yield by employing Sonagashira coupling. They were characterized by multinuclear NMR (H-1, C-13), ESI-MS and single crystal X-ray diffraction analyses 1 = 1( 2-methyl-3-butyn-2-ol) pyrene; 2 = 9,10-bis(2-methyl-3-butyn-2-ol) anthracene; 3 = 1,3,6,8-tetrakis(2methyl- 3-butyn-2-ol) pyrene]. Single crystal structures of 1-3 indicated that the incorporation of hydroxy (-OH) groups on the peripheral of the fluorophores helps them to self-associate into an infinite supramolecular polymeric network via intermolecular hydrogen bonding interactions between the adjacent discrete fluorophore units. All these compounds showed fluorescence characteristics in chloroform solution due to the extended pi-conjugation and were used as selective fluorescent sensors for the detection of electron deficient nitroaromatics. The changes in photophysical properties of fluorophores (1-3) upon complex formation with electron deficient nitroaromatic explosives were studied in chloroform solution by using fluorescence spectroscopy. All these fluorophores showed the largest quenching response with moderate selectivity for nitroaromatics over various other electron deficient/ rich aromatic compounds tested (Chart 1). Analysis of the fluorescence titration profile of 9,10-bis(2-methyl-3butyn- 2-ol) anthracene fluorophore (2) with 1,3,5-trinitrotoluene/ 2,4-dinitrotoluene provided evidence that this particular fluorophore detects nitroaromatics in the nanomolar range 2.0 ppb for TNT, 13.7 ppb for DNT]. Moreover, sharp visual color change was observed upon mixing nitroaromatic (DNT) with fluorophores (1-3) both in solution as well as in solid phase. Furthermore, the vapor-phase sensing study of thin film of fluorophores (1-3) showed efficient quenching responses for DNT and this sensing process is reproducible. Selective fluorescence quenching response including a sharp visual color change for nitroaromatics make these tested fluorophores (1-3) as potential sensors for nitroaromatic compounds with a detection limit of ppb level.

Tutorial: implementing a pedestrian tracker using inertial sensors

Shoe-mounted inertial sensors offer a convenient way to track pedestrians in situations where other localization systems fail. This tutorial outlines a simple yet effective approach for implementing a reasonably accurate tracker. This Web extra presents the Matlab implementation and a few sample recordings for implementing the pedestrian inertial tracking system using an error-state Kalman filter for zero-velocity updates (ZUPTs) and orientation estimation.

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.

Heterogeneous locational optimisation using a generalised Voronoi partition

In this paper a generalisation of the Voronoi partition is used for locational optimisation of facilities having different service capabilities and limited range or reach. The facilities can be stationary, such as base stations in a cellular network, hospitals, schools, etc., or mobile units, such as multiple unmanned aerial vehicles, automated guided vehicles, etc., carrying sensors, or mobile units carrying relief personnel and materials. An objective function for optimal deployment of the facilities is formulated, and its critical points are determined. The locally optimal deployment is shown to be a generalised centroidal Voronoi configuration in which the facilities are located at the centroids of the corresponding generalised Voronoi cells. The problem is formulated for more general mobile facilities, and formal results on the stability, convergence and spatial distribution of the proposed control laws responsible for the motion of the agents carrying facilities, under some constraints on the agents' speed and limit on the sensor range, are provided. The theoretical results are supported with illustrative simulation results.

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.