CN105610732A - Method for selecting forwarding nodes and performing cooperative communication of vehicular ad-hoc network (VANET) - Google Patents

Method for selecting forwarding nodes and performing cooperative communication of vehicular ad-hoc network (VANET) Download PDF

Info

Publication number
CN105610732A
CN105610732A CN201610009407.XA CN201610009407A CN105610732A CN 105610732 A CN105610732 A CN 105610732A CN 201610009407 A CN201610009407 A CN 201610009407A CN 105610732 A CN105610732 A CN 105610732A
Authority
CN
China
Prior art keywords
node
vehicle
time
data
queue
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201610009407.XA
Other languages
Chinese (zh)
Other versions
CN105610732B (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.)
Nanjing Post and Telecommunication University
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing Post and Telecommunication 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 Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201610009407.XA priority Critical patent/CN105610732B/en
Publication of CN105610732A publication Critical patent/CN105610732A/en
Application granted granted Critical
Publication of CN105610732B publication Critical patent/CN105610732B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • 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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/34—Modification of an existing route
    • H04W40/38—Modification of an existing route adapting due to varying relative distances between nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention aims to further optimize a communication mechanism of a vehicular ad-hoc network (VANET), and provides a method for dynamically selecting forwarding nodes and performing autonomous cooperative communication. When information in need of being forwarded in a multi-hop manner exists between vehicles, two alternative forwarding nodes can be selected according to the mutual speed between the vehicles; then, one forwarding node is selected for forwarding according to sizes of current storage spaces of the two forwarding nodes; another node is in a standby state; simultaneously, to reduce the load of the forwarding node as much as possible, cooperative sending can be autonomously carried out when other nodes around the forwarding node successfully monitors the information in need of being forwarded and does not have information to be sent in a current time; and the forwarding node correspondingly deletes the information from a storage queue, such that other information can be conveniently received. When the vehicle driving speed in the vehicle network is relatively steady, the packet loss condition can be effectively reduced through the method; and various performances of the network can be improved.

Description

Vehicle self-organizing network forwarder selection and collaboration communication method
Technical field
The invention belongs to communication technical field, relate to a kind of collaboration type vehicle self-organizing network data transmission method for uplink.
Background technology
In intelligent transportation system, vehicle and infrastructure are two requisite key elements. Along with sending out of economyExhibition, the contradiction of the vehicle fleet size increasing fast and the infrastructure construction of stagnation is increasingly sharpened. According to effective systemMeter, by 2013, the automobile pollution of China was 1.37 hundred million, average annual increment is 10% left and right, and basicIn facility, urban road increment is average annual 3% to 5%. The problem that the shortage of infrastructure brings also manifests day by day,Road is crowded, and conevying efficiency is low. And the land resource that the construction of infrastructure needs is very in short supply, aobviousSo can not be in order to improve traffic environment without restraint land occupation build road, the infrastructure such as base station. Realize vehicleBetween efficient communication can effectively improve traffic environment, therefore become study hotspot in recent years.
While designing mac-layer protocol for In-vehicle networking, the high-speed mobile of node, the spies such as distribution density dynamic changeProperty be all to need the problem considered, be also to optimize the key of agreement. In recent years, IEEE802.11p is undoubtedly peopleThe MAC agreement of applicable VANETs understood the most, but IEEE802.11p does not have RTS/CTS exchangeMechanism, can not provide reliable broadcast service, the problem that therefore cannot avoid hidden terminal to bring. For can be realNow reliable broadcast service, scholars' MAC access protocol based on TDMA that begins one's study gradually, passes throughOn control channel, carry out reliable one and jump the problem that broadcast can effectively avoid hidden terminal to bring. This quasi-protocolFor vehicle-mounted net provides reliable broadcast and point-to-point communication. But node high density can cause time interval resource not while distributionEnough distribution, and the time slot collision problem of bringing along with the movement of vehicle has caused the waste of time interval resource more.Once node loses time slot, mean that data cannot send and cause queue to be piled up. The timeliness of data in vehicle-mounted netProperty is very important, while therefore adopting the mode of collaboration communication to become to make up In-vehicle networking time interval resource inadequateA kind of settling mode. General collaboration protocols is all to utilize the free timeslot number that may exist in networkAccording to transmission, to improve the entire throughput of system. But there is a shortcoming in this collaboration protocols, needs exactly footEnough vacant time slots support cooperation to relay, and in vehicle-mounted net, time interval resource is often very limited, highly denseIn degree situation, time interval resource is inadequate reasonable distribution especially.
Consider that the communication between Shape Of Things To Come is not only for safety traffic, can also carry out some data simultaneouslyThe transmission of business, therefore this method considers that data arrival rate changes and cooperation under node processing ability fixation caseCommunication scenes can be selected a suitable forwarding joint according to given rule in the time that inter-node communication scope exceedes a jumpingPoint is used for forwarding data, considers that facilitating collaboration completes and turns and send out node node around according to the situation of self queueSend out or do not participate in forwarding, it is to carry out on the time slot taking at self that this cooperation forwards, without new when idleGap.
Summary of the invention
Technical problem: the object of this invention is to provide one in vehicle self-organizing network situation, node is sendingChoose reasonable forward node when multi-hop data, idle node provides spontaneous forwarding service, improves network in general and gulps downThe amount of telling, the collaboration type vehicle self-organizing network communication means of reduction packet loss.
Technical scheme: the present invention is vehicle self-organizing network forwarder selection and collaboration communication method.
In the method that the present invention proposes, each node need to be preengage a time slot and use all the time on control channelThis time slot is lost time slot until be moved conflict, and frame assumption diagram as shown in Figure 1. In the time that node successfully takiesWhether, when gap, no matter have data on data, services channel, to send, the time slot that node self takies at every frame arrivesWhile reaching, send and control message at control channel, be used for ensureing and exchange and the information updating of neighbor node data.
Control message format as shown in Figure 2: when wherein Time Slot Occupancy information can clearly record within the scope of double bounceThe occupied situation of gap, time slot S in figure1By node, x takies, time slot S2Unoccupied, can preengage, andTime slot SM-1 of mark represents time slot SMThere is reservation at place. New module WCHWhat record is each node basisSelf the weighted value that car speed calculates. And module RMDissimilar with different value difference node,If this value is 0, node is ordinary node, if 1, and node is available forward node, ifVehicle self WCHValue is vehicle W within the scope of a jumpingCHMinimum or inferior little in value, by RMValue is rewritten as 1.Header file has recorded a series of vehicle mobile related datas such as vehicle location, speed, moving direction.
The inventive method comprises the following steps:
(1) initialize moment t=1, the W of each vehicle nodeCH,RMBe set to 0 (wherein WCHBe used for weighing vehicle itBetween relative velocity, RMWhether vehicle is the mark of forward node), each vehicle node WCH(0) be set to 0;
(2), in the time that delivery time corresponding to vehicle node do not arrive, node keeps monitor channel, simultaneously by dataDeposit successively storage queue in;
(3) vehicle node is calculated the W of selfCHValue;
3-1) calculate factor of influence W ( t ) = Σ j = 1 n | V i - V j | max { Σ j = 1 n | V 1 - V j | , Σ j = 1 n | V 2 - V j | , ... , Σ j = 1 n | V n - V j | } , Wherein, ViBeThe speed of this node self, VjBe the speed of other nodes within the scope of this node one jumping, n is this node car aroundThe quantity of node;
3-2) computing node WCH(t)＝β·W(t)+(1-β)·WCH(t-1), wherein β is that regulatory factor is used for regulatingCurrent time and previous moment factor of influence are to calculating WCH(t) weight, and the numerical value calculating is write to controlW in message processedCH；
(4), after delivery time corresponding to vehicle node arrives, node is passed on each by controlling message to adjacent nodeIn the time taking time slot, pass on weights W separatelyCH, whether node judges to store in queue has data to send outSend, if there are data to send, enter (5), otherwise enter (7);
(5) distance that the data of vehicle node judgement storage queue head of the queue need to send, if within a jumping scope,Can directly be sent to corresponding receiving node, otherwise enter (6);
(6) data of vehicle node storage queue head of the queue need to send to outside a jumping scope, must select to forward jointPoint is realized multi-hop and is sent.
6-1) according to the W of node in each double bounce setCHValue, select two minimum and time little nodes as this twoJump the possible forward node of set, and by RMChange 1 into by initial value 0. And current according to these two nodesMoment stores queue length size, selects a short node of team leader to send data as forward node.
6-2) due to the characteristic of vehicle mobile, within occurring that two forward node distances narrow down to a jumping communication range r,Need to merge forward node, i.e. basis W separatelyCHValue is determined unique forward node, WCHBe worth larger jointR names a person for a particular jobMChange 0 into by 1, represent do not storing forwarding data;
6-3) when occurring that two adjacent forward node distances exceed double bounce communication range 2r, occur subregion withoutForward node covers, and the vehicle in this region can select a vehicle node to become forward node temporarily, by againAfter inferior monitor channel, determine whether to become formal forward node or merge with other forward node;
(7) node current time stores the queue free time, does not have data to need to send. Node according to monitor channel otherThe data that node sends determine whether the transmission that will cooperate. If this node does not listen to the number that needs forwardingAccording to, node keeps idle at current time. And after delivery time finishes time counter t=t+1, returnTo (2), otherwise enter (8);
(8) node current time stores the queue free time, does not have data to need to send, and receives but listen to forward nodeArrive new multi-hop information. The spontaneous cooperation of this node forwards this message, when other nodes have listened to this messageAfter being forwarded, selection is deleted this message from store queue, no longer forwards. After delivery time finishes,Time counter t=t+1, gets back to (2);
Beneficial effect
The present invention compared with prior art, has the following advantages:
1. in the time that data need multi-hop to forward, more reasonably select forward node. Due to vehicle in vehicle-mounted netMobility, fixing use same forward node inappropriate often, the present invention is considering between vehicle mutuallyOn the basis of speed, select with surrounding vehicles metastable vehicle, as forward node, to have improved network linkStability.
2. the ordinary node spontaneous forwarding that cooperates at one's leisure. If ordinary node arrives at self delivery timeReach and while not having data to send, if listened to the data that need multi-hop to forward that other nodes send,These data of transmission that can be spontaneous are to destination node. This method is not being used the prerequisite of extra vacant time slotUnder, reduce the load of forward node, and effectively promoted throughput of system.
Brief description of the drawings
Fig. 1 is frame structure schematic diagram.
Fig. 2 is for controlling message structure schematic diagram.
Fig. 3 is the schematic flow sheet of the inventive method.
Fig. 4 is the simulation result figure of handling capacity under highway scene.
Fig. 5 is the simulation result figure of packet loss under highway scene.
Detailed description of the invention
Below in conjunction with embodiment and Figure of description, the technical scheme of invention is elaborated:
Thinking of the present invention is the stability with lifting network link according to car speed choose reasonable forward node,Allow other nodes are spontaneous at one's leisure provides cooperation to forward service to alleviate the load of forward node and to promote netNetwork performance.
Vehicle self-organizing network forwarder selection and collaboration communication method idiographic flow are shown in accompanying drawing 3.
Vehicle self-organizing network forwarder selection of the present invention and collaboration communication method, comprise the following steps:
(1) initialize moment t=1, the W of each vehicle nodeCH,RMBe set to 0 (wherein WCHBe used for weighing vehicle itBetween relative velocity, RMWhether vehicle is the mark of forward node), each vehicle node WCH(0) be set to 0;
(2), in the time that delivery time corresponding to vehicle node do not arrive, node keeps monitor channel, simultaneously by dataDeposit successively storage queue in;
(3) vehicle node is calculated the W of selfCHValue;
3-1) calculate factor of influence W ( t ) = Σ j = 1 n | V i - V j | max { Σ j = 1 n | V 1 - V j | , Σ j = 1 n | V 2 - V j | , ... , Σ j = 1 n | V n - V j | } , Wherein, ViBeThe speed of this node self, VjBe the speed of other nodes within the scope of this node one jumping, n is this node car aroundThe quantity of node;
3-2) computing node WCH(t)＝β·W(t)+(1-β)·WCH(t-1), wherein β is that regulatory factor is used for regulatingCurrent time and previous moment factor of influence are to calculating WCH(t) weight, and the numerical value calculating is write to controlW in message processedCH；
(4), after delivery time corresponding to vehicle node arrives, node is passed on each by controlling message to adjacent nodeIn the time taking time slot, pass on weights W separatelyCH, whether node judges to store in queue has data to send outSend, if there are data to send, enter 5), otherwise enter 7);
(5) distance that the data of vehicle node judgement storage queue head of the queue need to send, if within a jumping scope,Can directly be sent to corresponding receiving node, otherwise enter 6);
(6) data of vehicle node storage queue head of the queue need to send to outside a jumping scope, must select to forward jointPoint is realized multi-hop and is sent.
6-1) according to the W of node in each double bounce setCHValue, select two minimum and time little nodes as this twoJump the possible forward node of set, and by RMChange 1 into by initial value 0. And current according to these two nodesMoment stores queue length size, selects a short node of team leader to send data as forward node.
6-2) due to the characteristic of vehicle mobile, within occurring that two forward node distances narrow down to a jumping communication range r,Need to merge forward node, i.e. basis W separatelyCHValue is determined unique forward node, WCHBe worth larger jointR names a person for a particular jobMChange 0 into by 1, represent do not storing forwarding data;
6-3) when occurring that two adjacent forward node distances exceed double bounce communication range 2r, occur subregion withoutForward node covers, and the vehicle in this region can select a vehicle node to become forward node temporarily, by againAfter inferior monitor channel, determine whether to become formal forward node or merge with other forward node;
(7) node current time stores the queue free time, does not have data to need to send. Node according to monitor channel otherThe data that node sends determine whether the transmission that will cooperate. If this node does not listen to the number that needs forwardingAccording to, node keeps idle at current time. And after delivery time finishes time counter t=t+1, returnTo 2), otherwise enter 8);
(8) node current time stores the queue free time, does not have data to need to send, but listens to forward nodeReceive new multi-hop information. The spontaneous cooperation of this node forwards this message, disappears when other nodes listen to thisAfter breath has been forwarded, selection is deleted this message from store queue, no longer forwards. When delivery time finishesAfter, time counter t=t+1, gets back to 2);
In sum, the present invention has provided the choose reasonable mode of vehicle-mounted net repeating node, and allows idle nodeProvide spontaneous cooperation to forward service, can effectively promote network stabilization and handling capacity. Be as shown in Figure 4The simulation result of handling capacity under highway scene, shown in accompanying drawing 5 under highway scene packet lossSimulation result. Vehicle self-organizing network collaboration communication method is obviously better than traditional time slot reservation mode, effectively fallsLow packet loss has also promoted network in general handling capacity.

