CN103763753A - Rapid road network traffic information spreading method based on VANET - Google Patents
Rapid road network traffic information spreading method based on VANET Download PDFInfo
- Publication number
- CN103763753A CN103763753A CN201410002190.0A CN201410002190A CN103763753A CN 103763753 A CN103763753 A CN 103763753A CN 201410002190 A CN201410002190 A CN 201410002190A CN 103763753 A CN103763753 A CN 103763753A
- Authority
- CN
- China
- Prior art keywords
- information
- diffusion
- forwarding
- node
- 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.)
- Granted
Links
Images
Landscapes
- Traffic Control Systems (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a rapid road network traffic information spreading method based on a VANET, and relates to the field of vehicle-mounted ad hoc networks. According to the method, the problems that when vehicle information is spread in the prior art, channel scrambling is prone to occurring or network resource occupation is severe when the vehicle density is higher, and information spreading discontinuity can occur when the vehicle density is low or the density of distances between vehicles is uneven are solved. According to the method, a vehicle node with the farthest spreading distance in the diffusion direction of an information diffusion center is used as a preferential forwarding node, after nodes closer to the operating range of the information diffusion center in the same road section receive traffic information forwarded by farther receiving nodes, the nodes stop forwarding the traffic information or when the traffic information forwarded by the farthest node is not received in a waiting time, periodic forwarding is performed, therefore, rapid spreading of the traffic information is achieved through the least forwarding nodes and at the longest spreading distance, and the traffic information can be diffused and spread in road networks rapidly and continuously.
Description
Technical field
The present invention relates to a kind of vehicular ad hoc network network field, relate in particular to a kind of road grid traffic information fast propagation method based on VANET.
Background technology
Along with the increase year by year of private car, traffic congestion has become the very general phenomenon of city road network, if make vehicle can recognize early the road network section that blocks up, carries out path planning, can reduce vehicle congestion, alleviates road congestion conditions.Truck traffic is a kind of effective means of radio transmission information of vehicles, and wherein Radio Broadcasting Agreements is a kind of comparatively common and important circulation way, genus flooded broadcast (Flooding) agreement that it is the most common, but all nodes of this agreement all carry out information forwarding, thereby there will be that serious channel is fought for, the problem such as broadcast storm even.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) etc. people has proposed (pertinent literature: 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) flooding algorithm based on probability, be that vehicle node is carried out forwarding information with probability, thereby reduced forward node quantity, and the people such as Qian Shu (money relaxes, Dynamical probabilistic scheme [J] based on distance in Zhang Xihuang .Ad Hoc network. computer engineering and design, 2007,28 (14): 3373-3375) will be apart from getting up to take in Probabilistic Synthesis, according to spaces of vehicles, dynamically adjust forwarding probability, give the preferential forwarding power that distant node is higher, but this type of information pass-through mode based on probability has certain uncertainty, in the sparse network of node, easily there is network cavity and cause the phenomenons such as Information Communication chain rupture.YuanguoBi etc. have proposed (Yuanguo Bi, Hai Zhao, Xuemin (Sherman) Shen:A Directional Broadcast Protocol for Emergency Message Exchange in Inter-Vehicle Communications[C] .ICC2009:1-5) location-based Radio Broadcasting Agreements, by BCTS/CTS, shaking hands to find maximum distance node is via node, in addition also has a kind of common (Broadcast protocol of the Radio Broadcasting Agreements based on information of neighbor nodes, BCAST) (Thomas Kunz.Multicasting in mobile ad-hoc networks:achieving high packet delivery ratios[J] .Systems and Computer Engineering.Carleton University, pp.156-170.IBM, (2003) .), be that the node that neighbor node quantity is many preferentially forwards, with this, reduce forward node number, but because all needing periodically to exchange hello, each node wraps to obtain adjacent node information, also the channel occurring is to a certain degree fought for.
Although above-mentioned Radio Broadcasting Agreements visual angle is different, differ from one another, but the comprehensive angle of fighting for and taking, avoid Information Communication chain rupture, improve the road network coverage rate of forwarding information from reducing channel, still have some limitations or deficiency, it shows that when traffic density is larger, channel easily occurring fights for or take the serious phenomenon of Internet resources, and when traffic density rareness or following distance density inequality, there will be again Information Communication chain rupture and information cannot be continued to propagate, and forwarding information cannot cover the phenomenon of whole network completely.
Summary of the invention
The object of the present invention is to provide a kind of road grid traffic information fast propagation method based on VANET, to solve prior art when propagating information of vehicles, when traffic density is larger, easily there is channel and fight for or take the serious problem of Internet resources, and when traffic density rareness or following distance density inequality, there will be again Information Communication chain rupture and information cannot be continued to propagate, and forwarding information cannot cover the problem of whole network completely.
For solving the problems of the technologies described above, the invention provides a kind of road grid traffic information fast propagation method based on VANET, wherein each node sets in advance the forwarding time in cycle of transport information, and the method comprises:
Step 1: the receiving node distributing traffic information in diffusion of information on each section of its diffusion of information direction of mind-set and in its communication range;
Step 2: each receiving node that receives the transport information of described diffusion of information center issue on each section, according to oneself, to the operating range at diffusion of information center, calculate the corresponding forwarding stand-by period, and by forwarding described transport information to the operating range at diffusion of information center receiving node is farthest preferential when the forwarding stand-by period of self correspondence arrives on each section;
Step 3: any time subsequently, on each section of the diffusion of information direction at described diffusion of information center, by the receiving node farthest of the operating range to diffusion of information center, take described forwarding time in cycle and forward this transport information as gap periods, if other receiving nodes are received the identical transport information forwarding to the operating range at the diffusion of information center receiving node more farther than the operating range that oneself arrives diffusion of information center on this section within the corresponding forwarding stand-by period, stop forwarding this traffic message, otherwise, take described forwarding time in cycle forwards this transport information as gap periods, and dwelling period forwarding while receiving on this section the operating range at diffusion of information center than the own identical transport information forwarding to the farther receiving node of the operating range at diffusion of information center in cycle repeating process.
Preferably, described step 3 also comprises: if on arbitrary section of the diffusion of information direction at described diffusion of information center, to the operating range at diffusion of information center receiving node farthest, it is the receiving node that drives towards diffusion of information center, on this section to the direction running away from diffusion of information center and with the operating range at diffusion of information center receiving node farthest, after the forwarding stand-by period of self correspondence arrives, take described forwarding time in cycle forwards this transport information as gap periods, until receive the place ahead and during identical transport information that other receiving nodes of travelling in the same way with oneself forward dwelling period forward.
Preferably, definite method at the diffusion of information center described in step 1 is: judge in the communication range of source node of distributing traffic information whether cover intersection, using this intersection as diffusion of information center, otherwise by this source node as diffusion of information center.
Preferably, the computational methods of the forwarding stand-by period that in step 2, each node is corresponding are: each receiving node calculates the forwarding stand-by period of its correspondence to the inverse relation of the operating range at diffusion of information center according to oneself.
Preferably, when diffusion of information center is intersection, forwarding or dwelling period that the receiving node in intersection does not carry out transport information before outlet forward transport information.
Preferably, drive towards receiving node in He intersection, intersection before rolling intersection away from, if receive, roll this crossing away from and forward to other receiving nodes of the direction running away from intersection identical transport information time, record and store the road section ID number at the receiving node place of sending this transport information; When the receiving node in driving towards intersection or intersection rolls this intersection away from and enters next section, inquiring about the road section ID that self whether recorded current place, is not carry out the forwarding of this transport information; Otherwise the cycle forwards this transport information, until dwelling period forwards while receiving the identical transport information that other receiving nodes that the place ahead travels in the same way forward.
The beneficial effect of technique scheme of the present invention is as follows:
It is preferential forward node that the vehicle node of the furthest distance of disease spread on dispersal direction is take in the present invention, introduce the nearlyer node of range information dispersal center simultaneously and receive the mechanism stopping forwarding after its forwarding information, thereby reach the fast propagation that carries out transport information with minimum forward node, maximum propagation distance.Simultaneously for preventing Information Communication chain rupture phenomenon, introduce the cycle forwarding mechanism of transport information, when not receiving on dispersal direction the transport information that other node forwards, carry information carries out the cycle forwarding of certain intervals, the transport information that can make thus source node issue fast, without chain rupture in the situation that road network diffusion is propagated in Internet Transmission mistake, the downstream node information that also can promptly and accurately take the fingerprint, and correct decoding reduction original packet data.
Accompanying drawing explanation
Fig. 1 is a kind of road grid traffic information fast propagation method flow schematic diagram based on VANET of the present invention;
Fig. 2 is the schematic flow sheet that in the S13 of Fig. 1, arbitrary receiving node forwards traffic message;
Fig. 3 is the schematic diagram that intersection receiving node forwards traffic message.
Embodiment
For making the technical problem to be solved in the present invention, technical scheme and advantage clearer, be described in detail below in conjunction with the accompanying drawings and the specific embodiments.
As shown in Figure 1, a kind of road grid traffic information fast propagation method based on VANET provided by the invention, each node sets in advance the time of the cycle forwarding of transport information, and the method comprises:
S11: the receiving node distributing traffic information in diffusion of information on each section of its diffusion of information direction of mind-set and in its communication range.Wherein, the diffusion of information direction at described diffusion of information center refers to centered by this diffusion of information center, points to any direction in outside.Arbitrary section of the diffusion of information direction at diffusion of information center refers to take diffusion of information center as starting point, along the arbitrary section in its diffusion of information direction.
S12: each receiving node that receives the transport information of diffusion of information center issue on each section, according to oneself, to the operating range at diffusion of information center, calculate the forwarding stand-by period of self correspondence, and by each section to the operating range at diffusion of information center receiving node farthest described transport information of preferential forwarding when the forwarding stand-by period of self correspondence arrives.In this step, respectively receive that the receiving node basis of the transport information of diffusion of information center issue oneself arrives the forwarding stand-by period of operating range calculating self correspondence at diffusion of information center, all receiving nodes on each section can forward according to it preferential transfer sequence of the transport information in section, stand-by period auto arrangement place thus, by the receiving node farthest of the operating range to diffusion of information center is preferential when the forwarding stand-by period of self correspondence arrives, forward described transport information.
S13: any time subsequently, on each section of the diffusion of information direction at diffusion of information center, by the receiving node farthest of the operating range to diffusion of information center, take described forwarding time in cycle and forward this transport information as gap periods, if other receiving nodes are received the identical transport information forwarding to the operating range at the diffusion of information center receiving node more farther than the operating range that oneself arrives diffusion of information center on this section within the corresponding forwarding stand-by period, stop forwarding this traffic message, otherwise, take forwarding time in cycle forwards this transport information as gap periods, and dwelling period forwarding while receiving on this section the operating range at diffusion of information center than the own identical transport information forwarding to the farther receiving node of the operating range at diffusion of information center in cycle repeating process.
Figure 2 shows that arbitrary receiving node in the S13 of Fig. 1 forwards the schematic flow sheet of traffic message, specifically comprises step:
S131: current receiving node judges whether the forwarding time of self correspondence arrive, and is to carry out S133, otherwise carries out S132;
S132: judging whether to receive the identical transport information forwarding to the farther receiving node of the operating range at diffusion of information center than oneself to diffusion of information center by current section, carry out S131 otherwise return, is to carry out S136;
S133: forward transport information;
S134: judging whether forwarding time in cycle arrive, is to carry out S133, otherwise carry out S135;
S135: judging whether to receive the identical transport information forwarding to the farther receiving node of the operating range at diffusion of information center than oneself to diffusion of information center by current section, otherwise carry out S134, is to carry out S136;
S136: stop forwarding transport information.
Preferably, step S13 also comprises: if on arbitrary section of the diffusion of information direction at described diffusion of information center, to the operating range at diffusion of information center receiving node farthest, it is the receiving node that drives towards diffusion of information center, on this section to the direction running away from diffusion of information center and with the operating range at diffusion of information center receiving node farthest, after the forwarding stand-by period of self correspondence arrives, take described forwarding time in cycle forwards this transport information as gap periods, until receive the place ahead and during identical transport information that other receiving nodes of travelling in the same way with oneself forward dwelling period forward.Preferred implementation is known thus: when preferential forward node is while sailing out of the receiving node travelling in the direction at diffusion of information center, when its place ahead without travel in the same way other receiving nodes time (no matter whether its place ahead has the subtend receiving node that drives towards diffusion of information center), the cycle that this receiving node carries out transport information forwards, until dwelling period forwards while receiving the identical transport information that other receiving nodes of travelling in the same way in the place ahead forward; For the receiving node that drives towards diffusion of information center, when it receives the identical transport information that self rear (comprise travel in the same way in rear and backward going) own farther receiving node of range information dispersal center forwards, dwelling period forwards, otherwise carries out cycle forwarding always.By this preferred implementation, by travelling in the same way with diffusion of information center and range information dispersal center receiving node farthest carrys out cycle forwarding messages, can avoid formerly carrying out the cycle forwards transport information, when the receiving node that drives towards diffusion of information center is crossed the reception joint travelling in the same way with diffusion of information center in the process of driving towards diffusion of information center, the receiving node of some close together of travelling in the same way with diffusion of information center does not stop cycle forwarding messages owing to can not receive the transport information that its place ahead node sends, make as far as possible transport information with maximum range of scatter, carry out fast-forwarding at road network.
Preferably, definite method at the diffusion of information center in step S11 is: judge in the communication range of source node of distributing traffic information whether cover intersection, using this intersection as diffusion of information center, otherwise by this source node as diffusion of information center.For forthright situation, be that diffusion of information is while being centered close on forthright, its diffusion of information direction take the direction (regardless of vehicle heading) that its former and later two directions as starting point to this forthright are extended, and comprises this source node travel forthright section at rear of the forthright section in the place ahead and this source node of travelling along the section of diffusion of information direction.When diffusion of information center is intersection, the section in its diffusion of information direction is each section (regardless of vehicle heading) of collecting at this crossing intersection part.
Preferably, the computational methods of the forwarding stand-by period that in step S12, each node is corresponding are: each receiving node calculates the forwarding stand-by period of its correspondence to the inverse relation of the operating range at diffusion of information center according to oneself, with this, reach the object of the preferential transfer sequence of auto arrangement transport information.That is: when each vehicle node on each section receives the transport information of diffusion of information center issue, inquire about the ID of this traffic information data bag, if received, this transport information is directly abandoned, if receive first this transport information, by the inverse relation of the operating range of range information dispersal center, calculate the forwarding stand-by period of this transport information, the preferential transfer sequence of auto arrangement transport information thus, the vehicle node stand-by period that distance is far away is shorter, and operating range vehicle node farthest preferentially forwards.
Preferably, when diffusion of information center is intersection, the receiving node in intersection does not carry out the forwarding of transport information before outlet.
As shown in Figure 3,10. node is the node of distributing traffic information, dotted line circle is node communication radius 10., arrow shown in dotted line is toward the receiving node travel direction away from intersection direction running, arrow shown in solid line is in communication range, to sail for the travel direction of the receiving node of intersection, and pentagon fritter represents each receiving node.Shown in Fig. 3 now the receiving node on 4 of this intersection sections 1., 3., 5., transport information that 7. 8. 10. cycle forward node is issued, the receiving node in intersection
before outlet, do not carry out the forwarding of transport information.
Preferably, drive towards receiving node in He intersection, intersection before rolling intersection away from, if receive, roll this crossing away from and forward to other receiving nodes of the direction running away from intersection identical transport information time, record and store the road section ID number at the receiving node place of sending this transport information; When the receiving node in driving towards intersection or intersection rolls this intersection away from and enters next section, inquiring about the road section ID that self whether recorded current place, is not carry out the forwarding of this transport information; Otherwise the cycle forwards this transport information, until dwelling period forwards while receiving the identical transport information that other receiving nodes that the place ahead travels in the same way forward.Still take Fig. 3 as example, if drive towards the receiving node at crossing 6. before rolling this intersection away from, while having received the identical transport information of transport information of having rolled this crossing away from and 10. having issued to the node that 8. receiving node of the direction running away from intersection forwards, 6. receiving node records and the 8. road section ID number (regardless of travel direction) at place of storing received node, if if receiving node sails 8. section of living in of current receiving node into after 6. passing through this intersection, 6. receiving node is inquired about and self whether was recorded current road section ID of sailing into (receiving node is section of living in 8.), inquired and represented on this section had than self and forwarded transport information from the farther receiving node of intersection operating range, receiving node does not carry out the forwarding of transport information after 6. entering this section.
In sum, in forthright situation, source node sends after congestion information, as diffusion of information center forwards, backwards the both direction diffusion of carrying out information propagate, by distance sources node receiving node farthest on dispersal direction before and after it, preferentially forwarded, wait in repeating process, the nearer receiving node of distance sources node is abandoned forwarding after receiving the transport information that the node more farther than self node forward automatically, to avoid channel to fight for.For complicated road network environment, when the broadcasting area of source node covers intersection, take this crossing determines that as diffusion of information center congestion information is along the diffusion direction of propagation in each section, receiving node farthest on each dispersal direction section will directly carry out the forwarding of transport information cycle, and other receiving node forwarded in the stand-by period, if while receiving the identical transport information of equidirectional farther node forwarding, stop forwarding.And if for certain, forwarded this transport information to the receiving node away from diffusion of information center, forwarding this transport information, but when not receiving its place ahead after forwarding and travelling in the same way the identical transport information that node forwards, explanation there is no the vehicle node that continues forwarding in travel direction the place ahead, it continues carry information to carry out cycle forwarding, until stop while receiving the place ahead transport information that node forwards in the same way.For the receiving node that drives towards intersection, through whether receiving on the new section entering according to it identical transport information forwarding to other nodes that travel in the direction away from crossing behind crossing, determined whether to forward this transport information; If existing receiving record does not forward, otherwise will forward in the cycle, until dwelling period forwards while receiving the identical transport information that other receiving nodes of travelling in the same way in the place ahead forward.
The present invention adopts that to take the crossing that source node or its communication range were covered be diffusion of information center, for the receiving node in its communication range, make the transport information of its issue in each dispersal direction section, by the operating range of range information dispersal center, give from far near the preferential transfer sequence of its transport information, operating range receiving node farthest on dispersal direction is preferentially forwarded, can make transport information with maximum range of scatter, carry out fast-forwarding at road network; Simultaneously in order to make transport information fast propagation to whole road network, simultaneously for to avoid great deal of nodes forwarding information to cause fighting for of channel, while making the node of other close together receive the transport information forwarding compared with the farther node of self distance in diffusion of information direction and stop forwarding, reach thus and with minimum forward node, minimal communications resource occupation, reach transport information and propagate in the diffusion of road network.Simultaneously for preventing Information Communication chain rupture phenomenon, introduce the cycle forwarding mechanism of transport information, when not receiving on dispersal direction the transport information that other node forwards, carry information carries out the cycle forwarding of certain intervals, the transport information that can make thus source node issue fast, without chain rupture in the situation that road network diffusion is propagated in Internet Transmission mistake, the downstream node information that also can promptly and accurately take the fingerprint, and correct decoding reduction original packet data.
It is more than the preferred embodiment of the present invention; it should be pointed out that for those skilled in the art, do not departing under the prerequisite of principle of the present invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (6)
1. the road grid traffic information fast propagation method based on VANET, is characterized in that, each node sets in advance the forwarding time in cycle of transport information, and the method comprises:
Step 1: the receiving node distributing traffic information in diffusion of information on each section of its diffusion of information direction of mind-set and in its communication range;
Step 2: each receiving node that receives the transport information of described diffusion of information center issue on each section, according to oneself, to the operating range at diffusion of information center, calculate the corresponding forwarding stand-by period, and by forwarding described transport information to the operating range at diffusion of information center receiving node is farthest preferential when the forwarding stand-by period of self correspondence arrives on each section;
Step 3: any time subsequently, on each section of the diffusion of information direction at described diffusion of information center, by the receiving node farthest of the operating range to diffusion of information center, take described forwarding time in cycle and forward this transport information as gap periods, if other receiving nodes are received the identical transport information forwarding to the operating range at the diffusion of information center receiving node more farther than the operating range that oneself arrives diffusion of information center on this section within the corresponding forwarding stand-by period, stop forwarding this traffic message, otherwise, take described forwarding time in cycle forwards this transport information as gap periods, and dwelling period forwarding while receiving on this section the operating range at diffusion of information center than the own identical transport information forwarding to the farther receiving node of the operating range at diffusion of information center in cycle repeating process.
2. a kind of road grid traffic information fast propagation method based on VANET as claimed in claim 1, it is characterized in that, described step 3 also comprises: if on arbitrary section of the diffusion of information direction at described diffusion of information center, to the operating range at diffusion of information center receiving node farthest, it is the receiving node that drives towards diffusion of information center, on this section to the direction running away from diffusion of information center and with the operating range at diffusion of information center receiving node farthest, after the forwarding stand-by period of self correspondence arrives, take described forwarding time in cycle forwards this transport information as gap periods, until receive the place ahead and during identical transport information that other receiving nodes of travelling in the same way with oneself forward dwelling period forward.
3. a kind of road grid traffic information fast propagation method based on VANET as claimed in claim 2, it is characterized in that, definite method at the diffusion of information center described in step 1 is: judge in the communication range of source node of distributing traffic information whether cover intersection, using this intersection as diffusion of information center, otherwise by this source node as diffusion of information center.
4. a kind of road grid traffic information fast propagation method based on VANET as claimed in claim 3, it is characterized in that, the computational methods of the forwarding stand-by period that in step 2, each node is corresponding are: each receiving node calculates the forwarding stand-by period of its correspondence to the inverse relation of the operating range at diffusion of information center according to oneself.
5. a kind of road grid traffic information fast propagation method based on VANET as claimed in claim 4, it is characterized in that, when diffusion of information center is intersection, forwarding or dwelling period that the receiving node in intersection does not carry out transport information before outlet forward transport information.
6. a kind of road grid traffic information fast propagation method based on VANET as claimed in claim 5, it is characterized in that, drive towards receiving node in He intersection, intersection before rolling intersection away from, if receive, roll this crossing away from and forward to other receiving nodes of the direction running away from intersection identical transport information time, record and store the road section ID number at the receiving node place of sending this transport information;
When the receiving node in driving towards intersection or intersection rolls this intersection away from and enters next section, inquiring about the road section ID that self whether recorded current place, is not carry out the forwarding of this transport information; Otherwise the cycle forwards this transport information, until dwelling period forwards while receiving the identical transport information that other receiving nodes that the place ahead travels in the same way forward.
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 true CN103763753A (en) | 2014-04-30 |
| CN103763753B 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) |
Cited By (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 |
| CN104519463A (en) * | 2014-12-16 | 2015-04-15 | 大连理工大学 | Two-stage submit based suspension information content consistency method in VANET (vehicular ad-hoc network) |
| CN104835316A (en) * | 2015-05-26 | 2015-08-12 | 大连理工大学 | Traffic flow density-based solution to problem of VANET sparse connectivity |
| CN105228215A (en) * | 2015-09-01 | 2016-01-06 | 重庆邮电大学 | Based on many copies method for routing of decision tree mechanism in vehicular ad hoc network |
| CN105682046A (en) * | 2016-03-10 | 2016-06-15 | 重庆邮电大学 | Interest packet forwarding method based on data attributes in vehicle-mounted named data networking |
| CN105847326A (en) * | 2016-03-14 | 2016-08-10 | 河海大学 | Dynamic deployment system for vehicular cloud (VC) resources |
| CN106961707A (en) * | 2017-03-06 | 2017-07-18 | 哈尔滨工程大学 | Based on connective Multifactor Decision Making Routing Protocol in a kind of VANET |
| CN109195094A (en) * | 2018-08-30 | 2019-01-11 | 北京邮电大学 | Dynamic resource selection methods, devices and systems based on geographical location |
| CN112969145A (en) * | 2021-02-04 | 2021-06-15 | 泰州学院 | 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 |
Cited By (16)
| 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 |
| CN104519463A (en) * | 2014-12-16 | 2015-04-15 | 大连理工大学 | Two-stage submit based suspension information content consistency method in VANET (vehicular ad-hoc network) |
| CN104835316A (en) * | 2015-05-26 | 2015-08-12 | 大连理工大学 | Traffic flow density-based solution to problem of VANET sparse connectivity |
| CN104835316B (en) * | 2015-05-26 | 2017-03-22 | 大连理工大学 | Traffic flow density-based solution to problem of VANET sparse connectivity |
| CN105228215A (en) * | 2015-09-01 | 2016-01-06 | 重庆邮电大学 | Based on many copies method for routing of decision tree mechanism in vehicular ad hoc network |
| CN105228215B (en) * | 2015-09-01 | 2018-07-06 | 重庆邮电大学 | More copy method for routing based on decision tree mechanism in vehicular ad hoc network |
| CN105682046A (en) * | 2016-03-10 | 2016-06-15 | 重庆邮电大学 | Interest packet forwarding method based on data attributes in vehicle-mounted named data networking |
| CN105682046B (en) * | 2016-03-10 | 2018-12-28 | 重庆邮电大学 | Interest package transmitting method in vehicle-mounted name data network based on data attribute |
| CN105847326A (en) * | 2016-03-14 | 2016-08-10 | 河海大学 | Dynamic deployment system for vehicular cloud (VC) resources |
| CN105847326B (en) * | 2016-03-14 | 2018-11-30 | 河海大学 | A kind of vehicle connection cloud resource Dynamic Deployment System |
| CN106961707A (en) * | 2017-03-06 | 2017-07-18 | 哈尔滨工程大学 | Based on connective Multifactor Decision Making Routing Protocol in a kind of VANET |
| CN106961707B (en) * | 2017-03-06 | 2019-09-27 | 哈尔滨工程大学 | Multifactor decision making Routing Protocol based on connectivity in a kind of VANET |
| CN109195094A (en) * | 2018-08-30 | 2019-01-11 | 北京邮电大学 | Dynamic resource selection methods, devices and systems based on geographical location |
| CN112969145A (en) * | 2021-02-04 | 2021-06-15 | 泰州学院 | Regional message suspension method, device, equipment and storage medium based on self-organizing network |
| CN112969145B (en) * | 2021-02-04 | 2022-02-11 | 泰州学院 | Regional message suspension method, device, equipment and storage medium based on self-organizing network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103763753B (en) | 2017-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103763753A (en) | Rapid road network traffic information spreading method based on VANET | |
| Chuang et al. | DEEP: Density-aware emergency message extension protocol for VANETs | |
| Chou et al. | Intersection-based routing protocol for VANETs | |
| CN105376152B (en) | A kind of more candidate compound relay data transmission methods in In-vehicle networking | |
| Chitra et al. | Efficient broadcasting mechanisms for data dissemination in vehicular ad hoc networks | |
| Chaabouni et al. | A collision-based beacon rate adaptation scheme (CBA) for VANETs | |
| Sanguesa et al. | Using topology and neighbor information to overcome adverse vehicle density conditions | |
| Vegni et al. | Forwarder smart selection protocol for limitation of broadcast storm problem | |
| Chitra et al. | Selective epidemic broadcast algorithm to suppress broadcast storm in vehicular ad hoc networks | |
| Nguyen et al. | Novel store–carry–forward scheme for message dissemination in vehicular ad-hoc networks | |
| Benrhaiem et al. | Multi-hop reliability for broadcast-based VANET in city environments | |
| Li et al. | A probabilistic broadcasting scheme for emergent message dissemination in urban internet of vehicles | |
| Nguyen et al. | Combining V2I with V2V communications for service continuity in vehicular networks | |
| Maia et al. | A data dissemination protocol for urban vehicular ad hoc networks with extreme traffic conditions | |
| Lin et al. | Reliable forwarding strategy in vehicular networks using NDN | |
| Sahu et al. | Congestion control in vehicular networks using network coding | |
| Malla et al. | A review on vehicle to vehicle communication protocols in VANETs | |
| Ratnani et al. | A novel architecture for vehicular traffic control | |
| Bae | Design and evaluation of a hybrid intelligent broadcast algorithm for alert message dissemination in vanets | |
| KR101119437B1 (en) | A Method of message-transmitting in VANET | |
| Wu et al. | DAYcast: A dynamic transmission delay based broadcast protocol for vehicular ad hoc networks | |
| KR101335803B1 (en) | Method and apparatus for transmitting message adaptively in vihicle ad-hoc network | |
| Marzouk et al. | Enhanced reachability and low latency DENM dissemination protocol for platoon based VANETs | |
| Hajjej et al. | Robust backbone network based on hybrid selection of relays for multi-hop data dissemination in VANETs | |
| Galaviz-Mosqueda et al. | Reliable Multihop Broadcast Protocol with a Low‐Overhead Link Quality Assessment for ITS Based on VANETs in Highway Scenarios |
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 |