A probabilistic neighbor discovery algorithm in wireless ad hoc networks

Taewon Song; Hyunhee Park; Sangheon Pack

doi:10.1109/VTCSpring.2014.7022791

A probabilistic neighbor discovery algorithm in wireless ad hoc networks

Taewon Song, Hyunhee Park, Sangheon Pack

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

In wireless ad hoc networks, it is difficult to share the information on neighbor devices in a distributed manner. 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% and 57.0%, respectively, compared with the ALOHA-like neighbor discovery algorithm.

Original language	English
Title of host publication	IEEE Vehicular Technology Conference
Publisher	Institute of Electrical and Electronics Engineers Inc.
Volume	2015-January
Edition	January
DOIs	https://doi.org/10.1109/VTCSpring.2014.7022791
Publication status	Published - 2015 Jan 26
Event	2014 79th IEEE Vehicular Technology Conference, VTC 2014-Spring - Seoul, Korea, Republic of Duration: 2014 May 18 → 2014 May 21

Other

Other	2014 79th IEEE Vehicular Technology Conference, VTC 2014-Spring
Country	Korea, Republic of
City	Seoul
Period	14/5/18 → 14/5/21

Keywords

Collision detection
Distributed MAC
Neighbor discovery
Wireless ad hoc networks

ASJC Scopus subject areas

Electrical and Electronic Engineering
Computer Science Applications
Applied Mathematics

Access to Document

10.1109/VTCSpring.2014.7022791

Fingerprint Dive into the research topics of 'A probabilistic neighbor discovery algorithm in wireless ad hoc networks'. Together they form a unique fingerprint.

Cite this

Song, T, Park, H & Pack, S 2015, A probabilistic neighbor discovery algorithm in wireless ad hoc networks. in IEEE Vehicular Technology Conference. January edn, vol. 2015-January, 7022791, Institute of Electrical and Electronics Engineers Inc., 2014 79th IEEE Vehicular Technology Conference, VTC 2014-Spring, Seoul, Korea, Republic of, 14/5/18. https://doi.org/10.1109/VTCSpring.2014.7022791

@inproceedings{da1896492d164fb4a8c3333de7d005d9,

title = "A probabilistic neighbor discovery algorithm in wireless ad hoc networks",

abstract = "In wireless ad hoc networks, it is difficult to share the information on neighbor devices in a distributed manner. 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% and 57.0%, respectively, compared with the ALOHA-like neighbor discovery algorithm.",

keywords = "Collision detection, Distributed MAC, Neighbor discovery, Wireless ad hoc networks",

author = "Taewon Song and Hyunhee Park and Sangheon Pack",

year = "2015",

month = jan,

day = "26",

doi = "10.1109/VTCSpring.2014.7022791",

language = "English",

volume = "2015-January",

booktitle = "IEEE Vehicular Technology Conference",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

edition = "January",

note = "2014 79th IEEE Vehicular Technology Conference, VTC 2014-Spring ; Conference date: 18-05-2014 Through 21-05-2014",

}

TY - GEN

T1 - A probabilistic neighbor discovery algorithm in wireless ad hoc networks

AU - Song, Taewon

AU - Park, Hyunhee

AU - Pack, Sangheon

PY - 2015/1/26

Y1 - 2015/1/26

N2 - In wireless ad hoc networks, it is difficult to share the information on neighbor devices in a distributed manner. 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% and 57.0%, respectively, compared with the ALOHA-like neighbor discovery algorithm.

AB - In wireless ad hoc networks, it is difficult to share the information on neighbor devices in a distributed manner. 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% and 57.0%, respectively, compared with the ALOHA-like neighbor discovery algorithm.

KW - Collision detection

KW - Distributed MAC

KW - Neighbor discovery

KW - Wireless ad hoc networks

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

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

U2 - 10.1109/VTCSpring.2014.7022791

DO - 10.1109/VTCSpring.2014.7022791

M3 - Conference contribution

AN - SCOPUS:84936879678

VL - 2015-January

BT - IEEE Vehicular Technology Conference

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 79th IEEE Vehicular Technology Conference, VTC 2014-Spring

Y2 - 18 May 2014 through 21 May 2014

ER -

A probabilistic neighbor discovery algorithm in wireless ad hoc networks

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this