Group testing for binary Markov sources

Data-driven group queries for cooperative sensor networks

Yao Win Peter Hong, Anna Scaglione

Research output: Contribution to journalArticle

Abstract

Group testing has been used in many applications to efficiently identify rare events in a large population. In this paper, the concept of group testing is generalized to applications with correlated source models to derive scheduling policies for sensors' adopting cooperative transmissions. The tenet of our work is that in a wireless sensor network it is advantageous to allocate the same channel dimensions to all sensor sources that have the same response to a sequence of queries or tests. That is, nodes that have the same data attributes should transmit as a cooperative super-source. Specifically, we consider the case where sensors' data are modeled spatially as a one-dimensional Markov chain. Two strategies are considered: the recursive algorithm and the tree-based algorithm. The recursive scheme allows us to illustrate the performance of group testing for finite populations while the tree-based algorithm is used to derive the achievable scaling performances of the class of group testing strategies as the number of sensors increases. We show that the total number of queries required to gather all sensors' data scales in the order of the joint entropy. A further generalization of this concept provides the basis of deriving efficient data-gathering algorithms for correlated sources.

Original languageEnglish (US)
Pages (from-to)3538-3551
Number of pages14
JournalIEEE Transactions on Information Theory
Volume54
Issue number8
DOIs
StatePublished - Aug 2008
Externally publishedYes

Fingerprint

Sensor networks
Sensors
Testing
Group
entropy
scaling
Trees (mathematics)
scheduling
performance
Markov processes
Wireless sensor networks
Entropy
Scheduling
event

Keywords

  • Aggregates
  • Algorithm design and analysis
  • Array signal processing
  • AWGN
  • Blood
  • Broadcasting
  • Channel capacity
  • Channel coding
  • Computer architecture
  • Computer networks
  • Computers
  • Cooperative communications
  • Correlation
  • Data gathering in sensor networks
  • Data models
  • Delay
  • Distributed databases
  • Distributed source coding
  • DNA
  • Entropy
  • Equations
  • Gain
  • Group testing
  • Image coding
  • Indexes
  • Job shop scheduling
  • Libraries
  • Mathematical model
  • Multiple access
  • Noise
  • Object recognition
  • Partitioning algorithms
  • Quality control
  • Random variables
  • Receivers
  • Reliability
  • Routing
  • Schedules
  • Source coding
  • Spatial resolution
  • Stochastic processes
  • Synchronization
  • Testing
  • Transceivers
  • Transmitters
  • Wireless sensor networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Information Systems

Cite this

Group testing for binary Markov sources : Data-driven group queries for cooperative sensor networks. / Hong, Yao Win Peter; Scaglione, Anna.

In: IEEE Transactions on Information Theory, Vol. 54, No. 8, 08.2008, p. 3538-3551.

Research output: Contribution to journalArticle

