无线团网中利用带内全双工的邻居发现

Yuichi Miyaji, H. Uehara
{"title":"无线团网中利用带内全双工的邻居发现","authors":"Yuichi Miyaji, H. Uehara","doi":"10.1109/ICCNC.2017.7876276","DOIUrl":null,"url":null,"abstract":"In wireless ad hoc networks, neighbor discovery is essential for medium access control and routing. In this paper, we propose a new neighbor discovery algorithm utilizing in-band full duplex. This algorithm employs a reservation scheme with full duplex into an existing algorithm based on half-duplex. We analyze neighbor discovery time of both algorithms with absorbing Markov chain models and simulations. These results show our proposed algorithm shortens neighbor discovery. Furthermore, we discuss an affinity between the proposed algorithm and an existing one with full duplex.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Neighbor discovery utilizing in-band full duplex in wireless clique networks\",\"authors\":\"Yuichi Miyaji, H. Uehara\",\"doi\":\"10.1109/ICCNC.2017.7876276\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In wireless ad hoc networks, neighbor discovery is essential for medium access control and routing. In this paper, we propose a new neighbor discovery algorithm utilizing in-band full duplex. This algorithm employs a reservation scheme with full duplex into an existing algorithm based on half-duplex. We analyze neighbor discovery time of both algorithms with absorbing Markov chain models and simulations. These results show our proposed algorithm shortens neighbor discovery. Furthermore, we discuss an affinity between the proposed algorithm and an existing one with full duplex.\",\"PeriodicalId\":135028,\"journal\":{\"name\":\"2017 International Conference on Computing, Networking and Communications (ICNC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Computing, Networking and Communications (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNC.2017.7876276\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2017.7876276","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在无线自组织网络中,邻居发现对介质访问控制和路由至关重要。本文提出了一种新的带内全双工邻居发现算法。该算法将全双工的预留方案引入到现有的半双工算法中。利用马尔可夫链模型和仿真分析了两种算法的邻居发现时间。结果表明,该算法缩短了邻居发现时间。此外,我们还讨论了该算法与现有全双工算法之间的亲和力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Neighbor discovery utilizing in-band full duplex in wireless clique networks
In wireless ad hoc networks, neighbor discovery is essential for medium access control and routing. In this paper, we propose a new neighbor discovery algorithm utilizing in-band full duplex. This algorithm employs a reservation scheme with full duplex into an existing algorithm based on half-duplex. We analyze neighbor discovery time of both algorithms with absorbing Markov chain models and simulations. These results show our proposed algorithm shortens neighbor discovery. Furthermore, we discuss an affinity between the proposed algorithm and an existing one with full duplex.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A game-theoretic analysis of energy-depleting jamming attacks Overlapping user grouping in IoT oriented massive MIMO systems Towards zero packet loss with LISP Mobile Node Social factors for data sparsity problem of trust models in MANETs An approach to online network monitoring using clustered patterns
×
引用
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