arrow
返回

Network sensor health problem

delete2016-07-01
delete8
PRE
AI
Z
Zhe Sun
W
Wen‐Long Jin *
M
ManWo Ng
DOI:10.1016/j.trc.2016.04.015delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Many existing studies on the sensor health problem determine an individual sensor's health status based on the statistical characteristics of collected data by the sensor. In this research, we study the sensor health problem at the network level, which is referred to as the network sensor health problem. First, based on the conservation principle of daily flows in a network, we separate all links into base links and non-base links, such that the flows on the latter can be calculated from those on the former. In reality, the network flow conservation principle can be violated due to the existence of unhealthy sensors. Then we define the least inconsistent base set of links as those that minimize the sum of squares of the differences between observed and calculated flows on non-base links. But such least inconsistent base sets may not be unique in a general road network. Finally we define the health index of an individual sensor as the frequency that it appears in all of the least inconsistent base sets. Intuitively, a lower health index suggests that the corresponding sensor is more likely to be unhealthy. We present the brute force method to find all least inconsistent base sets and calculate the health indices. We also propose a greedy search algorithm to calculate the approximate health indices more efficiently. We solve the network sensor health problem for a real-world example with 16 nodes and 30 links, among which 18 links are monitored with loop detectors. Using daily traffic count data from the Caltrans Performance Measurement System (PeMS) database, we use both the brute-force and greedy search methods to calculate the health indices for all the sensors. We find that all the four sensors flagged as unhealthy (high value) by PeMS have the lowest health indices. This confirms that a sensor with a lower health index is more likely to be unhealthy. Therefore, we can use such health indices to determine the relative reliability of different sensors' data and prioritize the maintenance of sensors. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Network flow conservation
Least inconsistent base set
Health index
Greedy search algorithm
Caltrans Performance Measurement System (PeMS) database
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Transportation Research Part C-Emerging Technologies 封面图
Transportation Research Part C-Emerging Technologies
IF:
7.9
论文数:
4.7K
被引数:
3.2W

机构

University of California System 封面图
University of California System
学者数:
37.5W
论文数: 33.7W
被引数: 6.6K
U
university of california irvine
学者数:
2.3W
论文数: 1.7W
被引数: 55
引用论文

引用论文

Matrix Tools for General Observability Analysis in Traffic Networks
err2010-12-01
err56
PREAI
errCastillo, Enrique; Gallego, Inmaculada; Sanchez-Cambronero, Santos; Rivas, Ana
err分享
err收藏
Switch from Anionic Polymerization to Coordinative Chain Transfer Polymerization: A Valuable Strategy to Make Olefin Block Copolymers
err2022-04-26
err0
errOAAI
errNicolas Baulu; Marvin Langlais; Robert Ngo; Julien Thuilliez; François Jean‐Baptiste‐dit‐Dominique; Franck D'Agosto; Christophe Boisson
err分享
err收藏
没有更多内容