10,885 research outputs found
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)
A survey of localization in wireless sensor network
Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network
Recommended from our members
Cooperative Sequential Hypothesis Testing in Multi-Agent Systems
Since the sequential inference framework determines the number of total samples in real-time based on the history data, it yields quicker decision compared to its fixed-sample-size counterpart, provided the appropriate early termination rule. This advantage is particularly appealing in the system where data is acquired in sequence, and both the decision accuracy and latency are of primary interests. Meanwhile, the Internet of Things (IoT) technology has created all types of connected devices, which can potentially enhance the inference performance by providing information diversity. For instance, smart home network deploys multiple sensors to perform the climate control, security surveillance, and personal assistance. Therefore, it has become highly desirable to pursue the solutions that can efficiently integrate the classic sequential inference methodologies into the networked multi-agent systems. In brief, this thesis investigates the sequential hypothesis testing problem in multi-agent networks, aiming to overcome the constraints of communication bandwidth, energy capacity, and network topology so that the networked system can perform sequential test cooperatively to its full potential.
The multi-agent networks are generally categorized into two main types. The first one features a hierarchical structure, where the agents transmit messages based on their observations to a fusion center that performs the data fusion and sequential inference on behalf of the network. One such example is the network formed by wearable devices connected with a smartphone. The central challenges in the hierarchical network arise from the instantaneous transmission of the distributed data to the fusion center, which is constrained by the battery capacity and the communication bandwidth in practice. Therefore, the first part of this thesis is dedicated to address
these two constraints for the hierarchical network. In specific, aiming to preserve the agent energy, Chapter 2 devises the optimal sequential test that selects the "most informative" agent online at each sampling step while leaving others in idle status. To overcome the communication bottleneck, Chapter 3 proposes a scheme that allows distributed agents to send only one-bit messages asynchronously to the fusion center without compromising the performance. In contrast, the second type of networks does not assume the presence of a fusion center, and each agent performs the sequential test based on its own samples together with the messages shared by its neighbours. The communication links can be represented by an undirected graph. A variety of applications conform to such a distributed structure, for instance, the social networks that connect individuals through online friendship and the vehicular network formed by connected cars. However, the distributed network is prone to sub-optimal performance since each agent can only access the information from its local neighborhood. Hence the second part of this thesis mainly focuses on optimizing the distributed performance through local
message exchanges. In Chapter 4, we put forward a distributed sequential test based on consensus algorithm, where agents exchange and aggregate real-valued local statistics with neighbours at every sampling step. In order to further lower the communication overhead, Chapter 5 develops a distributed sequential test that only requires the exchange of quantized messages (i.e., integers) between agents. The cluster-based network, which is a hybrid of the hierarchical and distributed networks, is also investigated in Chapter 5
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
- …