arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.02570cs.ITmath.COmath.IT
收藏

跳频干扰的组合模型

A Combinatorial Model of Interference in Frequency Hopping Schemes

Mwawi M. Nyirenda, Siaw-Lynn Ng, Keith M. Martin

摘要:

在跳频(FH)方案中,用户使用在同一组频率信道上定义的FH序列同时通信。FH序列指定在通信进行时要使用的频率信道。许多关于跳频方案性能的研究是基于成对相互干扰或对抗性干扰,而不是两者兼而有之。在本文中,我们评估的性能的跳频方案方面的两个组明智的相互干扰和对抗性干扰(干扰),请记住,两个以上的用户可能会同时发送在干扰机的存在。建立了无覆盖码和跳频方案之间的对应关系。这给出了传输容量的下限。此外,我们指定一个干扰机模型,并考虑什么额外的属性覆盖免费的代码应该有抵抗干扰机。我们证明,一个纯粹的组合方法是不足以对付这样的干扰,但与使用的伪随机性,我们可以有一个系统,具有高吞吐量,以及对干扰的安全性。

英文摘要:

In a frequency hopping (FH) scheme users communicate simultaneously using FH sequences defined on the same set of frequency channels. An FH sequence specifies the frequency channel to be used as communication progresses. Much of the research on the performance of FH schemes is based on either pairwise mutual interference or adversarial interference but not both. In this paper, we evaluate the performance of an FH scheme with respect to both group-wise mutual interference and adversarial interference (jamming), bearing in mind that more than two users may be transmitting simultaneously in the presence of a jammer. We establish a correspondence between a cover-free code and an FH scheme. This gives a lower bound on the transmission capacity. Furthermore, we specify a jammer model and consider what additional properties a cover-free code should have to resist the jammer. We demonstrate that a purely combinatorial approach is inadequate against such a jammer, but that with the use of pseudorandomness, we can have a system that has high throughput as well as security against jamming.

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

↑