arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1209.6577physics.ins-detastro-ph.IMcs.DC
收藏

Cosmic Ray事件检测分布式算法的设计权衡

Exploring Design Tradeoffs Of A Distributed Algorithm For Cosmic Ray Event Detection

Suhail Yousaf, Rena Bakhshi, Maarten van Steen, Spyros Voulgaris, John L. Kelley

摘要:

许多传感器网络,包括大型粒子探测器阵列测量高能宇宙射线空气簇射,传统上依赖于集中式触发算法,以找到空间和时间的巧合的各个节点。这样的方案遭受可扩展性问题,特别是如果节点无线通信或具有带宽限制。然而,原则上,相互通信的节点可以使用分布式算法来自己找到重合事件,而无需与中央节点通信。我们提出了这样一个算法,并考虑各种设计权衡,在俄歇工程无线电阵列(AERA)的潜在触发的背景下。

英文摘要:

Many sensor networks, including large particle detector arrays measuring high-energy cosmic-ray air showers, traditionally rely on centralised trigger algorithms to find spatial and temporal coincidences of individual nodes. Such schemes suffer from scalability problems, especially if the nodes communicate wirelessly or have bandwidth limitations. However, nodes which instead communicate with each other can, in principle, use a distributed algorithm to find coincident events themselves without communication with a central node. We present such an algorithm and consider various design tradeoffs involved, in the context of a potential trigger for the Auger Engineering Radio Array (AERA).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