• DocumentCode
    2976198
  • Title

    Delay-throughput tradeoff for supportive two-tier networks

  • Author

    Long Gao ; Shuguang Cui ; Yin, Changchuan ; Cui, Shuguang

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Texas A&M Univ., College Station, TX, USA
  • fYear
    2009
  • fDate
    June 28 2009-July 3 2009
  • Firstpage
    2833
  • Lastpage
    2837
  • Abstract
    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 = nbeta with beta ges 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 lambdap(n) = Theta(1/log n) per node and a delay-throughput tradeoff of Dp(n) = Theta (radic(nbeta log nlambdap(n))) for lambdap(n) = O (1/log n), while the secondary tier still achieves the same optimal delay-throughput tradeoff as a stand-alone network.
  • Keywords
    cognitive radio; delays; random processes; telecommunication network routing; optimal delay-throughput tradeoff; packet routing; randomly distributed cognitive node; spectrum access; static wireless network; two-tier network; Cognitive radio; Computer networks; Explosives; Interference; Large-scale systems; Measurement; Protocols; Spread spectrum communication; Throughput; Wireless networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2009. ISIT 2009. IEEE International Symposium on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-4312-3
  • Electronic_ISBN
    978-1-4244-4313-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2009.5205252
  • Filename
    5205252