@article{5c0a1a9341ff4bfc8c71f35c3c0488de,
title = "Group testing for binary Markov sources: Data-driven group queries for cooperative sensor networks",
abstract = "Group testing has been used in many applications to efficiently identify rare events in a large population. In this paper, the concept of group testing is generalized to applications with correlated source models to derive scheduling policies for sensors' adopting cooperative transmissions. The tenet of our work is that in a wireless sensor network it is advantageous to allocate the same channel dimensions to all sensor sources that have the same response to a sequence of queries or tests. That is, nodes that have the same data attributes should transmit as a cooperative super-source. Specifically, we consider the case where sensors' data are modeled spatially as a one-dimensional Markov chain. Two strategies are considered: the recursive algorithm and the tree-based algorithm. The recursive scheme allows us to illustrate the performance of group testing for finite populations while the tree-based algorithm is used to derive the achievable scaling performances of the class of group testing strategies as the number of sensors increases. We show that the total number of queries required to gather all sensors' data scales in the order of the joint entropy. A further generalization of this concept provides the basis of deriving efficient data-gathering algorithms for correlated sources.",
keywords = "Aggregates, Algorithm design and analysis, Array signal processing, AWGN, Blood, Broadcasting, Channel capacity, Channel coding, Computer architecture, Computer networks, Computers, Cooperative communications, Correlation, Data gathering in sensor networks, Data models, Delay, Distributed databases, Distributed source coding, DNA, Entropy, Equations, Gain, Group testing, Image coding, Indexes, Job shop scheduling, Libraries, Mathematical model, Multiple access, Noise, Object recognition, Partitioning algorithms, Quality control, Random variables, Receivers, Reliability, Routing, Schedules, Source coding, Spatial resolution, Stochastic processes, Synchronization, Testing, Transceivers, Transmitters, Wireless sensor networks",
author = "Hong, {Yao Win Peter} and Anna Scaglione",
year = "2008",
month = "8",
doi = "10.1109/TIT.2008.926363",
language = "English (US)",
volume = "54",
pages = "3538--3551",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

TY - JOUR

T1 - Group testing for binary Markov sources

T2 - Data-driven group queries for cooperative sensor networks

AU - Hong, Yao Win Peter

AU - Scaglione, Anna

PY - 2008/8

Y1 - 2008/8

N2 - Group testing has been used in many applications to efficiently identify rare events in a large population. In this paper, the concept of group testing is generalized to applications with correlated source models to derive scheduling policies for sensors' adopting cooperative transmissions. The tenet of our work is that in a wireless sensor network it is advantageous to allocate the same channel dimensions to all sensor sources that have the same response to a sequence of queries or tests. That is, nodes that have the same data attributes should transmit as a cooperative super-source. Specifically, we consider the case where sensors' data are modeled spatially as a one-dimensional Markov chain. Two strategies are considered: the recursive algorithm and the tree-based algorithm. The recursive scheme allows us to illustrate the performance of group testing for finite populations while the tree-based algorithm is used to derive the achievable scaling performances of the class of group testing strategies as the number of sensors increases. We show that the total number of queries required to gather all sensors' data scales in the order of the joint entropy. A further generalization of this concept provides the basis of deriving efficient data-gathering algorithms for correlated sources.

AB - Group testing has been used in many applications to efficiently identify rare events in a large population. In this paper, the concept of group testing is generalized to applications with correlated source models to derive scheduling policies for sensors' adopting cooperative transmissions. The tenet of our work is that in a wireless sensor network it is advantageous to allocate the same channel dimensions to all sensor sources that have the same response to a sequence of queries or tests. That is, nodes that have the same data attributes should transmit as a cooperative super-source. Specifically, we consider the case where sensors' data are modeled spatially as a one-dimensional Markov chain. Two strategies are considered: the recursive algorithm and the tree-based algorithm. The recursive scheme allows us to illustrate the performance of group testing for finite populations while the tree-based algorithm is used to derive the achievable scaling performances of the class of group testing strategies as the number of sensors increases. We show that the total number of queries required to gather all sensors' data scales in the order of the joint entropy. A further generalization of this concept provides the basis of deriving efficient data-gathering algorithms for correlated sources.

KW - Aggregates

KW - Algorithm design and analysis

KW - Array signal processing

KW - AWGN

KW - Blood

KW - Broadcasting

KW - Channel capacity

KW - Channel coding

KW - Computer architecture

KW - Computer networks

KW - Computers

KW - Cooperative communications

KW - Correlation

KW - Data gathering in sensor networks

KW - Data models

KW - Delay

KW - Distributed databases

KW - Distributed source coding

KW - DNA

KW - Entropy

KW - Equations

KW - Gain

KW - Group testing

KW - Image coding

KW - Indexes

KW - Job shop scheduling

KW - Libraries

KW - Mathematical model

KW - Multiple access

KW - Noise

KW - Object recognition

KW - Partitioning algorithms

KW - Quality control

KW - Random variables

KW - Receivers

KW - Reliability

KW - Routing

KW - Schedules

KW - Source coding

KW - Spatial resolution

KW - Stochastic processes

KW - Synchronization

KW - Testing

KW - Transceivers

KW - Transmitters

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=48849088039&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=48849088039&partnerID=8YFLogxK

U2 - 10.1109/TIT.2008.926363

DO - 10.1109/TIT.2008.926363

M3 - Article

VL - 54

SP - 3538

EP - 3551

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 8

ER -