A lower bound for radio broadcast

For a positive integer k with 1 ≤ k ≤ q , a radio k -coloring of a simple connected graph G = ( V ( G ) , E ( G ) ) is a mapping f : V ( G ) { 0 , 1 , 2 , } such that | f ( u ) - f ( v ) | k + 1 - d ( u , v ) for each pair of distinct vertices u , v V ( ...

We derive an upper bound on the capacity of cognitive radio using the interference temperature concept. We do not assume any cooperation between the primary and the secondary user. First, assuming all four links associated with the primary/secondary ...