Collision-Aware Decision Fusion in Distributed Detection Using Reliability-Splitting Algorithms

Laitrakun, Seksan; Coyle, Eugene

doi:10.1109/milcom.2014.178

Cited by 5 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Under these parameter setups, the ROC of the CA-Rao test is optimized at M = 2. Unlike other relevant schemes such as [9] and [16], increasing M further deteriorates the ROC of the CARao test. The reason can be explained as follows.…”

Section: A Receiver Operating Characteristicsmentioning

confidence: 86%

“…Similar to [16]- [18], a collision time slot is meaningful and recognized. Specifically, a collision time slot indicates that there are two or more sensor nodes whose observations x ∈ (τ m−1 , τ m ].…”

Section: Sensor-censoring Random Accessmentioning

confidence: 99%

“…The derivations of I q i and ∂ log Pr(z;qi) ∂qi are shown in Appendix A and Appendix B, respectively. By putting (16) and (17) into (7), we obtain the CA-Rao test (6).…”

Section: Proof: the Rao Test Is Derived From [10]mentioning

confidence: 99%

“…However, with a proper transmission and censoring strategy, these collisions can provide useful information. Other distributed detection schemes have used the information in packet collisions in their fusion rules [16]- [18].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Collision-aware composite hypothesis testing in random-access WSNs with sensor censoring

Laitrakun

Coyle

2015

2015 International Computer Science and Engineering Conference (ICSEC)

Self Cite

View full text Add to dashboard Cite

We consider a distributed composite hypothesis testing problem in which sensor nodes share a collision channel to send their decisions and the fusion center (FC) has a limited time to collect these decisions. When the FC does not have enough time to collect all local decisions successfully, we propose a transmission protocol called sensor censoring random access as the multiple access scheme used by sensor nodes to send their decisions to the FC. By using this protocol, the collection time is divided into frames, where each frame consists of a number of time slots. The sensor nodes whose observations are within a specific range will send their decisions in a specific frame by using slotted ALOHA. Thereafter, we derive a Rao test used by the FC to decide whether the event is happening. Since this Rao test is aware of packet collisions and exploits them to make a global decision, we call it a collision-aware Rao test (CA-Rao test). Its asymptotic performance (the probabilities of detection and false alarm) is determined. The receiver operating characteristics of the CA-Rao test are evaluated and compared to those of a Rao test of distributed detection using parallel access channels.

show abstract

Section: A Receiver Operating Characteristicsmentioning

confidence: 86%

Section: Sensor-censoring Random Accessmentioning

confidence: 99%

“…The derivations of I q i and ∂ log Pr(z;qi) ∂qi are shown in Appendix A and Appendix B, respectively. By putting (16) and (17) into (7), we obtain the CA-Rao test (6).…”

Section: Proof: the Rao Test Is Derived From [10]mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations