首页> 外文会议>IEEE International Conference on Advanced Networks and Telecommunications Systems >On-demand routing for multimedia communication through Cognitive Radio Networks using sample division multiplexing
【24h】

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.
机译:我们建议分布式点播通过认知无线电网络(CRN)路由多媒体通信方案的小说。基本技术是基于样品分复用(SDM)以实现通过源和目的地节点之间的多个路由多媒体通信[2],使得沿着所有这样的路由流的总和等于源 - 之间的所需流量目的地对。与此相反,以[1],其中集中式最大流算法已被使用,我们在这里提出了一种基于分布式算法用于通过放松相同的网络结构的限制的寻找具有所需流量的多个路由协议在假定[1] 。所提出的协议为O的最坏情况下的时间复杂度(| E |×DN),| E |是所述网络的边缘的数量和DN是用于进行通信的多媒体信号,这比在[1]的集中式算法的也不太需要的信道数。上不同的网络结构的模拟结果,然而,揭示了,所提出的协议的平均时间复杂度大于上述的最坏情况的时间复杂度小得多。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号