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 journalArticle

4 Citations (Scopus)

Abstract

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
Volume13
Issue number7
DOIs
Publication statusPublished - 2013 May 1

Fingerprint

Wireless networks
Network protocols
Energy efficiency
Communication

Keywords

  • neighbor discovery
  • new estimation algorithm
  • p-persistent

ASJC Scopus subject areas

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

Cite this

PND : A p-persistent neighbor discovery protocol in wireless networks. / Kim, Kyunghwi; Roh, Heejun; Lee, Wonjun; Lee, Sinjae; Du, Ding Zhu.

In: Wireless Communications and Mobile Computing, Vol. 13, No. 7, 01.05.2013, p. 650-662.

Research output: Contribution to journalArticle

Kim, Kyunghwi ; Roh, Heejun ; Lee, Wonjun ; Lee, Sinjae ; Du, Ding Zhu. / PND : A p-persistent neighbor discovery protocol in wireless networks. In: Wireless Communications and Mobile Computing. 2013 ; Vol. 13, No. 7. pp. 650-662.
@article{bd810fa15ca34ba68584cb5e6dd873df,
title = "PND: A p-persistent neighbor discovery protocol in wireless networks",
abstract = "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.",
keywords = "neighbor discovery, new estimation algorithm, p-persistent",
author = "Kyunghwi Kim and Heejun Roh and Wonjun Lee and Sinjae Lee and Du, {Ding Zhu}",
year = "2013",
month = "5",
day = "1",
doi = "10.1002/wcm.1128",
language = "English",
volume = "13",
pages = "650--662",
journal = "Wireless Communications and Mobile Computing",
issn = "1530-8669",
publisher = "John Wiley and Sons Ltd",
number = "7",

}

TY - JOUR

T1 - PND

T2 - A p-persistent neighbor discovery protocol in wireless networks

AU - Kim, Kyunghwi

AU - Roh, Heejun

AU - Lee, Wonjun

AU - Lee, Sinjae

AU - Du, Ding Zhu

PY - 2013/5/1

Y1 - 2013/5/1

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

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

KW - neighbor discovery

KW - new estimation algorithm

KW - p-persistent

UR - http://www.scopus.com/inward/record.url?scp=84876704729&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84876704729&partnerID=8YFLogxK

U2 - 10.1002/wcm.1128

DO - 10.1002/wcm.1128

M3 - Article

AN - SCOPUS:84876704729

VL - 13

SP - 650

EP - 662

JO - Wireless Communications and Mobile Computing

JF - Wireless Communications and Mobile Computing

SN - 1530-8669

IS - 7

ER -