检索结果-内蒙古大学图书馆

International Conference on Affective Computing and Intelligent Interaction (ICACH 2012)

作者： Cao Xiaohua Zhou Yong Wuhan Univ Technol Logist Dept Wuhan 430070 Peoples R China

ISBN: (纸本)9783642278655

Network control system is applied widely in the industrial field. However, the reliability and real-time cannot meet the system's requirements in the overloading system. A new idea called as Active-Request-And-Dynamic-Load-Distribution was introduced into redundant fault-tolerant services through analysis and comparison to several fault-tolerant algorithms. An effective algorithm was presented for CAN fault-tolerant services. According to the system's load. CAN nodes decided whether to request actively the task as a redundant server. Considering the load and the current status of node hosts, the management system distributed dynamically its load to each redundant server and changed the number of redundant servers. Finally, the model of new algorithm was created. The new algorithm was compared with other fault-tolerant algorithms and tested throught some examples. The results showed that the new algorithm was superior and feasible.

关键词： Dynamic Load Distribution Active Request fault-tolerant algorithm CAN

来源：评论

学校读者我要写书评

暂无评论

fault-tolerant grid frequency measurement algorithm during transientsInspec keywordsOther keywords

IET ENERGY SYSTEMS INTEGRATION

引用

IET ENERGY SYSTEMS INTEGRATION 2020年第3期2卷 173-178页

作者： Zhan, Lingwei Xiao, Bailu Li, Fuhua Yin, He Yao, Wenxuan Li, Zhi Liu, Yilu Oak Ridge Natl Lab One Bethel Valley RdPOB 2008 Oak Ridge TN 37831 USA Univ Tennessee Dept Elect Engn & Comp Sci EECS 1520 Middle Dr Knoxville TN 37996 USA

Many critical electric grid operations rely on accurate grid frequency measurements. Unfortunately, the measurement accuracy can be easily undermined by power system transient faults. During a power system transient fault, the power grid voltages and currents are usually highly distorted by high-frequency components. What is worse, the power grid signals could have discontinuity during some system transient faults such as phase angle jump, and the discontinuity could result in large measurement errors to state-of-the-art grid measurement algorithms. In this study, a fault-tolerant grid frequency measurement algorithm during transients is proposed. The new algorithm consists of two stages. The first stage is a transient detector, and it can detect the occurrence of system transient faults instantaneously. The second stage is the intelligent frequency estimator, and it will adapt its measurements according to the transient detector. The performance of the algorithm is evaluated under different steady-state and transient conditions. Both dependability and security of the fault-tolerant algorithm are assessed by using PSCAD simulation data and IEEE Standard test data.

关键词： power system measurement power grids frequency measurement measurement errors frequency estimation IEEE standards power supply quality power system CAD fault-tolerant grid frequency measurement algorithm critical electric grid operations accurate grid frequency measurements measurement accuracy power system transient fault power grid voltages high-frequency components power grid signals system transient faults measurement errors state-of-the-art grid measurement algorithms transient detector transient conditions fault-tolerant algorithm

来源：评论

学校读者我要写书评

暂无评论

Fractional-Order Finite-Time, fault-tolerant Control of Nonlinear Hydraulic-Turbine-Governing Systems with an Actuator fault

引用

ENERGIES 2020年第15期13卷 3812页

作者： Yang, Ying Wang, Bin Tian, Yuqiang Chen, Peng Northwest A&F Univ Coll Water Resources & Architectural Engn Dept Elect Engn Yangling 712100 Shaanxi Peoples R China Northwest A&F Univ Minist Educ Key Lab Agr Soil & Water Engn Arid & Semiarid Are Yangling 712100 Shaanxi Peoples R China

