Show simple item record

AuthorHussain S.I.
AuthorAlouini M.-S.
AuthorQaraqe K.
AuthorHasna , Mazen
Available date2022-04-26T11:06:54Z
Publication Date2012
Publication NameIEEE International Conference on Communications
ResourceScopus
Identifierhttp://dx.doi.org/10.1109/ICC.2012.6364595
URIhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84871956061&doi=10.1109%2fICC.2012.6364595&partnerID=40&md5=7b034b49f24393ded9085aa8b8281dda
URIhttp://hdl.handle.net/10576/30524
AbstractBest relay selection is a bandwidth efficient technique for multiple relay environments without compromising the system performance. The problem of relay selection is more challenging in underlay cognitive networks due to strict interference constraints to the primary users. Generally, relay selection is done on the basis of maximum end-to-end signal to noise ratio (SNR). However, it requires large amounts of channel state information (CSI) at different network nodes. In this paper, we present and analyze a reactive relay selection scheme in underlay cognitive networks where the relays are operating with fixed gains near a primary user. The system model minimizes the amount of CSI required at different nodes and the destination selects the best relay on the basis of maximum relay to destination SNR. We derive close form expressions for the received SNR statistics, outage probability, bit error probability and average channel capacity of the system. Simulation results are also presented to confirm the validity of the derived expressions.
SponsorQatar National Research Fund
Languageen
PublisherIEEE
SubjectBandwidth efficient
Best-relay selections
Bit error probability
Cognitive network
Fixed-gain relays
Interference constraints
Network node
Outage probability
Relay selection
System models
Bit error rate
Signal to noise ratio
TitleReactive relay selection in underlay cognitive networks with fixed gain relays
TypeConference Paper
Pagination1784-1788
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record