Skip to main content
SpringerLink
Log in

Randomized neighbor discovery protocols with collision detection for static multi-hop wireless ad hoc networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Neighbor discovery represents a first step after the deployment of wireless ad hoc networks, since the nodes that form them are equipped with limited-range radio transceivers, and they typically do not know their neighbors. In this paper two randomized neighbor discovery approaches, called CDH and CDPRR, based on collision detection for static multi-hop wireless ad hoc networks, are presented. Castalia 3.2 simulator has been used to compare our proposed protocols against two protocols chosen from the literature and used as reference: the PRR, and the Hello protocol. For the experiments, we chose five metrics: the neighbor discovery time, the number of discovered neighbors, the energy consumption, the throughput and the number of discovered neighbors versus packets sent ratio. According to the results obtained through simulation, we can conclude that our randomized proposals outperform both Hello and PRR protocols in the presence of collisions regarding all five metrics, for both one-hop and multi-hop scenarios. As novelty compared to the reference protocols, both proposals allow nodes to discover all their neighbors with probability 1, they are based on collision detection and know when to terminate the neighbor discovery process. Furthermore, qualitative comparisons of the existing protocols and the proposals are available in this paper. Moreover, CDPRR presents better results in terms of time, energy consumption and number of discovered neighbors versus packets sent ratio. We found that both proposals achieve to operate under more realistic assumptions. Furthermore, CDH does not need to know the number of nodes in the network.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. Sun, G., Wu, F., Gao, X., Chen, G., & Wang, W. (2013). Time-efficient protocols for neighbor discovery in wireless ad hoc networks. IEEE Transactions on Vehicular Technology, 62(6), 2780–2791. https://doi.org/10.1109/TVT.2013.2246204

    Article  Google Scholar 

  2. Vasudevan, S., Adler, M., Goeckel, D., & Towsley, D. (2013). Efficient algorithms for neighbor discovery in wireless networks. IEEE/ACM Transactions on Networking, 21(1), 69–83. https://doi.org/10.1109/TNET.2012.2189892

    Article  Google Scholar 

  3. Ling, H., & Yang, S. (2019). Passive neighbor discovery with social recognition for mobile ad hoc social networking applications. Wireless Networks, 25, 4247–4258. https://doi.org/10.1007/s11276-019-02087-3

    Article  Google Scholar 

  4. Chen, H., Qin, Y., Lin, K., Luan, Y., Wang, Z., Yu, J., & Li, Y. (2020). PWEND: Proactive wakeup based energy-efficient neighbor discovery for mobile sensor networks. Ad Hoc Networks, 107, 102247. https://doi.org/10.1016/j.adhoc.2020.102247

    Article  Google Scholar 

  5. Garcia, M., Bri, D., Boronat, F., & Lloret, J. (2008). A new neighbour selection strategy for group-based wireless sensor networks. Fourth international conference on networking and services (ICNS 2008) (pp. 16–21). Guadeloupe: Gosier.

    Google Scholar 

  6. Han, G., Li, X., Jiang, J., Shu, L., & Lloret, J. (2015). Intrusion detection algorithm based on neighbor information against sinkhole attack in wireless sensor networks. The Computer Journal, 58(6), 1280–1292. https://doi.org/10.1093/comjnl/bxu036

    Article  Google Scholar 

  7. Mcglynn, M. J., & Borbash, S. A. (2001). Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks. In Proceedings of the 2nd ACM international symposium on mobile ad hoc networking computing (pp. 137–145). ACM Press. https://doi.org/10.1145/501431.501435

  8. Stoleru, R., Wu, H., & Chenji, H. (2011). Secure neighbor discovery in mobile ad hoc networks. In Proceedings—8th IEEE international conference on mobile ad-hoc and sensor systems, MASS 2011 (pp. 35–42). https://doi.org/10.1109/MASS.2011.15

  9. Varghane, N., & Kurade, B. (2014). Secure protocol and signature based intrusion detection for spontaneous wireless AD HOC network. International Journal of Computer Science and Mobile Computing (IJCSMC), 3(5), 758–768.

    Google Scholar 

  10. Ben Hamida, E., Chelius, G., Busson, A., & Fleury, E. (2008). Neighbor discovery in multi-hop wireless networks: Evaluation and dimensioning with interference considerations. Discrete Mathematics Theoretical Computer Science DMTCS, 10(2), 87–114.

    Google Scholar 

  11. Boulis, A. (2011). Castalia—A simulator for wireless sensor networks and body area networks. version 3.2. user’s manual. https://es.scribd.com/document/78901825/castalia-user-manual

  12. Chunfeng, L., Gang, Z., Weisi, G., & Ran, H. (2020). Kalman prediction-based neighbor discovery and its effect on routing protocol in vehicular ad hoc networks. IEEE Transactions on Intelligent Transportation Systems, 21(1), 159–169. https://doi.org/10.1109/TITS.2018.2889923

    Article  Google Scholar 

  13. Wei, Z., Han, C., Qiu, C., Feng, Z., & Wu, H. (2019). Radar assisted fast neighbor discovery for wireless ad hoc networks. IEEE Access, 7, 176514–176524. https://doi.org/10.1109/ACCESS.2019.2950277

    Article  Google Scholar 

  14. Carty, J., & Jayaweera, S. K. (2019). Distributed network, neighbor discovery and blind routing for mobile wireless ad-hoc networks. In 12th IFIP wireless and mobile networking conference (WMNC), Paris, France (pp. 131–135). https://doi.org/10.23919/WMNC.2019.8881802

  15. Wang, Q., He, X., & Chen, N. (2019). A cross-layer neighbour discovery algorithm in ad hoc networks based on hexagonal clustering and GPS. In IOP conference series: Earth and environmental science, 6th annual 2018 international conference on geo-spatial knowledge and intelligence, 14–16 December 2018, Hubei, China (vol. 234, 012050, pp. 1–6). https://doi.org/10.1088/1755-1315/234/1/012050

  16. El Khamlichi, B., Nguyen, D. H. N., El Abbadi, J., Rowe, N. W., & Kumar, S. (2019). Learning automaton-based neighbor discovery for wireless networks using directional antennas. IEEE Wireless Communications Letters, 8(1), 69–72. https://doi.org/10.1109/LWC.2018.2855120

    Article  Google Scholar 

  17. Ji, D., Wei, Z., Chen, X., Han, C., Chen, Q., Feng, Z., & Ning, F. (2019). Radar-communication integrated neighbor discovery for wireless ad hoc networks. In 11th international conference on wireless communications and signal processing (WCSP), Xi’an, China (pp. 1–5). https://doi.org/10.1109/WCSP.2019.8927896

  18. Muhammed, I. S., Ali, S., & Mathew, J. A. (2014). Protocol design for neighbor discovery in ad-hoc network. International Journal of Electronic and Electrical Engineering, 7(9), 915–922.

    Google Scholar 

  19. Luo, J., & Guo, D. (2008). Neighbor discovery in wireless ad hoc networks based on group testing. In 46th annual allerton conference on communication, control, and computing (pp. 791–797). ACM Press. https://doi.org/10.1109/ALLERTON.2008.4797638

  20. Chen, L., Li, Y., Chen, Y., Liu, K., Zhang, J., Cheng, Y., You, H., & Luo, Q. (2015). Prime-set-based neighbour discovery algorithm for low duty-cycle dynamic wsns. Electronics Letters, 51(6), 534–536. https://doi.org/10.1049/el.2014.3879.24

    Article  Google Scholar 

  21. Dutta, P., & Culler, D. (2008). Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications. In SenSys (pp. 71–84). https://doi.org/10.1145/1460412.1460420

  22. Bakht, M., & Kravets, R. (2010). Searchlight: A systematic probingbased asynchronous neighbor discovery protocol. In Illinois Digital Environment for Access to Learning and Scholarship Repository.

  23. Margolies, R., Grebla, G. T., Rubenstein, D., & Zussman, G. (2016). Panda: Neighbor discovery on a power harvesting budget. IEEE Journal on Selected Areas in Communications, 34(12), 3606–3619. https://doi.org/10.1109/JSAC.2016.2611984

    Article  Google Scholar 

  24. Qiu, Y., Li, S., Xu, X., & Li, Z. (2016) Talk more listen less: Energy-efficient neighbor discovery in wireless sensor networks. In The 35th annual IEEE international conference on computer communications (pp. 1–9). IEEE INFOCOM 2016. https://doi.org/10.1109/INFOCOM.2016.7524336

  25. Zheng, R., Hou, J. C., & Sha, L. (2003). Asynchronous wakeup for ad hoc networks. In Proceedings of the 4th ACM international symposium on mobile ad hoc networking and computing (pp. 35–45). MobiHoc’03. https://doi.org/10.1145/778415.778420

  26. Kandhalu, A., & Rajkumar, R. (2010). U-connect: A low-latency energy-efficient asynchronous neighbor discovery protocol. In Proceedings of the 9th ACM/IEEE international conference on information processing in sensor networks, IPSN ’10 (pp. 350–361). https://doi.org/10.1145/1791212.1791253

  27. Wang, K., Mao, X., & Liu, Y. (2013). Blinddate: A neighbor discovery protocol. IEEE Transactions on Parallel and Distributed Systems, 26(4), 120–129. https://doi.org/10.1109/ICPP.2013.21

    Article  Google Scholar 

  28. Astudillo, G., & Kadoch, M. (2017). Neighbor discovery and routing schemes for mobile ad-hoc networks with beamwidth adaptive smart antennas. Telecommunication Systems, 66, 17–27. https://doi.org/10.1007/s11235-016-0268-x

    Article  Google Scholar 

  29. Li, X., Mitton, N., & Simplot-Ryl, D. (2011). Mobility prediction based neighborhood discovery in mobile ad hoc networks. In Proceedings of 10th international IFIP TC networking conference, Valencia, Spain, May 2011 (pp. 241–253).

  30. Taleb, T., Sakhaee, E., Jamalipour, A., Hashimoto, K., Kato, N., & Nemoto, Y. (2007). A stable routing protocol to support ITS services in VANET networks. IEEE Transactions on Vehicular Technology, 56(6), 3337–3347.

    Article  Google Scholar 

  31. Li, J., Peng, L., Ye, Y., Xu, R., Zhao, W., & Tian C. (2014). A neighbor discovery algorithm in network of radar and communication integrated system. In Proceedings IEEE 17th international conference on computational science and engineering (CSE), Chengdu, China, Dec. 2014 (pp. 1142–1149).

  32. Zhang, Z., & Li, B. (2008). Neighbor discovery in mobile ad hoc selfconfiguring networks with directional antennas: Algorithms and comparisons. IEEE Transactions on Wireless Communications, 7(5), 1540–1549.

    Article  Google Scholar 

  33. Vasudevan, S., Kurose, J., & Towsley, D. (2005). On neighbor discovery in wireless networks with directional antennas. In Proceedings of IEEE international conference on computer communications, Miami, FL, USA, Mar. 2005 (pp. 2502–2512).

  34. Chen, H., Lou, W., Wang, Z., & Xia, F. (2018). On achieving asynchronous energy-efficient neighbor discovery for mobile sensor networks. IEEE Transactions on Emerging Topics in Computing, 6, 553–565.

    Article  Google Scholar 

  35. Garcia, M., Martinez, C., Tomas, J., & Lloret J. (2007). Wireless sensors self-location in an indoor WLAN environment. In International conference on sensor technologies and applications SENSORCOMM 2007, Valencia, Spain, October 2007 (pp. 14–20).

  36. Lloret, J., López, J. J., Turró, C., & Flores, S. (2004). A fast design model for indoor radio coverage in the 2.4GHz wireless LAN. In 1st international symposium on wireless communication systems (pp. 408–412).

Download references

Acknowledgements

This work has been partially supported by the "Ministerio de Economía y Competitividad" in the "Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia, Subprograma Estatal de Generación de Conocimiento" within the project under Grant TIN2017-84802-C2-1-P. This work has also been partially supported by European Union through the ERANETMED (Euromediterranean Cooperation through ERANET joint activities and beyond) project ERANETMED3-227 SMARTWATIR.

Author information

Authors and Affiliations

  1. Universitat Politécnica de Valencia, Valencia, Spain

    Jose Vicente Sorribes, Lourdes Peñalver, Carlos Tavares Calafate & Jaime Lloret

Authors
  1. Jose Vicente Sorribes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lourdes Peñalver
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Carlos Tavares Calafate
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jaime Lloret
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jaime Lloret.

Ethics declarations

Conflicts of interest

Authors declare that they do not have conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sorribes, J.V., Peñalver, L., Calafate, C.T. et al. Randomized neighbor discovery protocols with collision detection for static multi-hop wireless ad hoc networks. Telecommun Syst 77, 577–596 (2021). https://doi.org/10.1007/s11235-021-00763-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-021-00763-4

Keywords

Search

Navigation