CN101431468B - Greed data forwarding method based on direction in vehicle-mounted network - Google Patents
Greed data forwarding method based on direction in vehicle-mounted network Download PDFInfo
- Publication number
- CN101431468B CN101431468B CN2008101537649A CN200810153764A CN101431468B CN 101431468 B CN101431468 B CN 101431468B CN 2008101537649 A CN2008101537649 A CN 2008101537649A CN 200810153764 A CN200810153764 A CN 200810153764A CN 101431468 B CN101431468 B CN 101431468B
- Authority
- CN
- China
- Prior art keywords
- node
- message
- destination node
- destination
- information
- 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
Images
Abstract
A greedy data forwarding method of vehicle-mounted network based on direction comprises: source node transmits target node position request message in aimless flooding broadcasting style; target node periodically updates target node position message on every node in response to position request message of target node; every node periodically broadcasts and transmits beacon message in self one hop range; the message is provided by GPS; every node establishes and updates neighbor table according to node position information and movement direction information after receiving beacon message transmitted by neighbor node; data packet forwarding: data packet is forwarded according to greedy forwarding algorithm of ordinary geographical position route protocol; if proper next hop is not found, then direction forwarding is enabled. The inventive method combines traditional standard routing protocol, keeps many merits of existing mature routing protocol, and can be easily used in existing network without need of large range modification.
Description
Technical field
The present invention relates to a kind of network service.Particularly relate in a kind of vehicle-mounted self-organizing network based on greedy direction transmit, reliably in the In-vehicle networking that calculates of the route of transmits data packets based on the greedy data forwarding method of direction.
Background technology
In the contemporary society, vehicle is being brought into play enormous function.The use of vehicle also brings some nerve-wracking problems, as the traffic accident of frequent generation, traffic congestion etc. when the life of giving people offers convenience.These problems are directly threatening people's life, bring very big puzzlement for people's life, become national governments' problem demanding prompt solution.Along with the continuous progress with automotive electronic technology of developing rapidly of wireless communication technology, a lot of governments attempt all with research institution that (Inter-vehicle communication, IVC) system solves these problems by setting up communicating by letter between vehicle.The demand of inter-vehicular communication and the immense value that contains have promoted vehicle-mounted self-organizing network (Vehicle Ad hoc Network, appearance VANET) and development.
Inter-vehicular communication has very big randomness on when and where, so the VANET network is a kind of Vehicle Intercommunications System of setting up with ad hoc pattern.Specifically, the provisional self-organizing network of a multi-hop forming by the vehicle of having equipped the radio communication R-T unit of VANET.The purpose of VANET network is in order to improve traveling security and efficient.VANET has high application prospect and researching value.
Current, for the Routing Protocol of Ad Hoc network comparative maturity, the research of routing algorithm mainly concentrates on two types in the VANET networking, first kind of Routing Protocol that is based on topology; Second kind of Routing Protocol that is based on the geographical position.The general standard of first kind of agreement is mostly based on the consideration of jumping figure or delay, between source node and destination node, seek and have the route in fewest number of hops or minimum delay, reckon without node in the network because fast moving, some node that causes leaves original position and causes the problem of path failure.Second kind of agreement typical case is represented as greedy peripheral state routing protocol, and this agreement determines a data grouping to be routed to each jumping the process of destination node from source node independently in real time.But in the VANET network, because the instability of neighborhood between the node that the fast moving of node causes, the positional information of using when making route all is out-of-date.It is the accuracy that it does not guarantee information.
Summary of the invention
Technical problem to be solved by this invention is, a kind of positional information that can obtain timely with the maintenance purpose node is provided, and thought by good bonding position forwarding, making routing algorithm is the routing algorithm of transmitting based on direction reliably that satisfies the VANET network demand, has realized in the In-vehicle networking of reliable transmission of packet the greedy data forwarding method based on direction.
The technical solution adopted in the present invention is: based on the greedy data forwarding method of direction, comprise and finish following few component parts successively in a kind of In-vehicle networking:
(1) source node sends target node position request information: the broadcast mode that source node floods with blindness sends the positional information of destination node, and this message terminates when arriving the destination node of being asked;
(2) destination node response target node position request information: when the target node position request information of being sent by source node arrives the destination node of being asked, this destination node will start the updating location information transmission of news of destination node, the periodic positional information of upgrading the destination node on each node of beginning;
(3) the regular broadcast transmission beacon message in oneself jumping scope of each node, the positional information and the movement direction of nodes information that comprise oneself in the message, these information are provided by GPS, after each node is received the beacon message of neighbor node transmission, according to node location information and foundation of direction of motion information and renewal neighbor table wherein;
(4) forwarding of packet: the forwarding that data are wrapped according to the greedy forwarding algorithm in the Routing Protocol of general geographical position, if can not find next suitable jumping, then enable direction and transmit, may further comprise the steps:
(4.1) when node has data to send, first traversal neighbor table, whether the search destination node is in an oneself jumping scope, if in just directly forwarding from neighbor table;
(4.2) if destination node not in the jumping scope of oneself, then transmit according to the greedy forwarding strategy in the geographical position;
(4.3) if greedy the forwarding do not found next suitable jumping, then enable direction and transmit.The traversal neighbor table is found out the forwarding that the direction of motion is wrapped from that nearest node of destination node direction.
Described part (1) source node sends target node position request information, may further comprise the steps:
(1.1) when source node has packet to send, if source node does not also obtain the positional information that the destination node of arrival is estimated in packet, source node will send a target node position request to the destination node of appointment;
(1.2) if source node is searched for the tabulation of its destination node, find to have existed destination node than new location information the time, then need not send target node position request information, directly judge with its existing destination locations information.
Described part (2) may further comprise the steps:
(2.1) after destination node is received location request message, it will be periodically to its immediate neighbor node broadcasting target node position updating message, each neighbor node is tabulated by the destination node of retrieving it according to this message and is created or upgrade corresponding positional information record;
(2.2) node of each except destination node is periodically broadcasted the target node position interaction message to their immediate neighbor node, exchange the positional information that their are preserved mutually by each node of this message, make each node can both preserve the record about the positional information of this destination node of portion " up-to-date relatively " about certain destination node;
(2.3) any one immediate neighbor node of destination node is after receiving the node location updating message, and performed action is: create for the destination node of appointment in their destination node tabulation or upgrade corresponding positional information record;
(2.4) after a node is received the node location interaction message, use the identifier ID of the destination node of the destination node of carrying in the node location interaction message that receives, the destination node that retrieval is preserved on this node is tabulated, and seeks the record of corresponding node; Then, the timestamp ts2 in timestamp ts1 in the interaction message of comparison node position and the destination node that just the retrieved record; If ts1＞ts2, illustrate that then the destination locations information in the node location interaction message is to upgrade relatively, then upgrade relevant position information in the destination node tabulation of this node, otherwise do not make any reason that goes out with the destination locations information of carrying in the node location interaction message.
Based on the greedy data forwarding method of direction, consider that from each angle this agreement has the following advantages because the variety of issue that the quick variation of network topology structure brings has proposed greedy direction and transmitted Routing Protocol in the In-vehicle networking of the present invention:
(1) it is a kind of location-based routing algorithm, and the forwarding strategy of employing is " greedy transmit ", that is to say, and when transmission of data packets, just divide into groups next jumping that arrive of determination data in real time.Do not need to set up in advance a complete path, do not need the process of route foundation and route maintenance.
(2) this routing algorithm has used the strategy that direction is transmitted, and further seeks available next jumping behind greedy retransmission failure, has realized the reliability that packet is transmitted.The essence that direction is transmitted is exactly a kind of retry mechanism.
(3) two kinds of separate message mechanisms of this routing algorithm use are safeguarded the positional information of destination node and are upgraded.The mode of this lastest imformation can be tackled the situation of the network division that may occur.Even network division occurs, also can guarantee to safeguard on each node a up-to-date relatively target node position information.Therefore, accuracy and the consistency of the target node position information that this routing algorithm uses when having guaranteed to the full extent to calculate route have improved the quality of transfer of data.
The present invention is improved its route criterion on its basis by typical location-based Routing Protocol development in the current vehicle-mounted Ad Hoc network, has introduced the thought that direction is transmitted, and then has realized the accuracy of reliability and information.This mode that combines with the traditional standard Routing Protocol, make the present invention well keep many advantages of existing ripe Routing Protocol, need not simultaneously through change just can be by simple applications in existing network on a large scale, satisfactory for result, application prospect is good.
Description of drawings
Fig. 1 is the schematic diagram of basic boom principle of the present invention;
Fig. 2 is the schematic diagram that two kinds of message mechanisms of the present invention are used;
Fig. 3 is the message format of the request target node position used of the present invention;
Fig. 4 is the message format of the renewal target node position used of the present invention;
Fig. 5 is the message format of the mutual target node position used of the present invention;
Fig. 6 is the schematic diagram of the notion of the direction used of the present invention;
Fig. 7 is the calculating of the direction used of the present invention and the exemplary plot of system of selection;
Fig. 8 is the network example topological diagram that uses the experimental stage of the present invention.
Embodiment
Below in conjunction with embodiment and accompanying drawing the greedy data forwarding method based on direction in the In-vehicle networking of the present invention is made a detailed description.
As shown in Figure 1, the greedy direction of basic boom principle one vehicle-mounted self-organizing network based on the greedy data forwarding method of direction is transmitted Routing Protocol research in the In-vehicle networking of the present invention.When node had data to send, the target node position updating message that regularly sends according to the destination node of receiving was upgraded the positional information of destination node, and set up and upgrade neighbor table according to regular hello (beacon) message.The forwarding of taking the greedy strategy of transmitting to wrap afterwards, if do not find next suitable jumping, then the approach axis forwarding mechanism is sought next jumping again.The words of direction retransmission failure then abandon this packet, continue other grouping in the process data packets formation.
As shown in Figure 2, carry out alternately with target node position updating message q (query message) between a destination node and its hop neighbor node.And between other nodes except that destination node, upgrade the positional information of destination node alternately with target node position interaction message d (destInfo message).And when situation that cutting apart appears in network, can also propagate the positional information of up-to-date destination node between other nodes with destInfo message.Positional information is all obtained by the gps system on the car.This has just guaranteed that each node in network all preserved a consistent relatively destination node information.H among the figure, I, J node are the hop neighbor nodes of destination node D.Node K, L, M are the hop neighbor nodes of node A.
If node has data to send, determine next jumping with greedy forwarding strategy earlier, if do not find next suitable jumping, then change direction forwarding mechanism retry over to greedy forwarding strategy.
Based on the greedy data forwarding method of direction, comprise and finish following few component parts successively in the In-vehicle networking of the present invention:
(1) source node sends target node position request information: message format as shown in Figure 3, wherein field id has provided the numbering of the destination node of asking its positional information.The broadcast mode that source node floods with blindness sends the positional information of destination node, and this message terminates when arriving the destination node of being asked; May further comprise the steps:
(1.1) when source node has packet to send, if source node does not also obtain the positional information that the destination node of arrival is estimated in packet, source node will send a target node position request to the destination node of appointment;
(1.2) if source node is searched for the tabulation of its destination node, find to have existed destination node than new location information the time, then need not send target node position request information, directly judge with its existing destination locations information.
(2) destination node response target node position request information: when the target node position request information of being sent by source node arrives the destination node of being asked, this destination node will start the propagation of the updating location information message (query message) of destination node, the periodic positional information of upgrading the destination node on each node of beginning; May further comprise the steps:
(2.1) after destination node is received location request message, it will be periodically to its immediate neighbor node broadcasting target node position updating message (query message), message format as shown in Figure 4, field x has wherein pointed out to send the coordinate figure of the destination node of location update message among the y.Each neighbor node is tabulated by the destination node of retrieving it according to this message and is created or upgrade corresponding positional information record; That is, it can give its a direct hop neighbor broadcasting target node position updating message (query message), and its immediate neighbor is set up according to this message and renewal destination locations information list then.
(2.2) each node of other except destination node is periodically to their immediate neighbor node broadcasting target node position interaction message (destInfo message), message format as shown in Figure 5, wherein field id has pointed out the numbering of the node in the interaction message; Field x has pointed out the coordinate figure of destination node in the interaction message among the y; Field time stamp has pointed out the update time of the positional information correspondence of destination node in the interaction message.Exchange the positional information that their are preserved mutually by each node of this message, make each node can both preserve the record about the positional information of this destination node of portion " up-to-date relatively " about certain destination node;
(2.3) any one immediate neighbor node of destination node is receiving node location updating message (query message) afterwards, and performed action is: create for the destination node of appointment in their destination node tabulation or upgrade corresponding positional information record;
(2.4) after a node is received node location interaction message (destInfo message), identifier ID with the destination node of the destination node of carrying in the node location interaction message that receives, the destination node that retrieval is preserved on this node is tabulated, and seeks the record of corresponding node; Then, the timestamp ts2 in timestamp ts1 in this detInfo message and the destination node record that just retrieved relatively; If ts1＞ts2, the destination locations information in the destInfo message of then illustrating is to upgrade relatively, the relevant position information during then the destination node of upgrading this node with the destination locations information of carrying in the destInfo message is tabulated, otherwise do not do any processing.
(3) regular broadcast transmission hello (beacon) message in oneself jumping scope of each node, the positional information and the movement direction of nodes information that comprise oneself in the message, these information are provided by GPS, after each node is received the hello message of neighbor node transmission, according to node location information and foundation of direction of motion information and renewal neighbor table wherein.
(4) forwarding of packet: the forwarding that data are wrapped according to the greedy forwarding algorithm in the Routing Protocol of general geographical position, if can not find next suitable jumping, then enable direction and transmit; May further comprise the steps:
(4.1) when node has data to send, first traversal neighbor table, whether the search destination node is in an oneself jumping scope, if in just directly forwarding from neighbor table;
(4.2) if destination node not in the jumping scope of oneself, then transmit according to the greedy forwarding strategy in the general geographical position.
(4.3) if greedy the forwarding do not found next suitable jumping, then enable direction and transmit.The traversal neighbor table is found out the forwarding that the direction of motion is wrapped from that nearest node of destination node direction.That is, if greedy retransmission failure is then used direction forwarding mechanism retry.The notion that direction is transmitted as shown in Figure 6, wherein the neighbor node of data packet node is transmitted in the A representative, D represents destination node, the position that A ' moves to after representing A through very short a period of time, a represents AD and between's AA ' angle.Utilize the cosine law to calculate the neighbor node of forward node with the included angle cosine value between destination node.Select wherein that node on the occasion of the intermediate value maximum.This has just guaranteed that packet transmits towards destination node along correct direction.
The computational process of deflection as shown in Figure 7, wherein the neighbor node of data packet node is transmitted in A representative, D represents destination node, the position that on behalf of A, A ' move to through very short a period of time.A represents AD and between's AA ' angle.Respectively the location coordinate information of these several nodes in the bracket.Utilize the moving direction of neighbor node in the short time, rejudge its position, and then calculate its angular separation with destination node with the cosine law.Wherein used forward node, the position of neighbor node and destination node and direction of motion information.These information are provided by gps system.
In the In-vehicle networking of the present invention based on the greedy data forwarding method of direction, by using: two message independently, positional information to the destination node of preserving on each node is upgraded, and has reduced because the VANET network is in the inaccurate situation of destination locations information that node that connected state not causes inter-node communication to lag behind to cause is preserved.Based on the forwarding of direction, make data according to a certain direction property arrive the destination fast.Greedy direction is transmitted the Routing Protocol algorithm and is used this two characteristics, and purpose is the accuracy of target node position information used during in order to ensure Route Selection, and then improves the quality of transfer of data.This method is as a kind of more satisfactory, technical scheme that reliability is high, practical, can obtain positional information timely with the maintenance purpose node, and well combine the thought that direction is transmitted, make that this routing algorithm is a kind of routing algorithm of transmitting based on direction reliably that has satisfied the VANET network demand, has realized the reliable transmission of packet.
Network scenarios with Fig. 8 is an example below, and the mechanism of describing before cooperating briefly introduces workflow of the present invention:
(1) vehicle node is with certain acceleration, and travelling is about on the highway of 50m/s in maximum speed, and highway section uses 2 tracks.
(2) Business Stream that uses is the CBR Business Stream, and the size of the grouping of transmission (packetSize) is 256 bytes, and per second sends 4 data groupings.Here Ding Yi Business Stream correspondence is Internet multimedia application in the vehicle-mounted self-organizing network.
(3) suppose that node 10 sends packet to node 15, judges flooded broadcast target node position request message.As shown in Figure 10, node 5 and node 24 are hop neighbors of node 10, and they regularly send hello message, tell source node the positional information of oneself by GPS.And destination node is received oneself the location message that periodically sends behind the target node position request message, other node timed sending destination locations interaction messages, and the positional information of the destination node that upgrades in time, these positional informations all are to obtain by GPS.With d1, d2 respectively representation node 5 and node 24 to the distance of destination node 15, as can be known this constantly, d1＜d2.Then according to greedy forwarding strategy, packet is transmitted to node 4 earlier, after time in according to same judgement, carry out the forwarding of packet, finally pass to destination node 15.
(4) if do not find next suitable jumping in a certain therein jumping, the direction forwarding mechanism of then using the stage (2) to mention is sought next jumping again.
(5) vehicle is not subjected to the restriction of energy condition as mobile node, so the transmitted power of wireless transmission can be used bigger power under the satiable situation of reality.
The above only is preferred embodiment of the present invention, not in order to restriction the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (3)
- In the In-vehicle networking based on the greedy data forwarding method of direction, it is characterized in that, comprise and finish following few component parts successively:(1) source node sends target node position request information: the broadcast mode that source node floods with blindness sends the positional information of destination node, and this message terminates when arriving the destination node of being asked;(2) destination node response target node position request information: when the target node position request information of being sent by source node arrives the destination node of being asked, this destination node will start the updating location information transmission of news of destination node, the periodic positional information of upgrading the destination node on each node of beginning;(3) the regular broadcast transmission beacon message in oneself jumping scope of each node, the positional information and the movement direction of nodes information that comprise oneself in the message, these information are provided by GPS, after each node is received the beacon message of neighbor node transmission, according to node location information and foundation of direction of motion information and renewal neighbor table wherein;(4) forwarding of packet: the forwarding that data are wrapped according to the greedy forwarding algorithm in the Routing Protocol of general geographical position, if can not find next suitable jumping, then enable direction and transmit, may further comprise the steps:(4.1) when node has data to send, first traversal neighbor table, whether the search destination node is in an oneself jumping scope, if in just directly forwarding from neighbor table;(4.2) if destination node not in the jumping scope of oneself, then transmit according to the greedy forwarding strategy in the geographical position;(4.3) if greedy the forwarding do not found next suitable jumping, then enable direction and transmit, the traversal neighbor table is found out the forwarding that the direction of motion is wrapped from that nearest node of destination node direction.
- 2. based on the greedy data forwarding method of direction, it is characterized in that in the In-vehicle networking according to claim 1 that described part (1) source node sends target node position request information, may further comprise the steps:(1.1) when source node has packet to send, if source node does not also obtain the positional information that the destination node of arrival is estimated in packet, source node will send a target node position request to the destination node of appointment;(1.2) if source node is searched for the tabulation of its destination node, find to have existed destination node than new location information the time, then need not send target node position request information, directly judge with its existing destination locations information.
- 3. based on the greedy data forwarding method of direction, it is characterized in that in the In-vehicle networking according to claim 1 that described part (2) may further comprise the steps:(2.1) after destination node is received location request message, it will be periodically to its immediate neighbor node broadcasting target node position updating message, each neighbor node is tabulated by the destination node of retrieving it according to this message and is created or upgrade corresponding positional information record;(2.2) node of each except destination node is periodically broadcasted the target node position interaction message to their immediate neighbor node, exchange the positional information that their are preserved mutually by each node of this message, make each node can both preserve the record about the positional information of this destination node of portion " up-to-date relatively " about certain destination node;(2.3) any one immediate neighbor node of destination node is after receiving the node location updating message, and performed action is: create for the destination node of appointment in their destination node tabulation or upgrade corresponding positional information record;(2.4) after a node is received the node location interaction message, use the identifier ID of the destination node of the destination node of carrying in the node location interaction message that receives, the destination node that retrieval is preserved on this node is tabulated, and seeks the record of corresponding node; Then, the timestamp ts2 in timestamp ts1 in the interaction message of comparison node position and the destination node that just the retrieved record; If ts1＞ts2, illustrate that then the destination locations information in the node location interaction message is to upgrade relatively, then upgrade relevant position information in the destination node tabulation of this node, otherwise do not make any reason that goes out with the destination locations information of carrying in the node location interaction message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101537649A CN101431468B (en) | 2008-12-05 | 2008-12-05 | Greed data forwarding method based on direction in vehicle-mounted network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101537649A CN101431468B (en) | 2008-12-05 | 2008-12-05 | Greed data forwarding method based on direction in vehicle-mounted network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101431468A CN101431468A (en) | 2009-05-13 |
| CN101431468B true CN101431468B (en) | 2011-03-23 |
Family
ID=40646643
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101537649A Expired - Fee Related CN101431468B (en) | 2008-12-05 | 2008-12-05 | Greed data forwarding method based on direction in vehicle-mounted network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101431468B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101925122B (en) * | 2009-06-12 | 2014-10-08 | 株式会社日立制作所 | Method and apparatus for disseminating a data packet via multi-hop communication in a communication network |
| SI2362604T1 (en) * | 2010-02-18 | 2013-02-28 | Kapsch Trafficcom Ag | Network nodes for an ad-hoc network and method for providing application services in an ad-hoc network |
| CN102355406B (en) * | 2011-08-12 | 2013-11-27 | 河南工业大学 | Self-adaption data distributing method based on node density distribution in vehicle-mounted ad hoc network |
| CN103596237B (en) * | 2013-11-29 | 2017-03-08 | 北京航空航天大学深圳研究院 | A kind of directional broadcasting method for routing in two-way lane under hetero-com-munication radius |
| CN103826284B (en) * | 2014-03-18 | 2017-02-22 | 中南大学 | Vehicle-density-based medium access control method in vehicular wireless network |
| CN105246119B (en) * | 2015-09-22 | 2019-01-11 | 东软集团股份有限公司 | A kind of the singlecast router retransmission method and device of vehicular ad hoc network |
| CN105228180B (en) * | 2015-09-29 | 2018-08-21 | 江苏大学 | A kind of vehicle-mounted Delay Tolerant Network method for routing based on the estimation of node transfer capability |
| CN106412958B (en) * | 2016-10-21 | 2019-11-01 | 燕山大学 | The method of data link is quickly established in a kind of wireless network |
| CN107343301B (en) * | 2017-05-23 | 2019-12-06 | 重庆邮电大学 | Efficient and reliable routing method of vehicle-mounted ad hoc network based on message aggregation |
| CN107995114B (en) * | 2017-12-08 | 2020-11-27 | 江西理工大学 | Routing method of delay tolerant network based on density clustering |
| CN116455431B (en) * | 2023-06-14 | 2023-08-15 | 天地信息网络研究院(安徽)有限公司 | Directional ad hoc network beam tracking method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1938966A (en) * | 2004-04-05 | 2007-03-28 | 摩托罗拉公司(在特拉华州注册的公司) | Method for enabling communications dependent on user location, user-specified location or orientation |
| CN101207572A (en) * | 2007-12-14 | 2008-06-25 | 北京科技大学 | Method for clustering vehicle mounted Ad hoc network based on signal strength |
-
2008
- 2008-12-05 CN CN2008101537649A patent/CN101431468B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1938966A (en) * | 2004-04-05 | 2007-03-28 | 摩托罗拉公司(在特拉华州注册的公司) | Method for enabling communications dependent on user location, user-specified location or orientation |
| CN101207572A (en) * | 2007-12-14 | 2008-06-25 | 北京科技大学 | Method for clustering vehicle mounted Ad hoc network based on signal strength |
Non-Patent Citations (2)
| Title |
|---|
| 彭玉旭等.一种新的Ad hoc网络中基于位置的路由协议.《电子与信息学报》.2006,第28卷(第9期),1666-1669. * |
| 徐旭.车载Ad Hoc网络路由协议的研究.《中国优秀硕士学位论文全文数据库信息科技辑》.2008,I136-410. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101431468A (en) | 2009-05-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101431468B (en) | Greed data forwarding method based on direction in vehicle-mounted network | |
| CN101431784B (en) | Optimized data transmission method based on geographical position in vehicle-mounted network | |
| CN106961707B (en) | Multifactor decision making Routing Protocol based on connectivity in a kind of VANET | |
| CN108600942B (en) | Routing method of unmanned aerial vehicle ad hoc network | |
| EP2262188B2 (en) | Method and apparatus for disseminating a data packet via multi-hop communication in a communication network | |
| Kumar et al. | A comparative study of various routing protocols in VANET | |
| CN102255973B (en) | Routing method in vehicle wireless communication network and vehicle wireless communication network | |
| CN102916889A (en) | Instant route selection based on multi-path communication time and credibility in VANET (Vehicular Ad-Hoc Network) | |
| CN102769888A (en) | Method for vehicle-mounted Ad Hoc network based on improved AODV (Ad Hoc Ondemand Distance Vector) protocol | |
| CN109640369B (en) | Vehicle-mounted network reliable communication method based on adaptive power | |
| Hou et al. | Data forwarding scheme for vehicle tracking in named data networking | |
| Tian et al. | A VANETs routing algorithm based on Euclidean distance clustering | |
| CN103781141A (en) | Unicast routing forwarding method of vehicle ad-hoc network, chip and a communication system | |
| Wang et al. | Delay-aware relay selection with heterogeneous communication range in VANETs | |
| CN104185239A (en) | Intersection routing method in vehicle self-organized network on the basis of path segment length | |
| CN110493749B (en) | Greedy routing method for Internet of vehicles based on path exploration | |
| Véque et al. | CONVOY: A New Cluster‐Based Routing Protocol for Vehicular Networks | |
| Bersali et al. | A new collaborative clustering approach for the Internet of vehicles (CCA-IoV) | |
| Ram et al. | Density-connected cluster-based routing protocol in vehicular ad hoc networks | |
| Yang et al. | A data dissemination mechanism for motorway environment in VANETs | |
| Marinov | Comparative analysis of AODV, DSDV and DSR routing protocols in VANET | |
| Wahid et al. | Software-Defined Networks and Named Data Networks in Vehicular Ad Hoc Network Routing: Comparative Study and Future Directions | |
| Tariq et al. | An Intelligent Forwarding Strategy in SDN-Enabled Named-Data IoV. | |
| KR20090056072A (en) | Emergency warning message broadcasting method using range-based relay node selecting method for vehicular ad-hoc network | |
| Wang et al. | Varied priority-based data forwarding via NDN in VANET |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110323 Termination date: 20111205 |