Hydropower units undertake tasks such as peak shaving, frequency modulation, and providing accident reserves in the power system. With the increasing capacity and structural complexity of power systems, hydropower units have become more important. Hydraulic-turbine-governing systems (HTGSs) need to have higher control performance and automation levels to meet the higher regulatory requirements of the power system. To achieve high-quality control, we proposed a new finite-time, fault-tolerant control method for HTGSs with an actuator fault. First, a fractional-order model for HTGSs with uncertainty, external disturbance, and an actuator fault was introduced. Second, a fault estimator that could quickly track the fault signal for an actuator fault was proposed. Then, based on the fractional-order finite-time stability theorem, a finite-time, fault-tolerant controller was proposed for the stabilization of an HTGS. Furthermore, a controller was developed as a fractional differential form combined with a smooth bounded arctangent function to effectively suppress jitters and uncertainties. Finally, numerical experimental results verified the validity and robustness of the proposed scheme.

关键词： fractional-order modeling hydraulic-turbine-governing systems fault estimator finite-time stability fault-tolerant algorithm actuator fault

来源：评论

学校读者我要写书评

暂无评论

On the Message Complexity of fault-tolerant Computation: Leader Election and Agreement

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2023年第4期34卷 1115-1127页

作者： Kumar, Manish Molla, Anisur Rahaman Indian Stat Inst Kolkata 700108 West Bengal India

This article investigates the message complexity of two fundamental problems, leader election and agreement in the crash-fault synchronous and fully-connected distributed network. We present randomized (Monte Carlo) algorithms for both the problems and also show non-trivial lower bounds on the message complexity. Our algorithms achieve sublinear message complexity in the so-called implicit version of the two problems when tolerating more than a constant fraction of the faulty nodes. In comparison to the state-of-art, our results improved and extended the works of [Gilbert-Kowalski, SODA'10] (which studied only the agreement problem) in several directions. Specifically, our algorithms tolerate any number of faulty nodes up to (n - polylog n). The message complexity (and also the time complexity) of our algorithms is optimal (up to a polylog n factor). Further, our algorithm works in anonymous networks, where nodes do not know each other. To the best of our knowledge, these are the first sub-linear results for both the leader election and the agreement problem in the crash-fault distributed networks.

关键词： Complexity theory Voting fault tolerant systems fault tolerance Computer crashes Peer-to-peer computing Protocols Distributed algorithm randomized algorithm fault-tolerant algorithm crash-fault leader election agreement message complexity

来源：评论

学校读者我要写书评

暂无评论

Efficient fault-tolerant Information Barrier Coverage in Internet of Things

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2021年第12期20卷 7963-7976页

作者： He, Shibo Chen, Jiming Shu, Yuanchao Cui, Xianbin Shi, Kun Wei, Chunjuan Shi, Zhiguo Zhejiang Univ State Key Lab Ind Control Technol Hangzhou 310027 Peoples R China Shanghai Univ Elect Power Sch Elect & Informat Engn Shanghai 200090 Peoples R China Zhejiang Univ Coll Informat Sci & Elect Engn Hangzhou 310027 Peoples R China

Information barrier coverage has been widely adopted to prevent unauthorized invasion of important areas in Internet of Things. As sensors are typically placed outdoors, they are susceptible to getting faulty. Previous works assumed that faulty sensors are easy to recognize, e.g., they may stop functioning or output apparently deviant sensory data. In practice, there exist multiple types of fault that sensors may have during operation. It is, thereby, difficult to recognize faulty sensors as well as their invalid output and attain accurate intrusion detection. We, in this paper, propose a novel fault-tolerant intrusion detection algorithm (TrusDet) based on trust management to address this challenging issue. TrusDet comprises of three steps: i) sensor-level detection, ii) sink-level decision by collective voting, and iii) trust management and fault determination. In the Step i) and ii), TrusDet divides the surveillance area into a set of fine-grained subareas and exploits temporal and spatial correlation of sensory output among sensors in different subareas to yield a more accurate and robust performance of information barrier coverage. In the Step iii), TrusDet builds a trust management based framework to determine the confidence level of sensors being faulty. We implement TrusDet on HC-SR501 infrared sensors, and design hardware and software to build a practical detection system. Extensive experimental results and simulation results validate the information coverage model and demonstrate that TrusDet has a very low false alarm rate.

关键词： Sensors Intrusion detection Trust management Sensor fusion fault tolerant systems Internet of Things Surveillance Intrusion detection information barrier coverage fault-tolerant algorithm

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: On the Message Complexity of fault-tolerant Computation: Leader Election and Agreement 21

