|
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 generalize the algorithm to also include nonparametric CUSUM and provide a unified analysis.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
S. Asmussen, "Subexponential asymptotics for stochastic processes: extremal behavior, stationary distribution and first passage probabilities", Ann. Appl. Prob. Vo. 8, No. 2, pp. 354--374, 1998.
|
| |
2
|
T. Banerjee, V. Kavitha and V. Sharma, "Energy efficient change detection over a MAC using physical layer fusion", In Proc. of IEEE ICASSP, Las Vegas, Apr. 2008.
|
| |
3
|
O.J. Boxma and J.W. Cohen, "The Single Server Queue: Heavy Tails and Heavy Traffic In self-similar Network Traffic and Performance Evaluation, K. Park and W. Willinger (ed.), Wiley, N.Y., 2000.
|
| |
4
|
B.E. Brodsky and B.S. Darkhovsky, "Nonparametric methods in change point problems", Kluwer Acad. Pub.s, Springer, 1993.
|
| |
5
|
J.-F. Chamberland and V.V. Veeravalli, "Detection in Sensor Networks", IEEE Sig. Proc. Magazine, May 2007.
|
| |
6
|
T.L. Lai, "Sequential Change Point Detection in Quality Control and Dynamical Systems", Journal of the Royal
|
| |
7
|
Statistical Society, Series B (Methodological), Vol. 57, No. 4, pp. 613--658, 1995.
|
| |
8
|
K.B. Lataief and W. Zhang, "Cooperative Spectrum Sensing in Cognitive Wireless Communication Networks, (ed.) E. Hossain and V.K. Bhargava, Springer, 2007.
|
| |
9
|
G. Lorden, "Procedures for reacting to a change in distribution", Ann. Math. Statist. Vol. 41, pp. 1897--1908, 1971.
|
| |
10
|
A. Luceno and J. Puig-Pey, "Evaluation of the run-length probability distribution for CUSUM charts: assessing chart performance", Technometrics, Vol. 42, No. 4, pp. 411--416, 2000.
|
| |
11
|
Y. Mei, "Information bounds and quickest change detection in decentralized decision systems", IEEE Trans. on I. T., Vol. 51, pp. 2669--2681, Jul. 2005 IEEE Trans. on Sig. Proc., Vol. 54, No. 2, Feb. 2006.
|
| |
12
|
G.V. Moustakides, "Optimal stopping times for detecting changes in distribution", Ann. Statist. 14 1379--1387, 1986.
|
| |
13
|
E.S. Page, "Continuous inspection schemes", Biometrica, Vol. 41, No. 1/2, pp. 100--115, Jun. 1954.
|
| |
14
|
H. Rootzen, "Maxima and exceedances of stationary Markov chains", Adv. in Appl. Prob., Vol. 20, No. 2, pp. 371--390, Jun. 1998.
|
| |
15
|
S. Ross, "Stochastic Processes",2nd Ed., Wiley, 1996.
|
| |
16
|
V. Sharma and A.K. Jaya Prakasam, "An efficient algorithm for cooperative spectrum sensing in cognitive radio networks", in Proc. National Conf. on Comm. (NCC) Jan. 2009, Guwahati, India.
|
| |
17
|
A.N. Shiryaev, "On optimal methods in quickest detection problems", Theory Probab. Appl., Vol. 8, pp. 22--46, 1963.
|
| |
18
|
R. Tantra and A. Sahai, "SNR walls for signal detection", IEEE Jour. on Selected Topics in Signal Proc., Vol. 2, pp. 4--17, Feb. 2008.
|
| |
19
|
A. Tartakovsky and V.V. Veeravalli, "Quickest change detection in distributed sensor systems", Proc. of the 6th Int. Sym. on Inf. Fusion, Australia, Jul. 2003,. 756--763
|
| |
20
|
V.V. Veeravalli. "Decentralized quickest change detection", IEEE Trans. on IT, 47(4): 1657--65, May 2001.
|
| |
21
|
L. Zacharias and R. Sundaresan, "Decentralized sequential change detection using physical layer fusion", Proc. ISIT, France, Jun. 2007.
|
|