Computer Science – Information Theory
Scientific paper
2008-12-28
Computer Science
Information Theory
5 pages, 1 figure, submitted to ISIT 2009
Scientific paper
Consider 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^\beta$ with $\beta\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 $\lambda_p(n)=\Theta(1/\log n)$ per node and a delay-throughput tradeoff of $D_p(n)=\Theta(\sqrt{n^\beta\log n}\lambda_p(n))$ for $\lambda_p(n)=O(1/\log n)$, while the secondary tier still achieves the same optimal delay-throughput tradeoff as a stand-alone network.
Cui Shuguang
Gao Long
Yin Changchuan
Zhang Rui
No associations
LandOfFree
Delay-Throughput Tradeoff for Supportive Two-Tier Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Delay-Throughput Tradeoff for Supportive Two-Tier Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Delay-Throughput Tradeoff for Supportive Two-Tier Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-478276