Research Article
An Optimal Multi-round Multi-slot Hello-Reply Directional Neighbor Discovery Algorithm
@INPROCEEDINGS{10.1007/978-3-030-69514-9_36, author={Xinru Li and Zhongjiang Yan and Mao Yang and Bo Li and Hang Zhang}, title={An Optimal Multi-round Multi-slot Hello-Reply Directional Neighbor Discovery Algorithm}, proceedings={Smart Grid and Internet of Things. 4th EAI International Conference, SGIoT 2020, TaiChung, Taiwan, December 5--6, 2020, Proceedings}, proceedings_a={SGIOT}, year={2021}, month={7}, keywords={Neighbor discovery Directional antenna Dynamic slot number}, doi={10.1007/978-3-030-69514-9_36} }- Xinru Li
Zhongjiang Yan
Mao Yang
Bo Li
Hang Zhang
Year: 2021
An Optimal Multi-round Multi-slot Hello-Reply Directional Neighbor Discovery Algorithm
SGIOT
Springer
DOI: 10.1007/978-3-030-69514-9_36
Abstract
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 [], 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.
