An Opportunistic Routing for Data Forwarding Based on Vehicle Mobility Association in Vehicular Ad Hoc Networks

Abstract

Vehicular ad hoc networks (VANETs) have emerged as a new powerful technology for data transmission between vehicles. Efficient data transmission accompanied with low data delay plays an important role in selecting the ideal data forwarding path in VANETs. This paper proposes a new opportunity routing protocol for data forwarding based on vehicle mobility association (OVMA). With assistance from the vehicle mobility association, data can be forwarded without passing through many extra intermediate nodes. Besides, each vehicle carries the only replica information to record its associated vehicle information, so the routing decision can adapt to the vehicle densities. Simulation results show that the OVMA protocol can extend the network lifetime, improve the performance of data delivery ratio, and reduce the data delay and routing overhead when compared to the other well-known routing protocols.

FCNS: A Fuzzy Routing-Forwarding Algorithm Exploiting Comprehensive Node Similarity in Opportunistic Social Networks

“…In recent years, research around the routing algorithm [8,[11][12][13][14] has been a hot issue in opportunistic social networks, where different methods suitable for different application scenarios have been proposed. In opportunistic social networks, routing algorithms can be roughly divided into two categories: context-aware algorithms, and context-ignorant algorithms.…”

“…In opportunistic social networks, routing algorithms can be roughly divided into two categories: context-aware algorithms, and context-ignorant algorithms. Context-aware routing algorithms, based on node similarity [8,12,15,18], attempt to adopt the contextual information related to nodes and the social relationships between nodes to choose a proper relay node among the surrounding neighbors for the data transmission process. Moreover, in order to improve the transmission environment, the context-aware algorithm needs to process heavy computing tasks and manage large amounts of information.…”

“…For instance, if the node u likes basketball and film, its sub-vector of interest would be A u = (1, 0, 0, 1). Moreover, for the same sub-vector between a pair of nodes u and v, we use the following formula (8) to compute the sub-vector similarity between them:…”

“…In opportunistic networks, nodes in unpredictable locations attempt to communicate with each other at unpredictable intervals. Nowadays, the application areas of opportunistic networks mainly include wildlife monitoring networks [5], interplanetary networks [6,7], vehicular networks [8], networks in underdeveloped areas [9,10], and social opportunistic networks [11][12][13][14]. At the dawn of 5G networks and big data, technological development is leading to the wide distribution of mobile devices, such as smartphones, Bluetooth, Wi-Fi technologies, or notebooks.…”

Predict and Forward: An Efficient Routing-Delivery Scheme Based on Node Profile in Opportunistic Networks

“…In recent years, with the rapid development of novel wireless devices, such as mobile phones, smart watches, Bluetooth earphones or other wearable sensor devices, the message applications in opportunistic social networks [3,4] may obtain more opportunities to communicate with each other. Moreover, the hot issues of opportunistic networks include routing algorithms [5][6][7], mobile models [8,9], security and cooperation [1,10], and applications [11,12].…”