Sequential detection of disjoint subgraphs over Boolean MAC channels: A probabilistic approach
In this paper, we consider a new framework under which a sequential subgraph construction and thus detection is achieved via communications among a set of active nodes following a random codebook over a Boolean noiseless multiple access (MAC) channel. Based on a probabilistically generated codebook and shared between transmitters and receiver, the receiver sequentially removes edges or vertices from a graph built in precedent slots to gradually form a particular labeled graph. Analysis of both the distribution and average of the stopping time are provided for several simple but non-trivial cases. The proposed approach for computing average stopping time in constructing a given subgraph whose supporting codewords sets form an intersection graph with loops can be extended for larger and more complex topologies.
Publication Source (Journal or Book title)
2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings
Bayat, F., & Wei, S. (2016). Sequential detection of disjoint subgraphs over Boolean MAC channels: A probabilistic approach. 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings https://doi.org/10.1109/GLOCOMW.2016.7849044