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

Cited 5 time in webofscience Cited 6 time in scopus
  • Hit : 771
  • Download : 0
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 © 2011 John Wiley & Sons, Ltd.
Publisher
WILEY-HINDAWI
Issue Date
2013-05
Language
English
Article Type
Article
Citation

WIRELESS COMMUNICATIONS & MOBILE COMPUTING, v.13, no.7, pp.650 - 662

ISSN
1530-8669
DOI
10.1002/wcm.1128
URI
http://hdl.handle.net/10203/263774
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0