Distributed Network, Neighbor Discovery and Blind Routing for Mobile Wireless Ad-hoc Networks

Randomized neighbor discovery protocols with collision detection for static multi-hop wireless ad hoc networks

“…Our work is different from recent works in the literature such as [12] which uses a Kalman filter as a prediction model, combines hello messages and node mobility prediction, and uses the ALOHA-like [2] mechanism with transmission probability 0.5, [13] that uses prior information from radars to accelerate the speed, integrates radar and communication, the protocol is 3-way but feedback might collide, and uses directional transmission and directional reception, [14] where the protocol combines routing and neighbor discovery, without having a priori knowledge of the network parameters (such as size, topology or mobility), [15] presenting a cross-layer protocol that performs neighbor discovery in the MAC layer, hello messages are sent periodically after a random backoff in a TDMA method, with the aid of hexagonal clustering and GPS to update the latest information of neighbors, [16] which uses directional antennas, and model neighbor discovery as a finite-state learning automaton, the protocol operates in a ALOHA-like manner, 2-way handshaking on the same beam where nodes transmit or receive with equal probability, [17] that integrates radar and communication, using directional antennas, making use of a two-way handshaking for each direction sending hello messages, in [3] neighbor discovery with social recognition under a passive discovery framework, broadcasts a wake-up radio signal before the hello message broadcast to trigger from idle to active modes, hello messages are integrated with social information, and neighbor discovery is performed in the MAC layer, [4] beacons are separated from active slots, a periodical broadcast of beacons can be dynamically adjusted to accelerate the discovery, and proactive wake-up is available. Most of these protocols are used in mobile environments.…”

Autoconfiguración de redes ad hoc basadas en confianza.

“…En [51] se presenta un protocolo de descubrimiento de vecinos adecuado para MANETs altamente dinámicas donde los nodos tienen recursos limitados. El protocolo combina encaminamiento, planificación y descubrimiento de vecinos.…”

“…Según la Tabla 2.4, todos los protocolos se pueden usar en redes móviles excepto el ND_HC y RCI-SBA. El tiempo está ranurado excepto en el protocolo en [51]. Todos excepto el protocolo en [52] son asíncronos.…”

“…Todos excepto el protocolo en [52] son asíncronos. Solo se permite su uso en entornos multi-hop a los protocolos [48], [52] y [51]. Finalmente, todos los protocolos son capaces de manejar las colisiones.…”

“…El protocolo es 3-way pero el feedback puede colisionar, y usa transmisión direccional y recepción direccional. En [51] el protocolo combina encaminamiento y descubrimiento de vecinos. No requiere conocimiento a priori de los parámetros de la red (tal como tamaño, topología o movilidad).…”