Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Broadcast Design in Cognitive Radio Ad Hoc NetworksQoS-based Broadcast Protocol Under Blind Information in Cognitive Radio Ad Hoc Networks

Broadcast Design in Cognitive Radio Ad Hoc Networks: QoS-based Broadcast Protocol Under Blind... [In this book, we consider a CR ad hoc network where N SUs and K PUs co-exist in an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $L\times L$ \end{document} area, as shown in Fig. 2.1. PUs are distributed within the area under the probability density function (pdf) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $f_{G}(g)$ \end{document}. For simplicity, in this book, we consider that PUs are evenly distributed. The SUs opportunistically access M licensed channels. In Fig. 2.1, the solid circle represents the transmission range of a SU with a radius of rc. Other SUs within the transmission range are considered as the neighboring nodes of the corresponding SU. That is, only when a SU receiver is within the transmission range of a SU transmitter, the signal-to-noise ratio (SNR) at the SU receiver is considered to be acceptable for reliable communications.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Broadcast Design in Cognitive Radio Ad Hoc NetworksQoS-based Broadcast Protocol Under Blind Information in Cognitive Radio Ad Hoc Networks

Download PDF
23 pages

Loading next page...
 
/lp/springer-journals/broadcast-design-in-cognitive-radio-ad-hoc-networks-qos-based-sqVM8z1bbY
Publisher
Springer International Publishing
Copyright
© The Author(s) 2014
ISBN
978-3-319-12621-0
Pages
13 –36
DOI
10.1007/978-3-319-12622-7_2
Publisher site
See Chapter on Publisher Site

Abstract

[In this book, we consider a CR ad hoc network where N SUs and K PUs co-exist in an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $L\times L$ \end{document} area, as shown in Fig. 2.1. PUs are distributed within the area under the probability density function (pdf) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $f_{G}(g)$ \end{document}. For simplicity, in this book, we consider that PUs are evenly distributed. The SUs opportunistically access M licensed channels. In Fig. 2.1, the solid circle represents the transmission range of a SU with a radius of rc. Other SUs within the transmission range are considered as the neighboring nodes of the corresponding SU. That is, only when a SU receiver is within the transmission range of a SU transmitter, the signal-to-noise ratio (SNR) at the SU receiver is considered to be acceptable for reliable communications.]

Published: Dec 5, 2014

Keywords: Blind Information; Channel Hopping Sequence; Broadcast Scheme; Broadcast Delay; Rendezvous Channel

There are no references for this article.