CN109067655B - A kind of car networking mixed logic dynamic retransmission method based on name data network - Google Patents
A kind of car networking mixed logic dynamic retransmission method based on name data network Download PDFInfo
- Publication number
- CN109067655B CN109067655B CN201811217064.1A CN201811217064A CN109067655B CN 109067655 B CN109067655 B CN 109067655B CN 201811217064 A CN201811217064 A CN 201811217064A CN 109067655 B CN109067655 B CN 109067655B
- Authority
- CN
- China
- Prior art keywords
- node
- message
- vehicle
- hop
- distance
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of car networking mixed logic dynamic retransmission methods based on name data network, by in car networking environment, utilize the type of message of multiple types, including security message, entertain message, public service message and auxiliary drive message, consider geographical location information, the influence that the real-time demand that message category and message are sent transmits message, message is divided into unrelated two class of position correlation and position, every class message includes emergency message and common message, and different forwarding strategies is taken to carry out adaptive forwarding, it is final to realize that message is quick in car networking environment, reliable forwarding, it is convenient and efficient, reduce transmission delay, reduce packet loss, to be that car networking is quick, reliable message forwarding provides technical guarantee, improve the forward efficiency of message.
Description
Technical field
The present invention relates to car networking technical field of data transmission, specially a kind of car networking based on name data network is mixed
Close routing conversion.
Background technique
Since its own topologies change is rapid in traditional car networking, the factors such as height of car dynamic lead to network frequency
Numerous disconnection, communication is unstable, and message efficiency of transmission is difficult to ensure.Data network (NDN) is named to use name data instead of IP
Location, is that one kind is data-centered, and the new network framework driven by content requestor can be in effective solution car networking
Mobility and intermittent connection bring data communication problem, therefore it is more suitable for car networking practical application environment.Existing base
Not accounting for News Category division, different messages mostly in the routing forwarding agreement of name data network needs the difference of transmission
When asking and influence that geographical location factor transmits message, therefore being directly applied to car networking, the efficiency of transmission of message
Need to be further increased.
Summary of the invention
The purpose of the present invention is to provide it is a kind of based on name data network architecture car networking mixed logic dynamic forwarding strategy,
To effectively improve the forward efficiency of message, reduce transmission delay, reduce packet loss, thus quick, the reliable message for car networking
Forwarding provides technical guarantee.
In order to achieve the above objectives, the present invention adopts the following technical scheme:
A kind of car networking mixed logic dynamic retransmission method based on name data network, comprising the following steps:
Step 1), node ViCheck that specific fields judge whether itself requested message is related to position, and if position
2) correlation then gos to step, gos to step 3) if uncorrelated；
Step 2), node ViWhen institute's request message is related to position, best next-hop forward node is foundCarry out message
Forwarding；
Step 3), node ViWhen institute's request message is unrelated with position, best next-hop forward node is foundCarry out message
Forwarding.
Further, step 2) specifically includes the following steps:
Step 2.1, node ViTo all neighbor nodesIt is screened；IfAs alternative neighbours' section
Point enters step 2.2 carry out next step selections；
D: node ViThe distance between the destination sent with message；Node ViAnd neighbor nodeBetween away from
From,Have it is positive and negative, with ViFor origin, ViAny neighbor nodeViAnd the angle of message meaning destination three composition <
90 ° thenIt is positive, is otherwise negative；
Step 2.2ViJudge whether message is urgent type message, and different forwarding strategies is selected for different messages；
Step 2.3 node ViTo fixed next-hop nodeSend Interest packet；
After step 2.4 receives Interest packet, nodeWhether expired according to hop count threshold decision Interest packet；If arriving
Phase abandons forwarding, and terminates；
If not yet due, nodeJudge whether there is corresponding Data packet；If judgement has corresponding Data packet, along original route
It is reversed to return to Data packet, terminate；2.1 are not entered step then.
Further, step 2.2 specifically includes the following steps:
Step 2.2.1, emergency message relevant to position includes: traffic information, traffic accident and congestion；
Times T is waited according to listening1Weight analysis is carried out with forward rate R to select best next-hop node
(1) equal times T is listened1: node ViIt calculates and its each neighbor nodeThe distance between rear calculating listen equal times T1,
Selection is apart from node ViFarthest node is as next-hop forward node
T0It is a time-concerning impact factor, is constant, is defined as the nearest neighbours' vehicle processing of distance request vehicle
Minimal time delay needed for Interest packet；
(2) forward rate R: select the higher neighbor node of reliability as next-hop node；
The message number that vehicle node forwards in this period is got from the history mutual information of vehicle, is denoted as N, when
Between section be denoted as Time, forward rate R calculates as follows:
(3) weight analysis is carried out by two indices, calculates F；
The value of α will carry out many experiments, so that it is determined that its best value；
Best next-hop forward node is selected according to the calculated F value of institute
Step 2.2.2 general information relevant to position includes parking lot information and trackside architecture information；
Pass through calculate node ViWith neighbor nodeThe distance between, calculating, which is listened, waits times T2, farthest neighbours is selected to save
Point is used as next-hop forward node
Further, T is set0=5ms.
Further, specific step is as follows for step 3):
Step 3.1 node ViOne jumps flooding Interest packet；
Its neighbor node of step 3.2Receive Interest packet；
Step 3.3 neighbor nodeWhether expired according to hop count threshold decision Interest packet；
If expiring, abandons forwarding and terminate；
If not yet due, nodeJudge whether there is corresponding Data packet；If there is corresponding Data packet, by the opposite road of original route
Diameter returns to Data packet and gives source requesting node；If not corresponding to Data packet, 3.4 are entered step；
Step 3.4 nodeJudge whether message is urgent type message；
Further, step 3.4.1, emergency message includes bad weather；
By listening equal formula, node as followsEqual times T is listened in calculating3It realizes and quickly, reliably forwards:
T3=Td+Tl+Tvr+Tc (5)
Listen equal times T3Pass through vehicle headway correlation time (Td), position correlation time (Tl), speed/directional correlation time
(Tvr) and avoid conflict time (Tc) be added obtain；
3.4.2 it common message: is calculated according to distance and listens equal times T4, distance is farthest, listens and times shortest vehicle is waited to carry out
Forwarding, determines best forward nodeAnd go to step 3.1；
NodeWith upper hop node ViThe distance between；
Dm: the maximum transmitted range of neighbor node.
Further, specific step is as follows by step 3.4.1: (1) vehicle headway correlation time (Td)
Vehicle headway is nodeWith upper hop node ViThe distance between, TdIndicate to apart from relevant time parameter,
In order to allow vehicle that request message to be diffused rapidly in a certain region, farthest by a hop distance in selection communication range
Vehicle help forwards to realize.So the calculation formula that build time and distance are inversely proportional, TdSpecific formula for calculation it is as follows:
T0It is a time-concerning impact factor, is constant, is defined as the nearest neighbours' vehicle processing of distance request vehicle
Minimal time delay needed for Interest packet.It is summarized according to experiment experience, 5ms is set；Indicate nodeWith upper hop node Vi
The distance between；DmIndicate the maximum transmitted range of message；
(3) position correlation time (Tl)
Vehicle V close to intersection centeriPossess more signal covers, so wanting to cover under single hop case
More vehicles are covered, need preferentially to select to be in the vehicle at crossing.Crossroad is divided into two parts by us, central part C, outside
Part E is enclosed, is not N at crossing.Vehicle in center has less Tl, we are to TlBe provided that
(3) speed/directional correlation time (Tvr)
TvrIndicate nodeWith upper hop node ViRelative velocity and directional correlation time parameter, in data dissemination mistake
Cheng Zhong, request message excessive cannot may disposably transmit, so message is carried out block transmission, the mobility of vehicle at this time
Meeting generates large effect to the transmission of data packet, so selection and upper hop node ViSpeed is more close and direction is identical
Vehicle carries out message forwarding, more can guarantee the reliability of message transmission.Therefore vehicle/directional correlation time parameter T is introducedvr, tool
Body calculates as follows:
T0It indicates time-concerning impact factor, is constant；SiIndicate upper hop node ViSpeed；SbIndicate nodeSpeed；
μ indicates direction of traffic impact factor, and driving direction is mutually all 1, and driving direction is -1 on the contrary；When two cars speed is more close, and
And direction be it is in the same direction when, its waiting time is shorter；
(4) conflict time (T is avoidedc)
In environment of the vehicle than comparatively dense, due to vehicle distances, the influence of the conditions such as position might have more vehicles
Waiting time is almost the same, to generate conflict, therefore passes through uniform random number TcIt avoids conflicting, can effectively solve
Congestion problems when Data packet returns, Tc∈[0,1]；
Determine forward node: neighbor nodeIt is constantly in listening state before listening the equal times to expire, waits the times if listening
When expiring, message is forwarded without other nodes, then is forwarded；If there are other nodes to forward message, abandon forwarding；Whens listening equal
Between shortest node be best forward nodeForward Interest packet；And go to step 3.1.
Compared with prior art, the invention has the following beneficial technical effects:
A kind of car networking mixed logic dynamic retransmission method based on name data network of the present invention, by car networking environment
In, message is driven using the type of message of multiple types, including security message, amusement message, public service message and auxiliary, is examined
Consider the influence that the real-time demand that geographical location information, message category and message are sent transmits message, message is divided into
Unrelated two class of position correlation and position, every class message includes emergency message and common message, and different forwarding strategies is taken
Adaptive forwarding is carried out, final quick, the reliable forwarding for realizing message in car networking environment is convenient and efficient, reduces transmission
Delay reduces packet loss, so that the forwarding of quick for car networking, reliable message provides technical guarantee, improves the forwarding of message
Efficiency.
Detailed description of the invention
Fig. 1 is the flow diagram of algorithm of the present invention.
Specific embodiment
The invention will be described in further detail with reference to the accompanying drawing:
As shown in Figure 1, a kind of car networking mixed logic dynamic retransmission method based on name data network, steps are as follows: Che Lian
Each vehicle node is equipped at least one wireless communication interface, GPS positioning and electronic map in net environment, while having and depositing
Storage and computing capability can get the position of destination pointed in Interest packet by GPS.The design is related to three kinds
The data packet of type: (1) Interest packet: when node requests data, can send Interest packet, wherein record the number of needs
According to name, (2) Data packet: if node receives Interest packet, and has corresponding data packet, then can reply Data packet, and
According to the forward-path backtracking of Interest packet to the node for requesting the data, (3) Bancon packet: periodically sent out between node
Bancon message is sent, information of neighbor nodes (history mutual information including neighbor node) is obtained by Bancon message, thus
Calculate the distance between neighbor node.If vehicle node collection is combined into V={ V in car networking1,V2,Vi······Vn, n
For the number of vehicle node in car networking, ViFor any one vehicle node in car networking, node ViThe collection of neighbor node be combined intoFor wherein any one neighbor node,For best next-hop forward node,
M is ViNeighbor node total number.
Step 1, node ViCheck that specific fields judge whether itself requested message is related to position, if with position phase
It closes, then gos to step 2, go to step 3 if uncorrelated；
Step 2, node ViWhen institute's request message is related to position, best next-hop forward node is foundMessage is carried out to turn
Hair, the specific steps are as follows:
2.1, node ViTo all neighbor nodesIt is screened；IfAs alternative neighbor node, into
Enter step 2.2 and carries out next step selection；
D: node ViThe distance between the destination sent with message；Node ViAnd neighbor nodeBetween away from
From,Have it is positive and negative, with ViFor origin, ViAny neighbor nodeViAnd the angle that message meaning destination three is constituted
< 90 ° thenIt is positive, is otherwise negative；
2.2ViJudge whether message is urgent type message, and different forwarding strategies is selected for different messages；
2.2.1 emergency message relevant to position, generally comprises: traffic information, traffic accident, congestion etc.；
Times T is waited according to listening1Weight analysis is carried out with forward rate R to select best next-hop node
(1) equal times T is listened1: node ViIt calculates and its each neighbor nodeThe distance between rear calculating listen equal times T1,
Selection is apart from node ViThe node for farthest (listening the equal times most short) is as next-hop forward node
T0It is a time-concerning impact factor, is constant, is defined as the nearest neighbours' vehicle processing of distance request vehicle
Minimal time delay needed for Interest packet.It is summarized according to experiment experience, T is set0=5ms；
(2) forward rate R: selecting the higher neighbor node of reliability as next-hop node, that is, selects the nearest time
In section, the quantity of forwarded message is measured in the unit time；
The message number that vehicle node forwards in this period is got from the history mutual information of vehicle, is denoted as N, when
Between section be denoted as Time, forward rate R calculates as follows:
(3) weight analysis is carried out by two indices, calculates F；
The value of α will carry out many experiments, so that it is determined that its best value.
Best next-hop forward node is selected according to the calculated F value of instituteF is bigger, under being more likely to become most preferably
One jumps forward node；
2.2.2 general information relevant to position, such as: parking lot information, trackside architecture information etc.；
Pass through calculate node ViWith neighbor nodeThe distance between, calculating, which is listened, waits times T2, farthest neighbours is selected to save
Point (listening the equal times most short) is as next-hop forward node
2.3 node ViTo fixed next-hop nodeSend Interest packet；
After 2.4 receive Interest packet, nodeWhether expired according to hop count threshold decision Interest packet；
If expiring, abandon forwarding, terminate；
If not yet due, nodeJudge whether there is corresponding Data packet；Have, then reversely return to Data packet along original route, ties
Beam；2.1 are not entered step then；
Step 3, node ViWhen institute's request message is unrelated with position, best next-hop forward node is foundMessage is carried out to turn
Hair；Specific step is as follows:
3.1 node ViOne jumps flooding Interest packet；
3.2 its neighbor nodeReceive Interest packet；
3.3 neighbor nodeWhether expired according to hop count threshold decision Interest packet；
If expiring, abandons forwarding and terminate；
If not yet due, nodeJudge whether there is corresponding Data packet；If there is corresponding Data packet, by the opposite road of original route
Diameter returns to Data packet and gives source requesting node；If not corresponding to Data packet, 3.4 are entered step；
3.4 nodeJudge whether message is urgent type message；
3.4.1 emergency message includes bad weather；
By listening equal formula, node as followsEqual times T is listened in calculating3It realizes and quickly, reliably forwards:
T3=Td+Tl+Tvr+Tc (5)
Listen equal times T3Pass through vehicle headway correlation time (Td), position correlation time (Tl), speed/directional correlation time
(Tvr) and avoid conflict time (Tc) be added obtain.
Wherein:
(1) vehicle headway correlation time (Td)
Vehicle headway is nodeWith upper hop node ViThe distance between, TdIndicate to apart from relevant time parameter,
In order to allow vehicle that request message to be diffused rapidly in a certain region, farthest by a hop distance in selection communication range
Vehicle help forwards to realize.So the calculation formula that build time and distance are inversely proportional, TdSpecific formula for calculation it is as follows:
T0It is a time-concerning impact factor, is constant, is defined as the nearest neighbours' vehicle processing of distance request vehicle
Minimal time delay needed for Interest packet.It is summarized according to experiment experience, 5ms is set；Indicate nodeWith upper hop node Vi
The distance between；DmIndicate the maximum transmitted range of message；
(4) position correlation time (Tl)
Vehicle V close to intersection centeriPossess more signal covers, so wanting to cover under single hop case
More vehicles are covered, need preferentially to select to be in the vehicle at crossing.Crossroad is divided into two parts by us, central part C, outside
Part E is enclosed, is not N at crossing.Vehicle in center has less Tl, we are to TlBe provided that
(3) speed/directional correlation time (Tvr)
TvrIndicate nodeWith upper hop node ViRelative velocity and directional correlation time parameter, in data dissemination mistake
Cheng Zhong, request message excessive cannot may disposably transmit, so message is carried out block transmission, the mobility of vehicle at this time
Meeting generates large effect to the transmission of data packet, so selection and upper hop node ViSpeed is more close and direction is identical
Vehicle carries out message forwarding, more can guarantee the reliability of message transmission.Therefore vehicle/directional correlation time parameter T is introducedvr, tool
Body calculates as follows:
T0It indicates time-concerning impact factor, is constant；SiIndicate upper hop node ViSpeed；SbIndicate nodeSpeed；
μ indicates direction of traffic impact factor, and driving direction is mutually all 1, and driving direction is -1 on the contrary；When two cars speed is more close, and
And direction be it is in the same direction when, its waiting time is shorter；
(4) conflict time (T is avoidedc)
In environment of the vehicle than comparatively dense, due to vehicle distances, the influence of the conditions such as position might have more vehicles
Waiting time is almost the same, to generate conflict, therefore passes through uniform random number TcIt avoids conflicting, can effectively solve
Congestion problems when Data packet returns, Tc∈[0,1]；
Determine forward node: neighbor nodeIt is constantly in listening state before listening the equal times to expire, waits the times if listening
When expiring, message is forwarded without other nodes, then is forwarded；If there are other nodes to forward message, abandon forwarding；Whens listening equal
Between shortest node be best forward nodeForward Interest packet；And go to step 3.1；
3.4.2 it common message: is calculated according to distance and listens equal times T4, distance is farthest, listens and times shortest vehicle is waited to carry out
Forwarding, determines best forward nodeAnd go to step 3.1；
NodeWith upper hop node ViThe distance between；
Dm: the maximum transmitted range of neighbor node.
Claims (6)
1. a kind of car networking mixed logic dynamic retransmission method based on name data network, which comprises the following steps:
Step 1), node ViCheck that specific fields judge whether itself requested message is related to position, if related to position,
It then gos to step 2), gos to step 3) if uncorrelated；
Step 2), node ViWhen institute's request message is related to position, best next-hop forward node is foundCarry out message forwarding:
Step 2.1, node ViTo all neighbor nodesIt is screened；IfAs alternative neighbor node, into step
Rapid 2.2 carry out next step selection；
D: node ViThe distance between the destination sent with message；Node ViAnd neighbor nodeThe distance between,
Have it is positive and negative, with ViFor origin, ViAny neighbor nodeViAnd angle < 90 ° that message meaning destination three is constituted are thenIt is positive, is otherwise negative；
Step 2.2 ViJudge whether message is urgent type message, and different forwarding strategies is selected for different messages；
Step 2.3 node ViTo fixed next-hop nodeSend Interest packet；
After step 2.4 receives Interest packet, nodeWhether expired according to hop count threshold decision Interest packet；If expiring,
It abandons forwarding, terminate；
If not yet due, nodeJudge whether there is corresponding Data packet；If judgement has corresponding Data packet, reversed along original route
Data packet is returned, is terminated；2.1 are not entered step then；
Step 3), node ViWhen institute's request message is unrelated with position, best next-hop forward node is foundCarry out message forwarding.
2. a kind of car networking mixed logic dynamic retransmission method based on name data network according to claim 1, feature
Be, step 2.2 specifically includes the following steps:
Step 2.2.1, emergency message relevant to position includes: traffic information, traffic accident and congestion；
Times T is waited according to listening1Weight analysis is carried out with forward rate R to select best next-hop node
(1) equal times T is listened1: node ViIt calculates and its each neighbor nodeThe distance between rear calculating listen equal times T1, selection
Apart from node ViFarthest node is as next-hop forward node
T0It is a time-concerning impact factor, is constant, is defined as the nearest neighbours' vehicle processing Interest packet of distance request vehicle
Required minimal time delay；
(2) forward rate R: select the higher neighbor node of reliability as next-hop node；
The message number that vehicle node forwards in this period is got from the history mutual information of vehicle, is denoted as N, period
It is denoted as Time, forward rate R calculates as follows:
(3) weight analysis is carried out by two indices, calculates F；
The value of α will carry out many experiments, so that it is determined that its best value；
Best next-hop forward node is selected according to the calculated F value of institute
Step 2.2.2 general information relevant to position includes parking lot information and trackside architecture information；
Pass through calculate node ViWith neighbor nodeThe distance between, calculating, which is listened, waits times T2, select farthest neighbor node as
Next-hop forward node
3. a kind of car networking mixed logic dynamic retransmission method based on name data network according to claim 2, feature
It is, T is set0=5ms.
4. a kind of car networking mixed logic dynamic retransmission method based on name data network according to claim 1, feature
It is, specific step is as follows for step 3):
Step 3.1 node ViOne jumps flooding Interest packet；
Its neighbor node of step 3.2Receive Interest packet；
Step 3.3 neighbor nodeWhether expired according to hop count threshold decision Interest packet；
If expiring, abandons forwarding and terminate；
If not yet due, nodeJudge whether there is corresponding Data packet；If there is corresponding Data packet, returned by the reverse path of original route
It returns Data packet and gives source requesting node；If not corresponding to Data packet, 3.4 are entered step；
Step 3.4 nodeJudge whether message is urgent type message, carries out message transmission.
5. a kind of car networking mixed logic dynamic retransmission method based on name data network according to claim 4, feature
Be, step 3.4 specifically includes the following steps:
Step 3.4.1, emergency message includes bad weather；
By listening equal formula, node as followsEqual times T is listened in calculating3It realizes and quickly, reliably forwards:
T3=Td+Tl+Tvr+Tc (5)
Listen equal times T3Pass through vehicle headway correlation time (Td), position correlation time (Tl), speed/directional correlation time (Tvr)
With avoid conflict time (Tc) be added obtain；
3.4.2 it common message: is calculated according to distance and listens equal times T4, distance is farthest, and it listens and times shortest vehicle is waited to be forwarded,
Determine best forward nodeAnd go to step 3.1；
NodeWith upper hop node ViThe distance between；
Dm: the maximum transmitted range of neighbor node.
6. a kind of car networking mixed logic dynamic retransmission method based on name data network according to claim 5, feature
Be, step 3.4.1 specifically includes the following steps:
(1) vehicle headway correlation time (Td)
Vehicle headway is nodeWith upper hop node ViThe distance between, TdIndicate to apart from relevant time parameter；When construction
Between the calculation formula that is inversely proportional with distance, TdSpecific formula for calculation it is as follows:
T0It is a time-concerning impact factor, is constant, is defined as the nearest neighbours' vehicle processing Interest packet of distance request vehicle
Required minimal time delay；Indicate nodeWith upper hop node ViThe distance between；DmIndicate the maximum transmitted model of message
It encloses；
(2) position correlation time (Tl)
Vehicle V close to intersection centeriPossess more signal covers, crossroad is divided into central part C and outer
Part E is enclosed, is not N at crossing, the vehicle in center has less Tl, we are to TlBe provided that
(3) speed/directional correlation time (Tvr)
TvrIndicate nodeWith upper hop node ViRelative velocity and directional correlation time parameter, introduce vehicle/direction phase
Close time parameter Tvr, it specifically calculates as follows:
T0It indicates time-concerning impact factor, is constant；SiIndicate upper hop node ViSpeed；SjkIndicate nodeSpeed；μ table
Show direction of traffic impact factor, driving direction is mutually all 1, and driving direction is -1 on the contrary；
(4) conflict time (T is avoidedc)
Pass through uniform random number TcIt avoids conflicting, Tc∈[0,1]；
Determine forward node: neighbor nodeIt is constantly in listening state before listening the equal times to expire, waits the times to expire if listening
When, message is forwarded without other nodes, then is forwarded；If there are other nodes to forward message, abandon forwarding；Listen the equal times most
Short node is best forward nodeForward Interest packet；And go to step 3.1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811217064.1A CN109067655B (en) | 2018-10-18 | 2018-10-18 | A kind of car networking mixed logic dynamic retransmission method based on name data network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811217064.1A CN109067655B (en) | 2018-10-18 | 2018-10-18 | A kind of car networking mixed logic dynamic retransmission method based on name data network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109067655A CN109067655A (en) | 2018-12-21 |
| CN109067655B true CN109067655B (en) | 2019-08-06 |
Family
ID=64765131
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811217064.1A Active CN109067655B (en) | 2018-10-18 | 2018-10-18 | A kind of car networking mixed logic dynamic retransmission method based on name data network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109067655B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110943927B (en) * | 2019-12-06 | 2021-07-02 | 湖南大学 | Named data network transmission control method, device and equipment based on time delay management |
| CN112584353B (en) * | 2020-12-09 | 2022-07-15 | 重庆邮电大学 | Vehicle-mounted terminal V2X message filtering and forwarding system |
| CN112911544A (en) * | 2021-01-19 | 2021-06-04 | 汉纳森（厦门）数据股份有限公司 | Self-adaptive routing method for expressway Internet of vehicles |
| CN114866960B (en) * | 2022-04-11 | 2023-03-24 | 华南理工大学 | Internet of vehicles multi-hop broadcasting method based on message type and network communication state |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104010047A (en) * | 2014-06-17 | 2014-08-27 | 北京航空航天大学 | Interrupt-tolerant traffic information spreading prototype system based on Android |
| CN106453660A (en) * | 2016-12-09 | 2017-02-22 | 思建科技有限公司 | V to V communication system |
| CN106507429A (en) * | 2016-11-25 | 2017-03-15 | 常熟理工学院 | A kind of data communications method of car networking |
| CN107124470A (en) * | 2017-06-08 | 2017-09-01 | 天津大学 | Car networking framework and network layer communication method based on name data network |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103546937B (en) * | 2013-10-22 | 2017-02-22 | 重庆邮电大学 | Opportunistic routing method based on drive link state sensing in vehicle self-organizing network |
| KR102366744B1 (en) * | 2015-06-24 | 2022-02-23 | 에스케이플래닛 주식회사 | Service system and method for transmitting push message based on user location, user equipment and computer readable medium having computer program recorded therefor |
| CN105187529B (en) * | 2015-09-08 | 2018-05-11 | 常熟理工学院 | A kind of car networking implementation method based on location information |
| CN106211260B (en) * | 2016-07-31 | 2019-12-10 | 华南理工大学 | Position information self-adaptive opportunistic routing method in Internet of vehicles |
| CN108650487A (en) * | 2018-03-28 | 2018-10-12 | 山东科技大学 | Wireless video multi-hop transmission system under a kind of car networking environment |
| CN108667668B (en) * | 2018-05-21 | 2020-12-29 | 同济大学 | Accessibility routing method based on Internet of vehicles communication base in urban road scene |
-
2018
- 2018-10-18 CN CN201811217064.1A patent/CN109067655B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104010047A (en) * | 2014-06-17 | 2014-08-27 | 北京航空航天大学 | Interrupt-tolerant traffic information spreading prototype system based on Android |
| CN106507429A (en) * | 2016-11-25 | 2017-03-15 | 常熟理工学院 | A kind of data communications method of car networking |
| CN106453660A (en) * | 2016-12-09 | 2017-02-22 | 思建科技有限公司 | V to V communication system |
| CN107124470A (en) * | 2017-06-08 | 2017-09-01 | 天津大学 | Car networking framework and network layer communication method based on name data network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109067655A (en) | 2018-12-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109067655B (en) | A kind of car networking mixed logic dynamic retransmission method based on name data network | |
| Darwish et al. | Reliable intersection-based traffic aware routing protocol for urban areas vehicular ad hoc networks | |
| Ullah et al. | Advances in position based routing towards its enabled fog-oriented vanet–a survey | |
| Al-Mayouf et al. | Real-time intersection-based segment aware routing algorithm for urban vehicular networks | |
| Wu et al. | A reinforcement learning-based data storage scheme for vehicular ad hoc networks | |
| CN103298059A (en) | Connectivity sensing routing method on basis of location prediction in vehicle ad hoc network | |
| Zemouri et al. | A fast, reliable and lightweight distributed dissemination protocol for safety messages in urban vehicular networks | |
| Taysi et al. | Routing protocols for geonet: A survey | |
| CN105407517B (en) | Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system | |
| Li et al. | Building transmission backbone for highway vehicular networks: Framework and analysis | |
| CN108834098B (en) | A kind of car networking data forwarding method based on name data network | |
| Zhao et al. | A vehicle density and load aware routing protocol for VANETs in city scenarios | |
| Sheu et al. | A distributed routing protocol and handover schemes in hybrid vehicular ad hoc networks | |
| CN110519682A (en) | A kind of V2V method for routing of binding site and communication range prediction | |
| Talib et al. | Vehicular ad-hoc networks: Current challenges and future direction of research | |
| CN110248392A (en) | Chance retransmission method based on node efficiency in a kind of car networking | |
| Vaghela et al. | Vehicular parking space discovery with agent approach | |
| Marques et al. | Evaluation of strategies for emergency message dissemination in vanets | |
| Nakamura et al. | A method for improving data delivery efficiency in delay tolerant vanet with scheduled routes of cars | |
| CN106254250A (en) | Car networking short-distance networking method | |
| Wu et al. | DAYcast: A dynamic transmission delay based broadcast protocol for vehicular ad hoc networks | |
| Yan et al. | DOVE: Data dissemination to a fixed number of receivers in VANET | |
| CN106304237B (en) | Terminal vehicle communication method based on wireless protocol | |
| Cozzetti et al. | Mapcast: A map-constrained broadcast solution for VANETs | |
| CN105374225B (en) | A kind of acquisition methods of the parking lot information based on In-vehicle networking |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |