认知无线电自组网的因果排序群通信

Liming Xie, X. Jia, Kunxiao Zhou
{"title":"认知无线电自组网的因果排序群通信","authors":"Liming Xie, X. Jia, Kunxiao Zhou","doi":"10.1109/INFCOMW.2011.5928900","DOIUrl":null,"url":null,"abstract":"In this paper, we discuss the causal ordering group communication for cognitive radio (CR) networks. The issue of causal ordering has been studied extensively by previous works. However, these works considered the problem at the application 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 group communication request in a CR 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. We propose a two-phase method to solve it. 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.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":" 37","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Causal ordering group communication for cognitive radio ad hoc networks\",\"authors\":\"Liming Xie, X. Jia, Kunxiao Zhou\",\"doi\":\"10.1109/INFCOMW.2011.5928900\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we discuss the causal ordering group communication for cognitive radio (CR) networks. The issue of causal ordering has been studied extensively by previous works. However, these works considered the problem at the application 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 group communication request in a CR 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. We propose a two-phase method to solve it. 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.\",\"PeriodicalId\":402219,\"journal\":{\"name\":\"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\" 37\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOMW.2011.5928900\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2011.5928900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文讨论了认知无线电(CR)网络中的因果顺序群通信。因果排序问题已被前人广泛研究。然而,这些工作考虑的是应用层的问题,其中的方法带来了较高的通信开销和较长的消息传递延迟。本文讨论了网络层的因果排序问题。我们关注的问题是:在CR网络中,给定一个组通信请求,如何建立连接,使组通信的因果顺序保持不变,并使通信的带宽消耗最小。我们提出了一个两阶段的方法来解决这个问题。在该方法中,我们首先为通信构造一个组播树,然后为所有树中的链路分配插槽。结果表明,该方法能够保持消息的因果顺序,且没有额外的通信开销和消息传递延迟。仿真结果表明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Causal ordering group communication for cognitive radio ad hoc networks
In this paper, we discuss the causal ordering group communication for cognitive radio (CR) networks. The issue of causal ordering has been studied extensively by previous works. However, these works considered the problem at the application 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 group communication request in a CR 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. We propose a two-phase method to solve it. 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A robust controller of dynamic networks and its verification by the simulation of the heat shock response network with reliable signal transmission An energy-aware distributed approach for content and network management Lightweight privacy-preserving routing and incentive protocol for hybrid ad hoc wireless network Cooperative spectrum sensing in TV White Spaces: When Cognitive Radio meets Cloud A Reservation-based Smart Parking System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1