Delay-Throughput Tradeoff for Supportive Two-Tier Networks

dc.creatorGao, Long
dc.creatorZhang, Rui
dc.creatorYin, Changchuan
dc.creatorCui, Shuguang
dc.date2008-12-28
dc.date.accessioned2026-07-07T12:22:57Z
dc.date.available2026-07-07T12:22:57Z
dc.descriptionConsider a static wireless network that has two tiers with different priorities: a primary tier vs. a secondary tier. 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. By allowing the secondary tier to route the packets for the primary tier, we show that the primary tier can achieve a throughput scaling of $λ_p(n)=Θ(1/\log n)$ per node and a delay-throughput tradeoff of $D_p(n)=Θ(\sqrt{n^β\log n}λ_p(n))$ for $λ_p(n)=O(1/\log n)$, while the secondary tier still achieves the same optimal delay-throughput tradeoff as a stand-alone network.
dc.description5 pages, 1 figure, submitted to ISIT 2009
dc.identifierhttps://arxiv.org/abs/0812.4826
dc.identifierhttp://arxiv.org/abs/0812.4826
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/213833
dc.subjectInformation Theory
dc.subjectNetworking and Internet Architecture
dc.titleDelay-Throughput Tradeoff for Supportive Two-Tier Networks
dc.typetext

Files

Collections