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 | |
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/Territory | 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