Claims (1)

1. vehicle self-organizing network forwarder selection and collaboration communication method, is characterized in that, the method bagDraw together following steps:
(1) initialize moment t=1, the W of each vehicle nodeCH,RMBe set to 0, each vehicle node WCH(0) be set to 0;
(2), in the time that delivery time corresponding to vehicle node do not arrive, node keeps monitor channel, simultaneously by dataDeposit successively storage queue in;
(3) vehicle node is calculated the W of selfCHValue;
3-1) calculate factor of influence W ( t ) = Σ j = 1 n | V i - V j | max { Σ j = 1 n | V 1 - V j | , Σ j = 1 n | V 2 - V j | , ... , Σ j = 1 n | V n - V j | } , Wherein, ViBeThe speed of this node self, VjBe the speed of other nodes within the scope of this node one jumping, n is this node car aroundThe quantity of node;
3-2) computing node WCH(t)＝β·W(t)+(1-β)·WCH(t-1), wherein β is that regulatory factor is used for regulatingCurrent time and previous moment factor of influence are to calculating WCH(t) weight, and the numerical value calculating is write to controlW in message processedCH；
(4), after delivery time corresponding to vehicle node arrives, node is passed on each by controlling message to adjacent nodeIn the time taking time slot, pass on weights W separatelyCH, whether node judges to store in queue has data to send outSend, if there are data to send, enter (5), otherwise enter (7);
(5) distance that the data of vehicle node judgement storage queue head of the queue need to send, if within a jumping scope,Can directly be sent to corresponding receiving node, otherwise enter (6);
(6) data of vehicle node storage queue head of the queue need to send to outside a jumping scope, must select to forward jointPoint is realized multi-hop and is sent;
6-1) according to the W of node in each double bounce setCHValue, select two minimum and time little nodes as this twoJump the possible forward node of set, and by RMChange 1 into by initial value 0, and current according to these two nodesMoment stores queue length size, selects a short node of team leader to send data as forward node;
6-2) due to the characteristic of vehicle mobile, within occurring that two forward node distances narrow down to a jumping communication range r,Need to merge forward node, i.e. basis W separatelyCHValue is determined unique forward node, WCHBe worth larger jointR names a person for a particular jobMChange 0 into by 1, represent do not storing forwarding data;
3) when occurring that two adjacent forward node distances exceed double bounce communication range 2r, occur that subregion is without turningSend out coverage, the vehicle in this region can select a vehicle node to become forward node temporarily, by againAfter monitor channel, determine whether to become formal forward node or merge with other forward node;
(7) node current time stores the queue free time, does not have data to need to send; Node according to monitor channel otherThe data that node sends determine whether the transmission that will cooperate; If this node does not listen to the number that needs forwardingAccording to, node keeps idle at current time, and after delivery time finishes time counter t=t+1, returnTo (2), otherwise enter (8);
(8) node current time stores the queue free time, does not have data to need to send, and receives but listen to forward nodeArrive new multi-hop information. The spontaneous cooperation of this node forwards this message, when other nodes have listened to this messageAfter being forwarded, selection is deleted this message from store queue, no longer forwards; After delivery time finishes,Time counter t=t+1, gets back to (2).
CN201610009407.XA 2016-01-07 2016-01-07 Vehicle self-organizing network forwarder selection and collaboration communication method Active CN105610732B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610009407.XA CN105610732B (en) 2016-01-07 2016-01-07 Vehicle self-organizing network forwarder selection and collaboration communication method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610009407.XA CN105610732B (en) 2016-01-07 2016-01-07 Vehicle self-organizing network forwarder selection and collaboration communication method

