Opportunistic routing algorithm based on multi-copy congestion avoidance in car networking

A congestion avoidance, multi-copy technology, applied in the field of vehicle networking communication, can solve the problems of network congestion, high network overhead, low message transmission success rate, etc., to avoid waste, solve congestion problems, and rationally utilize network resources.

Active Publication Date: 2018-11-06
SOUTH CHINA UNIV OF TECH
View PDF3 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] However, the existing opportunistic routing based on multiple copies pursues high transmission success rate and low transmission delay, and usually forwards a large number of data packets, and a large number of invalid data packet forwarding has become a prominent problem of node resource consu

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Opportunistic routing algorithm based on multi-copy congestion avoidance in car networking
  • Opportunistic routing algorithm based on multi-copy congestion avoidance in car networking
  • Opportunistic routing algorithm based on multi-copy congestion avoidance in car networking

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0049] In this example, if figure 1 is the vehicle message forwarding scene diagram of the present invention, such as figure 2It is the overall flowchart of the routing algorithm of the present invention. The Opportunistic Routing Algorithm of the present invention is simulated and compared with the classic multi-copy routing protocol Spray and Wait in DTN using The One network emulator, the simulation parameter settings are as shown in Table 1, and the simulation scene map is as shown in Table 1 image 3 As shown, this map is a city map of Helsinki, Netherlands. Simulation results such as Figure 4 , Figure 5 with Image 6 As shown in , they are comparative analysis diagrams of delivery rate, end-to-end delay, and routing overhead.

[0050] Table 1. Simulation parameter value setting table of The One

[0051] map size

4500M*3400M(Helsinki)

Simulation time / s

3000

cache size

15M

communication radius

200m

Transmission rat...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The present invention discloses an opportunistic routing algorithm based on multi-copy congestion avoidance in car networking. The algorithm comprises a multi-copy mode and a single-copy mode according to a condition of the number of message copies for any one node requiring forwarding of messages, in the multi-copy mode, transmission performances of candidate forwarding nodes are fully considered, a new routing measurement standard is provided, the measurement standard integrally considers the node attribute parameters of the candidate forwarding nodes, forwarding utility values of the candidate forwarding nodes are calculated, an analytic hierarchy process is employed to calculate the weight value of each node attribute parameter in the forwarding utility value formula, and finally, proper forwarding nodes are selected according to the forwarding utility values. If the number of the message copies is equal to 1, the single-copy mode is accessed and the message copies are not forwarded until target nodes are in contact. The simulation experiment result shows that, the routing algorithm has a good routing performance compared with a traditional algorithm so as to effectively relieve the network congestion and achieve reasonable utilization of the network resources.

Description

technical field [0001] The invention relates to the technical field of Internet of Vehicles communication, in particular to an opportunistic routing algorithm based on multi-copy congestion avoidance in the Internet of Vehicles. Background technique [0002] Vehicular Ad Hoc Network (VANET) is an important part of ITS, usually composed of on-board unit (OBU) and roadside unit (RSU). VANET supports vehicle-to-vehicle communication ( Vehicle to Vehicle (V2V) and communication between vehicles and roadside fixed infrastructure (Vehicle to Infrastructure, V2I) make intelligent driving, road condition forecast, safety warning, resource sharing and other services a reality. [0003] In-vehicle routing is the key to reliable multi-hop transmission in in-vehicle networks. Vehicles need to drive along fixed roads when driving on urban roads. It has become a research hotspot to use information such as road topology, node location, speed, and direction to assist routing decisions. . ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L12/721H04L12/801H04L29/08
CPCH04L45/32H04L47/12H04L67/12
Inventor 刘晓涛胡斌杰
Owner SOUTH CHINA UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap