Skip to Main content Skip to Navigation

Adaptive solutions for data sharing in vehicular networks

Abstract : In the context of Intelligent Transportation Systems - ITS, vehicles may have a lot of sensors (e.g. cameras, lidars, radars) and applications (collision avoidance, traffic monitoring, etc.) generating data. They represent then an important source of information. Local applications can significantly increase their effectiveness by sharing such an information within the network. Data accuracy, confidence and pertinence can be verified when receiving data from other nodes. Therefore, we believe that an important question to answer in this context is: “How to efficiently share data within such an environment?” Data sharing is a complex task in dynamic networks. Many concerns like intermittent connections, network density variation and communication spectrum congestion arise. A usual approach to handle these problems is based on periodic processes. Indeed, a message sent many times can reach its destination even with intermittent connections and low density networks. Nevertheless, within high density networks, they may lead to communication spectrum scarcity. In this thesis we address the problem of data sharing in dynamic networks by relying in so-called horizons of pertinence. A horizon is defined as an area within which an information is expected to be received. We start focusing on data sharing within direct neighbors (at 1-hop of distance). Then we propose a solution to construct a map of neighbors, centered in the ego-node, within a horizon of n-hops. Finally, we relax the horizon definition to a dynamic defined one where different data items may reach different distances (hops). Regarding the solution for 1-hop horizons, our adaptive technique takes into account nodes’ dynamics and network load. In order to ensure an effective data dissemination in different scenarios, the sending messages frequency is defined according to vehicles movements and an estimation of the network loss rate. Following, we focus on the map of neighbors up to n-hops of distance. As communicationwith distant nodes brings additional concerns (forwarding actions, larger delays, out-of-date information), a trust evaluation of identified nodes and a reliability estimation of the multi-hop path to each neighbor is added to the map. Instead of running separated disseminating processes, our third contribution deals with a cooperative strategy with the main goal of disseminating data while satisfying most of the nodes. For this purpose a unique frame is forwarded from node to node. Its payload is locally updated so that it contains the most relevant data items according to some criteria (e.g. urgency, relevance). Such a strategy defines thus a data-centered horizon. We validate our proposals by means of realistic network emulations. From all our studies and achieved results we can state that our approach brings interesting insights for data sharing in dynamic networks like VANETs.
Complete list of metadatas

Cited literature [101 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Thursday, February 28, 2019 - 5:37:06 PM
Last modification on : Thursday, October 3, 2019 - 9:49:09 AM
Long-term archiving on: : Wednesday, May 29, 2019 - 6:19:13 PM


Version validated by the jury (STAR)


  • HAL Id : tel-02052847, version 1


Hermes Pimenta de Moraes Junior. Adaptive solutions for data sharing in vehicular networks. Networking and Internet Architecture [cs.NI]. Université de Technologie de Compiègne, 2018. English. ⟨NNT : 2018COMP2417⟩. ⟨tel-02052847⟩



Record views


Files downloads