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.