PND: A p-persistent neighbor discovery protocol in wireless networks

Kyunghwi Kim, Heejun Roh, Wonjun Lee, Sinjae Lee, Ding Zhu Du

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


In wireless communications research, a number of literature assume that every node knows all of its neighbor nodes. To this end, neighbor discovery research has been conducted, but it still has room for improvement in terms of discovery delay. Furthermore, prior work has overlooked energy efficiency, which is considered as the critical factor in wireless devices or appliances. For better performance with respect to the discovery delay and energy efficiency, we proposed a novel p-persistent-based neighbor discovery protocol and devised a simple and light algorithm estimating the number of neighbor nodes to support the proposed protocol. Our protocol requires a lower delay and a smaller number of messages for the discovery process than the existing protocols. For extensive performance evaluation, we adopted extra comparison targets from other research areas within the same context.

Original languageEnglish
Pages (from-to)650-662
Number of pages13
JournalWireless Communications and Mobile Computing
Issue number7
Publication statusPublished - 2013 May


  • neighbor discovery
  • new estimation algorithm
  • p-persistent

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'PND: A p-persistent neighbor discovery protocol in wireless networks'. Together they form a unique fingerprint.

Cite this