Narrowband Detection of Acoustic Source in Shallow Ocean using Vector Sensor Array

The problem of narrowband CFAR (constant false alarm rate) detection of an acoustic source at an unknown location in a range-independent shallow ocean is considered. If a target is present, the received signal vector at an array of N sensors belongs to an M-dimensional subspace if N exceeds the number of propagating modes M in the ocean. A subspace detection method which utilises the knowledge of the signal subspace to enhance the detector performance is presented in thisMpaper. It is shown that, for a given number of sensors N, the performance of a detector using a vector sensor array is significantly better than that using a scalar sensor array. If a target is detected, the detector using a vector sensor array also provides a concurrent coarse estimate of the bearing of the target.

Narrowband signal detection techniques in shallow ocean by acoustic vector sensor array

This paper presents the formulation and performance analysis of four techniques for detection of a narrowband acoustic source in a shallow range-independent ocean using an acoustic vector sensor (AVS) array. The array signal vector is not known due to the unknown location of the source. Hence all detectors are based on a generalized likelihood ratio test (GLRT) which involves estimation of the array signal vector. One non-parametric and three parametric (model-based) signal estimators are presented. It is shown that there is a strong correlation between the detector performance and the mean-square signal estimation error. Theoretical expressions for probability of false alarm and probability of detection are derived for all the detectors, and the theoretical predictions are compared with simulation results. It is shown that the detection performance of an AVS array with a certain number of sensors is equal to or slightly better than that of a conventional acoustic pressure sensor array with thrice as many sensors.

Estimating bottom properties with a vector sensor array during MakaiEx 2005

Nowadays, vector sensors which measure both acoustic pressure and particle velocity begin to be available in underwater acoustic systems, normally configured as vector sensor arrays (VSA). The spatial filtering capabilities of a VSA can be used, with advantage over traditional pressure only hydrophone arrays, for estimating acoustic field directionality as well as arrival times and spectral content, which could open up the possibility for its use in bottom properties' estimation. An additional motivation for this work is to test the possibility of using high frequency probe signals (say above 2 kHz) for reducing size and cost of actual sub bottom profilers and current geoacoustic inversion methods. This work studies the bottom related structure of the VSA acquired signals, regarding the emitted signal waveform, frequency band and source-receiver geometry in order to estimate bottom properties, specially bottom reflection coefficient characteristics. Such a system was used during the Makai 2005 experiment, off Kauai I., Hawai (USA) to receive precoded signals in a broad frequency band from 8 up to 14 kHz. The agreement between the observed and the modelled acoustic data is discussed and preliminary results on the bottom reflection estimation are presented.

Source localization with vector sensor array during the makai experiment

Vector sensors measure both the acoustic pressure and the three components of particle velocity. Because of this, a vector sensor array (VSA) has the advantage of being able to provide substantially higher directivity with a much smaller aperture than an array of traditional scalar (pressure only) hydrophones. Although several, most of them theoretic, works were published from early nineties, only in the last years due to improvements and availability of vector sensor technology, the interest on field experiments with VSA increased in the scientific community. During the Makai Experiment, that took place off the coast of Kauai I., Hawaii, in September 2005, real data were collected with a 4 element vertical VSA. These data will be discussed in the present paper. The acoustic signals were emitted from a near source (low frequency ship noise) and two high frequency controlled acoustic sources located within a range of 2km from the VSA. The advantages of the VSA over traditional scalar hydrophone arrays in source localization will be addressed using conventional beamforming.

In-fibre directional transverse loading sensor based on excessively tilted fibre Bragg gratings

We report a distinctive polarization mode coupling behaviour of tilted fibre Bragg gratings (TFBGs) with a tilted angle exceeding 45°. The ex-45° TFBGs exhibit pronounced polarization mode splitting resulted from the birefringence induced by the grating structure asymmetry. We have fabricated TFBGs with a tilted structure at 81° and studied their properties under transverse load applied to their equivalent fast and slow axes. The results show that the light coupling to the orthogonally polarized modes of the 81°-TFBGs changes only when the load is applied to their slow axis, giving a prominent directional loading response. For the view of real applications, we further investigated the possibility of interrogating such a TFBG-based load sensor using low-cost and compact-size single wavelength source and power detector. The experimental results clearly show that the 81°-TFBGs plus the proposed power-measurement interrogation scheme may be developed to an optical fibre vector sensor system capable of not just measuring the magnitude but also recognizing the direction of the applied transverse load. Using such an 81°-TFBG based load sensor, a load change as small as 1.6 × 10-2 g may be detected by employing a standard photodiode detector.

DS-VBF : dual sink vector-based routing protocol for underwater wireless sensor network

Underwater wireless sensor networks (UWSNs) have become the seat of researchers' attention recently due to their proficiency to explore underwater areas and design different applications for marine discovery and oceanic surveillance. One of the main objectives of each deployed underwater network is discovering the optimized path over sensor nodes to transmit the monitored data to onshore station. The process of transmitting data consumes energy of each node, while energy is limited in UWSNs. So energy efficiency is a challenge in underwater wireless sensor network. Dual sinks vector based forwarding (DS-VBF) takes both residual energy and location information into consideration as priority factors to discover an optimized routing path to save energy in underwater networks. The modified routing protocol employs dual sinks on the water surface which improves network lifetime. According to deployment of dual sinks, packet delivery ratio and the average end to end delay are enhanced. Based on our simulation results in comparison with VBF, average end to end delay reduced more than 80%, remaining energy increased 10%, and the increment of packet reception ratio was about 70%.

Optical bend sensor for vector curvature measurement based on Bragg grating in eccentric core polymer optical fibre

We present an optical bend sensor based on a Bragg grating written in an eccentric core polymer optical fibre. The grating wavelength shifts are studied as a function of bend curvature and fibre orientation and the device exhibits strong fibre orientation dependence, wide bend curvature range of ± 22.7 m-1 and high bend sensitivity of 63 pm/m-1, which is 80 times higher than the reported sensor based on an offset-FBG in standard single mode silica fibre.

Monitoring static shape memory polymers using a fiber Bragg grating as a vector-bending sensor

We propose and demonstrate a technique for monitoring the recovery deformation of the shape-memory polymers (SMP) using a surface-attached fiber Bragg grating (FBG) as a vector-bending sensor. The proposed sensing scheme could monitor the pure bending deformation for the SMP sample. When the SMP sample undergoes concave or convex bending, the resonance wavelength of the FBG will have red-shift or blue-shift according to the tensile or compressive stress gradient along the FBG. As the results show, the bending sensitivity is around 4.07  nm/cm−1. The experimental results clearly indicate that the deformation of such an SMP sample can be effectively monitored by the attached FBG not just for the bending curvature but also the bending direction.

Long period grating in multicore optical fiber:an ultra-sensitive vector bending sensor for low curvatures

Long period grating was UV inscribed into a multicore fiber consisting of 120 single mode cores. The multicore fiber that hosts the grating was fusion spliced into a single mode fiber at both ends. The splice creates a taper transition between the two types of fiber that produces a nonadiabatic mode evolution; this results in the illumination of all the modes in the multicore fiber. The spectral characteristics of this fiber device as a function of curvature were investigated. The device yielded a significant spectral sensitivity as high as 1.23 nm/m-1 and 3.57 dB/m-1 to the ultra-low curvature values from 0 to 1 m-1. This fiber device can also distinguish the orientation of curvature experienced by the fiber as the long period grating attenuation bands producing either a blue or red wavelength shift. The finite element method (FEM) model was used to investigate the modal behavior in multicore fiber and to predict the phase-matching curves of the long period grating inscribed into multicore fiber. © 2014 Optical Society of America.

Robot navigation in sensor space

This thesis investigates the problem of robot navigation using only landmark bearings. The proposed system allows a robot to move to a ground target location specified by the sensor values observed at this ground target posi- tion. The control actions are computed based on the difference between the current landmark bearings and the target landmark bearings. No Cartesian coordinates with respect to the ground are computed by the control system. The robot navigates using solely information from the bearing sensor space. Most existing robot navigation systems require a ground frame (2D Cartesian coordinate system) in order to navigate from a ground point A to a ground point B. The commonly used sensors such as laser range scanner, sonar, infrared, and vision do not directly provide the 2D ground coordi- nates of the robot. The existing systems use the sensor measurements to localise the robot with respect to a map, a set of 2D coordinates of the objects of interest. It is more natural to navigate between the points in the sensor space corresponding to A and B without requiring the Cartesian map and the localisation process. Research on animals has revealed how insects are able to exploit very limited computational and memory resources to successfully navigate to a desired destination without computing Cartesian positions. For example, a honeybee balances the left and right optical flows to navigate in a nar- row corridor. Unlike many other ants, Cataglyphis bicolor does not secrete pheromone trails in order to find its way home but instead uses the sun as a compass to keep track of its home direction vector. The home vector can be inaccurate, so the ant also uses landmark recognition. More precisely, it takes snapshots and compass headings of some landmarks. To return home, the ant tries to line up the landmarks exactly as they were before it started wandering. This thesis introduces a navigation method based on reflex actions in sensor space. The sensor vector is made of the bearings of some landmarks, and the reflex action is a gradient descent with respect to the distance in sensor space between the current sensor vector and the target sensor vec- tor. Our theoretical analysis shows that except for some fully characterized pathological cases, any point is reachable from any other point by reflex action in the bearing sensor space provided the environment contains three landmarks and is free of obstacles. The trajectories of a robot using reflex navigation, like other image- based visual control strategies, do not correspond necessarily to the shortest paths on the ground, because the sensor error is minimized, not the moving distance on the ground. However, we show that the use of a sequence of waypoints in sensor space can address this problem. In order to identify relevant waypoints, we train a Self Organising Map (SOM) from a set of observations uniformly distributed with respect to the ground. This SOM provides a sense of location to the robot, and allows a form of path planning in sensor space. The navigation proposed system is analysed theoretically, and evaluated both in simulation and with experiments on a real robot.

Learned ultra-wideband RADAR sensor model for augmented LIDAR-based traversability mapping in vegetated environments

