A robust sequential hypothesis testing method for brake squeal localisation

This contribution deals with the in situ detection and localisation of brake squeal in an automobile. As brake squeal is emitted from regions known a priori, i.e., near the wheels, the localisation is treated as a hypothesis testing problem. Distributed microphone arrays, situated under the automobile, are used to capture the directional properties of the sound field generated by a squealing brake. The spatial characteristics of the sampled sound field is then used to formulate the hypothesis tests. However, in contrast to standard hypothesis testing approaches of this kind, the propagation environment is complex and time-varying. Coupled with inaccuracies in the knowledge of the sensor and source positions as well as sensor gain mismatches, modelling the sound field is difficult and standard approaches fail in this case. A previously proposed approach implicitly tried to account for such incomplete system knowledge and was based on ad hoc likelihood formulations. The current paper builds upon this approach and proposes a second approach, based on more solid theoretical foundations, that can systematically account for the model uncertainties. Results from tests in a real setting show that the proposed approach is more consistent than the prior state-of-the-art. In both approaches, the tasks of detection and localisation are decoupled for complexity reasons. The localisation (hypothesis testing) is subject to a prior detection of brake squeal and identification of the squeal frequencies. The approaches used for the detection and identification of squeal frequencies are also presented. The paper, further, briefly addresses some practical issues related to array design and placement. (C) 2019 Author(s)

Super-resolved localisation in multipath environments

In the last few decades, the localisation problems have been studied extensively. There are still some open issues that remain unresolved. One of the key issues is the efficiency and preciseness of the localisation in presence of non-line-of-sight (NLoS) path. Nevertheless, the NLoS path has a high occurrence in multipath environments, but NLoS bias is viewed as a main factor to severely degrade the localisation performance. The NLoS bias would often result in extra propagation delay and angular bias. Numerous localisation methods have been proposed to deal with NLoS bias in various propagation environments, but they are tailored to some specif ic scenarios due to different prior knowledge requirements, accuracies, computational complexities, and assumptions. To super-resolve the location of mobile device (MD) without prior knowledge, we address the localisation problem by super-resolution technique due to its favourable features, such as working on continuous parameter space, reducing computational cost and good extensibility. Besides the NLoS bias, we consider an extra array directional error which implies the deviation in the orientation of the array placement. The proposed method is able to estimate the locations of MDs and self-calibrate the array directional errors simultaneously. To achieve joint localisation, we directly map MD locations and array directional error to received signals. Then the group sparsity based optimisation is proposed to exploit the geometric consistency that received paths are originating from common MDs. Note that the super-resolution framework cannot be directly applied to our localisation problems. Because the proposed objective function cannot be efficiently solved by semi-definite programming. Typical strategies focus on reducing adverse effect due to the NLoS bias by separating line-of-sight (LoS)/NLoS path or mitigating NLoS effect. The LoS path is well studied for localisation and multiple methods have been proposed in the literature. However, the number of LoS paths are typically limited and the effect of NLoS bias may not always be reduced completely. As a long-standing issue, the suitable solution of using NLoS path is still an open topic for research. Instead of dealing with NLoS bias, we present a novel localisation method that exploits both LoS and NLoS paths in the same manner. The unique feature is avoiding hard decisions on separating LoS and NLoS paths and hence relevant possible error. A grid-free sparse inverse problem is formulated for localisation which avoids error propagation between multiple stages, handles multipath in a unified way, and guarantees a global convergence. Extensive localisation experiments on different propagation environments and localisation systems are presented to illustrate the high performance of the proposed algorithm compared with theoretical analysis. In one of the case studies, single antenna access points (APs) can locate a single antenna MD even when all paths between them are NLoS, which according to the authors’ knowledge is the first time in the literature.Open Acces

A survey of self organisation in future cellular networks

This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks

Acoustical Ranging Techniques in Embedded Wireless Sensor Networked Devices

