On-demand routing for multimedia communication through Cognitive Radio Networks using sample division multiplexing

We propose a novel distributed on-demand routing scheme for multimedia communication through Cognitive Radio Networks (CRN). The basic technique is to effect the multimedia communication through multiple routes between the source and the destination nodes based on Sample Division Multiplexing (SDM) [2] such that the sum of flow along all such routes is equal to the required flow between the source-destination pair. In contrast to [1] where a centralized Max-Flow algorithm has been used, we propose here a protocol based on distributed algorithms for finding the multiple routes with the required flow by relaxing same of the constraints on the network structure assumed in [1]. The proposed protocol has a worst-case time complexity of O(|E| × DN), |E| being the number of edges of the network and DN being the number of channels required for communicating a multimedia signal, which is also less than that of the centralized algorithm in [1]. Simulation results on different network structures, however, reveal that the average time complexity of the proposed protocol is much smaller than the above worst-case time complexity.