PND: a p-persistent neighbor discovery protocol in wireless networks
- Authors
- Kim, Kyunghwi; Roh, Heejun; Lee, Wonjun; Lee, Sinjae; Du, Ding-Zhu
- Issue Date
- 5월-2013
- Publisher
- WILEY-HINDAWI
- Keywords
- neighbor discovery; p-persistent; new estimation algorithm
- Citation
- WIRELESS COMMUNICATIONS & MOBILE COMPUTING, v.13, no.7, pp.650 - 662
- Indexed
- SCIE
SCOPUS
- Journal Title
- WIRELESS COMMUNICATIONS & MOBILE COMPUTING
- Volume
- 13
- Number
- 7
- Start Page
- 650
- End Page
- 662
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/103455
- DOI
- 10.1002/wcm.1128
- ISSN
- 1530-8669
- 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. Copyright (c) 2011 John Wiley & Sons, Ltd.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Cyber Security > 1. Journal Articles
- School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.