Determinação de vizinhança em rede veiculares ad hoc: uma análise dos tempos limite para entrega de mensagens

Abstract

Neighborhood detection in ad hoc vehicular networks involves determining neighboring vehicles for collaborative organization. This problem presents challenges to communication between vehicles in vehicular networks due to the dynamic nature of the network, which leads to unpredictable variations in the quality of the communication channel due to factors such as environmental conditions, interferences, and congestion. In this dissertation, we address the neighborhood detection between platoons in dynamic networks, facing challenges such as varied vehicle movements and building interferences. The platooning organization represents a relevant scenario for studying vehicular networks, as it brings benefits to traffic quality, such as fuel consumption reduction, traffic flow improvement, and increased safety. We have developed a basic communication protocol designed for communication between platoon leaders, which ensures mutual knowledge between them, enabling the exchange of essential information for neighborhood detection and collaborative operation of the platoons. We have verified the protocol using the PRISM model checker. Using this protocol, we conducted experiments to determine the required times that occur between the sending and receiving of messages exchanged between platoon leaders for neighborhood determination. We performed experiments on both reliable and unreliable channels and determined progress time bound through simulations using the VEINS framework, which integrates SUMO and OMNET++. The results of the experiments provided information about the progress time bound in various scenarios that can serve as a reference for the development of applications related to communication in VANETs.