Brief Announcement: On the Message Complexity of Fault-Toler...

引用

40th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)

作者： Kumar, Manish Molla, Anisur Rahaman Indian Stat Inst Kolkata India

ISBN: (纸本)9781450385480

This paper investigates on the message complexity of the two fundamental problems, namely, leader election and agreement in the crash-fault synchronous and fully-connected distributed network. We present randomized algorithms for both the problems and also develop non-trivial lower bounds on the message complexity. In the so-called implicit version of the two problems, our algorithms achieve sublinear message complexity while tolerating more than a constant fraction of faulty nodes. The algorithms work in anonymous networks, where nodes do not know each other. Specifically, our main results are: (1) A randomized leader election algorithm which elects a leader with high probability in a complete network with n nodes, in which at least [alpha n] nodes are non-faulty and the remaining can be faulty, where alpha >= (log(2) n)In. The time complexity of the algorithm is O(log n/alpha) rounds and message complexity is O((n(0.5) log(2.5) n)/alpha(2.5)) with high probability (i.e., with probability >= 1 - 1/n). A non-trivial lower bound of Omega (n(0.)(5)/alpha(1.5)) messages for any leader election algorithm that tolerates at most (1- alpha)-fraction faulty nodes and succeeds with high probability. (2) A randomized algorithm, tolerating at most left perpendicular(1 - alpha)nright perpendicular faulty nodes, solves agreement in O (log n/alpha) rounds and with high probability uses only O ((n(0.5) log(1.5)n)/alpha(1.)(5)) messages. A match- ing lower bound (up to a polylog n factor) of Omega(n(0.)(5)/alpha(1.5)) messages for any agreement algorithm that tolerates at most (1-alpha)-fraction faulty nodes and succeeds with high probability. A full version of the paper is available at [17].

关键词： Distributed algorithm randomized algorithm fault-tolerant algorithm crash-fault leader election agreement message complexity

来源：评论

学校读者我要写书评

暂无评论

On the Message Complexity of fault-tolerant Computation: Leader Election and Agreement 23

On the Message Complexity of Fault-Tolerant Computation: Lea...

引用

24th International Conference on Distributed Computing and Networking (ICDCN)

作者： Kumar, Manish Molla, Anisur Rahaman Indian Stat Inst Kolkata India

ISBN: (纸本)9781450397964

