Abstract
One of the problem in distributed wireless ad hoc network is to design efficient neighbor discovery mechanism. However, the parameter analysis of the directional neighbor acquisition probability model that can be applied to engineering is still unclear. In this paper, the successful discovery probability of the directional neighbor discovery mechanism based on election (DND-EMA) and directional neighbor discovery mechanism based on competition multiple access (DND-CMA) are modeled and analyzed respectively. And then, we obtain the probability expressions of access slot transmission probability and transmission success probability, and finally combines the geometric calculation method and mechanism to obtain the expression of probability of successful discovery, and according to the probability expression analyzes the joint optimized parameters. Numerical analysis results show that the efficiency of the neighbor acquisition mechanism also depends on the choice of the number of antenna sectors. And the number of directional antenna sectors equipped with nodes should be adjusted according to the network scale.
This work was supported by the National Key R&D Program of China under Grant 2017YFF0206201.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Feng, O., Qiang, L., Qi, H., Tingting, L.: Summary of mobile self-networking technology based on directional antennas. TV Technol. 41(004), 148–153 (2017)
Liao, Y., Peng, L., Xu, R., Li, A., Ge, L.: Neighbor discovery algorithm with collision avoidance in ad hoc network using directional antenna. In: 2020 IEEE 6th International Conference on Computer and Communications (ICCC), pp. 458–462 (2020)
Qin, Z., Gan, X., Wang, J., Fu, L., Wang, X.: Capacity of social-aware wireless networks with directional antennas. IEEE Trans. Commun. 65(11), 4831–4844 (2017)
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)
Burghal, D., Tehrani, A., Molisch, A.: On expected neighbor discovery time with prior information: modeling, bounds and optimization. IEEE Trans. Wirel. Commun. 99, 1–1 (2017)
Russell, A., Vasudevan, S., Wang, B., Zeng, W., Chen, X., Wei, W.: Neighbor discovery in wireless networks with multipacket reception. IEEE Trans. Parallel Distrib. Syst. 26, 1984–1998 (2015)
Tehrani, A.S., Molisch, A.F., Caire, G.: Directional zigzag: neighbor discovery with directional antennas. In: 2015 IEEE Global Communications Conference, GLOBECOM 2015 (2014)
Mir, Z.H., Jung, W.S., Ko, Y.B.: Continuous neighbor discovery protocol in wireless ad hoc networks with sectored-antennas. IEEE (2015)
Khamlichi, B.E., Nguyen, D., Abbadi, J.E., Rowe, N.W., Kumar, S.: Collision-aware neighbor discovery with directional antennas. In: 2018 International Conference on Computing, Networking and Communications (ICNC) (2018)
Liu, L., Peng, L., Xu, R., Zhao, W.: A neighbor discovery algorithm for flying ad hoc network using directional antennas. In: 2019 28th Wireless and Optical Communications Conference (WOCC) (2019)
Li, H., Xu, Z.: Self-adaptive neighbor discovery in mobile ad hoc networks with directional antennas, pp. 1–6 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Qin, R., Li, X. (2022). Parameter Optimization for Neighbor Discovery Probability of Ad Hoc Network Using Directional Antennas. In: Shi, X., Bohács, G., Ma, Y., Gong, D., Shang, X. (eds) LISS 2021. Lecture Notes in Operations Research. Springer, Singapore. https://doi.org/10.1007/978-981-16-8656-6_47
Download citation
DOI: https://doi.org/10.1007/978-981-16-8656-6_47
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-8655-9
Online ISBN: 978-981-16-8656-6
eBook Packages: Business and ManagementBusiness and Management (R0)