Publications (2)

Publication Number Publication Date
CN105610732A true CN105610732A (en) 2016-05-25
CN105610732B CN105610732B (en) 2018-09-25

Family

ID=55990274

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610009407.XA Active CN105610732B (en) 2016-01-07 2016-01-07 Vehicle self-organizing network forwarder selection and collaboration communication method

Country Status (1)

Country Link
CN (1) CN105610732B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106953681A (en) * 2017-03-15 2017-07-14 北京航空航天大学 Network broadcasting communication high throughput network coding and transmission method between star
CN107295600A (en) * 2017-07-07 2017-10-24 北京邮电大学 A kind of data transmission method in In-vehicle networking
CN111917830A (en) * 2020-07-02 2020-11-10 南昌工程学院 Method and system for vehicle communication in Internet of vehicles

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100080168A1 (en) * 2008-09-29 2010-04-01 Toyota Infotechnology Center Co., Ltd. Probabilistic routing for vehicular ad hoc network
CN103095592A (en) * 2013-01-11 2013-05-08 上海交通大学 Zone multicast routing system and method of vehicular ad hoc network
CN103095593A (en) * 2013-01-11 2013-05-08 上海交通大学 Routing system and method of vehicular ad hoc network
CN103974373A (en) * 2014-05-26 2014-08-06 北京邮电大学 Vehicle-mounted network routing method and device
CN104580407A (en) * 2014-12-24 2015-04-29 南京邮电大学 VANET (vehicular ad hoc network) time slot reservation method based on game theory

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100080168A1 (en) * 2008-09-29 2010-04-01 Toyota Infotechnology Center Co., Ltd. Probabilistic routing for vehicular ad hoc network
CN103095592A (en) * 2013-01-11 2013-05-08 上海交通大学 Zone multicast routing system and method of vehicular ad hoc network
CN103095593A (en) * 2013-01-11 2013-05-08 上海交通大学 Routing system and method of vehicular ad hoc network
CN103974373A (en) * 2014-05-26 2014-08-06 北京邮电大学 Vehicle-mounted network routing method and device
CN104580407A (en) * 2014-12-24 2015-04-29 南京邮电大学 VANET (vehicular ad hoc network) time slot reservation method based on game theory

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106953681A (en) * 2017-03-15 2017-07-14 北京航空航天大学 Network broadcasting communication high throughput network coding and transmission method between star
CN107295600A (en) * 2017-07-07 2017-10-24 北京邮电大学 A kind of data transmission method in In-vehicle networking
CN107295600B (en) * 2017-07-07 2019-08-30 北京邮电大学 A kind of data transmission method in In-vehicle networking
CN111917830A (en) * 2020-07-02 2020-11-10 南昌工程学院 Method and system for vehicle communication in Internet of vehicles