Our paper investigates the message complexity of two fundamental problems, leader election and agreement, in the crash-fault synchronous and fully-connected distributed network. We present randomized algorithms for both the problems and also show non-trivial lower bounds on the message complexity. Our algorithms achieve sublinear message complexity in the so-called implicit version of the two problems when tolerating more than a constant fraction of the faulty nodes. In comparison to the state-of-art, our results improved and extended the works of [Gilbert-Kowalski, SODA'10] (which studied only the agreement problem) in several directions. Specifically, our algorithms tolerate any number of faulty nodes up to (n - polylog n). The message complexity (and also the time complexity) of our algorithms is optimal (up to a polylog n factor). Further, our algorithm works in anonymous networks, where nodes do not know each other. To the best of our knowledge, these are the first sublinear results for both the leader election and the agreement problem in the crash-fault distributed networks. A full version of the paper is available at [3]

关键词： Distributed algorithm randomized algorithm fault-tolerant algorithm crash-fault leader election agreement message complexity

来源：评论

学校读者我要写书评

暂无评论

fault-tolerant Graph Realizations in the Congested Clique, Revisited 19th

Fault-Tolerant Graph Realizations in the Congested Clique, R...

引用

19th International Conference on Distributed Computing and Intelligent Technology (ICDCIT)

作者： Kumar, Manish Indian Stat Inst Kolkata India

ISBN: (纸本)9783031248474;9783031248481

We study the graph realization problem in the Congested Clique in a distributed network under the crash-fault model. We focus on the degree-sequence realization, each node v is associated with a degree value d(v), and the resulting degree sequence is realizable if it is possible to construct an overlay network with the given degrees. This paper focuses on the message and round complexity of deterministic graph realization in the anonymous network. It has been shown by Kumar et al. [ALGOSENSORS 2022] that the graph realization can be solved using O(n(2)) message and O(f) round without the knowledge of f, of which f nodes could be faulty (f < n). However, their algorithm works for KT1 (Knowledge Till 1 hop) model where nodes know their neighbors' IDs;or in the KT0 (Knowledge Till 0 hop) model, in which each node knows the IDs of all the nodes in the clique, but doesn't know which port is connecting to which node-ID. In this paper, we extend the result to KT0 when the network is anonymous, i.e., the IDs of the neighboring nodes are unknown. We present an algorithm that solves the graph realization problem in the KT0 model with matching performance guarantees as in the KT1 model.

关键词： Graph realizations Congested-Clique Distributed algorithm fault-tolerant algorithm Crash fault Time complexity Message complexity

来源：评论

学校读者我要写书评

暂无评论

fault-tolerant Dispersion of Mobile Robots 9th

Fault-Tolerant Dispersion of Mobile Robots

引用

9th International Conference on algorithms and Discrete Applied Mathematics (CALDAM)

作者： Chand, Prabhat Kumar Kumar, Manish Molla, Anisur Rahaman Sivasubramaniam, Sumathi Indian Stat Inst Kolkata India

ISBN: (纸本)9783031252105;9783031252112

We consider the mobile robot dispersion problem in the presence of faulty robots (crash-fault). Mobile robot dispersion consists of k <= n robots in an n-node anonymous graph. The goal is to ensure that regardless of the initial placement of the robots over the nodes, the final configuration consists of having at most one robot at each node. In a crash-fault setting, up to f <= k robots may fail by crashing arbitrarily and subsequently lose all the information stored at the robots, rendering them unable to communicate. In this paper, we solve the dispersion problem in a crash-fault setting by considering two different initial configurations: i) the rooted configuration, and ii) the arbitrary configuration. In the rooted case, all robots are placed together at a single node at the start. The arbitrary configuration is a general configuration (a.k.a. arbitrary configuration in the literature) where the robots are placed in some l < k clusters arbitrarily across the graph. For the first case, we develop an algorithm solving dispersion in the presence of faulty robots in O(k(2)) rounds, which improves over the previous O(f center dot min(m, k Delta))-round result by [23]. For the arbitrary configuration, we present an algorithm solving dispersion in O((f + l) center dot min(m, k Delta, k(2))) rounds, when the number of edges m and the maximum degree. of the graph is known to the robots.

关键词： Distributed algorithm Mobile robot Dispersion fault-tolerant algorithm Crash-fault Round complexity Memory complexity

来源：评论

学校读者我要写书评

暂无评论

fault-tolerant Graph Realizations in the Congested Clique 1

引用

18th International Symposium on algorithmics of Wireless Networks

作者： Kumar, Manish Molla, Anisur Rahaman Sivasubramaniam, Sumathi Indian Stat Inst Kolkata India

ISBN: (数字)9783031220500

ISBN: (纸本)9783031220494;9783031220500

In this paper, we study the graph realization problem in the Congested Clique model of distributed computing under crash faults. We consider degree-sequence realization, in which each node v is associated with a degree value d(v), and the resulting degree sequence is realizable if it is possible to construct an overlay network with the given degrees. Our main result is a O(f)-round deterministic algorithm for the degree-sequence realization problem in a n-node Congested Clique, of which f nodes could be faulty (f < n). The algorithm uses O(n(2)) messages. We complement the result with lower bounds to show that the algorithm is tight w.r.t the number of rounds and the messages simultaneously. We also extend our result to the Node Capacitated Clique (NCC) model, where each node is restricted to sending and receiving at-most O(log n) messages per round. In the NCC model, our algorithm solves degree-sequence realization in O(nf/ log n) rounds and O(n(2)) messages. For both settings, our algorithms work without the knowledge of f, the number of faults. To the best of our knowledge, these are the first results for the graph realization problem in the crash-fault distributed network.

关键词： Graph realizations Congested-Clique Distributed algorithm fault-tolerant algorithm Crash fault Time complexity Message complexity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：