CN103763753B - A kind of road grid traffic information fast propagation method based on VANET - Google Patents
A kind of road grid traffic information fast propagation method based on VANET Download PDFInfo
- Publication number
- CN103763753B CN103763753B CN201410002190.0A CN201410002190A CN103763753B CN 103763753 B CN103763753 B CN 103763753B CN 201410002190 A CN201410002190 A CN 201410002190A CN 103763753 B CN103763753 B CN 103763753B
- Authority
- CN
- China
- Prior art keywords
- information
- diffusion
- node
- forwarding
- receiving node
- 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.)
- Expired - Fee Related
Links
Landscapes
- Traffic Control Systems (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a kind of road grid traffic information fast propagation method based on VANET, relate to a kind of vehicular ad hoc network network field, for solving prior art when propagating information of vehicles, it is susceptible to channel when traffic density is bigger and fights for or take the problem that Internet resources are serious, and when traffic density rareness or following distance density inequality, the problem that there will be again Information Communication chain rupture.The present invention is preferential forward node with the vehicle node of the furthest distance of disease spread on the dispersal direction of diffusion of information center, stop forwarding or do not receive within the waiting time after receiving, to the node that the operating range at diffusion of information center is nearer, the transport information that farther receiving node forwards on same section when farthest node forwards the transport information come and carry out cycle forwarding, thus reach to carry out the fast propagation of transport information with minimum forward node, maximum propagation distance, and transport information can be quick, without chain rupture ground diffusive transport in road network.
Description
Technical field
The present invention relates to a kind of vehicular ad hoc network network field, particularly relate to a kind of road grid traffic information based on VANET fast
Speed transmission method.
Background technology
Along with the increase year by year of private car, traffic congestion has become as the phenomenon that city road network is the most universal, if making car
Can recognize road network congested link early, carry out path planning, then can reduce vehicle congestion, alleviate road congestion conditions.
Truck traffic is the effective means of a kind of radio transmission information of vehicles, and wherein Radio Broadcasting Agreements is a kind of relatively conventional and important
Circulation way, its most commonly seen genus flooded broadcast (Flooding) agreement, but all nodes of this agreement all carry out information forwarding,
Thus there will be serious channel fight for, the even problem such as broadcast storm.For solving problems, Wisitpongphan
(N.Wisitpongphan,O.K.Tonguz,J.S.Parikh,P.Mudalige,F.Bai and V.Sadekar,
Broadcast storm mitigation techniques in vehicular ad hoc wireless networks
[J] .IEEE Wireless Communications Magazine, pp.84 94, Dec.2007) et al. propose (relevant literary composition
Offer: N.Wisitpongphan, O.K.Tonguz, J.S.Parikh, P.Mudalige, F.Bai and V.Sadekar,
Broadcast storm mitigation techniques in vehicular ad hoc wireless networks
[J] .IEEE Wireless Communications Magazine, pp.84 94, Dec.2007) broadcast based on probability calculation
Method, i.e. vehicle node carry out forwarding information with probability, thus decrease forward node quantity；And money relax et al. (money relax, Zhang Xihuang
.Ad Dynamical probabilistic scheme [J] based on distance in Hoc network. computer engineering and design, 2007,28 (14): 3373-
3375) then get up to take in Probabilistic Synthesis by distance, dynamically adjust forwarding probability according to spaces of vehicles, give distant
Higher preferential forwarding of node is weighed；But this type of information pass-through mode based on probability has certain uncertainty, dilute at node
The network dredged easily occurring, the phenomenons such as Information Communication chain rupture are caused in network cavity.YuanguoBi etc. propose (Yuanguo
Bi,Hai Zhao,Xuemin(Sherman)Shen:A Directional Broadcast Protocol for
Emergency Message Exchange in Inter-Vehicle Communications [C] .ICC2009:1-5) base
In the Radio Broadcasting Agreements of position, being shaken hands by BCTS/CTS and finding maximum distance node is via node；Normal in addition with one
Radio Broadcasting Agreements based on information of neighbor nodes (Broadcast protocol, the BCAST) (Thomas seen
Kunz.Multicasting in mobile ad-hoc networks:achieving high packet delivery
ratios[J].Systems and Computer Engineering.Carleton University,pp.156-
170.IBM, (2003) .), the node that i.e. neighbor node quantity is many preferentially forwards, and reduces forward node number with this, but due to respectively
Node all needs periodically to exchange hello bag to obtain adjacent node information, is the most also fought for by a certain degree of for generation channel.
Although above-mentioned Radio Broadcasting Agreements visual angle is different, differ from one another, but fight for and take from reducing channel, avoid Information Communication
Chain rupture, the road network coverage rate improving forwarding information comprehensive angle from the point of view of, still have some limitations or not enough, it shows
It is susceptible to channel when traffic density is bigger and fights for or take the phenomenon that Internet resources are serious, and in traffic density rareness or workshop
When density inequality, there will be again Information Communication chain rupture and cannot continue to propagate by information, and forwarding information cannot cover completely
Cover the phenomenon of whole network.
Summary of the invention
It is an object of the invention to provide a kind of road grid traffic information fast propagation method based on VANET, existing to solve
There is technology when propagating information of vehicles, be susceptible to channel when traffic density is bigger and fight for or take serious the asking of Internet resources
Topic, and when traffic density rareness or following distance density inequality, there will be again Information Communication chain rupture and cannot continue to pass by information
Broadcast, and the problem that forwarding information cannot be completely covered whole network.
For solving above-mentioned technical problem, the present invention provides a kind of road grid traffic information fast propagation method based on VANET,
The most each node pre-sets the forwarding time in cycle of transport information, and the method includes:
Step one: diffusion of information center reception on each section in its diffusion of information direction and in its communication range
Node distributing traffic information；
Step 2: receive each receiving node of the transport information that described diffusion of information center is issued on each section, according to
Oneself calculates the corresponding forwarding waiting time to the operating range at diffusion of information center, and by each section to diffusion of information center
The farthest receiving node of operating range preferentially forward described transport information when the forwarding waiting time of self correspondence arrives；
Step 3: any time subsequently, on each section in the diffusion of information direction at described diffusion of information center, by information
The receiving node that the operating range of dispersal center is farthest forwards this transport information with described forwarding time in cycle for gap periods, its
If his receiving node received within the corresponding forwarding waiting time arrives the operating range at diffusion of information center on this section than oneself
The identical transport information forwarded to the receiving node that the operating range at diffusion of information center is farther, then stop forwarding this traffic and disappear
Breath, otherwise, forwards this transport information with described forwarding time in cycle for gap periods, and receives this road in cycle repeating process
In section, the operating range to diffusion of information center forwards to the receiving node that the operating range at diffusion of information center is farther than oneself
Identical transport information time dwelling period forward.
Preferably, described step 3 also includes: if on arbitrary section in the diffusion of information direction at described diffusion of information center,
It is the receiving node driving towards diffusion of information center to the receiving node that the operating range at diffusion of information center is farthest, then on this section
To the direction running away from diffusion of information center and the receiving node farthest with the operating range at diffusion of information center, right at self
Forwarding waiting time of answering forwards this transport information for gap periods with described forwarding time in cycle after arriving, until before receiving
During the identical transport information that side and other receiving nodes travelled in the same direction with oneself forward, dwelling period forwards.
Preferably, the determination method at the diffusion of information center described in step one is: judge the source joint of distributing traffic information
Point communication range in whether cover intersection, be then using this intersection as diffusion of information center, otherwise this source is saved
Point is as diffusion of information center.
Preferably, the computational methods forwarding the waiting time that in step 2, each node is corresponding are: each receiving node is according to certainly
The inverse relation of the own operating range to diffusion of information center calculates the forwarding waiting time of its correspondence.
Preferably, when diffusion of information center is intersection, the receiving node in intersection before outlet not
The forwarding or the dwelling period that carry out transport information forward transport information.
Preferably, move towards the intersection and receiving node in intersection is before rolling intersection away from, if receiving
Roll this crossing away from and when the identical transport information that other receiving nodes of the direction running away from intersection forward, then remembered
Record and store the road section ID number at the receiving node place sending this transport information；When moving towards the intersection or connecing in intersection
When receipts node rolls this intersection away from and enters next section, inquire about self whether recording the road section ID being currently located, be then
Do not carry out the forwarding of this transport information；Otherwise the cycle forwards this transport information, until other receiving that front travels in the same direction connect
When receiving the identical transport information of node forwarding, dwelling period forwards.
Having the beneficial effect that of the technique scheme of the present invention:
The present invention is preferential forward node with the vehicle node of the furthest distance of disease spread on dispersal direction, is simultaneously introduced distance letter
The breath nearlyer node of dispersal center receive its forwarding information after the mechanism that stops forwarding, thus reach with minimum forward node,
Big propagation distance carries out the fast propagation of transport information.Simultaneously for preventing Information Communication chain cleavage, introduce the week of transport information
Phase forwarding mechanism, to be not received by dispersal direction other node forward transport information time, then the information of carrying is carried out necessarily
The cycle at interval forwards, thus can make the transport information that source node issues quick, without chain rupture at road network diffusive transport at network
In the case of transmission error, downstream node also can promptly and accurately take the fingerprint information, and correct decoded back original packet
Data.
Accompanying drawing explanation
Fig. 1 is a kind of based on VANET road grid traffic information fast propagation method flow schematic diagram of the present invention；
Fig. 2 be Fig. 1 S13 in arbitrary receiving node forward traffic message schematic flow sheet；
Fig. 3 is the schematic diagram that intersection receiving node forwards traffic message.
Detailed description of the invention
For making the technical problem to be solved in the present invention, technical scheme and advantage clearer, below in conjunction with accompanying drawing and tool
Body embodiment is described in detail.
As it is shown in figure 1, a kind of based on VANET road grid traffic information fast propagation method that the present invention provides, each node
Pre-setting the time of the cycle forwarding of transport information, the method includes:
S11: diffusion of information center reception joint on each section in its diffusion of information direction and in its communication range
Point distributing traffic information.Wherein, the diffusion of information direction at described diffusion of information center refers to centered by this diffusion of information center,
Outwardly directed any direction.Arbitrary section in the diffusion of information direction at diffusion of information center refers to diffusion of information center for rising
Point, the arbitrary section on its diffusion of information direction.
S12: receive each receiving node of the transport information that diffusion of information center is issued on each section, according to oneself to letter
Breath dispersal center operating range calculate self correspondence the forwarding waiting time, and by each section to the row at diffusion of information center
Sail and preferentially forward described transport information apart from farthest receiving node when the forwarding waiting time of self correspondence arrives.This step
In, respectively receive the receiving node of the transport information that diffusion of information center is issued according to the operating range oneself arriving diffusion of information center
Calculating the forwarding waiting time of self correspondence, all receiving nodes on the most each section can forward the waiting time automatic according to it
The preferential transfer sequence of the transport information in arrangement section, place, the receiving node farthest by the operating range to diffusion of information center
Described transport information is preferentially forwarded when the forwarding waiting time of self correspondence arrives.
S13: any time subsequently, on each section in the diffusion of information direction at diffusion of information center, by diffusion of information
The receiving node that the operating range of the heart is farthest forwards this transport information with described forwarding time in cycle for gap periods, and other receive
If node receives the operating range arriving diffusion of information center on this section than oneself to information within the corresponding forwarding waiting time
The identical transport information that the farther receiving node of the operating range of dispersal center forwards, then stop forwarding this traffic message, otherwise,
Forward this transport information with forwarding time in cycle for gap periods, and receive in cycle repeating process on this section to information expansion
Dissipate the identical traffic letter that the operating range at center forwards to the receiving node that the operating range at diffusion of information center is farther than oneself
During breath, dwelling period forwards.
Fig. 2 show arbitrary receiving node in the S13 of Fig. 1 and forwards the schematic flow sheet of traffic message, specifically includes step:
S131: current receiving node judges whether the forwarding time of self correspondence arrives, and is to perform S133, otherwise performs
S132；
S132: judge whether to receive by current road segment to diffusion of information center than oneself to the row at diffusion of information center
Sail the identical transport information forwarded apart from farther receiving node, otherwise return and perform S131, be to perform S136；
S133: forward transport information；
S134: judge whether forwarding time in cycle arrives, is to perform S133, otherwise performs S135；
S135: judge whether to receive by current road segment to diffusion of information center than oneself to the row at diffusion of information center
Sail the identical transport information forwarded apart from farther receiving node, otherwise perform S134, be, perform S136；
S136: stop forwarding transport information.
Preferably, step S13 also includes: if on arbitrary section in the diffusion of information direction at described diffusion of information center, arriving
The receiving node that the operating range at diffusion of information center is farthest is the receiving node driving towards diffusion of information center, then on this section to
Away from the direction running at diffusion of information center and the receiving node farthest with the operating range at diffusion of information center, corresponding at self
The forwarding waiting time arrive after forward this transport information for gap periods, until receiving front with described forwarding time in cycle
And other receiving nodes travelled in the same direction with oneself forward identical transport information time dwelling period forward.The thus side of being preferable to carry out
Formula understands: when preferential forward node is to sail out of the receiving node travelled on the direction at diffusion of information center, when its front is without same
To travel other receiving nodes time (though its front whether have drive towards diffusion of information center to receiving node), this reception
Node carries out the cycle forwarding of transport information, until receiving the identical traffic of other receiving nodes forwarding that front travels in the same direction
During information, dwelling period forwards；For driving towards the receiving node at diffusion of information center, receive self rear at it and (include
Rear travels and backward going in the same direction) the identical traffic letter that forwards compared with oneself farther receiving node of range information dispersal center
During breath, dwelling period forwards, and carries out cycle forwarding the most always.By this preferred implementation, by same with diffusion of information center
Carry out cycle forwarding message to the receiving node travelled and range information dispersal center is farthest, can avoid former ought carrying out cycle forwarding
Transport information, the receiving node that drives towards diffusion of information center crosses and diffusion of information during driving towards diffusion of information center
During reception that center travels in the same direction joint, some receiving node close together travelled in the same direction with diffusion of information center is owing to receiving not
The cycle that do not stops during the transport information sent to its front node forwards message, makes transport information at road network to maximally diffuse as far as possible
Scope carries out fast-forwarding.
Preferably, the determination method at the diffusion of information center in step S11 is: judge the source node of distributing traffic information
Whether communication range covers intersection, be then using this intersection as diffusion of information center, otherwise this source node is done
For diffusion of information center.For forthright situation, when i.e. diffusion of information is centrally located on forthright, its diffusion of information direction with it is i.e.
The starting point direction (regardless of vehicle heading) that both direction extends before and after this forthright, the section along diffusion of information direction is wrapped
Include this source node and travel forthright section and the forthright section at this source node traveling rear in front.When diffusion of information center is for intersecting
During crossing, the section on its diffusion of information direction is in (the not separating vehicles traveling side, each section that this crossing intersection part collects
To).
Preferably, the computational methods forwarding the waiting time that in step S12, each node is corresponding are: each receiving node is according to certainly
The inverse relation of the own operating range to diffusion of information center calculates the forwarding waiting time of its correspondence, reaches automatically to arrange with this
The purpose of the preferential transfer sequence of row transport information.That is: send out when each vehicle node on each section receives diffusion of information center
During the transport information of cloth, then inquiring about the ID of this traffic information data bag, if received, then this transport information directly being abandoned,
If receiving this transport information first, then calculate this traffic letter by the inverse relation of the operating range of range information dispersal center
The forwarding waiting time of breath, the thus preferential transfer sequence of auto arrangement transport information, the vehicle node waiting time that distance is the most remote
The shortest, the vehicle node that i.e. operating range is farthest preferentially forwards.
Preferably, when diffusion of information center is intersection, the receiving node in intersection before outlet not
Carry out the forwarding of transport information.
As shown in Figure 3,10. node is the node of distributing traffic information, and dotted line circle is node communication radius 10., dotted line
Shown in arrow be toward away from the receiving node travel direction of intersection direction running, arrow shown in solid is to sail in communication range
Toward the travel direction of the receiving node of intersection, pentagon fritter represents each receiving node.Now this intersection shown in Fig. 3
4 sections on receiving node 1., 3., 5., transport information that the most 8. 10. cycle forward node is issued, in intersection
Receiving nodeThe forwarding of transport information is not carried out before outlet.
Preferably, move towards the intersection and receiving node in intersection is before rolling intersection away from, if receiving
Roll this crossing away from and when the identical transport information that other receiving nodes of the direction running away from intersection forward, then remembered
Record and store the road section ID number at the receiving node place sending this transport information；When moving towards the intersection or connecing in intersection
When receipts node rolls this intersection away from and enters next section, inquire about self whether recording the road section ID being currently located, be then
Do not carry out the forwarding of this transport information；Otherwise the cycle forwards this transport information, until other receiving that front travels in the same direction connect
When receiving the identical transport information of node forwarding, dwelling period forwards.Still as a example by Fig. 3, if 6. the receiving node driving towards crossing is sailed
Before going out this intersection, have been received by rolling this crossing away from and 8. the receiving node to the direction running away from intersection turns
During the identical transport information of transport information that 10. node sent out is issued, 6. receiving node records and stores the road at receiving node 8. place
No. ID (regardless of travel direction) of section, if if then receiving node sails current receiving node 8. residing road into after 6. passing through this intersection
Section, then 6. receiving node is inquired about and self whether was recorded the road section ID (receiving node 8. residing section) currently sailed into, inquires
Then represent to have had on this section and forwarding transport information than self from the receiving node that intersection operating range is farther,
The forwarding of transport information is not carried out after then 6. receiving node enters this section.
In sum, in the case of forthright, after source node sends congestion information, then as diffusion of information center forwards, backwards
Both direction carries out the diffusive transport of information, and the receiving node farthest by distance sources node on dispersal direction before and after it preferentially turns
Sending out, wait in repeating process, the nearer receiving node of distance sources node receives the friendship that the node more farther than own node forwards
The most automatically abandon after communication breath forwarding, to avoid channel to fight for.For complicated road network environment, when the broadcasting area of source node covers
During lid intersection, then determine the congestion information diffusive transport direction along each section with this crossing for diffusion of information center, respectively expand
Dissipate the farthest receiving node on section, direction and will directly carry out the forwarding of transport information cycle, and other receiving node is forwarding wait
In time, if receive the identical transport information that equidirectional farther node forwards, then stop forwarding.And it is the most forwarded over for certain
If this transport information to the receiving node away from diffusion of information center in this transport information the most forwarded over, but forward after do not connect
When receiving the identical transport information that its front travels node forwarding in the same direction, illustrate to there is no the car continuing to forward in travel direction front
Node, then it will carry information and persistently carry out cycle forwarding, during until receiving the transport information that front node in the same direction forwards
Stop.For the receiving node moved towards the intersection, whether received according to it behind crossing on the new section entered to
The identical transport information forwarded away from other nodes travelled on the direction at crossing determines whether to forward this transport information；If
There is receiving record not forward, otherwise will forward in the cycle, until receiving what other receiving nodes that front travels in the same direction forwarded
During identical transport information, dwelling period forwards.
The present invention uses with crossing that source node or its communication range are covered for diffusion of information center, for its model that communicates
Enclose interior receiving node so that it is the transport information of issue in each dispersal direction section, by the traveling of range information dispersal center away from
From giving the preferential transfer sequence of its transport information from far near, the receiving node making operating range on dispersal direction farthest is carried out
Preferential forwarding, can make transport information carry out fast-forwarding at road network to maximally diffuse scope；Simultaneously in order to make transport information quick
Travel to whole road network, simultaneously for avoid great deal of nodes forwarding information to cause fighting for of channel so that it is the node that he is close together
Receive and stop forwarding compared with during the transport information self forwarded apart from farther node on diffusion of information direction, thus reach with
Minimum forward node, minimal communications resource occupation and reach the transport information diffusive transport at road network.Simultaneously for preventing information from passing
Broadcast chain cleavage, introduce the cycle forwarding mechanism of transport information, to being not received by dispersal direction the friendship that other node forwards
During communication breath, then the information of carrying carries out the cycle forwarding of certain intervals, and the transport information that source node thus can be made to issue is quick, nothing
Chain rupture ground is at road network diffusive transport in the case of network transmission error, and downstream node also can promptly and accurately take the fingerprint letter
Breath, and correct decoded back original packet data.
It is above the preferred embodiment of the present invention, it is noted that for those skilled in the art,
On the premise of without departing from principle of the present invention, it is also possible to make some improvements and modifications, these improvements and modifications also should regard
For protection scope of the present invention.
Claims (5)
1. a road grid traffic information fast propagation method based on VANET, it is characterised in that each node pre-sets traffic letter
The forwarding time in cycle of breath, the method includes:
Step one: diffusion of information center receiving node on each section in its diffusion of information direction and in its communication range
Distributing traffic information；
Step 2: receive each receiving node of the transport information that described diffusion of information center is issued on each section, according to oneself
Operating range to diffusion of information center calculates the corresponding forwarding waiting time, and by each section to the row at diffusion of information center
Sail and preferentially forward described transport information apart from farthest receiving node when the forwarding waiting time of self correspondence arrives；
Step 3: any time subsequently, on each section in the diffusion of information direction at described diffusion of information center, by diffusion of information
The receiving node that the operating range at center is farthest forwards this transport information with described forwarding time in cycle for gap periods, and other connect
If receiving node to receive the operating range arriving diffusion of information center on this section than oneself to letter within the corresponding forwarding waiting time
The identical transport information that the farther receiving node of operating range of breath dispersal center forwards, then stop forwarding this traffic message, no
Then, forward this transport information with described forwarding time in cycle for gap periods, and receive in cycle repeating process on this section
The phase forwarded to the receiving node that the operating range at diffusion of information center is farther than oneself to the operating range at diffusion of information center
Forward with dwelling period during transport information.
A kind of road grid traffic information fast propagation method based on VANET, it is characterised in that institute
State step 3 also to include: if on arbitrary section in the diffusion of information direction at described diffusion of information center, to diffusion of information center
The farthest receiving node of operating range is the receiving node driving towards diffusion of information center, then to away from diffusion of information on this section
The direction running of the heart and the receiving node farthest with the operating range at diffusion of information center, in the forwarding waiting time of self correspondence
This transport information is forwarded for gap periods, until receiving front and going in the same direction with oneself with described forwarding time in cycle after arrival
During the identical transport information that other receiving nodes sailed forward, dwelling period forwards.
A kind of road grid traffic information fast propagation method based on VANET, it is characterised in that step
The determination method at the diffusion of information center described in rapid is: judge distributing traffic information source node communication range in whether
Cover intersection, be then using this intersection as diffusion of information center, otherwise by this source node as diffusion of information center.
A kind of road grid traffic information fast propagation method based on VANET, it is characterised in that step
The computational methods forwarding the waiting time that in rapid two, each node is corresponding are: each receiving node arrives diffusion of information center according to oneself
The inverse relation of operating range calculates the forwarding waiting time of its correspondence.
A kind of road grid traffic information fast propagation method based on VANET, it is characterised in that when
When diffusion of information center is intersection, the receiving node in intersection does not carries out the forwarding of transport information before outlet
Or dwelling period forwards transport information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410002190.0A CN103763753B (en) | 2014-01-03 | 2014-01-03 | A kind of road grid traffic information fast propagation method based on VANET |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410002190.0A CN103763753B (en) | 2014-01-03 | 2014-01-03 | A kind of road grid traffic information fast propagation method based on VANET |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103763753A CN103763753A (en) | 2014-04-30 |
| CN103763753B true CN103763753B (en) | 2017-01-04 |
Family
ID=50530896
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410002190.0A Expired - Fee Related CN103763753B (en) | 2014-01-03 | 2014-01-03 | A kind of road grid traffic information fast propagation method based on VANET |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103763753B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104157140A (en) * | 2014-08-15 | 2014-11-19 | 北京科技大学 | Large-scale urban road network vehicle congestion autonomous acquisition and transmission system |
| CN104519463B (en) * | 2014-12-16 | 2018-05-08 | 大连理工大学 | The method for submitting suspension information and content conformity in VANET based on the two-stage |
| CN104835316B (en) * | 2015-05-26 | 2017-03-22 | 大连理工大学 | Traffic flow density-based solution to problem of VANET sparse connectivity |
| CN105228215B (en) * | 2015-09-01 | 2018-07-06 | 重庆邮电大学 | More copy method for routing based on decision tree mechanism in vehicular ad hoc network |
| CN105682046B (en) * | 2016-03-10 | 2018-12-28 | 重庆邮电大学 | Interest package transmitting method in vehicle-mounted name data network based on data attribute |
| CN105847326B (en) * | 2016-03-14 | 2018-11-30 | 河海大学 | A kind of vehicle connection cloud resource Dynamic Deployment System |
| CN106961707B (en) * | 2017-03-06 | 2019-09-27 | 哈尔滨工程大学 | Multifactor decision making Routing Protocol based on connectivity in a kind of VANET |
| CN109195094B (en) * | 2018-08-30 | 2020-10-02 | 北京邮电大学 | Dynamic resource selection method, device and system based on geographic position |
| CN112969145B (en) * | 2021-02-04 | 2022-02-11 | 泰州学院 | Regional message suspension method, device, equipment and storage medium based on self-organizing network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011091534A (en) * | 2009-10-21 | 2011-05-06 | Honda Motor Co Ltd | Vehicle network system |
| JP2012085202A (en) * | 2010-10-14 | 2012-04-26 | Honda Motor Co Ltd | Wireless communication device capable of transmitting/receiving vehicle position information |
-
2014
- 2014-01-03 CN CN201410002190.0A patent/CN103763753B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011091534A (en) * | 2009-10-21 | 2011-05-06 | Honda Motor Co Ltd | Vehicle network system |
| JP2012085202A (en) * | 2010-10-14 | 2012-04-26 | Honda Motor Co Ltd | Wireless communication device capable of transmitting/receiving vehicle position information |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103763753A (en) | 2014-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103763753B (en) | A kind of road grid traffic information fast propagation method based on VANET | |
| CN107071854B (en) | The distributed multihop broadcasting method of relay forwarding probability is maximized based on car networking | |
| Taleb et al. | Toward an effective risk-conscious and collaborative vehicular collision avoidance system | |
| Bi et al. | A multi-hop broadcast protocol for emergency message dissemination in urban vehicular ad hoc networks | |
| Liu et al. | Cloud-assisted safety message dissemination in VANET–cellular heterogeneous wireless network | |
| Ji et al. | SDGR: An SDN-based geographic routing protocol for VANET | |
| Schwartz et al. | A directional data dissemination protocol for vehicular environments | |
| US9554322B2 (en) | Transmission control method and communication apparatus using the same for vehicular ad hoc network system | |
| Chou et al. | Intersection-based routing protocol for VANETs | |
| Chuang et al. | DEEP: Density-aware emergency message extension protocol for VANETs | |
| CN105959993B (en) | A kind of multi-hop transmission communication of algorithms applied to vehicle self-organizing network | |
| Ghafoor et al. | Intelligent beaconless geographical forwarding for urban vehicular environments | |
| CN105376152B (en) | A kind of more candidate compound relay data transmission methods in In-vehicle networking | |
| Luo et al. | CFT: A cluster-based file transfer scheme for highway VANETs | |
| JP2017184051A (en) | Wireless communication apparatus and wireless communication method | |
| Tomar et al. | State of the art of data dissemination in VANETs | |
| Yan et al. | DOVE: Data dissemination to a desired number of receivers in VANET | |
| Chitra et al. | Efficient broadcasting mechanisms for data dissemination in vehicular ad hoc networks | |
| Chitra et al. | Selective epidemic broadcast algorithm to suppress broadcast storm in vehicular ad hoc networks | |
| KR20140068591A (en) | Network system for vehicle | |
| Meneguette et al. | A self-adaptive data dissemination solution for intelligent transportation systems | |
| Hadded et al. | Performance evaluation of a TDMA-based multi-hop communication scheme for reliable delivery of warning messages in vehicular networks | |
| Li et al. | A multihop broadcast mechanism for emergency messages dissemination in VANETs | |
| CN105682054B (en) | The distribution method and device of wireless self-networking multi-hop data | |
| KR20090056072A (en) | Emergency warning message broadcasting method using range-based relay node selecting method for vehicular ad-hoc network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170104 Termination date: 20200103 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |