...
首页> 外文期刊>Wireless personal communications: An Internaional Journal >QoS Guaranteed Causal Ordering Group Communication for Cognitive Radio Ad Hoc Networks
【24h】

QoS Guaranteed Causal Ordering Group Communication for Cognitive Radio Ad Hoc Networks

机译:认知无线电自组织网络的QoS保证的因果排序组通信

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we discuss the QoS guaranteed causal ordering group communication for cognitive radio (CR) ad hoc networks. The issue of causal ordering has been studied extensively by previous works. However, these works considered the problem at the transport layer and the methods in the works incurred high communication overhead and the long latency for message delivery. In this paper, we discuss the causal ordering at the network layer. The problem of our concern is: given a QoS group communication request in a CR ad hoc network, how to set up the connection so that the causal ordering of the group communication can be preserved, and the bandwidth consumption of the communication is minimized under the condition that the QoS requirement is satisfied. In this paper, we focus on the bandwidth requirement. We propose a two-phase method to solve the problem. In the method, we first construct a multicast tree for the communication, and then assign slots for all tree links. It is proved that the method can preserve the causal ordering of messages without extra communication overhead nor the latency for delivering messages. Simulations are conducted to show the performance of our proposed method.
机译:在本文中,我们讨论了认知无线电(CR)ad hoc网络的QoS保证因果排序组通信。因果排序问题已被以前的著作广泛研究。但是,这些工作在传输层考虑了问题,并且工作中的方法导致高通信开销和消息传递的长等待时间。在本文中,我们讨论了网络层上的因果顺序。我们关心的问题是:在CR ad hoc网络中给定QoS组通信请求的情况下,如何建立连接以保留组通信的因果顺序,并在以下情况下使通信的带宽消耗最小化满足QoS要求的条件。在本文中,我们关注带宽需求。我们提出了一种两阶段方法来解决该问题。在该方法中,我们首先构造用于通信的多播树,然后为所有树链接分配时隙。证明了该方法可以保持消息的因果顺序,而没有额外的通信开销或传递消息的等待时间。进行仿真以显示我们提出的方法的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号