论文标题
具有确定性调度的无线网络的覆盖概率
Coverage probability in wireless networks with determinantal scheduling
论文作者
论文摘要
我们为随机调度网络传输提出了一种新的算法。这个想法是使用（离散的）确定点过程（子集）随机分配潜在发射机的各种{\ em排斥}子集的媒介访问。这种方法可以看作是（空间）aloha的自然扩展，该扩展是独立安排传输的。在一般的路径损失模型和瑞利褪色下，我们表明，与Aloha类似，它们也需要对覆盖率概率和传输尝试的优雅分析（也称为局部延迟）。这主要是由于确定过程的拉普拉斯功能的条件（棕榈）分布和闭合形式表达式的明确，决定性形式。有趣的是，网络的派生性能特征可与计划参数的各种优化（确定性内核）进行调整，从而允许使用用于确定过程的统计学习技术开发的技术。确定过程的公认采样算法可用于应对实施问题，这超出了本文的范围，但它为进一步的研究创造了途径。
We propose a new class of algorithms for randomly scheduling network transmissions. The idea is to use (discrete) determinantal point processes (subsets) to randomly assign medium access to various {\em repulsive} subsets of potential transmitters. This approach can be seen as a natural extension of (spatial) Aloha, which schedules transmissions independently. Under a general path loss model and Rayleigh fading, we show that, similarly to Aloha, they are also subject to elegant analysis of the coverage probabilities and transmission attempts (also known as local delay). This is mainly due to the explicit, determinantal form of the conditional (Palm) distribution and closed-form expressions for the Laplace functional of determinantal processes. Interestingly, the derived performance characteristics of the network are amenable to various optimizations of the scheduling parameters, which are determinantal kernels, allowing the use of techniques developed for statistical learning with determinantal processes. Well-established sampling algorithms for determinantal processes can be used to cope with implementation issues, which is is beyond the scope of this paper, but it creates paths for further research.
