An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem

Chakaravarthy, Venkatesan T.; Choudhury, Anamitra R.; Garg, Vijay K.; Sabharwal, Yogish

doi:10.1007/978-3-642-17679-1_5

Cited by 7 publications

(13 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We only consider the case where the number of triggers is much greater than the number of nodes, i.e.,

(for

, the works in [ 1 , 2 , 3 ] solve the problem with

messages using spanning trees).…”

Section: Ddr-coin Algorithmmentioning

confidence: 99%

“…Chakaravarthy et al proposed a near optimal DTC algorithm called LayeredRand [ 1 ]. The message complexity and MaxRcvLoad of this algorithm are

and

, respectively [ 1 ]. In [ 2 ], they proposed two DTC algorithms, which can be considered as an improvement of [ 1 ].…”

Section: Related Workmentioning

confidence: 99%

“…Assume that from external sources, w triggers arrive at the n nodes, and that no statistical information about the triggers is given to the system in advance. We consider the case where the number of triggers is much greater than the number of nodes, i.e.,

(If

, the number of triggers can be easily aggregated using a spanning tree of nodes [ 1 , 2 , 3 ]). The distributed trigger counting (DTC) problem is to raise an alarm when the total number of detected triggers by the n nodes reaches to w .…”

Section: Introductionmentioning

confidence: 99%

“…Table 1 summarizes the comparison results between previous work and DDR-coin. We use the following performance metrics to evaluate our algorithm, which are also used in previous work [ 1 , 2 , 3 , 17 ].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

DDR-coin: An Efficient Probabilistic Distributed Trigger Counting Algorithm

Kim¹,

Park

2020

Sensors

View full text Add to dashboard Cite

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(nlogn(w/n)) in average. MaxRcvLoad—the maximum number of received messages to detect w triggers in each node—is O(logn(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.

show abstract

“…We only consider the case where the number of triggers is much greater than the number of nodes, i.e.,

(for

, the works in [ 1 , 2 , 3 ] solve the problem with

messages using spanning trees).…”

Section: Ddr-coin Algorithmmentioning

confidence: 99%

“…Chakaravarthy et al proposed a near optimal DTC algorithm called LayeredRand [ 1 ]. The message complexity and MaxRcvLoad of this algorithm are

and

, respectively [ 1 ]. In [ 2 ], they proposed two DTC algorithms, which can be considered as an improvement of [ 1 ].…”

Section: Related Workmentioning

confidence: 99%

(If

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

DDR-coin: An Efficient Probabilistic Distributed Trigger Counting Algorithm

Kim¹,

Park

2020

Sensors

View full text Add to dashboard Cite

show abstract

“…log n log (w=n)) O(n log n log (w=n)) LayeredRand14 O(n log n log w) O(log n log w)CompTreeRand 21 O(n log w(log log n) 2 ) -CompTreeDet 21 O(n(log w log n) 2 ) O((log w log n) 2 ) CoinRand14 O(n(log w + log n)) O(log w + log n) RingRand14 O(n log n log w) O(log n log w) TreeFill O(n log (w=n)) O(log (w=n))The algorithms of Emek and Korman 21 are the bounds for arbitrary networks.…”

mentioning

confidence: 99%

An optimal distributed trigger counting algorithm for large-scale networked systems

et al. 2013

View full text Add to dashboard Cite

Distributed trigger counting (DTC) is a problem related to the detection of w triggers with n nodes in large-scale distributed systems that have general characteristics of complex adaptive systems. The triggers come from an external source, and no a priori information about the triggers is given. DTC algorithms can be used for distributed monitoring and global snapshots. When designing an efficient DTC algorithm, the following goals should be considered: minimizing the overall message complexity and distributing the loads for detecting triggers among nodes. In this paper, we propose a randomized algorithm called TreeFill, which satisfies the message complexity of O(n log(w=n)) with high probability. The maximum number of received messages to detect w triggers in each node is O(log(w=n)) with high probability. These results satisfy the lower bounds of DTC problems. We prove the upper bounds of TreeFill. The performance of TreeFill is also evaluated by means of an agent-based simulation using NetLogo. The simulation results show that TreeFill uses about 54-69% of the messages used in a previous work called CoinRand. The maximum number of received messages in each node of TreeFill is also smaller than that in the previous work.

show abstract

Distributed trigger counting algorithms for arbitrary network topology

Chang

Tsai

2016

Wireless Communications

View full text Add to dashboard Cite

The distributed trigger counting (DTC) problem is a fundamental block for many distributed applications. Particularly, such a problem is to raise an alert while the number of triggers received by the whole system reaches a pre‐defined amount. There have been a few algorithms proposed to solve the DTC problem in the literature. However, these existing algorithms are all under the assumption that each process knows what kind of network topology the whole system forms as well as playing distinct kind of role in the system. The foregoing assumption is not practical for wireless sensor networks because the network topology of a wireless sensor network cannot be obtained in advance, and the roles of all processes are basically identical during the computation. In this paper, we propose a novel distributed algorithm to solve the DTC problem, free of any aforementioned global assumption. Moreover, in order to reduce the message complexity of our algorithm, we further propose a more message‐efficient version, only with one extra requirement that all processes have learned ahead the number of processes in the system. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem

Cited by 7 publications

References 9 publications

DDR-coin: An Efficient Probabilistic Distributed Trigger Counting Algorithm

DDR-coin: An Efficient Probabilistic Distributed Trigger Counting Algorithm

An optimal distributed trigger counting algorithm for large-scale networked systems

Distributed trigger counting algorithms for arbitrary network topology

Contact Info

Product

Resources

About