This paper presents DiVA, a novel hybrid range-free and range-based acoustic source localization scheme that uses an ad-hoc network of microphone sensor nodes to produce an accurate estimate of the source's location in the presence of various real-world challenges. DiVA uses range-free pairwise comparisons of sound detection timestamps between local Voronoi neighbors to identify the node closest to the acoustic source, which then estimates the source's location using a constrained range-based method. Through simulation and experimental evaluations, DiVA is shown to be accurate and highly robust, making it practical for real-world applications.

This paper proposes a new acoustic source localization scheme, called Probabilistic Cutting Method (PCM), with randomly deployed smartphones which equipped with known location and direction dual-microphones. Instead of using the value of TDOA (Time Difference Of Arrival), we just use binary information (0/1) and probability to convert the localization problem into plane cutting issues. We can easily come up with the Basic Cutting Method (BCM), but it may appear empty set when error (location error, angle error or error anchors) occurs. PCM can effectively avoid the problem along with lower positioning error. When comparing PCM with TDOA and BCM in different aspects, simulation evaluation results indicate that PCM algorithm achieves highly robustness and accuracy.

This paper presents DiVA, a new acoustic source localization scheme that uses an ad-hoc network of microphone sensor nodes to produce an accurate estimate of the source's location. DiVA uses pairwise comparisons of sound detection timestamps between local Voronoi neighbors to identify the node closest to the acoustic source and then estimates the source's location. The scheme improves on the state of the art by effectively dealing with anchor nodes' position error, time stamp measurement error and time synchronization error in real world conditions. Through simulation and experimental evaluations, DiVA is shown to be more robust than existing solutions under different error conditions.

Indoor localization based on WiFi signal strength fingerprinting techniques have been attracting many research efforts in past decades. Many localization algorithms have been proposed in order to achieve higher localization accuracy. In this paper, we investigate Bayes learning algorithms and some common-used machine learning algorithms. We identify a general problem of Zero Probability (ZP) which may cause significant decrease of accuracy. In order to solve this problem, we propose an Improved Naive Bayes Simple learning algorithm, namely INBS, based on our data set characteristic. INBS is applicable even though Zero Probability problem occurs. We design experiments based on off-the-shelf WiFi devices, mobile phones and well-known machine learning tool Weka. Our experiments are conducted on a floor covering 560m2in a campus building and a laboratory covering 78m2. Experiment results show that INBS outperforms traditional Naive Bayes and k-Nearest Neighbors (k-NN) algorithms and two common-used machine learning algorithms in terms of accuracy.