An Optimal Multi-round Multi-slot Hello-Reply Directional Neighbor Discovery Algorithm

Xinru Li, Zhongjiang Yan, Mao Yang, Bo Li, Hang Zhang

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

To solve the problem that multi-round and multi-slot Hello-Reply scheme takes a long time to discover all neighbors due to its multiple parameters and difficulty in optimization, this paper proposes an optimal multi-round and multi-slot (o-MRMS) Hello-Reply algorithm, which theoretically proves and reduces the total time and round number of the algorithm for neighbor discovery, effectively reducing discovery time, and combined with the existing discovery protocol. Simulation results show that compared with a fixed slot number Hello-Reply algorithm, the total neighbor discovery time in the proposed optimal multi-round and multi-slot Hello-Reply algorithm is reduced by about 50 %. Compared with the DANDi protocol [3], discovery efficiency increased with the node number, when the node number is 256, the discovery time reduced by approximately 25 %. It can be combined with the existing neighbor discovery protocol, which verifies its feasibility and efficiency.

源语言英语
主期刊名Smart Grid and Internet of Things - 4th EAI International Conference, SGIoT 2020, Proceedings
编辑Yi-Bing Lin, Der-Jiunn Deng
出版商Springer Science and Business Media Deutschland GmbH
468-486
页数19
ISBN(印刷版)9783030695132
DOI
出版状态已出版 - 2021
活动4th EAI International Conference on Smart Grid and Internet of Things, SGIoT 2020 - TaiChung, 中国台湾
期限: 5 12月 20206 12月 2020

出版系列

姓名Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
354
ISSN(印刷版)1867-8211
ISSN(电子版)1867-822X

会议

会议4th EAI International Conference on Smart Grid and Internet of Things, SGIoT 2020
国家/地区中国台湾
TaiChung
时期5/12/206/12/20

指纹

探究 'An Optimal Multi-round Multi-slot Hello-Reply Directional Neighbor Discovery Algorithm' 的科研主题。它们共同构成独一无二的指纹。

引用此