In vegetated environments, reliable obstacle detection remains a challenge for state-of-the-art methods, which are usually based on geometrical representations of the environment built from LIDAR and/or visual data. In many cases, in practice field robots could safely traverse through vegetation, thereby avoiding costly detours. However, it is often mistakenly interpreted as an obstacle. Classifying vegetation is insufficient since there might be an obstacle hidden behind or within it. Some Ultra-wide band (UWB) radars can penetrate through vegetation to help distinguish actual obstacles from obstacle-free vegetation. However, these sensors provide noisy and low-accuracy data. Therefore, in this work we address the problem of reliable traversability estimation in vegetation by augmenting LIDAR-based traversability mapping with UWB radar data. A sensor model is learned from experimental data using a support vector machine to convert the radar data into occupancy probabilities. These are then fused with LIDAR-based traversability data. The resulting augmented traversability maps capture the fine resolution of LIDAR-based maps but clear safely traversable foliage from being interpreted as obstacle. We validate the approach experimentally using sensors mounted on two different mobile robots, navigating in two different environments.

A Low-Complexity Algorithm for Intrusion Detection in a PIR-Based Wireless Sensor Network

We present a low-complexity algorithm for intrusion detection in the presence of clutter arising from wind-blown vegetation, using Passive Infra-Red (PIR) sensors in a Wireless Sensor Network (WSN). The algorithm is based on a combination of Haar Transform (HT) and Support-Vector-Machine (SVM) based training and was field tested in a network setting comprising of 15-20 sensing nodes. Also contained in this paper is a closed-form expression for the signal generated by an intruder moving at a constant velocity. It is shown how this expression can be exploited to determine the direction of motion information and the velocity of the intruder from the signals of three well-positioned sensors.

Connectivity-aware Routing in Sensor Networks

Sensor network applications such as environmental monitoring demand that the data collection process be carried out for the longest possible time. Our paper addresses this problem by presenting a routing scheme that ensures that the monitoring network remains connected and hence the live sensor nodes deliver data for a longer duration. We analyze the role of relay nodes (neighbours of the base-station) in maintaining network connectivity and present a routing strategy that, for a particular class of networks, approaches the optimal as the set of relay nodes becomes larger. We then use these findings to develop an appropriate distributed routing protocol using potential-based routing. The basic idea of potential-based routing is to define a (scalar) potential value at each node in the network and forward data to the neighbor with the highest potential. We propose a potential function and evaluate its performance through simulations. The results show that our approach performs better than the well known lifetime maximization policy proposed by Chang and Tassiulas (2004), as well as AODV [Adhoc on demand distance vector routing] proposed by Perkins (1997).

Optimizing Delay in Sequential Change Detection on Ad Hoc Wireless Sensor Networks

We consider the classical problem of sequential detection of change in a distribution (from hypothesis 0 to hypothesis 1), where the fusion centre receives vectors of periodic measurements, with the measurements being i.i.d. over time and across the vector components, under each of the two hypotheses. In our problem, the sensor devices ("motes") that generate the measurements constitute an ad hoc wireless network. The motes contend using a random access protocol (such as CSMA/CA) to transmit their measurement packets to the fusion centre. The fusion centre waits for vectors of measurements to accumulate before taking decisions. We formulate the optimal detection problem, taking into account the network delay experienced by the vectors of measurements, and find that, under periodic sampling, the detection delay decouples into network delay and decision delay. We obtain a lower bound on the network delay, and propose a censoring scheme, where lagging sensors drop their delayed observations in order to mitigate network delay. We show that this scheme can achieve the lower bound. This approach is explored via simulation. We also use numerical evaluation and simulation to study issues such as: the optimal sampling rate for a given number of sensors, and the optimal number of sensors for a given measurement rate

Delay Optimal Event Detection on Ad Hoc Wireless Sensor Networks

We consider a small extent sensor network for event detection, in which nodes periodically take samples and then contend over a random access network to transmit their measurement packets to the fusion center. We consider two procedures at the fusion center for processing the measurements. The Bayesian setting, is assumed, that is, the fusion center has a prior distribution on the change time. In the first procedure, the decision algorithm at the fusion center is network-oblivious and makes a decision only when a complete vector of measurements taken at a sampling instant is available. In the second procedure, the decision algorithm at the fusion center is network-aware and processes measurements as they arrive, but in a time-causal order. In this case, the decision statistic depends on the network delays, whereas in the network-oblivious case, the decision statistic does not. This yields a Bayesian change-detection problem with a trade-off between the random network delay and the decision delay that is, a higher sampling rate reduces the decision delay but increases the random access delay. Under periodic sampling, in the network-oblivious case, the structure of the optimal stopping rule is the same as that without the network, and the optimal change detection delay decouples into the network delay and the optimal decision delay without the network. In the network-aware case, the optimal stopping problem is analyzed as a partially observable Markov decision process, in which the states of the queues and delays in the network need to be maintained. A sufficient decision statistic is the network state and the posterior probability of change having occurred, given the measurements received and the state of the network. The optimal regimes are studied using simulation.