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

支持型两层网络中的吞吐量和时延缩放

Throughput and Delay Scaling in Supportive Two-Tier Networks

Long Gao, Rui Zhang, Changchuan Yin, Shuguang Cui

摘要:

考虑一个无线网络,它有两个不同优先级的层:一个主层和一个辅助层,这是随着认知无线电技术的发展而出现的一种新兴网络场景。主层由密度为$n$的随机分布的传统节点组成,其具有接入频谱的绝对优先级。次级层由随机分布的具有$β\geq 2$的密度$m=n^β$的认知节点组成,其只能机会性地接入频谱以限制对初级层的干扰。基于允许从层为主层路由分组的假设,研究了在主节点和从节点均为静态以及从节点移动时主节点和从节点的吞吐量和延迟缩放定律。与建议的协议为两层,我们表明,主层可以实现每个节点的吞吐量缩放$λ_p(n)=Θ(1/\log n)$在上述两种情况下。在第一种情况下的相关延迟分析中,我们表明主层可以通过$λ_p(n)=O(1/\log n)$实现$D_p(n)=Θ(\sqrt{n^β\log n}λ_p(n))$的延迟缩放。在第二种情况下,考虑用于辅节点的两个移动性模型:i.i.d.移动性模型和随机游走模型,我们表明,主要层可以实现的延迟缩放定律$Θ(1)$和$Θ(1/S)$,分别,其中$S$是随机游走步长。第二层的吞吐量和延迟缩放定律也建立,这是一个独立的网络相同。

英文摘要:

Consider a wireless network that has two tiers with different priorities: a primary tier vs. a secondary tier, which is an emerging network scenario with the advancement of cognitive radio technologies. The primary tier consists of randomly distributed legacy nodes of density $n$, which have an absolute priority to access the spectrum. The secondary tier consists of randomly distributed cognitive nodes of density $m=n^β$ with $β\geq 2$, which can only access the spectrum opportunistically to limit the interference to the primary tier. Based on the assumption that the secondary tier is allowed to route the packets for the primary tier, we investigate the throughput and delay scaling laws of the two tiers in the following two scenarios: i) the primary and secondary nodes are all static; ii) the primary nodes are static while the secondary nodes are mobile. With the proposed protocols for the two tiers, we show that the primary tier can achieve a per-node throughput scaling of $λ_p(n)=Θ(1/\log n)$ in the above two scenarios. In the associated delay analysis for the first scenario, we show that the primary tier can achieve a delay scaling of $D_p(n)=Θ(\sqrt{n^β\log n}λ_p(n))$ with $λ_p(n)=O(1/\log n)$. In the second scenario, with two mobility models considered for the secondary nodes: an i.i.d. mobility model and a random walk model, we show that the primary tier can achieve delay scaling laws of $Θ(1)$ and $Θ(1/S)$, respectively, where $S$ is the random walk step size. The throughput and delay scaling laws for the secondary tier are also established, which are the same as those for a stand-alone network.

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

↑