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 [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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Felemban, E., Murawski, R., Ekici, E., et al.: SAND: sectored-antenna neighbor discovery protocol for wireless networks. In: 2010 7th Annual IEEE Communications Society Conference on Sensor. Mesh and Ad Hoc Communications and Networks (SECON), Boston MA, pp. 1–9 (2010)
Gammarano, N., Schandy, J., Steinfeld, L.: Q-SAND: a quick neighbor discovery protocol for wireless networks with sectored antennas. In: 2018 Ninth Argentine Symposium and Conference on Embedded Systems (CASE), Cordoba, pp. 19–24 (2018)
Gammarano, N., Schandy, J., Steinfeld, L.: DANDi: dynamic asynchronous neighbor discovery protocol for directional antennas. In: VIII Brazilian Symposium on Computing Systems Engineering, pp. 16–23 (2018)
Ji, D., Wei, Z., Chen, X., et al.: Radar-communication integrated neighbor discovery for wireless ad hoc networks. In: 2019 11th International Conference on Wireless Communications and Signal Processing (WCSP), Xi’an, China, pp. 1–5 (2019)
Gao, M., Shen, R., Mu, L., et al.: An anti-collision neighbor discovery protocol for multi-node discovery. In: 2019 11th International Conference on Wireless Communications and Signal Processing (WCSP), Xi’an, China, pp. 1–5 (2019)
Yang, A., Li, B., Yan, Z., et al.: A bi-directional carrier sense collision avoidance neighbor discovery algorithm in directional wireless ad hoc sensor networks. Sensors 19(9), 2120–2138 (2019)
Liu, B., Rong, B., Hu, R., et al.: Neighbor discovery algorithms in directional antenna based synchronous and asynchronous wireless ad hoc networks. IEEE Wirel. Commun. 20(6), 106–112 (2013)
Mir, Z., Jung, W., Ko, Y.: Continuous neighbor discovery protocol in wireless ad hoc networks with sectored-antennas. In: 2015 IEEE 29th International Conference on Advanced Information Networking and Applications, Gwangiu, pp. 54–61 (2015)
Cai, H., Liu, B., Gui, L., et al.: Neighbor discovery algorithms in wireless networks using directional antennas. In: 2012 IEEE International Conference on Communications (ICC), Ottawa, ON, pp. 767–772 (2012)
Mir, Z., Ko, Y.: Self-adaptive neighbor discovery in wireless sensor networks with sectored-antennas. Comput. Stand. Interfaces 70, 1–16 (2020)
Murawski, R., Felemban, E., Ekici, E., et al.: Neighbor discovery in wireless networks with sectored antennas. Ad Hoc Netw. 10(1), 1–18 (2012)
Wang, Y., Liu, B., Gui, L.: Adaptive scan-based asynchronous neighbor discovery in wireless networks using directional antennas. In: WCSP 2013: Proceedings of the International Conference on Wireless Communications and Signal Processing, Piscataway, N.J., pp. 1–6. IEEE (2013)
Tian, F., Hu, R., Qian, Y, et al.: Pure asynchronous neighbor discovery algorithms in ad hoc networks using directional antennas. In: 2013 IEEE Global Communications Conference (GLOBECOM), Atlanta, GA, pp. 498–503 (2014)
Li, J., Peng, L., Ye, Y., et al.: A neighbor discovery algorithm in network of radar and communication integrated system. In: 2014 IEEE 17th International Conference on Computational Science and Engineering, Chengdu, pp. 1142–1149 (2014)
Dai, H., Ng, K., Li, M., et al.: An overview of using directional antennas in wireless networks. Int. J. Commun. Syst. 26(4), 413–448 (2013)
Astudillo, G., Kadoch, M.: Neighbor discovery and routing schemes for mobile ad-hoc networks with beam width adaptive smart antennas. Telecommun. Syst. Model. Analy. Des. Manag. 66(1), 17–27 (2017)
Zhang, Z., Li, B.: Neighbor discovery in mobile ad hoc self-configuring networks with directional antennas: algorithms and comparisons. IEEE Trans. Wirel. Commun. 7(5), 1540–1549 (2008)
Chen, W.T.: An accurate tag estimate method for improving the performance of an RFID anticollision algorithm based on dynamic frame length ALOHA. IEEE Trans. Automat. ENCE Eng. 6(1), 9–15 (2009)
Acknowledgement
This work was supported in part by Science and Technology on Avionics Integration Laboratory and the Aeronautical Science Foundation of China (Grant No.201955053002), the National Natural Science Foundations of CHINA (Grant No. 61871322, No.61771392, No.61771390, and No.61501373), and Science and Technology on Avionics Integration Laboratory and the Aeronautical Science Foundation of China (Grant No.20185553035).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Li, X., Yan, Z., Yang, M., Li, B., Zhang, H. (2021). An Optimal Multi-round Multi-slot Hello-Reply Directional Neighbor Discovery Algorithm. In: Lin, YB., Deng, DJ. (eds) Smart Grid and Internet of Things. SGIoT 2020. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 354. Springer, Cham. https://doi.org/10.1007/978-3-030-69514-9_36
Download citation
DOI: https://doi.org/10.1007/978-3-030-69514-9_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-69513-2
Online ISBN: 978-3-030-69514-9
eBook Packages: Computer ScienceComputer Science (R0)