Reliability-Based Splitting Algorithms for Time-Constrained Distributed Detection in Random-Access WSNs

摘要

We consider distributed detection applications for a wireless sensor network (WSN) that has a limited time to collect and process local decisions to produce a global decision. When this time is not sufficient to collect decisions from all nodes in the network, a strategy is needed for collecting those with the highest reliability. This can be accomplished by incorporating a reliability-based splitting algorithm into the random access protocol of the WSN: the collection time is divided into frames and only nodes with a specified range of reliabilities compete for the channel using slotted ALOHA within each frame—nodes with the most reliable decisions attempt transmission in the first frame, nodes with the next most reliable set of decisions attempt in the next frame, etc. The detection error probability (DEP) of the proposed scheme is minimized, and the efficacy is maximized by determining the reliability intervals that define which nodes attempt to transmit in each frame. Intervals that maximize the channel throughput do not always minimize the DEP or maximize the efficacy. Because the scheme orders transmissions of the local decisions in approximately descending order of reliability but suffers collisions, it will offer better performance than a collision-free scheme with no reliability ordering when the time constraint prevents transmission of all local decisions. The transition point between the two schemes is found by deriving the asymptotic relative efficiency (ARE) of the proposed scheme relative to a TDMA-based scheme.