CN102769888B - Method for vehicle-mounted Ad Hoc network based on improved AODV (Ad Hoc Ondemand Distance Vector) protocol - Google Patents

Method for vehicle-mounted Ad Hoc network based on improved AODV (Ad Hoc Ondemand Distance Vector) protocol Download PDF

Info

Publication number
CN102769888B
CN102769888B CN201210181415.4A CN201210181415A CN102769888B CN 102769888 B CN102769888 B CN 102769888B CN 201210181415 A CN201210181415 A CN 201210181415A CN 102769888 B CN102769888 B CN 102769888B
Authority
CN
China
Prior art keywords
node
route
vehicle
message
hoc network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201210181415.4A
Other languages
Chinese (zh)
Other versions
CN102769888A (en
Inventor
邓磊
丁犇
程鹏
俞晖
李御益
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Jiaotong University
Original Assignee
Shanghai Jiaotong University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shanghai Jiaotong University filed Critical Shanghai Jiaotong University
Priority to CN201210181415.4A priority Critical patent/CN102769888B/en
Publication of CN102769888A publication Critical patent/CN102769888A/en
Application granted granted Critical
Publication of CN102769888B publication Critical patent/CN102769888B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/026—Route selection considering the moving speed of individual devices
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/26—Route discovery packet
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery

Abstract

The invention discloses a method for a vehicle-mounted Ad Hoc network based on an improved AODV (Ad Hoc Ondemand Distance Vector) protocol. The method comprises the following steps that (1) at a route discovery stage, when a source node has data to transmit to a destination node, an RREQ (Route Request) message is produced and transmitted to an adjacent node, and the node which receives the RREQ message can keep on transmitting the RREQ message only when meeting the stability condition; (2) at a route selection state, the destination node selects a route with maximal route expiration time from multiple routes as a relatively stable route, and replies an RREP(Route Reply) message; and (3) at a data transmission stage, after receiving the RREP message, the source node selects the relatively stable route to carry out data transmission. Due to the adoption of the technical scheme, the control overhead in the vehicle-mounted Ad Hoc network can be reduced, and the router reliability and the data transmission success rate are improved.

Description

For vehicle-mounted Ad Hoc network based on the method improving AODV agreement
Technical field
The present invention relates to wireless communication field, specifically a kind of for the method for vehicle-mounted Ad Hoc network based on improvement AODV agreement.
Background technology
Along with developing rapidly of the communications field and computer realm, inter-vehicular communication also becomes an important research topic.The function of automobile is enriched constantly, to variation, integrated trend development.Automobile is not merely walking-replacing tool, but collect comfortable, amusement, office and integration of services electronic tool.Meanwhile, along with the development of auto industry and the universal of private car, traffic safety and road traffic accident also become global public safety problem.How improve by day by day flourishing cordless communication network the focus that the trap for automobile institute that becomes industry safely pays close attention to and study.For this reason, vehicle-mounted Ad Hoc network is arisen at the historic moment.
The communication mode of traditional wire, can not meet the communication requirement between modern vehicle.So International Telecommunication Union proposed the concept of vehicle-mounted Ad Hoc network (Vehicular Ad Hoc Networks, VANET) in 2003.To be a kind of with driving vehicle be this network between node, vehicle carries out by multi-hop mode the Ad Hoc network that communicates.Vehicle-mounted Ad Hoc network combining global positioning system and cordless communication network, for the vehicle be in high-speed motion provides a kind of data access network of two-forty, and then provide possible solution for the safety traffic of vehicle, accounting management, traffic administration, data communication and car entertainment etc.
Traditional Ad Hoc network interior joint has higher one-movement-freedom-degree, therefore devises corresponding Routing Protocol according to the feature of its network.But the athletic meeting of vehicle node is subject to street in vehicle-mounted Ad Hoc network, the impact of the factors such as traffic lights, vehicle node also has the features such as high speed, straight line and low randomness simultaneously, network topology structure is caused to change very fast, so traditional Ad Hoc network Routing Protocol well can not be applied to vehicle-mounted Ad Hoc network.If carry out necessarily improving with the communication needs adapting to vehicle-mounted Ad Hoc network to existing comparatively ripe Ad Hoc Routing Protocol, good achievement will be obtained.AODV agreement, as the standard agreement (RFC3561) of mobile Ad Hoc network, is a kind of passive type Routing Protocol, have routing cost little, be applicable to that node motion is comparatively frequent, adaptability high.This meets the fast characteristic of vehicle-mounted Ad Hoc network node high mobility, change in topology to a certain extent, therefore, it is possible to meet the routing to communicate needs of vehicle-mounted Ad Hoc network preferably, but be applied to vehicle-mounted Ad Hoc network to reach communicating requirement, still need to make improvement.
Through finding the retrieval of prior art document, VinodNamboodiri etc. are at " Proceedings of the 1st ACM InternationalWorkshop on Vehicular Ad Hoc Networks, VANET, that delivers 2004 " is entitled as in " A Study on the Feasibility ofMobile Gateways for VehicularAd-hoc Networks (the mobile gateway feasibility study of vehicle-mounted Ad Hoc network) " paper, propose and select preferably route to carry out the strategy of transfer of data, but do not consider the problems such as control overhead, OmidAbedi etc. are at " 29th IEEEInternational Conference on Distributed Computing Systems Workshops, that 2009 " delivers is entitled as in " Improving RouteStability and Overhead on AODV Routing Protocol and Make it Usable for VANET (improving routing stability and the expense AODV Routing Protocol for vehicle-mounted Ad Hoc network) " paper, propose and send to fringe node to reduce expense RREQ message, but deep research is not done for the factor such as selection and delay of stable routing.As can be seen from correlative study mentioned above, very good solution is not still had for the improved Haniltonian of AODV agreement in vehicle-mounted Ad Hoc network, therefore is how an important research topic based on the control method improving AODV agreement to be better applicable to vehicle-mounted Ad Hoc network.
Summary of the invention
The present invention is directed to the deficiency that prior art exists, propose a kind of for the method for vehicle-mounted Ad Hoc network based on improvement AODV agreement.According to method provided by the invention incorporated for the information such as car speed locality, apply these information on vehicle-mounted Ad Hoc network routing to communicate, reduce control overhead when communicating between vehicle node, improve route reliability and data transmission success.
According to provided by the invention a kind of for the method for vehicle-mounted Ad Hoc network based on improvement AODV agreement, comprise the steps:
Step one: when source node has data will send to destination node, produce RREQ message, the first information of oneself to add in RREQ message and sends to neighbors by source node, and wherein, the described first information comprises the position of source node, speed, direction and route time expiration;
Step 2: each node receiving RREQ can calculate stability between two nodes according to sending node and the position of oneself, speed and directional information, the node not meeting stability condition then abandons RREQ message, and the node meeting stability condition then upgrades RREQ message and continues to forward;
Step 3: destination node after receiving RREQ message first, buffer memory RREQ message content, and start waiting timer, the RREQ message received within the waiting timer time all will by destination node buffer memory;
Step 4: at the end of waiting timer, destination node selects comparatively stable routing reply RREP message from many routes, and ultimate source node receives this RREP message, and with this comparatively stable routing carry out transfer of data.
Preferably, RREQ message in described step one is on the basis of former AODV agreement RREQ message format, newly-increased at least five information storage domain, these five newly-added information storage domain are used for depositing respectively the abscissa of current forwarding RREQ information node, ordinate, movement velocity, the direction of motion and axis of abscissas angle and route time expiration.
Preferably, stability condition in described step 2 refers to that the node receiving RREQ message and the nodal distance sending this RREQ are less than threshold value t × R or distance is greater than threshold value t × R, but along with two joint movements, its distance becomes near, wherein, R is the communication radius between node, and t is default parameter value.
Preferably, described default parameter value t=0.7 is set.
Preferably, the destination node in described step 3 by buffer memory RREQ message for selecting comparatively stable routing at the end of waiting timer.
Preferably, be select the route of maximum route time expiration as comparatively stable routing compared with the selection strategy of stable routing in described step 4.
Preferably, described route time expiration (Route Expiration Time, RET) refers to that the whole piece route established can stablize the time of sustainable existence, is the minimum value of all link time expirations in whole piece route, is expressed as wherein for adjacent two node n k-1and n kbetween communication link maintain effective time, the time (LinkExpiration Time, LET) during being defined as link.Route timeout value is larger, and illustrate that the stable existence time of this route is longer, this route is more reliable.
Preferably, in described step one, source node calls vehicle GPS module and obtains the position of own node, speed and directional information.
Preferably, the waiting timer time is set as 500ms.
Compared with prior art, according to method provided by the invention, there is following advantage: in route finding process, the node meeting stability condition is only had just to carry out the forwarding of RREQ message, limit the forwarding number of RREQ message on the one hand, prevent the flooded broadcast of message in network, reduce expense, stable node is remained, for the selection of posterior stabilization route prepares on the other hand; In the Route Selection stage, destination node selects a more stable routing reply RREP message from many routes, ultimate source node will receive this RREP message, and with this comparatively stable routing carry out transfer of data, improve route reliability and data transmission success.
Accompanying drawing explanation
Fig. 1 is amended RREQ message format;
Fig. 2 is node communication administrative division map;
Fig. 3 is two joint movements schematic diagrames;
Fig. 4 is the production process of RREQ message;
Fig. 5 is the processing procedure that node receives RREQ message;
Fig. 6 is the production process of RREP message;
Fig. 7 is the processing procedure that node receives RREP message;
Fig. 8 is the overall flow improving AODV agreement;
Fig. 9 is the Performance comparision improving AODV agreement and former AODV agreement.
Embodiment
Below in conjunction with accompanying drawing, embodiments of the invention are elaborated: the present embodiment is implemented premised on the inventive method, give detailed execution mode and concrete operating process, but protection scope of the present invention is not limited to following embodiment.
The scene setting of this embodiment is for the vehicle-mounted Ad Hoc network on highway.
Step one: when source node has data will send to destination node, can produce RREQ message, the information such as the position of oneself, speed and direction and route time expiration to add in RREQ message and to send to neighbors by source node.
The information such as the position of oneself, speed and direction and route time expiration are added RREQ message and refer to and make certain amendment to RREQ message format by described source node, to meet the needs storing relevant information.Amended RREQ message has newly increased five information storage domain, deposits the abscissa of current forwarding RREQ information node respectively, ordinate, movement velocity, the direction of motion and axis of abscissas angle and route time expiration.Amended RREQ message as shown in Figure 1.
When source node generates RREQ message, first filled in into by original for RREQ message each information field, the format and content filled in is identical with former AODV agreement.Then source node calls vehicle GPS module and obtains the abscissa that the position of own node, speed and directional information dose the current forwarding RREQ information node in newly-increased message field, ordinate, movement velocity, in the direction of motion and each region of axis of abscissas angle.Route time expiration RET initial value is set to 100s.It, according to after the as above generated RREQ message of form, is transmitted to neighbors with broadcast mode by source node.Source node generates the flow chart of RREQ as shown in Figure 4.
Step 2: each node receiving RREQ can calculate stability between two nodes according to sending the node of this RREQ message and the position of oneself, speed and directional information, the node not meeting stability condition then can abandon RREQ message and not process, and the node meeting stability condition can upgrade RREQ message and continue to forward until find destination node.
Described stability condition refers to that the neighbors receiving RREQ message and the nodal distance sending this RREQ are less than threshold value t × R or distance is greater than threshold value t × R, but along with two joint movements, its distance becomes near.R is the communication radius between node, and t is default parameter value, preferably, for making directly to forward the node of RREQ message and will calculating whether forward RREQ information node balanced number, gets t=0.7.Figure 2 shows that node communication administrative division map, when the distance of neighbors and node A is less than 0.7R, they can carry out the forwarding of RREQ message when receiving RREQ message; When the distance of neighbors and node A is greater than 0.7R, then need the distance situation of change judging two nodes further.Fig. 3 is two joint movements schematic diagrames, along with the motion of two nodes, Node B and node A become near condition into coordinate is expressed as: wherein v iand v jfor Node B is to the horizontal and vertical durection component of node A relative velocity, d iand d jfor Node B is to the horizontal and vertical durection component of the relative position of node A.So when the distance between two nodes is greater than 0.7R, meet neighbors can forward RREQ message, otherwise abandon RREQ message and do not process.
When intermediate node receives RREQ message first, first judge flag RREP_FLAG whether to be 1, RREP_FLAG be that 1 represents that this node have received and replys message RREP, so this node not RREQ message of repeating of reprocessing.If RREP_FLAG is not 1, then the every terms of information in the RREQ message received is added in broadcast ID cache table, and whether search exists the reverse route (reverse route is used for RREP message and sends to source node) arriving source node, if there is no, reverse route will be added in local routing table.If repeat to receive RREQ message, then intermediate node is by the RET compared in RREQ message and the RET broadcasted in ID cache table oldvalue size, if RET>RET old, illustrate that current reverse route is more stable, node carries out the renewal of reverse routing table, using RET as new RET old, otherwise the RREQ message abandoning repetition does not process.Then node judges node for the purpose of oneself whether, if oneself be destination node, so will carry out the generation of RREP message and reply operation; If oneself be not destination node, then RREQ message is transmitted to neighbors.To operate equally after neighbors receives RREQ message, until destination node is found.Node for RREQ message processing procedure as shown in Figure 5.
Step 3: destination node, after receiving RREQ message first, by buffer memory RREQ message content, and starts waiting timer, the RREQ message received within the waiting timer time all will by destination node buffer memory.
By destination node buffer memory, the described RREQ message received within the waiting timer time all will be referred to that object is after receiving RREQ message first, this RREQ message can't be replied at once, but startup waiting timer, and the RREQ message received in the waiting timer time is carried out buffer memory, for selecting wherein comparatively stable routing.The RREQ message number that the setting of waiting timer time length needs compromise to consider to receive and postpone two aspect factors, is preferably set to 500ms.
Step 4: at the end of waiting timer, destination node carries out reply RREP message by selecting a more stable route from many routes, and ultimate source node will receive this RREP message, and with this comparatively stable routing carry out transfer of data transmission.
Described refers to compared with stable routing the route that route time expiration is maximum.
Described route time expiration (Route Expiration Time, RET) refers to that the whole piece route established can stablize the time of sustainable existence, is the minimum value of all link time expirations in whole piece route, is expressed as wherein for adjacent two node n k-1and n kbetween communication link maintain effective time, the time (Link ExpirationTime, LET) during being defined as link.According to Fig. 3, can calculate
LET ab = - ( v i · d i + v j · d j ) + ( v i 2 + v j 2 ) · R 2 - ( v i · d j - d i · v j ) 2 v i 2 + v j 2 .
Route timeout value is larger, and illustrate that the stable existence time of this route is longer, this route is more reliable.Destination node selects a maximum route of route time expiration to carry out reply RREP message.After destination node generates RREP message, RREQ_FLAG in broadcast ID cache table is put 1, represent and responded this RREQ message, then according to the routing iinformation in reverse routing table, RREP is passed to next-hop node, it produces the process of RREP message as shown in Figure 6.
Step 5: each receives the route of node updates to destination node of RREP message, then goes out RREP message according to the next-hop node unicast forwarding pointed by reverse routing table.Node to the processing procedure of RREP message as shown in Figure 7.
Step 6: source node receives RREP message and obtains the route arriving destination node, starts the transmission carrying out data.
In route finding process, improved by the first step, only have the node meeting stability condition just to forward RREQ message, have selected the more stable node of link, for the selection of follow-up stable routing is prepared on the one hand; Limit the inundation broadcast in the entire network of RREQ message on the other hand, reduce network overhead.In routing procedure, take second step to improve, provide the strategy selecting more stable route according to route time expiration, destination node replys RREP message according to the comparatively stable routing selected, and carries out the transmission of data after ultimate source node receives RREP message by this more stable route.Figure 8 shows that the agreement overall flow figure of improvement.Fig. 9 compares the performance improving AODV agreement and former AODV agreement.In figure, packet delivery ratio refers to the ratio of number of data packets and the number of data packets sent from source node arriving destination node.As can be seen from Figure 9, based on the method improving AODV agreement, there is better packet delivery ratio, namely improve data transmission success.

Claims (9)

1., for the method for vehicle-mounted Ad Hoc network based on improvement AODV agreement, it is characterized in that, comprise the steps:
Step one: when source node has data will send to destination node, produce RREQ message, the first information of oneself to add in RREQ message and sends to neighbors by source node, and wherein, the described first information comprises the position of source node, speed, direction and route time expiration;
Step 2: each node receiving RREQ can calculate stability between two nodes according to sending node and the position of oneself, speed and directional information, the node not meeting stability condition then abandons RREQ message, and the node meeting stability condition then upgrades RREQ message and continues to forward;
Step 3: destination node after receiving RREQ message first, buffer memory RREQ message content, and start waiting timer, the RREQ message received within the waiting timer time all will by destination node buffer memory;
Step 4: at the end of waiting timer, destination node selects comparatively stable routing reply RREP message from many routes, and ultimate source node receives this RREP message, and with this comparatively stable routing carry out transfer of data.
2. according to claim 1 for the method for vehicle-mounted Ad Hoc network based on improvement AODV agreement, it is characterized in that: the RREQ message in described step one is on the basis of former AODV agreement RREQ message format, newly-increased at least five information storage domain, these five newly-added information storage domain are used for depositing respectively the abscissa of current forwarding RREQ information node, ordinate, movement velocity, the direction of motion and axis of abscissas angle and route time expiration.
3. according to claim 1 for the method for vehicle-mounted Ad Hoc network based on improvement AODV agreement, it is characterized in that: the stability condition in described step 2 refers to that the node receiving RREQ message and the nodal distance sending this RREQ are less than threshold value t × R or distance is greater than threshold value t × R, but along with two joint movements, its distance becomes near, wherein, R is the communication radius between node, and t is default parameter value;
Wherein judge that two node A and B distances become near criterion and are:
v i 2 + v j 2 + 2 d i &CenterDot; v i + 2 d j &CenterDot; v j < 0 ,
Wherein v iand v jfor Node B is to the horizontal and vertical durection component of node A relative velocity, d iand d jfor Node B is to the horizontal and vertical durection component of the relative position of node A.
4. according to claim 3 for the method for vehicle-mounted Ad Hoc network based on improvement AODV agreement, it is characterized in that: described default parameter value t=0.7 is set.
5. according to claim 1 for vehicle-mounted Ad Hoc network based on the method improving AODV agreement, it is characterized in that: the destination node in described step 3 by buffer memory RREQ message for selecting comparatively stable routing at the end of waiting timer.
6. according to claim 1 for vehicle-mounted Ad Hoc network based on the method improving AODV agreement, it is characterized in that: in described step 4 compared with the selection strategy of stable routing be, select the route of maximum route time expiration as comparatively stable routing.
7. according to claim 1 for the method for vehicle-mounted Ad Hoc network based on improvement AODV agreement, it is characterized in that: described route time expiration refers to that the whole piece route established can stablize the time of sustainable existence, be the minimum value of all link time expirations in whole piece route, be expressed as RET = min ( LET n 1 n 2 , LET n 2 n 3 , . . . , LET n k - 1 n k ) , Wherein for adjacent two node n k-1and n kbetween communication link maintain effective time, the time during being defined as link;
Link time expiration LET wherein from node A to Node B abfor:
LET ab = - ( v i &CenterDot; d i + v j &CenterDot; d j ) + ( v i 2 + v j 2 ) &CenterDot; R 2 - ( v i &CenterDot; d j - d i &CenterDot; v j ) 2 v i 2 + v j 2 ,
Wherein v iand v jfor Node B is to the horizontal and vertical durection component of node A relative velocity, d iand d jfor Node B is to the horizontal and vertical durection component of the relative position of node A, R is the communication radius between node.
8. according to claim 1 for vehicle-mounted Ad Hoc network based on the method improving AODV agreement, it is characterized in that: in described step one, source node calls vehicle GPS module and obtains the position of own node, speed and directional information.
9. according to claim 1 for the method for vehicle-mounted Ad Hoc network based on improvement AODV agreement, it is characterized in that: the waiting timer time is set as 500ms.
CN201210181415.4A 2012-06-04 2012-06-04 Method for vehicle-mounted Ad Hoc network based on improved AODV (Ad Hoc Ondemand Distance Vector) protocol Active CN102769888B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210181415.4A CN102769888B (en) 2012-06-04 2012-06-04 Method for vehicle-mounted Ad Hoc network based on improved AODV (Ad Hoc Ondemand Distance Vector) protocol

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210181415.4A CN102769888B (en) 2012-06-04 2012-06-04 Method for vehicle-mounted Ad Hoc network based on improved AODV (Ad Hoc Ondemand Distance Vector) protocol

Publications (2)

Publication Number Publication Date
CN102769888A CN102769888A (en) 2012-11-07
CN102769888B true CN102769888B (en) 2015-03-11

Family

ID=47097109

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210181415.4A Active CN102769888B (en) 2012-06-04 2012-06-04 Method for vehicle-mounted Ad Hoc network based on improved AODV (Ad Hoc Ondemand Distance Vector) protocol

Country Status (1)

Country Link
CN (1) CN102769888B (en)

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103260208B (en) * 2013-05-17 2016-03-09 南京邮电大学 The implementation method of the hybrid routing protocol of position-based information under vehicle-mounted Ad hoc network
CN103326942A (en) * 2013-06-19 2013-09-25 华南理工大学 Reliable routing protocol used for vehicle-mounted Ad Hoc network
CN104754613B (en) * 2013-12-30 2019-10-22 北京大唐高鸿软件技术有限公司 The method of optimization AODV agreement based on vehicle-mounted short haul connection net
CN105391631A (en) * 2015-11-30 2016-03-09 华南理工大学 Enhanced stable routing protocol for vehicle Ad Hoc network
CN106792975B (en) * 2016-12-09 2020-04-10 南京理工大学 AODV routing protocol optimization method based on distance estimation
CN109688614B (en) * 2019-01-14 2021-04-02 西安电子科技大学 Implementation method and system for high-dynamic unmanned aerial vehicle ad hoc network routing protocol
CN110312209B (en) * 2019-08-12 2021-05-25 航天科工网络信息发展有限公司 Positioning information assisted mobile ad hoc network routing method
CN111131033A (en) * 2019-11-22 2020-05-08 江苏星地通通信科技有限公司 Intelligent route switching method, system and storage medium based on MESH network
CN111148178B (en) * 2020-01-06 2022-04-19 桂林电子科技大学 DSR routing protocol implementation method based on unmanned aerial vehicle ad hoc network
CN111935002B (en) * 2020-06-11 2022-07-22 哈尔滨聚车科技有限公司 High-adaptability vehicle-mounted routing communication method based on AODV (Ad hoc on-demand distance vector)
CN112738707B (en) * 2020-11-30 2021-12-03 广东工业大学 Internet of vehicles routing method based on link connection time prediction and edge assistance
CN114828145A (en) * 2022-03-10 2022-07-29 西安电子科技大学 Fishing Ad hoc network routing control method and system based on intelligent antenna
CN114945142A (en) * 2022-05-24 2022-08-26 泰州学院 Vehicle networking short-distance networking method suitable for vehicle-mounted network

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101686521A (en) * 2009-05-27 2010-03-31 西安电子科技大学 Network coding based method for searching route of wireless Ad hoc network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101225274B1 (en) * 2005-11-09 2013-01-22 톰슨 라이센싱 Route selection in wireless networks

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101686521A (en) * 2009-05-27 2010-03-31 西安电子科技大学 Network coding based method for searching route of wireless Ad hoc network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Ben Ding等.An Improved AODV Routing Protocol for VANETs.《Wireless Communications and Signal Processing (WCSP), 2011 International Conference on》.2011,Introduction部分,SectionI-II部分. *

Also Published As

Publication number Publication date
CN102769888A (en) 2012-11-07

Similar Documents

Publication Publication Date Title
CN102769888B (en) Method for vehicle-mounted Ad Hoc network based on improved AODV (Ad Hoc Ondemand Distance Vector) protocol
Ji et al. SDGR: An SDN-based geographic routing protocol for VANET
Kihl et al. Reliable geographical multicast routing in vehicular ad-hoc networks
Abedi et al. Enhancing AODV routing protocol using mobility parameters in VANET
Qureshi et al. Weighted link quality and forward progress coupled with modified RTS/CTS for beaconless packet forwarding protocol (B-PFP) in VANETs
Alves Junior et al. Routing in vehicular ad hoc networks: main characteristics and tendencies
CN103781141B (en) Singlecast router retransmission method, chip and the communication system of vehicular ad hoc network
CN105407517B (en) Method for routing, routing module, car-mounted terminal and vehicular ad hoc network route system
Menouar et al. Improving proactive routing in VANETs with the MOPR movement prediction framework
CN105577547A (en) Multi-Qos based route selection method in mobile self-organizing network
Oubbati et al. IRTIV: Intelligent routing protocol using real time traffic information in urban vehicular environment
Aparecido Data dissemination in vehicular networks: Challenges, solutions, and future perspectives
Tu et al. GSPR-MV: A routing protocol based on motion vector for VANET
Han et al. Congestion and position aware dynamic routing for the internet of vehicles
Brahmi et al. Adaptative movement aware routing for vehicular ad hoc networks
Sharma et al. A contemporary proportional exploration of numerous routing protocol in VANET
Shafiee et al. WLAN-wimax double-technology routing for vehicular networks
Sheu et al. A distributed routing protocol and handover schemes in hybrid vehicular ad hoc networks
Marinov Comparative analysis of AODV, DSDV and DSR routing protocols in VANET
Eltahir et al. An enhanced hybrid wireless mesh protocol (E-HWMP) protocol for multihop vehicular communications
Wu et al. MEDAL: A moving direction and destination location based routing algorithm for vehicular ad hoc networks
Chen et al. Multi-metric opportunistic routing for VANETs in urban scenario
Jain et al. An RSU Based Approach: A solution to overcome major issues of Routing in VANET
Qureshi et al. Study of efficient topology based routing protocols for vehicular ad-hoc network technology
Khan Performance evaluation of Ad hoc routing protocols for Vehicular ad hoc networks

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