Abstract
Neighbor node discovery is one of the important steps in a wireless directed ad hoc network. Improving the efficiency of neighbor node discovery can not only reduce the collision during node communication, but also improve the performance of the wireless ad hoc network as a whole. In the Ad-hoc network of directional antennas, by analyzing and summarizing the deficiencies of the neighbor discovery algorithm, this paper proposes a probing and p-probability based two round directional neighbor discovery algorithm (PPTR). The second round adjusts the probability of neighboring neighbor nodes competing for slots based on the number of free slots, successful slots, and collision slots in the first round, thereby reducing the collision of neighboring nodes to reach the maximum number of neighbors discovered within a fixed time. We verified the protocol through network simulation. The simulation results show that the PPTR algorithm and the traditional neighbor discovery algorithm have the same neighbor discovery efficiency when the number of network nodes and the number of time slots are consistent. But The neighbor discovery efficiency increases on average 81.3% when the number of nodes increases to five times the number of timeslots.
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
Similar content being viewed by others
References
Felemban, E., Murawski, R., Ekici, E., Park, S.: SAND: sectored-antenna neighbor discovery protocol for wireless networks. In: IEEE Communications Society Conference on Sensor (2010)
Carty, J., Jayaweera, S.K.: Distributed network, neighbor discovery and blind routing for mobile wireless ad-hoc networks. In: 2019 12th IFIP Wireless and Mobile Networking Conference (WMNC) (2019)
Zhang, Y.J., Lei, L., Zhu, G., Dong, T.: Distributed neighbor discovery mechanism based on analytical modeling for ad hoc networks with directional antennas. J. Chin. Comput. Syst. 37(10), 2226–2231 (2016)
Benssalah, M., Djeddou, M., Dahou, B., Drouiche, K., Maali, A.: A cooperative Bayesian and lower bound estimation in dynamic framed slotted ALOHA algorithm for RFID systems. Int. J. Commun. Syst. 31(13), e3723.1–e3723.13 (2018)
Liu, A.F., Xian-You, W., Zhi-Gang, C., Wei-Hua, G.: Research on the energy hole problem based on unequal cluster-radius for wireless sensor networks. Comput. Commun. 33(3), 302–321 (2010)
Wu, H., Zeng, Y., Feng, J., Gu, Y.: Binary tree slotted ALOHA for passive RFID tag anticollision. IEEE Trans. Parallel Distrib. Syst. 24(1), 19–31 (2013)
Huang, S., Mo, L., Liang, Z.: An intelligent neighbor discovery algorithm for Ad Hoc networks with directional antennas. In: 2013 International Conference on Mechatronic Sciences, Electric Engineering and Computer (MEC) (2013)
Nguyen, D., Garcialunaaceves, J.J., Obraczka, K.: Collision-free asynchronous multi-channel access in ad hoc networks (2017)
Jia, X., Feng, Q., Yu, L.: Stability analysis of an efficient anti-collision protocol for RFID tag identification. IEEE Trans. Commun. 60(8), 2285–2294 (2012)
Lee, J.C., Shin, M.K., Jeong, S., Kim, H.J.: Method of transmitting neighbor discovery protocol message in IEEE 802.16/WiBro network (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. Autom. Sci. Eng. 6(1), 9–15 (2008)
Cai, H., Liu, B., Gui, L., Wu, M.Y.: Neighbor discovery algorithms in wireless networks using directional antennas. In: IEEE International Conference on Communications (2012)
Mbacke, A.A., Mitton, N., Rivano, H.: A survey of RFID readers anticollision protocols. IEEE J. Radio Freq. Identif. 2, 38–48 (2018)
Deng, D.J., Tsao, H.W.: Optimal dynamic framed slotted ALOHA based anti-collision algorithm for RFID systems. Wireless Pers. Commun. 59(1), 109–122 (2011). https://doi.org/10.1007/s11277-010-0193-3
Zhang, X.H., Zhang, L.Y.: Research on RFID anti-collision algorithm of slot responding in real-time and co-processing. Acta Electronica Sinica 42(6), 1139–1146 (2014)
Chu, C., Wen, G., Huang, Z., Su, J., Han, Yu.: Improved Bayesian method with collision recovery for RFID anti-collision. In: Sun, X., Pan, Z., Bertino, E. (eds.) ICAIS 2019. LNCS, vol. 11633, pp. 51–61. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-24265-7_5
Kohvakka, M., Suhonen, J., Kuorilehto, M., Kaseva, V., Haennikaeinen, M., Haemaelaeinen, T.D.: Energy-efficient neighbor discovery protocol for mobile wireless sensor networks. Ad Hoc Netw. 7(1), 24–41 (2009)
Xiong, T.W., Tan, X., Yan, N., Min, H.: Modeling and simulation of RTLS based on UHF RFID. J. Syst. Simul. 23(1), 212–216 (2011)
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
Hu, X., Yang, Q., Yan, Z., Yang, M., Li, B. (2021). A Probing and p-Probability Based Two Round 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_34
Download citation
DOI: https://doi.org/10.1007/978-3-030-69514-9_34
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)