Skip to main content
SpringerLink
Log in

An Asynchronous Leader-Based Neighbor Discovery Protocol in Static Wireless Ad Hoc Networks

  • Conference paper
  • First Online:
Applied Soft Computing and Communication Networks

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 187))

  • 353 Accesses

Abstract

Wireless ad hoc networks are characterized by a lack of a communications infrastructure after their deployment, and the nodes have limited range radio transceivers to carry out communications. Therefore, neighbor discovery techniques are necessary so that the nodes get to know their one-hop neighbors, that is, the nodes within transmission range. In this article, we proceed to present a new randomized leader-based neighbor discovery protocol for static one-hop networks, which manages to discover all the neighbors with probability 1, know when to terminate the process, following more realistic assumptions. To evaluate the performance of the protocol presented, we rely on Castalia 3.2 simulator, and we also compare the proposal with the Hello protocol chosen from the literature and an existing deterministic leader-based protocol. We found that the proposal presents better results than the Hello protocol regarding four metrics (Neighbor Discovery Time, Number of Discovered Neighbors, Energy consumption and Throughput). In addition, our proposal presents reasonable results in comparison to the deterministic leader-based protocol regarding time, energy and throughput results, and it also allows its use in an asynchronous way.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Loo J, Lloret J, Ortiz JH (2016) Mobile ad hoc networks: current status and future trends. Taylor & Francis Group, CRC Press

    Google Scholar 

  2. Lacuesta R, Lloret J, Garcia M, Peñalver L (2013) A secure protocol for spontaneous wireless ad hoc networks creation. IEEE Trans Parallel Distrib Syst 24(4)

    Google Scholar 

  3. Sun G, Wu F, Gao X, Chen G, Wang W (2013) Time-efficient protocols for neighbor discovery in wireless ad hoc networks. IEEE Trans Veh Technol 62(6):2780–2791

    Google Scholar 

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

  5. McGlynn MJ, Borbash SA (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

    Google Scholar 

  6. 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, Oct 2011. https://doi.org/10.1109/MASS.2011.15

  7. Ben Hamida E, Chelius G, Busson A, Fleury E (2008) Neighbor discovery in multi-hop wireless networks: evaluation and dimensioning with interference considerations. Discrete Math Theor Comput Sci DMTCS 10(2):87–114

    Google Scholar 

  8. Muhammed Irfan S, Ali S, Mathew JA (2014) Protocol design for neighbor discovery in ad-hoc network. Int J Electron Electr Eng 7(9):915–922

    Google Scholar 

  9. 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, Dec 2008, pp 791–797. ACM Press. https://doi.org/10.1109/ALLERTON.2008.4797638

  10. Chen L, Li Y, Chen Y, Liu K, Zhang J, Cheng Y, You H, Luo Q (2015) Prime-set-based neighbor discovery algorithm for low duty-cycle dynamic WSNs. Electron Lett 51(6):534–536. https://doi.org/10.1049/el.2014.3879.24

  11. 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

  12. Backht M, Kravets R (2010) Searchlight: a systematic probing based asynchronous neighbor discovery protocol. In: Illinois digital environment for access to learning and scholarship repository

    Google Scholar 

  13. Margolies R, Grebla G, Chen T, Rubenstein D, Zussman G (2016) Panda: neighbor discovery on a power harvesting budget. IEEE J Sel Areas Commun 34(12):3606–3619. https://doi.org/10.1109/JSAC.2016.2611984

  14. 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, IEEE INFOCOM 2016, pp 1–9

    Google Scholar 

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

  16. 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

    Google Scholar 

  17. Wang K, Mao X, Liu Y (2013) Blinddate: a neighbor discovery protocol. IEEE Trans Parallel Distrib Syst 26(4):120–129. https://doi.org/10.1109/ICPP.2013.21

  18. Yang S, Wang C, Jiang C (2018) Centron: cooperative neighbor discovery in mobile ad-hoc networks. Comput Netw 136:128–136

    Google Scholar 

  19. Chen L, Fan R, Zhang Y, Shi S, Bian K, Chen L, Zhou P, Gerla M, Wang T, Li X (2018) On heterogeneous duty cycles for neighbor discovery in wireless sensor networks. Ad Hoc Netw Elsevier 77:54–68. https://doi.org/10.1016/j.adhoc.2018.04.007

  20. Sorribes JV, Peñalver L, Tavares Calafate C, Lloret J (2020) Collision-aware deterministic neighbor discovery in static ad hoc wireless networks. In: Global conference on wireless and optical technologies, Malaga, Spain, Oct 2020, Approved for publication

    Google Scholar 

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

    Google Scholar 

  22. 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

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. Department of Computer Engineering, Universitat Politécnica de Valencia, Valencia, Spain

    Jose Vicente Sorribes & Lourdes Peñalver

  2. Integrated Management Coastal Research Institute, Universitat Politécnica de Valencia, Valencia, Spain

    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. Jaime Lloret
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jaime Lloret .

Editor information

Editors and Affiliations

  1. Indian Institute of Information Technology and Management Kerala, Trivandrum, Kerala, India

    Sabu M. Thampi

  2. Integrated Management Coastal Research Institute, Universitat Politecnica de Valencia, Valencia, Spain

    Jaime Lloret Mauri

  3. Ryerson Communications Lab, Department of Electrical and Computer Engineering, Ryerson University, Toronto, ON, Canada

    Xavier Fernando

  4. Department of Computer Science, University of Texas at San Antonio, San Antonio, TX, USA

    Rajendra Boppana

  5. School of Computer Science and Engineering, Vellore Institute of Technology, Chennai, India

    S. Geetha

  6. University of Applied Sciences Offenburg, Offenburg, Germany

    Axel Sikora

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sorribes, J.V., Peñalver, L., Lloret, J. (2021). An Asynchronous Leader-Based Neighbor Discovery Protocol in Static Wireless Ad Hoc Networks. In: Thampi, S.M., Lloret Mauri, J., Fernando, X., Boppana, R., Geetha, S., Sikora, A. (eds) Applied Soft Computing and Communication Networks. Lecture Notes in Networks and Systems, vol 187. Springer, Singapore. https://doi.org/10.1007/978-981-33-6173-7_10

Download citation

Publish with us

Policies and ethics

Search

Navigation