.png){kind=icon}
返回
DDR-coin: An Efficient Probabilistic Distributed Trigger Counting Algorithm
.png){kind=icon}
OA
AI
DOI：10.3390/s20226446.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A distributed trigger counting (DTC) problem is to detect w triggers in the distributed system consisting of n nodes. DTC algorithms can be used for monitoring systems using sensors to detect a significant global change. When designing an efficient DTC algorithm, the following goals should be considered; minimizing the whole number of exchanged messages used for counting triggers and even distribution of communication loads among nodes. In this paper, we present an efficient DTC algorithm, DDR-coin (Deterministic Detection of Randomly generated coins). The message complexity-the total number of exchanged messages-of DDR-coin is O(nlog(n)(w/n)) in average. MaxRcvLoad-the maximum number of received messages to detect w triggers in each node-is O(log(n)(w/n)) on average. DDR-coin is not an exact algorithm; even though w triggers are received by the n nodes, it can fail to raise an alarm with a negligible probability. However, DDR-coin is more efficient than exact DTC algorithms on average and the gap between those is increased for larger n. We implemented the prototype of the proposed scheme using NetLogo 6.1.1. We confirmed that experimental results are close to our mathematical analysis. Compared with the previous schemes-TreeFill, CoinRand, and RingRand- DDR-coin shows smaller message complexity and MaxRcvLoad.
Keyword:
distributed trigger counting
distributed algorithm
probabilistic algorithm
distributed systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
分享收藏分享收藏D2R-TED: Data-Domain ReductionModel for Threshold-Based Event Detection in Sensor Networks.png)
SENSORSOAAI
SENSORSIF3.5
OAAI分享收藏New <i>Spa</i> Types among MRSA and MSSA Isolates in North of Iran伊朗北部MRSA和MSSA分离株中的新型Spa类型
OAAI
OAAI分享收藏
查看更多内容