Decision fusion for composite hypothesis testing in wireless sensor networks over a shared and noisy collision channel

Abstract

<jats:p> We consider the composite hypothesis testing problem of time-bandwidth-constrained distributed detection. In this scenario, the probability distribution of the observed signal when the event of interest is happening is unknown. In addition, local decisions are censored and only those uncensored local decisions will be sent to the fusion center over a shared and noisy collision channel. The fusion center also has a limited time duration to collect transmitted decisions and make a final decision. Two types of medium access control that the sensor nodes apply to send their decisions are investigated: time division multiple access and slotted-Aloha. Unlike using the time division multiple access protocol, the slotted-Aloha-based distributed detection will experience packet collisions. However, in this article, since only uncensored decisions are sent, packet collisions are informative. We derive fusion rules according to generalized likelihood ratio test, Rao test, and Wald test for both the time division multiple access–based distributed detection and the slotted-Aloha-based distributed detection. We see that the fusion rules for the slotted-Aloha-based distributed detection here also exploit packet collisions in the final decision-making. In addition, the asymptotic performances and energy consumption of both schemes are analyzed. Extensive simulation and numerical results are provided to compare the performances of these two schemes. We show that, for a given time delay, the slotted-Aloha-based distributed detection can outperform the time division multiple access–based distributed detection by increasing the number of sensor nodes which results in higher energy consumption. </jats:p>

Monitoring of Discolored Trees Caused by Pine Wilt Disease Based on Unsupervised Learning with Decision Fusion Using UAV Images

“…Finally, the final extraction result was obtained by decision fusion. Decision fusion is generally achieved through algebraic operations such as maximum, mean and majority vote (MV) [23][24][25]. We adopt the MV method for decision fusion.…”

Distributed Detection in Wireless Sensor Networks Under Multiplicative Fading via Generalized Score Tests

“…First, the design complexity of the quantizer thresholds grows exponentially [13], [14] and, second, the sensor LR cannot be evaluated due to unknown target parameters [14]. Hence, the bit reported is either the outcome of a raw-measurement quantization [15], [16], [17] or represents the inferred binary-valued event (via sub-optimal detection statistics [18]).…”

Bandwidth-Constrained Decentralized Detection of an Unknown Vector Signal via Multisensor Fusion

“…The uncooperative-target case has been recently analyzed also in an online setup with a sequential version of the above fusion (one-bit) rule [27]. Furthermore, [28], [31] have applied the Rao test to collision-aware reporting for fusion design. Finally, locally most-powerful tests have been applied to decentralized detection of sparse signals in (generalized) Gaussian noise [29], [30].…”