首页> 外文会议>IEEE Global Communications Conference >Joint channel assignment and opportunistic routing for maximizing throughput in cognitive radio networks
【24h】

Joint channel assignment and opportunistic routing for maximizing throughput in cognitive radio networks

机译:联合信道分配和机会路由,以最大化认知无线电网络中的吞吐量

获取原文
获取外文期刊封面目录资料

摘要

In this paper, we consider the joint opportunistic routing and channel assignment problem in multi-channel multi-radio (MCMR) cognitive radio networks (CRNs) for improving aggregate throughput of the secondary users. We first present the linear programming optimization model for this joint problem, taking into account the feature of CRNs-channel uncertainty. Then considering the queue state of a node, we propose a new scheme to select proper forwarding candidates for opportunistic routing. Furthermore, a new algorithm for calculating the forwarding probability of any packet at a node is proposed, which is used to calculate how many packets a forwarder should send, so that the duplicate transmission can be reduced compared with MAC-independent opportunistic routing & encoding (MORE) [11]. Our numerical results show that the proposed scheme performs significantly better that traditional routing and opportunistic routing in which channel assignment strategy is employed.
机译:在本文中,我们考虑了多信道多无线电(MCMR)认知无线电网络(CRN)中的联合机会路由和信道分配问题,以提高次要用户的总吞吐量。考虑到CRNs通道不确定性的特征,我们首先提出针对该联合问题的线性规划优化模型。然后考虑节点的队列状态,我们提出了一种新的方案来为机会路由选择适当的转发候选。此外,提出了一种计算节点上任何数据包转发概率的新算法,该算法用于计算转发器应发送多少个数据包,从而与独立于MAC的机会路由和编码相比,可以减少重复传输(更多)[11]。我们的数值结果表明,与采用信道分配策略的传统路由和机会路由相比,该方案的性能要好得多。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号