2017
DOI: 10.1155/2017/3956282
|View full text |Cite
|
Sign up to set email alerts
|

A Survey of Sound Source Localization Methods in Wireless Acoustic Sensor Networks

Abstract: Wireless acoustic sensor networks (WASNs) are formed by a distributed group of acoustic-sensing devices featuring audio playing and recording capabilities. Current mobile computing platforms offer great possibilities for the design of audio-related applications involving acoustic-sensing nodes. In this context, acoustic source localization is one of the application domains that have attracted the most attention of the research community along the last decades. In general terms, the localization of acoustic sou… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
88
0
1

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 104 publications
(89 citation statements)
references
References 95 publications
(142 reference statements)
0
88
0
1
Order By: Relevance
“…Under the worst situation, if the path e is forced to join the connected subsets, the loop inevitably emerges. This result is in contradiction with the basic idea of call Algoithm 2 (6) end (7) Sink node broadcasts cluster head information and minimum aggregation tree information (8) for each node i received the cluster head information and minimum aggregation tree information (9) if (node i is the CH) (10)…”
Section: Theorem 10 the Generated Tree Conducted By The Kruskalbasementioning
confidence: 94%
See 2 more Smart Citations
“…Under the worst situation, if the path e is forced to join the connected subsets, the loop inevitably emerges. This result is in contradiction with the basic idea of call Algoithm 2 (6) end (7) Sink node broadcasts cluster head information and minimum aggregation tree information (8) for each node i received the cluster head information and minimum aggregation tree information (9) if (node i is the CH) (10)…”
Section: Theorem 10 the Generated Tree Conducted By The Kruskalbasementioning
confidence: 94%
“…In the initial stage of each cycle for the proposed EEMCR, the base station calculates the orientation-tended matrix of the nodes in terms of the Formula (6) and broadcasts it to all nodes. The nodes that successfully receive the orientation-tended matrix calculate their own responsibility and availability according to Formulas (8) and (9). At the same time, for any node i, the algorithm takes the node k that maximizes the sum of ( , )+ ( , ) as the CH in the current cycle of iteration.…”
Section: Clusteringmentioning
confidence: 99%
See 1 more Smart Citation
“…In a first step, a moving MD estimates the TO using only TDOA information using a mathematically closed form, in this work derived from the intersection of hyperboloids, which however is notoriously highly sensitive to measurements' uncertainty [34][35][36]. The MD estimates TO from scratch, i.e., without prior information.…”
Section: Introductionmentioning
confidence: 99%
“…The Maximum Likelihood (ML) Energy-based source localization methods, ML-Energy [5] and H-ML-Energy [4], are examined before and after the application of the proposed approach. This solution is also compared to a sensor selection method based on noise reduction [3], [7]. Experiments are conducted with four different values of SNR (signal-to-noise ratio) ranging from 0dB to 15dB.…”
Section: Introductionmentioning
confidence: 99%