Sequential Detection of Disjoint Subgraphs over Boolean MAC Channels: A Probabilistic Approach
Sequential Detection of Disjoint Subgraphs over Boolean MAC Channels: A Probabilistic Approach
复制标题
布尔 MAC 通道上不相交子图的顺序检测：概率方法
DOI：
10.1109/glocomw.2016.7849044
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Shuangqing Wei
中科院分区：
文献类型：
--
作者：
Farhang Bayat;Shuangqing Wei
在本文中，我们考虑了一个新框架，在该框架下，在布尔无噪音多访问（MAC）通道上的随机代码簿之后，通过在一组活动节点之间进行通信来实现一个顺序的子图结构，从而实现了检测。基于概率生成的代码簿并在发射器和接收器之间共享，接收器将从内置的先例插槽内置的图形删除边缘或顶点，以逐渐形成特定的标记图。为几个简单但非平凡的情况提供了对停止时间的分布和平均值的分析。在构建给定子图的平均停止时间的建议方法可以扩展与循环的交叉图相交图，以扩展到更大，更复杂的拓扑。
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.