Energy-aware Randomized Neighbor Discovery Protocol based on Collision Detection in Wireless Ad Hoc Networks

[EN] In wireless ad hoc networks, neighbor discovery is necessary as an initial step. In this work we present LECDH (Low Energy Collision Detection Hello), an energy-aware randomized handshake-based neighbor discovery protocol for static environments. We carried out simulations through Castalia 3.2...

Descripción completa

Detalles Bibliográficos
Autores: Sorribes, Jose Vicente, Peñalver Herrero, Mª Lourdes|||0000-0002-0403-7770, Jimenez, Jose M.|||0000-0002-3688-7235, Sendra, Sandra|||0000-0001-9556-9088
Tipo de recurso: artículo
Fecha de publicación:2022
País:España
Institución:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/198413
Acceso en línea:https://riunet.upv.es/handle/10251/198413
Access Level:acceso abierto
Palabra clave:Wireless ad hoc networks
Neighbor discovery
Energy
Collision detection
Randomized protocol
INGENIERÍA TELEMÁTICA
ARQUITECTURA Y TECNOLOGIA DE COMPUTADORES
Descripción
Sumario:[EN] In wireless ad hoc networks, neighbor discovery is necessary as an initial step. In this work we present LECDH (Low Energy Collision Detection Hello), an energy-aware randomized handshake-based neighbor discovery protocol for static environments. We carried out simulations through Castalia 3.2 simulator and compared LECDH with an existing protocol EAH (Energy Aware Hello) used as reference. We conclude that the proposal outperforms the reference protocol both in one-hop and multi-hop environments in terms of Energy consumption, Discovery time, Number of discovered neighbors, Throughput, and Discoveries per packet sent, for high duty cycles. Moreover, for low number of nodes in LECDH, as the duty cycle is reduced the performance is better according to all 5 metrics in both environments. Overall, we found that our proposal follows more realistic assumptions and still allows nodes to succeed at discovering all their neighbors almost with probability 1. Moreover, a qualitative comparison of the reference solution and our proposal is included in this paper.