Also Published As

Publication number Publication date
CN105610732B (en) 2018-09-25

Similar Documents

Publication Publication Date Title
CN105722231B (en) A kind of design method for the vehicle-mounted net MAC protocol of multichannel continuously coordinated
Gupta et al. Medium access control protocols for safety applications in Vehicular Ad-Hoc Network: A classification and comprehensive survey
Shafiee et al. Optimal distributed vertical handoff strategies in vehicular heterogeneous networks
Yu et al. Self-configuring TDMA protocols for enhancing vehicle safety with DSRC based vehicle-to-vehicle communications
CN107071854A (en) The distributed multihop Radio Broadcasting Agreements of relay forwarding probability is maximized based on car networking
CN104580407B (en) A kind of vehicle self-organizing network time slot reservation method based on game theory
CN103987103A (en) Vehicular ad hoc network route selection method based on game theory
Kwon et al. Neighbor stability-based VANET clustering for urban vehicular environments
Wu et al. Improving RSU service time by distributed sorting mechanism
Liya et al. A randomized algorithm for roadside units placement in vehicular ad hoc network
Kumar et al. BIIR: A beacon information independent VANET routing algorithm with low broadcast overhead
Lin et al. Integrated message dissemination and traffic regulation for autonomous VANETs
CN105610732A (en) Method for selecting forwarding nodes and performing cooperative communication of vehicular ad-hoc network (VANET)
Tomar et al. Enhanced SDMA for VANET communication
Chang et al. Adaptive message forwarding for avoiding broadcast storm and guaranteeing delay in active safe driving VANET
Goli-Bidgoli et al. Towards ensuring reliability of vehicular ad hoc networks using a relay selection techniques and D2D communications in 5G networks
Ravi et al. Stochastic traffic flow modeling for multi-hop cooperative data dissemination in VANETs
Wang et al. A local information sensing‐based broadcast scheme for disseminating emergency safety messages in IoV
Zhang et al. A tdma based cooperative communication mac protocol for vehicular ad hoc networks
Bi et al. Safety message broadcast in vehicular networks
CN108112046A (en) A kind of routing scheduling method based on vehicle-mounted internet
Yang et al. Priority‐Based Hybrid MAC Protocol for VANET with UAV‐Enabled Roadside Units
Rawashdeh et al. Communications in vehicular networks
Bharati et al. Link-layer cooperative communication in vehicular networks
Kannekanti et al. An efficient clustering scheme in 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
GR01 Patent grant
GR01 Patent grant