CN102300161A - Delay-tolerant VANET broadcasting method at disconnecting state of network - Google Patents
Delay-tolerant VANET broadcasting method at disconnecting state of network Download PDFInfo
- Publication number
- CN102300161A CN102300161A CN2011102434815A CN201110243481A CN102300161A CN 102300161 A CN102300161 A CN 102300161A CN 2011102434815 A CN2011102434815 A CN 2011102434815A CN 201110243481 A CN201110243481 A CN 201110243481A CN 102300161 A CN102300161 A CN 102300161A
- Authority
- CN
- China
- Prior art keywords
- node
- weights
- broadcast
- contact
- data packet
- 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.)
- Pending
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a delay-tolerant VANET broadcasting method at a disconnecting state of a network. Due to the adoption of the method, the problems that in the prior art, the delay-tolerant VANET broadcast cannot be realized because the carrier is not determined and an appropriate transmission time cannot be selected when the network is disconnected can be solved. After an order of a broadcast message is received by a source node, a comprehensive weighted value of the node is calculated, and a data packet is broadcasted; after the broadcast data packet is received by a non-source node, the comprehensive weighted value of the node is calculated, if the comprehensive weighted value is smaller than the received, only the broadcast message is stored; if the comprehensive weighted value is larger than the received comprehensive weighted value, the non-source node is used as a relay node, and the broadcast data packet is stored and carried; a statement packet is regularly broadcasted and carried by the relay node to discover the contact with a new node; after the statement response packet is received, the contact duration and the transmission time are calculated at the relay node, when the transmission time is reached, the relay node performs the repeated broadcast, and the steps are repeated until the entire broadcast area receives the broadcast message.
Description
Technical field
The present invention relates to the broadcasting method of onboard wireless MANET.
Background technology
Under the road traffic environment of reality, vehicle density changes very greatly, and this makes the VANET multihop network have following characteristics: node is advanced along uncertain route; The link life span is short; Node density changes violent, and is overstocked sometimes, and conflict is serious; Sometimes cross rarely, can't guarantee to be communicated with.When node density was too sparse, because euclidean distance between node pair is excessive, node was blocked, or factor such as the node motion is too fast, can cause short, the frequent characteristics such as disconnection of link instability, life period.This is communicated with internodal link and can not get guaranteeing, also just more can't guarantee network-in-dialing.In this case, the agreement of existing connection hypothesis Network Based all can't provide service.But often taking place still to need the VANET network to provide some to insensitive service of time under the scene of disconnection for vehicle.
Delay Tolerant Network refers to those former thereby frequent interruptions of appearance owing to node motion, management, scheduling, mode of operation etc., even is in a class network of interrupt status for a long time.Delay Tolerant Network does not require the network full-mesh, even may there be complete link never in two nodes of generation multi-hop data communication.In Delay Tolerant Network, main adopt store-carry-mode transmitted finishes the transmission to data.When promptly between node, having link,, and when network generation disconnection,, and carry data and move, in the time setting up link, again information is forwarded with other node by the node temporal data that moves directly by internodal communication link transmission data.In the message transmitting procedure of Delay Tolerant Network, when the network disconnection, how to select suitable forward node to carry information, and after linking with other node foundation, how forwarding information all is the subject matter that the Delay Tolerant Network Technology Need solves.
Although the research of the appearance broadcasting aspect late of VANET occurred, the appearance of the VANET key issue of broadcasting late is to be carried by whom when network generation disconnection and how to select suitable forwarding opportunity.This respect does not have correlative study to be seen in report, and therefore existing VANET is difficult to realize holding broadcasting late.
Summary of the invention
The invention provides the slow VANET broadcasting method of appearance under a kind of network disconnected state, fail to finish when the network generation disconnection and to carry by whom and how to select suitable forwarding opportunity thereby be difficult to realize hold the problem of slow VANET broadcasting to solve prior art.The present invention includes following step: one, source node is received the instruction of broadcast;
Two, source node calculates the comprehensive weights of this node;
The computing formula of comprehensive weights is as follows:
W
i＝w
1ΔV
i+w
2ΔD
i+w
3L
i (5-1)
W in the formula
i---the comprehensive weights of node i;
Δ V
i---the speed parameter of node i;
Δ D
i---the node i distance parameter;
L
i---be used for representing the parameter in node track of living in;
Three, source node comprehensive weights that step 2 is calculated and the speed of this node, the packet header that positional information is encapsulated into broadcast data packet, the information of being broadcasted encapsulates into broadcast data packet;
Four, broadcast the broadcast data packet that step 3 obtains;
Five, source node timing T
1Time; If at T
1Do not receive comprehensive weights that other node sends out weights exchange packets in time, carry that source node oneself is as via node by this broadcast data packet of the own buffer memory of source node greater than the source node weights; If source node is at T
1Receive comprehensive weights that other node sends out weights exchange packets in time, then stop to wait for greater than source node; In the source node timing, after non-source node is received broadcast data packet, at first from packet header, extract comprehensive weights, and calculate own with respect to the comprehensive weights of sending node about this bag, comprehensive weights with oneself compare with the comprehensive weights of receiving then, if the comprehensive weights of oneself are then only preserved broadcast message less than the comprehensive weights of receiving; If not the comprehensive weights of source node oneself, then send the next weights to neighbor node statement oneself of weights exchange packets greater than the comprehensive weights of receiving, and begin to wait for T
1Time is at T
1Be loaded with the weights exchange packets bigger as if receiving that other node is sent out in time, then abandon the relaying election and stop T than own weights
1Wait for, if T
1Time to and do not receive the weights exchange packets bigger than own weights, then this broadcast data packet is stored and carried to this non-source node as via node;
Six, election is carried statement and is wrapped and find and the contacting of new node for the source node of via node or non-source node begin periodic broadcasting; The sending time slots that the statement bag is carried in broadcasting is T
i, carry the ID that has broadcast data packet in the statement bag;
Seven, each node is received the broadcast data packet ID that at first extracts after carrying statement wraps wherein, and the tabulation of packet receiving of inquiry oneself, if this Bao Wei was received, then has the statement response packet of own speed and positional information to the via node answer; Via node thinks that promptly new contact is arranged after receiving the statement response packet of answer;
Eight, via node according to the speed and the position of recovery of node contained in wrapping, calculates duration of contact according to formula (5-2) after receiving the statement response packet, and according to the forwarding moment t of formula (5-3) calculating for this contact
RbIf receive new statement response packet before this transmits moment arrival, via node can calculate the duration of contact T of contact this time according to formula (5-2) once more
c, and further calculate the corresponding forwarding of new contact t constantly
Rb'; If the corresponding t of new contact
Rb' the t that calculates when coming in contact before of numerical value
RbNumerical value, then t
RbNumerical value be updated to t
Rb' numerical value, otherwise do not change t
RbNumerical value, until arriving t
RbConstantly, via node begins heavily to broadcast, and node sends broadcast data packet towards periphery;
Duration of contact T
c=D
c+ R
t/ | V
Self-V
Replying| (5-2)
T in the formula
c---duration of contact;
D
c---come in contact internodal distance;
R
t---the transmission radius of node;
V
Self---the speed of via node;
V
Replying---the speed of recovery of node;
The forwarding moment of contact:
t
rb＝t
cb+T
c (5-3)
T wherein
Cb---the contact time started;
t
Rb---this contacts the time of origin of corresponding heavy broadcasting;
Nine, heavily broadcast after, elect the broadcasting of laying equal stress on of new via node, repeat aforesaid operations always and all receive broadcast up to whole broadcast area.
These bright characteristics of utilizing high vehicle speeds, the mode that adopts the signal transmission to combine with mechanical transmission comes transmission information to make the vehicle that participates in communication form an opportunistic network, carry and how to select suitable forwarding opportunity by whom when having determined network generation disconnection, really realized appearance VANET broadcasting.
Description of drawings
Fig. 1 is the schematic diagram of contact process between node of the present invention, and S1 and S2 are two via nodes among the figure; Y1 and Y2 are two and reply node that Fig. 2 is the schematic flow sheet that step 7 contacts with processing node in the step 8.
Embodiment
Embodiment one: specify present embodiment below in conjunction with Fig. 1.Present embodiment comprises the steps:
One, source node is received the instruction of broadcast;
Two, source node calculates the comprehensive weights of this node;
The computing formula of comprehensive weights is as follows:
W
i＝w
1ΔV
i+w
2ΔD
i+w
3L
i (5-1)
W in the formula
i---the comprehensive weights of node i;
Δ V
i---the speed parameter of node i;
Δ D
i---the node i distance parameter;
L
i---be used for representing the parameter in node track of living in;
In order when electing via node, to select and the bigger node of source node relative velocity, make Δ V herein
i=V
i-V
sWherein, V
iBe the travel speed of node i, V
sThen be the speed of sending node.When the underway node that continues is elected, Δ V
iBigger node is more suitable for transmitting data as via node.
Δ D
iBe the node i distance parameter, the relative distance between expression receiving node and the sending node.Δ D
iCan be drawn by the position calculation of node i and sending node, and consider the directivity of message transmission, the definition receiving node is in when being in the sending node downstream on the information transfer directions this Δ D
iFor on the occasion of, and receiving node in information transfer directions with respect to being in the sending node upstream, then make this Δ D
iBe negative value.This Δ D
iBe worth big more, the suitable more via node that is elected as of receiving node.
L
iBe the parameter that is used for representing node track of living in, this parameter is according to the traffic rules setting, and its value is lane number.Here we to define the outermost lane number be 1, other track ecto-entad side adds up.Be more suitable for carrying, transmitting broadcast data owing to be positioned at the node of overtaking lane, so have big L
iThe node of value is more suitable for being elected as via node.
w
1, w
2, w
3Be the weighted value of each parameter, represent the significance level of each influencing factor in synthetic weights, by these weighted values are set, it accounts for the proportion of synthetic weights can to change each parameter according to actual conditions.This weighted value should satisfy: w
1+ w
2+ w
3=1 (0≤w
1, w
2, w
3≤ 1).Finally, by comparing the comprehensive weights election via node that each node calculates according to formula (5-1), election has big comprehensively weights W
iNode as via node.
Three, source node comprehensive weights that step 2 is calculated and the speed of this node, the packet header that positional information is encapsulated into broadcast data packet, the information of being broadcasted encapsulates into broadcast data packet;
Four, broadcast the broadcast data packet that step 3 obtains;
Five, source node timing T
1Time; If at T
1Do not receive comprehensive weights that other node sends out weights exchange packets in time greater than the source node weights, think that source node oneself is more suitable for relaying or does not have other neighbor node on every side, then carried by this broadcast data packet of the own buffer memory of source node, source node oneself is as via node; If source node is at T
1Receive comprehensive weights that other node sends out weights exchange packets in time, then stop to wait for greater than source node; In the source node timing, after non-source node is received broadcast data packet, at first from packet header, extract comprehensive weights, and calculate own with respect to the comprehensive weights of sending node about this bag, comprehensive weights with oneself compare with the comprehensive weights of receiving then, if the comprehensive weights of oneself are then only preserved broadcast message less than the comprehensive weights of receiving; If not the comprehensive weights of source node oneself, then send the next weights to neighbor node statement oneself of weights exchange packets greater than the comprehensive weights of receiving, and begin to wait for T
1Time is at T
1Be loaded with the weights exchange packets bigger as if receiving that other node is sent out in time, then abandon the relaying election and stop T than own weights
1Wait for, if T
1Time to and do not receive the weights exchange packets bigger than own weights, then this broadcast data packet is stored and carried to this non-source node as via node; The comprehensive weights of non-source node also adopt formula (5-1) to calculate.
Six, election is carried statement and is wrapped and find and the contacting of new node for the source node of via node or non-source node begin periodic broadcasting; The time slot that the statement bag is carried in broadcasting is T
i, the setting of this time slot can have influence on the performance of broadcasting, carries the ID that has broadcast data packet in the statement bag; Via node has the new node that the statement bag finds not receive this broadcast data packet that carries of entrained broadcast data packet ID by periodic broadcasting;
Seven, each node is received the broadcast data packet ID that at first extracts after carrying statement wraps wherein, and the tabulation of packet receiving of inquiry oneself, if this Bao Wei was received, then has the statement response packet of own speed and positional information to the via node answer; Via node thinks that promptly new contact is arranged after receiving the statement response packet of answer; But do not transmit BDP immediately, because local vehicle is often arranged on highway with the phenomenon of sailing, this moment is if transmit immediately after receiving RP, the phenomenon of new RP can take place just to have transmitted and received, to such an extent as to constantly transmit, broadcasting efficiency is descended, even may cause conflict, produce " broadcast storm " in the part.
Eight, via node according to the speed and the position of recovery of node contained in wrapping, calculates duration of contact according to formula (5-2) after receiving the statement response packet, and according to the forwarding moment t of formula (5-3) calculating for this contact
RbIf receive new statement response packet before this transmits moment arrival, via node can calculate the duration of contact T of contact this time according to formula (5-2) once more
c, and further calculate the corresponding forwarding of new contact t constantly
Rb'; If the corresponding t of new contact
Rb' the t that calculates when coming in contact before of numerical value
RbNumerical value, then t
RbNumerical value be updated to t
Rb' numerical value, otherwise do not change t
RbNumerical value, until arriving t
RbConstantly, via node begins heavily to broadcast, and node sends broadcast data packet towards periphery; By this method, the heavily broadcasting after coming in contact quilt is constantly prolonged after trying one's best, in case contacting, continuous repeating take place, and each new node that can both cover as much as possible of heavily broadcasting, broadcasting efficiency is improved.
Duration of contact T
c=D
c+ R
t/ | V
Self-V
Replying| (5-2)
T in the formula
c---duration of contact;
D
c---come in contact internodal distance;
R
t---the transmission radius of node;
V
Self---the speed of via node;
V
Replying---the speed of recovery of node.
The forwarding moment of contact:
t
rb＝t
cb+T
c (5-3)
T wherein
Cb---the contact time started;
t
Rb---this contacts the time of origin of corresponding heavy broadcasting;
Nine, heavily broadcast after, elect the broadcasting of laying equal stress on of new via node, repeat aforesaid operations always and all receive broadcast up to whole broadcast area.
(1) protocol theory of the present invention
In order to realize that the VANET network sends broadcast message in the target broadcast area node as much as possible as early as possible when its connectedness can't ensure, traffic behavior feature in conjunction with vehicle among the VANET, when network generation disconnection, the storage of employing Delay Tolerant Network-carry-forwarding strategy, realize the transmission of broadcast by moving of vehicle, to satisfy some to time insensitive VANET broadcast service demand.
This design of protocol supposes that all nodes distribute along road, and only considers along the broadcast message of road direction propagation.Agreement adopts the thought of Delay Tolerant Network, by vehicle node data are stored and carried during at network owing to reason generation disconnections such as node density are rare excessively, building blocks, utilize the physics of vehicle to move to seek an opportunity data broadcasting is gone out, when the vehicle node of store broadcast information and other node come in contact, heavily broadcast.Contact (Contact) refers to two a period of times that node can intercom mutually in the network.The key of this design of protocol is how to select appropriate nodes to be present and to carry broadcast message and carry out relaying and when contact takes place, how to select transmit suitable opportunity, thereby improves broadcasting efficiency, reduces the broadcasting time delay.When network generation disconnection, taken all factors into consideration the factors such as node speed, position and traffic behavior that influence broadcast behavior, design forward node selection algorithm is so that the forward node of selecting can be transmitted to information new node quickly.On the other hand, in road traffic environment,, follow the situation of travelling and still have many cars in the other part though occur through regular meeting can't connecting between the local nodes of network.At this moment, if coming in contact promptly, via node and new node one transmit, then can produce just heavily broadcasted after, carry out new via node election, new contact is arranged again then, need again heavily to broadcast, and then the phenomenon of election via node takes place at once, this can seriously reduce broadcasting efficiency, increases offered load and broadcasting time delay.So for avoiding the generation of above-mentioned phenomenon, when coming in contact, via node can not heavily be broadcasted immediately, cover more new node and need wait for a period of time to select suitable forwarding to make once to transmit opportunity, thereby improve broadcasting efficiency.When via node detects contact, via node can compare according to position, the speed of information such as the geographical position of contact object node, speed with oneself, to calculate length time of contact of node therewith, before finishing, contact heavily do not broadcast, but continue to survey other contact, find more contact as far as possible, make every effort to each forwarding and can cover more new nodes, also can finish data broadcasting with hop count still less to the target area.
(2) realization of agreement
To the discovery of new node, and the information when coming in contact transmits, and defined four kinds of packets in agreement in carrying the broadcast data process for the selection of via node when realizing the disconnection of VANET network, via node:
(1) broadcast data packet (Broadcast Data Packet, BDP)
Refer to carrying the packet of actual broadcast, form by packet header and data field.Definition bag ID initiates node ID in its packet header, wraps information such as rise time, transmits the synthetic weights of this node simultaneously, directly compares with the node of withholding.
(2) the weights exchange packets (Weight Exchange Packet, WEP)
By send these packet switch weights between neighbor node, in order to select via node therein, its content comprises node ID and weights when receiving BDP.
(3) carry statement bag (Carry Announced Packet, CAP)
By the ID of the entrained BDP of this node of via node periodic broadcasting, be used for accusing existing new node, tell it carrying BDP and will transmit.Content is the ID of entrained BDP.
(4) statement response packet (Responding Packet, RP)
New node is searched the BDP of the receipts tabulation of oneself after receiving CAP, then do not reply this bag to via node by the BDP that states among this CAP if receive.Via node receives that this Bao Ze thinks and comes in contact, can calculation contact time in order to make via node, and decision forwarding opportunity, the RP content mainly comprises replys node ID, replys node speed and replys the position of node.
Embodiment two: not being both of present embodiment and execution mode one defines the sending time slots T that the statement bag is carried in broadcasting
iBetween 1s to 10s.
Claims (3)
1. the slow VANET broadcasting method of the appearance under the network disconnected state is characterized in that it comprises the steps:
One, source node is received the instruction of broadcast;
Two, source node calculates the comprehensive weights of this node;
The computing formula of comprehensive weights is as follows:
W
i＝w
1ΔV
i+w
2ΔD
i+w
3L
i (5-1)
W in the formula
i---the comprehensive weights of node i;
Δ V
i---the speed parameter of node i;
Δ D
i---the node i distance parameter;
L
i---be used for representing the parameter in node track of living in;
Three, source node comprehensive weights that step 2 is calculated and the speed of this node, the packet header that positional information is encapsulated into broadcast data packet, the information of being broadcasted encapsulates into broadcast data packet;
Four, broadcast the broadcast data packet that step 3 obtains;
Five, source node timing T
1Time; If at T
1Do not receive comprehensive weights that other node sends out weights exchange packets in time, carry that source node oneself is as via node by this broadcast data packet of the own buffer memory of source node greater than the source node weights; If source node is at T
1Receive comprehensive weights that other node sends out weights exchange packets in time, then stop to wait for greater than source node; In the source node timing, after non-source node is received broadcast data packet, at first from packet header, extract comprehensive weights, and calculate own with respect to the comprehensive weights of sending node about this bag, comprehensive weights with oneself compare with the comprehensive weights of receiving then, if the comprehensive weights of oneself are then only preserved broadcast message less than the comprehensive weights of receiving; If not the comprehensive weights of source node oneself, then send the next weights to neighbor node statement oneself of weights exchange packets greater than the comprehensive weights of receiving, and begin to wait for T
1Time is at T
1Be loaded with the weights exchange packets bigger as if receiving that other node is sent out in time, then abandon the relaying election and stop T than own weights
1Wait for, if T
1Time to and do not receive the weights exchange packets bigger than own weights, then this broadcast data packet is stored and carried to this non-source node as via node;
Six, election is carried statement and is wrapped and find and the contacting of new node for the source node of via node or non-source node begin periodic broadcasting; The sending time slots that the statement bag is carried in broadcasting is T
i, carry the ID that has broadcast data packet in the statement bag;
Seven, each node is received the broadcast data packet ID that at first extracts after carrying statement wraps wherein, and the tabulation of packet receiving of inquiry oneself, if this Bao Wei was received, then has the statement response packet of own speed and positional information to the via node answer; Via node thinks that promptly new contact is arranged after receiving the statement response packet of answer;
Eight, via node according to the speed and the position of recovery of node contained in wrapping, calculates duration of contact according to formula (5-2) after receiving the statement response packet, and according to the forwarding moment t of formula (5-3) calculating for this contact
RbIf receive new statement response packet before this transmits moment arrival, via node can calculate the duration of contact T of contact this time according to formula (5-2) once more
c, and further calculate the corresponding forwarding of new contact t constantly
Rb'; If the corresponding t of new contact
Rb' the t that calculates when coming in contact before of numerical value
RbNumerical value, then t
RbNumerical value be updated to t
Rb' numerical value, otherwise do not change t
RbNumerical value, until arriving t
RbConstantly, via node begins heavily to broadcast, and node sends broadcast data packet towards periphery;
Duration of contact T
c=D
c+ R
t/ | V
Self-V
Replying| (5-2)
T in the formula
c---duration of contact;
D
c---come in contact internodal distance;
R
t---the transmission radius of node;
V
Self---the speed of via node;
V
Replying---the speed of recovery of node;
The forwarding moment of contact:
t
rb＝t
cb+T
c (5-3)
T wherein
Cb---the contact time started;
t
Rb---this contacts the time of origin of corresponding heavy broadcasting;
Nine, heavily broadcast after, elect the broadcasting of laying equal stress on of new via node, repeat aforesaid operations always and all receive broadcast up to whole broadcast area.
2. the appearance VANET broadcasting method under the network disconnected state according to claim 1 is characterized in that broadcasting the sending time slots T that carries the statement bag
iBetween 1s to 10s.
3. the appearance VANET broadcasting method under the network disconnected state according to claim 1 is when is characterized in that calculating the synthetic weights value in the step 2: make Δ V
i=V
i-V
sWherein, V
iBe the travel speed of node i, V
sBe the speed of sending node; When the underway node that continues is elected, Δ V
iBig node is transmitted data as via node;
Receiving node is in when being in the sending node downstream on the information transfer directions, Δ D
iFor on the occasion of, receiving node in information transfer directions with respect to being in the sending node upstream, Δ D
iBe negative value; Δ D
iValue is big, and the receiving node election is via node;
L
iValue is lane number, and the outermost lane number is 1, and other track ecto-entad side adds up, and has big L
iThe node election of value is via node;
w
1+w
2+w
3＝1。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011102434815A CN102300161A (en) | 2011-08-23 | 2011-08-23 | Delay-tolerant VANET broadcasting method at disconnecting state of network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011102434815A CN102300161A (en) | 2011-08-23 | 2011-08-23 | Delay-tolerant VANET broadcasting method at disconnecting state of network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102300161A true CN102300161A (en) | 2011-12-28 |
Family
ID=45360263
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011102434815A Pending CN102300161A (en) | 2011-08-23 | 2011-08-23 | Delay-tolerant VANET broadcasting method at disconnecting state of network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102300161A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102413536A (en) * | 2012-01-06 | 2012-04-11 | 北京邮电大学 | Site sensing communication method of ad hoc wireless network |
| CN103747500A (en) * | 2013-12-27 | 2014-04-23 | 哈尔滨工业大学 | Vehicle networking information delay transmission method based on MSPA algorithm |
| CN104064029A (en) * | 2014-07-07 | 2014-09-24 | 哈尔滨工业大学 | Dynamic V2V link delay predicting method in VANETs |
| CN104537838A (en) * | 2014-12-31 | 2015-04-22 | 哈尔滨工业大学 | Link time delay dynamic prediction method which is used for highway and takes V2V in VANETs of intersection into consideration |
| CN105682054A (en) * | 2016-03-29 | 2016-06-15 | 北京润科通用技术有限公司 | Method and device for distributing mobile ad-hoc network multi-hop data |
| CN106851590A (en) * | 2017-01-22 | 2017-06-13 | 王秀峰 | V2V multi-hops warning broadcasting method in a kind of VANETs |
| CN108390936A (en) * | 2018-02-28 | 2018-08-10 | 福建师范大学 | A kind of probability cache algorithm based on caching distributed awareness |
| CN110493716A (en) * | 2019-08-21 | 2019-11-22 | 科航（苏州）信息科技有限公司 | Communication node automatic deployment method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101478805A (en) * | 2009-01-20 | 2009-07-08 | 中国科学院软件研究所 | DTN network Anycast routing method based on opportunistic communication |
| CN101674220A (en) * | 2008-05-07 | 2010-03-17 | 北京理工大学 | Forwarding history-based asynchronous rooting algorithm |
| US7813326B1 (en) * | 2005-05-27 | 2010-10-12 | Bluetronix Inc. | Swarm location service for mobile ad hoc network communications |
| US7969914B1 (en) * | 2008-07-25 | 2011-06-28 | At&T Intellectual Property Ii, L.P. | Method for establishing and operating a mobile Ad-Hoc network |
-
2011
- 2011-08-23 CN CN2011102434815A patent/CN102300161A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7813326B1 (en) * | 2005-05-27 | 2010-10-12 | Bluetronix Inc. | Swarm location service for mobile ad hoc network communications |
| CN101674220A (en) * | 2008-05-07 | 2010-03-17 | 北京理工大学 | Forwarding history-based asynchronous rooting algorithm |
| US7969914B1 (en) * | 2008-07-25 | 2011-06-28 | At&T Intellectual Property Ii, L.P. | Method for establishing and operating a mobile Ad-Hoc network |
| CN101478805A (en) * | 2009-01-20 | 2009-07-08 | 中国科学院软件研究所 | DTN network Anycast routing method based on opportunistic communication |
Non-Patent Citations (4)
| Title |
|---|
| 《计算机应用》 20100731 林磊等 面向稳定性的基于权值的车辆自组网分簇算法--SWBCA 第30卷, 第7期 * |
| LIANKE ZHOU等: "A Delay Tolerant Broadcast Protocol for VANETs", 《2010 INTERNATIONAL CONFERENCE ON BROADCAST TECHNOLOGY AND MULTIMEDIA COMMUNICATION》, 31 December 2010 (2010-12-31) * |
| ZHOU LIANKE等: "A Reliability Enhanced Density Adaptive Data Dissemination Scheme For VANETs", 《JOURNAL OF ELECTRONICS(CHINA)》, vol. 28, no. 1, 31 January 2011 (2011-01-31) * |
| 林磊等: "面向稳定性的基于权值的车辆自组网分簇算法——SWBCA", 《计算机应用》, vol. 30, no. 7, 31 July 2010 (2010-07-31) * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102413536A (en) * | 2012-01-06 | 2012-04-11 | 北京邮电大学 | Site sensing communication method of ad hoc wireless network |
| CN103747500A (en) * | 2013-12-27 | 2014-04-23 | 哈尔滨工业大学 | Vehicle networking information delay transmission method based on MSPA algorithm |
| CN104064029A (en) * | 2014-07-07 | 2014-09-24 | 哈尔滨工业大学 | Dynamic V2V link delay predicting method in VANETs |
| CN104537838A (en) * | 2014-12-31 | 2015-04-22 | 哈尔滨工业大学 | Link time delay dynamic prediction method which is used for highway and takes V2V in VANETs of intersection into consideration |
| CN105682054A (en) * | 2016-03-29 | 2016-06-15 | 北京润科通用技术有限公司 | Method and device for distributing mobile ad-hoc network multi-hop data |
| CN105682054B (en) * | 2016-03-29 | 2019-01-25 | 北京润科通用技术有限公司 | The distribution method and device of wireless self-networking multi-hop data |
| CN106851590A (en) * | 2017-01-22 | 2017-06-13 | 王秀峰 | V2V multi-hops warning broadcasting method in a kind of VANETs |
| CN106851590B (en) * | 2017-01-22 | 2020-07-03 | 哈尔滨工业大学 | V2V multi-hop warning broadcasting method in VANETs |
| CN108390936A (en) * | 2018-02-28 | 2018-08-10 | 福建师范大学 | A kind of probability cache algorithm based on caching distributed awareness |
| CN108390936B (en) * | 2018-02-28 | 2021-03-16 | 福建师范大学 | Probability cache algorithm based on cache distribution perception |
| CN110493716A (en) * | 2019-08-21 | 2019-11-22 | 科航（苏州）信息科技有限公司 | Communication node automatic deployment method and device |
| CN110493716B (en) * | 2019-08-21 | 2020-12-11 | 科航（苏州）信息科技有限公司 | Automatic deployment method and device for communication nodes |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102300161A (en) | Delay-tolerant VANET broadcasting method at disconnecting state of network | |
| CN102883263B (en) | A kind of VANET sub-clustering maintaining method based on Adjacent vehicles distance | |
| CN101711048B (en) | Method for choosing gateway in integrating process of mobile self-organization network and Internet | |
| CN102970722A (en) | Multicasting route algorithm of low-time-delay delay tolerant and disruption tolerant sensor network | |
| CN102572994B (en) | Wireless self-organizing network fusing routing generation method based on node characteristics | |
| CN104135436A (en) | Self-organizing network route selecting method for vehicles | |
| CN103414632A (en) | Banded wireless sensor network data routing method | |
| CN103561446A (en) | Awareness routing method in vehicle-mounted self-organizing network based on road topology | |
| CN103916939A (en) | Wireless chain-type transmission system | |
| CN102143546A (en) | Method for reducing redundant routing packet in tree ZigBee network | |
| CN103037436B (en) | Network coding perception wireless mesh routing protocol based on hybrid wireless mesh protocol (HWMP) | |
| CN110691371B (en) | MAC (media Access control) scheduling method of mesh underwater acoustic network | |
| CN109874162B (en) | Hybrid routing protocol design optimization method for high-altitude high-speed mobile node ad hoc network | |
| Shafi et al. | A cross layer design for efficient multimedia message dissemination with an adaptive relay nodes selection in VANETs | |
| CN110248392A (en) | Chance retransmission method based on node efficiency in a kind of car networking | |
| CN101471864B (en) | Data forwarding method based on receiver route in wireless self-organizing network | |
| CN103096411B (en) | Based on the Internet of Things communication means of reverse power restriction route protocol | |
| CN104703273B (en) | A kind of synchronous wireless sensor network MAC method of Quorum time slot self-adaptative adjustment | |
| Zheng et al. | Cooperative data delivery in sparse cellular-VANET networks | |
| Goyal et al. | Improving the MANET routing algorithm by GC-efficient neighbor selection algorithm | |
| Sun et al. | ODAM-C: an improved algorithm for vehicle ad hoc network | |
| CN103581838A (en) | Information sharing method for Ad Hoc network | |
| Dong et al. | A new data transmission mechanism in aeronautical ad hoc network | |
| Puka et al. | Hybrid Context-aware Message Flooding for Dead Spot Mitigation in V2I Communication | |
| Rajini Girinath et al. | A novel hierarchical model for vehicular traffic regulation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20111228 |