Proceedings of the 12th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems 2009
DOI: 10.1145/1641804.1641857
|View full text |Cite
|
Sign up to set email alerts
|

Generalized analysis of a distributed energy efficient algorithm for change detection

Abstract: An energy efficient distributed Change Detection scheme based on Page's CUSUM algorithm was presented in [2]. In this paper we consider a nonparametric version of this algorithm. In the algorithm in [2], each sensor runs CUSUM and transmits only when the CUSUM is above some threshold. The transmissions from the sensors are fused at the physical layer. The channel is modeled as a Multiple Access Channel (MAC) corrupted with noise. The fusion center performs another CUSUM to detect the change. In this paper, we … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2010
2010
2014
2014

Publication Types

Select...
5
1

Relationship

5
1

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 18 publications
(28 reference statements)
0
7
0
Order By: Relevance
“…Finally, depending on the choice of I or D (based on whether (3) or (5) is used at the fusion center), some of the μ l 's can be negative or zero. Taking these factors into account, we have developed an approximation for E DD which works quite well for L > 1 (see [4]). However, in the following we use a somewhat different approach which is useful in more general scenario also.…”
Section: G Computation Of E Ddmentioning
confidence: 99%
“…Finally, depending on the choice of I or D (based on whether (3) or (5) is used at the fusion center), some of the μ l 's can be negative or zero. Taking these factors into account, we have developed an approximation for E DD which works quite well for L > 1 (see [4]). However, in the following we use a somewhat different approach which is useful in more general scenario also.…”
Section: G Computation Of E Ddmentioning
confidence: 99%
“…By finding solution to the integral equation obtained via renewal arguments [18], we can obtain the mean 1/λ β of first passage time, τ β (as done in [1], [2]). Let L(s) be the mean of τ β with F 0 0 = s and S k = log [g 1 (Y k ) /g 0 (Y k )] + D 0 .…”
Section: A P F a Analysismentioning
confidence: 99%
“…Sequential hypothesis testing finds out whether the primary is ON or OFF, while the sequential change point detection detects the point when the primary turns ON (or OFF). Sequential change detection is well studied (see [2], [10], [12], [14] and the references therein). However the optimal solution in the distributed setup is still not available.…”
Section: Introductionmentioning
confidence: 99%
“…This has the advantage of requiring less power and bandwidth in transmission, but is suboptimal since the fusion centre has to take a decision based on less information. This kind of problems have been studied in [2], [5], [6], [7] and [8]. * This work was partially supported by a grant from ANRC.…”
Section: Introductionmentioning
confidence: 99%