Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method applicable for scene with multiple sparse and dense vehicular ad hoc networks (VANETs)

A dense and scene-based technology, applied in the field of vehicle network, can solve problems such as not receiving rewards, discarding, whether nodes forward and whether excessive forwarding is lacking, etc.

Inactive Publication Date: 2013-03-20
DALIAN UNIV OF TECH
View PDF2 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in many scenarios such as highways at night, the distribution of vehicles is sparse, and the connection between nodes is intermittent. Before the node receiving the message encounters the next hop node, the lifetime of the message has expired and it is forced to discard it.
These nodes are not selfish nodes, but because they did not forward the message to the next hop, they were not rewarded, which is unreasonable
Some incentive mechanisms give the same reward to all forwarding nodes, ignoring the different importance of different nodes for message forwarding (T. Chen, L. Zhu, F. Wu, and S. Zhong, "Stimulating Cooperation in Vehicular Ad Hoc Networks: A Coalitional Game Theoretic Approach” IEEE Transactions on Vehicular Technology, vol. 60, no. 2, pp. 566-579, Feb. 2011.)
In addition, most incentive mechanisms are to encourage selfish nodes to forward messages, and there is a lack of a good balance between whether nodes forward and whether to over-forward

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
  • Method applicable for scene with multiple sparse and dense vehicular ad hoc networks (VANETs)
  • Method applicable for scene with multiple sparse and dense vehicular ad hoc networks (VANETs)
  • Method applicable for scene with multiple sparse and dense vehicular ad hoc networks (VANETs)

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0083] Embodiments of the present invention will be described in detail below in combination with technical solutions and accompanying drawings.

[0084] The whole incentive mechanism is as Figure 4 It mainly includes 4 stages:

[0085] 1) Communication between VANETs nodes;

[0086] 2) Submit tickets, meet reports and the number of successfully delivered copies;

[0087] 3) GCPC calculates the distribution of income;

[0088] 4) Nodes earn income from GCPC.

[0089] In the communication phase, the source node in VANETs generates a message to be sent, and forwards the message to the destination node through the neighbor node (of course, if the destination node is within the transmission range of the source node, the source node can directly send the message to the destination node). In the second stage, when the intermediate node gets connected with GCPC, it submits the collected bills and meet report to GCPC as evidence of gaining benefits. When the destination node gets...

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 invention discloses a method applicable for scenes with multiple sparse and dense vehicular ad hoc networks (VANETs). Firstly, when the VANETs are sparse, connection from end to end and specific to the sparse VANETs do not exist frequently, each node (vehicle in the VANETs) can be effectively stimulated to cooperate with each other, message transferring success is increased and transferring delay is reduced. When the VANETs are dense, ISSDV can enable forwarding nodes to choose a part of high-quality nodes to forward message, the number of forwarding nodes is effectively controlled, redundant package in the network can be reduced, meanwhile, connectivity of the network is guaranteed, and success rate of transferring is increased. According to the method applicable for the scenes with the multiple sparse and dense vehicular ad hoc networks (VANETs), a stimulation mechanism not only solves a problem that the nodes forward message in a selfish mode, but also well adapts to nodes rapid moving speed, a changing network density, frequency of topological changes, network partitioning and other practical problems of the VANETs, and enables presented mechanisms to be truly implemented and be practical.

Description

technical field [0001] The invention belongs to the field of vehicular networks, and relates to modeling the incentive mechanism of nodes in VANETs (Vehicular Ad Hoc Networks) by using alliance game theory, so that the nodes cooperate to forward messages. The given model and method can adapt to VANETs with variable density scenarios, and can automatically motivate nodes differently according to the density of VANETs, ​​constrain the selfish behavior of nodes, and improve network performance. Background technique [0002] VANETs are different from ordinary wireless mobile networks. The message forwarding incentive mechanism in VANETs tries to encourage nodes to cooperate in forwarding messages based on its unique characteristics such as fast mobility of nodes, changing network density, frequent topology changes, and network segmentation. Selfish behavior of nodes. Researchers have proposed many different incentive mechanisms, however each incentive opportunity has its own ch...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H04L29/08
Inventor 吴迪高艳荣刘江川孙利民谭国真
Owner DALIAN UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products