Primary Traffic Based Cooperative Multihop Relaying with Preliminary Farthest Relay Selection in Cognitive Radio Ad Hoc Networks


IEICE TRANSACTIONS on Communications   Vol.E95-B   No.8   pp.2586-2599
Publication Date: 2012/08/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.2586
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
underlay spectrum access,  overlay spectrum access,  cooperative transmission,  quality of service (QoS),  status of the primary traffic,  

Full Text: PDF>>
Buy this Article

We propose a primary traffic based multihop relaying algorithm with cooperative transmission (PTBMR-CT). It enlarges the hop transmission distances to reduce the number of cognitive relays on the route from the cognitive source (CS) to the cognitive destination (CD). In each hop, from the cognitive nodes in a specified area depending on whether the primary source (PS) transmits data to the primary destination (PD), the cognitive node that is farthest away from the cognitive relay that sends data is selected as the other one that receives data. However, when the PS is transmitting data to the PD, from the cognitive nodes in a specified area, another cognitive node is also selected and prepared to be the cognitive relay that receives data of cooperative transmission. Cooperative transmission is performed if the PS is still transmitting data to the PD when the cognitive relay that receives data of the next hop transmission is being searched. Simulation results show that the average number of cognitive relays is reduced by PTBMR-CT compared to conventional primary traffic based farthest neighbor relaying (PTBFNR), and PTBMR-CT outperforms conventional PTBFNR in terms of the average end-to-end reliability, the average end-to-end throughput, the average required transmission power of transmitting data from the CS to the CD, and the average end-to-end transmission latency.