Neighbor discovery can be seen as a crucial point after the wireless ad hoc networks have been deployed. In some
practical situations we would like to elect a favourite neighbor to be used for example as a gateway therefore neighbor selection is also required. In this paper, we present NDSP (Neighbor Discovery and Selection Protocol), a randomized approach which handles collision detection to fulfill the neighbor discovery in static environments, and deals with priorities to elect these favourite nodes. We relied on Castalia 3.2 in order to compare the approach with two protocols selected from the literature, modified to include neighbor selection: the NS-PRR (based on PRR), and the NS-Hello protocol (based on Hello). We conclude that the NDSP outperforms both reference
protocols in terms the time and the energy consumption, the throughput and the number of packets sent in both onehop and multi-hop environments. Furthermore, the proposal achieves to work following more realistic assumptions.
3rd Mosharaka International Conference on Telecommunication Systems and Networks (MIC-Telecom 2021)
Congress
2021 Global Congress on Electrical Engineering (GC-ElecEng 2021), 10-12 December 2021, Valencia, Spain
Pages
--1
Topics
Wireless Ad hoc Networks Wireless Sensor Networks
ISSN
2227-331X
DOI
BibTeX
@inproceedings{1180ElecEng2021,
title={Neighbor Discovery and Selection based on the Management of Priorities in Wireless Ad Hoc Networks},
author={Jose Vicente Sorribes, and Jaime Lloret, and Lourdes Peñalver},
booktitle={2021 Global Congress on Electrical Engineering (GC-ElecEng 2021)},
year={2021},
pages={--1},
doi={}},
organization={Mosharaka for Research and Studies}
}
