Author
Abstract
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.
Suggested Citation
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:16:y:2020:i:7:p:1550147720940204. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.