Location sensing provides endless opportunities for a wide range of applications in GPS-obstructed environments; where, typically, there is a need for higher degree of accuracy. In this article, we focus on robust range estimation, an important prerequisite for fine-grained localization. Motivated by the promise of acoustic in delivering high ranging accuracy, we present the design, implementation and evaluation of acoustic (both ultrasound and audible) ranging systems.We distill the limitations of acoustic ranging; and present efficient signal designs and detection algorithms to overcome the challenges of coverage, range, accuracy/resolution, tolerance to Doppler’s effect, and audible intensity. We evaluate our proposed techniques experimentally on TWEET, a low-power platform purpose-built for acoustic ranging applications. Our experiments demonstrate an operational range of 20 m (outdoor) and an average accuracy 2 cm in the ultrasound domain. Finally, we present the design of an audible-range acoustic tracking service that encompasses the benefits of a near-inaudible acoustic broadband chirp and approximately two times increase in Doppler tolerance to achieve better performance

AN ENERGY EFFICIENT CROSS-LAYER NETWORK OPERATION MODEL FOR MOBILE WIRELESS SENSOR NETWORKS

Wireless sensor networks (WSNs) are modern technologies used to sense/control the environment whether indoors or outdoors. Sensor nodes are miniatures that can sense a specific event according to the end user(s) needs. The types of applications where such technology can be utilised and implemented are vast and range from households’ low end simple need applications to high end military based applications. WSNs are resource limited. Sensor nodes are expected to work on a limited source of power (e.g., batteries). The connectivity quality and reliability of the nodes is dependent on the quality of the hardware which the nodes are made of. Sensor nodes are envisioned to be either stationary or mobile. Mobility increases the issues of the quality of the operation of the network because it effects directly on the quality of the connections between the nodes

Train Localisation using Wireless Sensor Networks

Safety and reliability have always been concerns for railway transportation. Knowing the exact location of a train enables the railway system to react to an unusual situation for the safety of human lives and properties. Generally, the accuracy of localisation systems is related with their deployment and maintenance costs, which can be on the order of millions of dollars a year. Despite a lot of research efforts, existing localisation systems based on different technologies are still limited because most of them either require expensive infrastructure (ultrasound and laser), have high database maintenance, computational costs or accumulate errors (vision), offer limited coverage (GPS-dark regions, Wi-Fi, RFID) or provide low accuracy (audible sound). On the other hand, wireless sensor networks (WSNs) offer the potential for a cheap, reliable and accurate solutions for the train localisation system. This thesis proposes a WSN-based train localisation system, in which train location is estimated based on the information gathered through the communication between the anchor sensors deployed along the track and the gateway sensor installed on the train, such as anchor sensors' geographic coordinates and the Received Signal Strength Indicator (RSSI). In the proposed system, timely anchor-gateway communication implies accurate localisation. How to guarantee effective communication between anchor sensors along the track and the gateway sensor on the train is a challenging problem for WSN-based train localisation. I propose a beacon driven sensors wake-up scheme (BWS) to address this problem. BWS allows each anchor sensor to run an asynchronous duty-cycling protocol to conserve energy and establishes an upper bound on the sleep time in one duty cycle to guarantee their timely wake-up once a train approaches. Simulation results show that the BWS scheme can timely wake up the anchor sensors at a very low energy consumption cost. To design an accurate scheme for train localisation, I conducted on-site experiments in an open field, a railway station and a tunnel, and the results show that RSSI can be used as an estimator for train localisation and its applicability increases with the incorporation of another type of data such as location information of anchor sensors. By combining the advantages of RSSI-based distance estimation and Particle Filtering techniques, I designed a Particle-Filter-based train localisation scheme and propose a novel Weighted RSSI Likelihood Function (WRLF) for particle update. The proposed localisation scheme is evaluated through extensive simulations using the data obtained from the on-site measurements. Simulation results demonstrate that the proposed scheme can achieve significant accuracy, where average localisation error stays under 30 cm at the train speed of 40 m=s, 40% anchor sensors failure rate and sparse deployment. In addition, the proposed train localisation scheme is robust to changes in train speed, the deployment density and reliability of anchor sensors. Anchor sensors are prone to hardware and software deterioration such as battery outage and dislocation. Therefore, in order to reduce the negative impacts of these problems, I designed a novel Consensus-based Anchor sensor Management Scheme (CAMS), in which each anchor sensor performs a self-diagnostics and reports the detected faults in the neighbourhood. CAMS can assist the gateway sensor to exclude the input from the faulty anchor sensors. In CAMS, anchor sensors update each other about their opinions on other neighbours and develops consensus to mark faulty sensors. In addition, CAMS also reports the system information such as signal path loss ratio and allows anchor sensors to re-calibrate and verify their geographic coordinates. CAMS is evaluated through extensive simulations based on real data collected from field experiments. This evaluation also incorporated the simulated node failure model in simulations. Though there are no existing WSN-based train localisation systems available to directly compare our results with, the proposed schemes are evaluated with real datasets, theoretical models and existing work wherever it was possible. Overall, the WSN-based train localisation system enables the use of RSSI, with combination of location coordinates of anchor sensors, as location estimator. Due to low cost of sensor devices, the cost of overall system remains low. Further, with duty-cycling operation, energy of the sensor nodes and system is conserved

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

Experimental performance evaluation of outdoor TDoA and RSS positioning in a public LoRa network

This paper experimentally compares the positioning accuracy of TDoA-based and RSS-based localization in a public outdoor LoRa network in the Netherlands. The performance of different Received Signal Strength (RSS)-based approaches (proximity, centroid, map matching,...) is compared with Time-Difference-of-Arrival (TDoA) performance. The number of RSS and TDoA location updates and the positioning accuracy per spreading factor (SF) is assessed, allowing to select the optimal SF choice for the network. A road mapping filter is applied to the raw location estimates for the best algorithms and SFs. RSS-based approaches have median and maximal errors that are limited to 1000 m and 2000 m respectively, using a road mapping filter. Using the same filter, TDoA-based approaches deliver median and maximal errors in the order of 150 m and 350 m respectively. However, the number of location updates per time unit using SF7 is around 10 times higher for RSS algorithms than for the TDoA algorithm

Efficient and Featureless Approaches to Bathymetric Simultaneous Localisation and Mapping

This thesis investigates efficient forms of Simultaneous Localization and Mapping (SLAM) that do not require explicit identification, tracking or association of map features. The specific application considered here is subsea robotic bathymetric mapping. In this context, SLAM allows a GPS-denied robot operating near the sea floor to create a self-consistent bathymetric map. This is accomplished using a Rao-Blackwellized Particle Filter (RBPF) whereby each particle maintains a hypothesis of the current vehicle state and map that is efficiently maintained using Distributed Particle Mapping. Through particle weighting and resampling, successive observations of the seafloor structure are used to improve the estimated trajectory and resulting map by enforcing map self consistency. The main contributions of this thesis are two novel map representations, either of which can be paired with the RBPF to perform SLAM. The first is a grid-based 2D depth map that is efficiently stored by exploiting redundancies between different maps. The second is a trajectory map representation that, instead of directly storing estimates of seabed depth, records the trajectory of each particle and synchronises it to a common log of bathymetric observations. Upon detecting a loop closure each particle is weighted by matching new observations to the current predictions. For the grid map approach this is done by extracting the predictions stored in the observed cells. For the trajectory map approach predictions are instead generated from a local reconstruction of their map using Gaussian Process Regression. While the former allows for faster map access the latter requires less memory and fully exploits the spatial correlation in the environment, allowing predictions of seabed depth to be generated in areas that were not directly observed previously. In this case particle resampling therefore not only enforces self-consistency in overlapping sections of the map but additionally enforces self-consistency between neighboring map borders. Both approaches are validated using multibeam sonar data collected from several missions of varying scale by a variety of different Unmanned Underwater Vehicles. These trials demonstrate how the corrections provided by both approaches improve the trajectory and map when compared to dead reckoning fused with Ultra Short Baseline or Long Baseline observations. Furthermore, results are compared with a pre-existing state of the art bathymetric SLAM technique, confirming that similar results can be achieved at a fraction of the computation cost. Lastly the added capabilities of the trajectory map are validated using two different bathymetric datasets. These demonstrate how navigation and mapping corrections can still be achieved when only sparse bathymetry is available (e.g. from a four beam Doppler Velocity Log sensor) or in missions where map overlap is minimal or even non-existent