Probabilistic Neighbor Discovery Algorithm in Wireless Ad Hoc Networks 


Vol. 39,  No. 9, pp. 561-569, Sep.  2014


PDF
  Abstract

In wireless ad hoc networks, neighbor discovery is essential in the network initialization and the design of routing, topology control, and medium access control algorithms. Therefore, efficient neighbor discovery algorithms should be devised for self-organization in wireless ad hoc networks. In this paper, we propose a probabilistic neighbor discovery (PND) algorithm, which aims at reducing the neighbor discovery time by adjusting the transmission probability of advertisement messages through the muiltiplicative-increase/multiplicative-decrease (MIMD) policy. To further improve PND, we consider the collision detection (CD) capability in which a device can distinguish between successful reception and collision of advertisement messages. Simulation results show that the transmission probabilities of PND and PND with CD converge on the optimal value quickly although the number of devices is unknown. As a result, PND and PND with CD can reduce the neighbor discovery time by 15.6% to 57.0% compared with the ALOHA-like neighbor discovery algorithm.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

T. Song, H. Park, S. Pack, "Probabilistic Neighbor Discovery Algorithm in Wireless Ad Hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 9, pp. 561-569, 2014. DOI: .

[ACM Style]

Taewon Song, Hyunhee Park, and Sangheon Pack. 2014. Probabilistic Neighbor Discovery Algorithm in Wireless Ad Hoc Networks. The Journal of Korean Institute of Communications and Information Sciences, 39, 9, (2014), 561-569. DOI: .

[KICS Style]

Taewon Song, Hyunhee Park, Sangheon Pack, "Probabilistic Neighbor Discovery Algorithm in Wireless Ad Hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 9, pp. 561-569, 9. 2014.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880