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

Laitrakun, Seksan; Coyle, Eugene

doi:10.1109/tsp.2014.2352606

Cited by 20 publications

(19 citation statements)

References 31 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: 87%

“…In many papers [1]- [9], the distributions of the observations taken by the sensor nodes under both hypotheses (H 0 and H 1 ) are assumed to be known. The distribution of the observations under H 0 (i.e., the event does not happen) can be acquired by applying a learning method when the WSN is initially deployed in the area.…”

Section: Introductionmentioning

confidence: 99%

“…However, under limited bandwidth conditions, such as a shared collision channel 1 , we encounter an additional problem of transmission scheduling because which nodes will send their decisions to the FC is unknown in advance. Random access has been used for distributed detection with sensor censoring [6]- [9] since no transmission scheduling is required. As an inherent characteristic of random access, these distributed detection schemes encounter packet collisions, treat them as transmission errors, and ignore them in fusion rules.…”

Section: Introductionmentioning

confidence: 99%

See 2 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: 87%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

show abstract

“…It can make up for the defects of railway status monitoring systems based on wired communication, and improve the efficiency of monitoring. However, the transmission bandwidth of WSN is small, so it is not suitable for application in monitoring areas with large transmission volume [2][3][4][5].…”

Section: Introductionmentioning

confidence: 99%

Optimal Energy Resources Allocation Method of Wireless Sensor Networks for Intelligent Railway Systems

Bin

Sun

2020

Sensors

View full text Add to dashboard Cite

The rapid increase of train speed has brought greater challenges to the safety and reliability of railway systems. Therefore, it is necessary to monitor the operation status of trains, infrastructure, and their operating environment in real time. Because the operation environment of railway systems is complex, the construction cost of wired monitoring systems is high, and it is difficult to achieve full coverage in the operation area of harsh environments, so wireless sensor networks are suitable for the status monitoring of railway systems. Energy resources of nodes are the basis of ensuring the lifecycle of wireless sensor networks, but severely restrict the sustainability of wireless sensor networks. A construction method of special wireless sensor networks for railway status monitoring, and an optimal energy resources allocation method of wireless sensor networks for intelligent railway systems are proposed in this paper. Through cluster head selection and rotating probability model, clustering generation and optimization model, and partial coverage model, the energy consumption of nodes can be minimized and balanced. The result of simulation experiment proved that the lifetime of wireless sensor networks can be maximized by the optimal energy resources allocation method based on clustering optimization and partial coverage model, based on polynomial time algorithm.

show abstract

“…For example, slotted-Aloha has been applied to schedule local decision transmissions in distributed detection whose local decisions are transmitted over a shared collision channel. [24][25][26][27][28]…”

Section: Introductionmentioning

confidence: 99%

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

Laitrakun

2020

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

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.

show abstract

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

Cited by 20 publications

References 31 publications

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

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

Optimal Energy Resources Allocation Method of Wireless Sensor Networks for Intelligent Railway Systems

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

Contact Info

Product

Resources

About