A Multihop Cooperative Routing Algorithm for Minimzing the Number of Hops in Spectrum Sharing Networks

I-Te Lin, Iwao Sasase · 2011

We propose a multihop cooperative routing (MCR) algorithm that extends the lengths of the $x$ axis projections of the hop distances and finds the multihop route that minimizes the number of hops in spectrum sharing networks. The cognitive relay and the cognitive receiver of each hop except the last

Read the paper · More papers on PaperTik