一种基于对称选路的Ad hoc协同路由算法

Yang Liu, Jianfeng Zhang, Jingmei Song, Renhui Xu, Zefeng Chen
{"title":"一种基于对称选路的Ad hoc协同路由算法","authors":"Yang Liu, Jianfeng Zhang, Jingmei Song, Renhui Xu, Zefeng Chen","doi":"10.1109/ICCT.2010.5689139","DOIUrl":null,"url":null,"abstract":"Routing problems based on cooperative transmission for multi-hop wireless Ad hoc network have been studied in this paper. Inspired by Multipoint Relay computation, a cooperative routing algorithm is proposed in Ad hoc network, which select cooperative neighbors for cooperative transmission by checking whether the links between the node and its neighbors are symmetric or not. The performances of the proposed cooperative routing algorithm and the non-cooperative routing algorithm are compared. The simulation results show that the cooperative routing algorithm's capability parameters, like deliver ratio, are better than the non-cooperative routing algorithm. Furthermore, we try to find the optimal number of cooperative nodes at each cooperative transmission stage.","PeriodicalId":253478,"journal":{"name":"2010 IEEE 12th International Conference on Communication Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An Ad hoc cooperative routing algorithm based on symmetric link selection\",\"authors\":\"Yang Liu, Jianfeng Zhang, Jingmei Song, Renhui Xu, Zefeng Chen\",\"doi\":\"10.1109/ICCT.2010.5689139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Routing problems based on cooperative transmission for multi-hop wireless Ad hoc network have been studied in this paper. Inspired by Multipoint Relay computation, a cooperative routing algorithm is proposed in Ad hoc network, which select cooperative neighbors for cooperative transmission by checking whether the links between the node and its neighbors are symmetric or not. The performances of the proposed cooperative routing algorithm and the non-cooperative routing algorithm are compared. The simulation results show that the cooperative routing algorithm's capability parameters, like deliver ratio, are better than the non-cooperative routing algorithm. Furthermore, we try to find the optimal number of cooperative nodes at each cooperative transmission stage.\",\"PeriodicalId\":253478,\"journal\":{\"name\":\"2010 IEEE 12th International Conference on Communication Technology\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 12th International Conference on Communication Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCT.2010.5689139\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 12th International Conference on Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT.2010.5689139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

研究了多跳无线自组网中基于协同传输的路由问题。受多点中继计算的启发,在Ad hoc网络中提出了一种协作路由算法,该算法通过检查节点与邻居之间的链路是否对称来选择协作邻居进行协作传输。比较了合作路由算法和非合作路由算法的性能。仿真结果表明,合作路由算法的投递率等性能参数优于非合作路由算法。在此基础上,我们尝试在每个合作传输阶段找到最优的合作节点数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Ad hoc cooperative routing algorithm based on symmetric link selection
Routing problems based on cooperative transmission for multi-hop wireless Ad hoc network have been studied in this paper. Inspired by Multipoint Relay computation, a cooperative routing algorithm is proposed in Ad hoc network, which select cooperative neighbors for cooperative transmission by checking whether the links between the node and its neighbors are symmetric or not. The performances of the proposed cooperative routing algorithm and the non-cooperative routing algorithm are compared. The simulation results show that the cooperative routing algorithm's capability parameters, like deliver ratio, are better than the non-cooperative routing algorithm. Furthermore, we try to find the optimal number of cooperative nodes at each cooperative transmission stage.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信