Fuzzy-Based Distributed Protocol for Vehicle-to-Vehicle Communication

Abstract

this paper modeled the multihop data-routing in Vehicular Ad-hoc Networks(VANET) as Multiple Criteria Decision Making (MCDM) in four steps. First, the criteria which have an impact on the performance of the network layer are captured and transformed into fuzzy sets. Second, the fuzzy sets are characterized by Fuzzy Membership Functions(FMF) which are interpolated based on the data collected from massive experimental simulations. Third, the Analytical Hierarchy Process(AHP) is exploited to identify the relationships among the criteria. Fourth, multiple fuzzy rules are determined and, the TSK inference system is employed to infer and aggregate the final forwarding decision. Through integrating techniques of MCDM, FMF, AHP, and TSK, we designed a distributed and opportunistic data routing protocol, namely, VEFR (Vehicular Environment Fuzzy Router) which targets V2V (vehicle-to-vehicle) communication and runs in two main processes, Road Segment Selection(RSS) and Relay Vehicle Selection(RVS). RSS is intended to select multiple successive junctions through which the packets should travel from the source to the destination, while RVS process is intended to select relay vehicles within the selected road segment. The experimental results showed that our protocol performs and scales well with both network size and density, considering the combined problem of end-to-end packet delivery ratio and end-to-end latency.

Request/Advertise-Based Content Forwarding in Vehicular Named Data Networking

“…We compare the performance of RACF with those of the MUPF, MobiVNDN, and V-NDN designs. Comparison parameters are evaluated during the simulation process against vehicle number/km 2…”

“…When developing VANETs, network challenges, such as sparse vehicle densities and rapid topology changes, should be considered [2]. These challenges have motivated most researchers to turn their attention toward the promising named data networking (NDN) model.…”

Fine-Grained Action Recognition by Motion Saliency and Mid-Level Patches

“…Inspired by the Huffman algorithm, we propose a region merging algorithm to merge the motion saliency regions with the image appearance features and the motion saliency features. All node regions in the Huffman tree are regarded as object proposals, which can obtain multi-granularity region partition results [50]. The initial region partition result of the foreground is…”

ACO–IBR: a modified intersection‐based routing approach for the VANET

“…In this method, a packet is routed through the adjacent vehicle closer to the endpoint. This adjacent vehicle forwards a packet to the endpoint [8 ]. In some of the cases, due to less density of vehicles between the source and adjacent nodes, a local optimal situation arises wherein, it is impractical to locate a next neighbour because of less vehicles on a particular road.…”

“…Some of the common distributed routing protocols are opportunistic routing, traffic‐aware routing, route discovery protocols and network coding. There are some distributed routing protocols available such as adaptive quality of service routing (AQRV) [9 ], reliable traffic aware routing (RTAR) [8 ] and beacon‐less routing algorithm for vehicular environments (BRAVE) [8 ]. Furthermore, in centralised protocols, topological information about the environment is collected in entity and it is the place where routing decisions are made.…”