Title:
Distributed detection and estimation with reliability-based splitting algorithms in random-access networks
Distributed detection and estimation with reliability-based splitting algorithms in random-access networks
| dc.contributor.advisor | Coyle, Edward J. | |
| dc.contributor.author | Laitrakun, Seksan | |
| dc.contributor.committeeMember | Blough, Douglas M. | |
| dc.contributor.committeeMember | Ma, Xiaoli | |
| dc.contributor.committeeMember | Zhang, Fumin | |
| dc.contributor.committeeMember | Mei, Yajun | |
| dc.contributor.department | Electrical and Computer Engineering | |
| dc.date.accessioned | 2015-01-12T20:44:28Z | |
| dc.date.available | 2015-01-12T20:44:28Z | |
| dc.date.created | 2014-12 | |
| dc.date.issued | 2014-08-18 | |
| dc.date.submitted | December 2014 | |
| dc.date.updated | 2015-01-12T20:44:28Z | |
| dc.description.abstract | We design, analyze, and optimize distributed detection and estimation algorithms in a large, shared-channel, single-hop wireless sensor network (WSN). The fusion center (FC) is allocated a shared transmission channel to collect local decisions/estimates but cannot collect all of them because of limited energy, bandwidth, or time. We propose a strategy called reliability-based splitting algorithm that enables the FC to collect local decisions/estimates in descending order of their reliabilities through a shared collision channel. The algorithm divides the transmission channel into time frames and the sensor nodes into groups based on their observation reliabilities. Only nodes with a specified range of reliabilities compete for the channel using slotted ALOHA within each frame. Nodes with the most reliable decisions/estimates attempt transmission in the first frame; nodes with the next most reliable set of decisions/estimates attempt in the next frame; etc. The reliability-based splitting algorithm is applied in three scenarios: time-constrained distributed detection; sequential distributed detection; and time-constrained estimation. Performance measures of interest - including detection error probability, efficacy, asymptotic relative efficiency, and estimator variance - are derived. In addition, we propose and analyze algorithms that exploit information from the occurrence of collisions to improve the performance of both time-constrained distributed detection and sequential distributed detection. | |
| dc.description.degree | Ph.D. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1853/53008 | |
| dc.language.iso | en_US | |
| dc.publisher | Georgia Institute of Technology | |
| dc.subject | Distributed detection | |
| dc.subject | Distributed estimation | |
| dc.subject | Random access | |
| dc.subject | Slotted ALOHA | |
| dc.subject | Reliability-based splitting algorithms | |
| dc.title | Distributed detection and estimation with reliability-based splitting algorithms in random-access networks | |
| dc.type | Text | |
| dc.type.genre | Dissertation | |
| dspace.entity.type | Publication | |
| local.contributor.advisor | Coyle, Edward J. | |
| local.contributor.corporatename | School of Electrical and Computer Engineering | |
| local.contributor.corporatename | College of Engineering | |
| relation.isAdvisorOfPublication | 6c9b6c7c-ee7d-4d93-9156-e60c42373f8c | |
| relation.isOrgUnitOfPublication | 5b7adef2-447c-4270-b9fc-846bd76f80f2 | |
| relation.isOrgUnitOfPublication | 7c022d60-21d5-497c-b552-95e489a06569 | |
| thesis.degree.level | Doctoral |