Seksan Laitrakun

Learn More
We consider a distributed detection application for a fusion center that has a limited time to make a global decision by collecting, weighting, and fusing local decisions made by nodes in a wireless sensor network that uses a random access channel. When this time is not long enough to collect decisions from all nodes in the network, a strategy is needed for(More)
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(More)
We consider a large, single-hop, wireless sensor network performing distributed detection under time and bandwidth constraints. The fusion center (FC) has a limited time to collect binary local decisions, which are sent through a shared transmission channel. Assume that the allocated collection time is not large enough to collect the local decisions from(More)
We consider distributed estimation algorithms in a large Wireless Sensor Network (WSN) with a star topology. The local estimates computed by each sensor must be collected in a fixed amount of time by the network's Fusion Center (FC) and processed to produce a global estimate. When the amount of time available is not sufficient to collect a local estimate(More)
We consider distributed detection applications for a fusion center that has a limited time to collect, weight and fuse local decisions to produce a global decision in a wireless sensor network that uses a random access protocol. When this time is not long enough to collect decisions from all nodes in the network, a strategy is needed for collecting those(More)
We consider the problem of distributed detection in a large, single-hop, wireless sensor network in which the fusion center (FC) is not able to collect observations from all sensor nodes. We propose an ordered sequential detection algorithm that combines a reliability-based splitting algorithm, an ordered transmission strategy, and a sequential probability(More)
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(More)
We consider a distributed detection problem in a large, single-hop, wireless sensor network. Because of limited collection time and bandwidth, the fusion center (FC) is not able to collect the local observations from all sensor nodes. A distributed detection scheme with a selection strategy and a capability to operate in a finite bandwidth is required. We(More)
Power Allocation (PA) strategies are evaluated for distributed detection in a single-hop, multiple-ring cluster. The Detection Error Probability (DEP) is affected by the observation Signal-to-Noise Ratios (SNRs), the channel SNRs, and node distances. We seek the PA maximizing the total expected deflection coefficient of the received signals at the fusion(More)