DocumentCode
2043976
Title
Collaborative quickest detection in adhoc networks with delay constraint - part I: Two-node network
Author
Li, Husheng ; Li, Chengzhi ; Dai, Huaiyu
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Tennessee Univ., Knoxville, TN
fYear
2008
fDate
19-21 March 2008
Firstpage
594
Lastpage
599
Abstract
Collaborative quickest detection is used to detect a certain distribution change in an adhoc network, in which there is no data fusion center and local decisions need to be made at all nodes. A two-thread cumulative sum (CUSUM) algorithm is proposed for a simple two-node network. The corresponding performance, particularly the performance gain induced by collaboration, is analyzed. Numerical results are provided to verify the theoretical analysis.
Keywords
ad hoc networks; delays; ad hoc networks; collaborative quickest detection; delay constraint; distribution change; two-node network; two-thread cumulative sum algorithm; Change detection algorithms; Collaboration; Machinery; Performance analysis; Performance gain; Phase detection; Phase frequency detector; Sampling methods; Sensor fusion; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on
Conference_Location
Princeton, NJ
Print_ISBN
978-1-4244-2246-3
Electronic_ISBN
978-1-4244-2247-0
Type
conf
DOI
10.1109/CISS.2008.4558594
Filename
4558594
Link To Document