CN105554839B - A kind of vehicular ad hoc network multi-hop broadcasting method of position competition - Google Patents
A kind of vehicular ad hoc network multi-hop broadcasting method of position competition Download PDFInfo
- Publication number
- CN105554839B CN105554839B CN201510906415.XA CN201510906415A CN105554839B CN 105554839 B CN105554839 B CN 105554839B CN 201510906415 A CN201510906415 A CN 201510906415A CN 105554839 B CN105554839 B CN 105554839B
- Authority
- CN
- China
- Prior art keywords
- node
- broadcast
- vehicle
- broadcast packet
- state
- 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
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/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- 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/16—Multipoint routing
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of vehicular ad hoc network multi-hop broadcasting methods of position competition, belong to field of communication technology.Method includes the following steps: step 1: being connected to the dynamic clustering of stability: including executing sub-clustering to node, complete the sub-clustering based on connection stability, filling broadcast data packet is simultaneously broadcasted, and node executes broadcast retransmission method after receiving broadcast packet, realizes the competition forwarding of broadcast packet；Step 2: the transmission of multi-hop broadcast packet: including initiating broadcasting process to when active node needs to carry out data broadcasting to whole network data in network；Step 3: relay node competition forwarding: including taking different relay node to compete forwarding strategy different road models on the basis of network node sub-clustering, it is broadly divided into the tournament selection of relay node under the tournament selection of relay node and crossing model under the model of section.This method effectively reduces the redundancy of multi-hop broadcast, improves the reliability of broadcast.Meanwhile increasing the broadcast that cluster head is isolated to network and carrying forwarding strategy, it ensure that the broadcast reliability under node sparse region or network " cavity " region.
Description
Technical field
The invention belongs to fields of communication technology, especially vehicular ad hoc network technical field, are related to a kind of position competition
Vehicular ad hoc network multi-hop broadcasting method.
Background technique
In recent years, the rapid development of the urgent need of traffic intelligence and wireless communication technique has expedited the emergence of the combination of the two,
As a part of intelligent transportation system original research, vehicular ad hoc network technology is as academia and industrial circle are ground in recent years
The cross discipline hot subject studied carefully.Vehicular ad hoc network studies the communication between vehicle and vehicle, different from traditional wireless
Mobile ad-hoc network, vehicular ad hoc network are a kind of wireless self-organization networks established in inter-vehicular communication, include two
Part: the wireless communication between the communication between automobile, automobile and infrastructure on road.As a kind of special wireless mobile
Self-organizing network, what vehicular ad hoc network used is also distributed frame, has dynamic, non-stop layer, self-organizing and multi-hop etc.
Feature, vehicle node are both terminal node and routing node, and vehicle node can then set up one completely by wireless transceiver
Dynamic network.
By developing the intelligent transportation system based on vehicular ad hoc network, and then effectively reduce and prevent road friendship
Interpreter's event, raising traffic efficiency have become mondial common recognition.Intelligent transportation system is a kind of collection sensing, communication and meter
The advanced technologies such as calculation machine are in the traffic comprehensive management system of one.Its design object is to establish putting down for an inter-vehicular communication
Platform, makes to can be realized between vehicle the shared of vehicle condition (such as position, Che Xiang, speed) information and real-time road condition information, and vehicle can be with
Intelligent safety running is realized by the system, to improve the traffic efficiency of traffic, promotes the safety of vehicle drive and reliable
Property.Due to the particularity of application environment and the limitation of road, it is uneven, mobile that vehicular ad hoc network shows node density
The features such as speed is fast, topological high dynamic variation is difficult to establish stable end-to-end link, the reliability of data transmission between node
Sharply decline with the increase of hop count, so that design vehicular ad hoc network Routing Protocol is more than traditional mobile ad-hoc network
Add complexity.Therefore, the own characteristic of vehicular ad hoc network how is combined, it is current for designing reliable, efficient Routing Protocol
The key points and difficulties of vehicular ad hoc network research.
In vehicular ad hoc network, a kind of simplest broadcast mechanism is exactly flooded broadcast (Flooding
Broadcasting), nodes receive the neighbor node after broadcasted just into communication radius and are forwarded.Although this side
Formula can guarantee that as possible data reach each node of network, and method is simple and effective, but brings a series of ask
Topic, is mainly manifested in: first, since each node repeats to broadcast, this just brings a large amount of redundancy to network,
Broadcast storm (Broadcast Storm) easy to form, causes the waste of resource；Second, adjacent node is broadcasted in data
When forwarding time height it is consistent, be easy to cause the competition and collision of channel；Third, largely hiding and exposed terminal there are shadows
The reliable distribution of data is rung.Conventional wireless mobile ad-hoc network Radio Broadcasting Agreements is also not suitable for because of the difference of application environment
In vehicular ad hoc network.
The Routing Protocol of vehicular ad hoc network is broadly divided into: unicast, multicast and broadcast.As in vehicular ad hoc network
An important technology, broadcast the main data distribution realized to the whole network node.Since vehicular ad hoc network topological structure is high
Speed variation, dense or sparse mode, therefore the broadcast association of vehicular ad hoc network is presented in the density of vehicle on different sections
View needs good robustness and convergence, can adapt to different network environments.Meanwhile on broadcast packet forwarding strategy,
The number for reducing relay forwarding node improves the successful reception rate of broadcast packet, and reducing time delay is also vehicular ad hoc network multi-hop
The emphasis of Radio Broadcasting Agreements design.
Therefore, it studies and realizes that complicated, data under large-scale network environment reliable, quick broadcast are vehicular ad hoc nets
The project of one important research of network, has important practical significance.
Summary of the invention
In view of this, the purpose of the present invention is to provide a kind of vehicular ad hoc network multi-hop broadcasters of position competition
Method, this method can be directed to situation of movement of the vehicle node under different road environments, position, mobile speed in conjunction with node
Degree, the direction of motion, predict the average Lifetime of node.The selection of broadcast relay node is divided into leader cluster node
Broadcast packet forwarding in cluster is carried out, member node is competed by position and carries out broadcast packet forwarding.The redundancy of multi-hop broadcast is reduced, and
Improve the reliability of broadcast.Meanwhile this method increase the broadcast that cluster head is isolated to network to carry forwarding strategy, ensure that
Broadcast reliability under node sparse region or network " cavity " region.
In order to achieve the above objectives, the invention provides the following technical scheme:
A kind of vehicular ad hoc network multi-hop broadcasting method of position competition, comprising the following steps:
Step 1: it is connected to the dynamic clustering of stability: including executing sub-clustering to node, completing point based on connection stability
Cluster is filled broadcast data packet and is broadcasted, and node executes broadcast retransmission method after receiving broadcast packet, realizes the competition of broadcast packet
Forwarding；
Step 2: the transmission of multi-hop broadcast packet: including in the network active node need to carry out data to whole network data
When broadcast, broadcasting process is initiated；
Step 3: relay node competition forwarding: including being adopted on the basis of network node sub-clustering to different road models
It takes different relay nodes to compete forwarding strategy, is broadly divided under the model of section under the tournament selection of relay node and crossing model
The tournament selection of relay node.
Further, in step 1, road is divided into section model and crossing model by cluster algorithm, calculates separately difference
The connection stability of vehicle node under road environment；Cluster algorithm will be connected to the highest vehicle of stability as leader cluster node, from
And improve the sub-clustering stability under In-vehicle networking environment.
Further, in step 2, the multi-hop broadcast packet is sent, the vehicle by the cluster algorithm of network, in network
Node is divided into multiple stable sub-clusterings, when active node needs to carry out data broadcasting to the whole network in network, then initiates wide
Broadcast process；Node i obtains current node location information, calculates cluster head list and neighbor list, and corresponding data are filled
To the packet header of broadcast packet, and broadcast life span Life_time is set；Node further judge current neighbor list whether be
Sky illustrates that range locating for present node is isolated node, node carries out extensively again after waiting for a period of time if list is empty
It broadcasts, if detecting neighbor list not is sky, node is directly broadcasted.
Further, in step 3, the tournament selection of relay node includes the following steps: under the section model
Step 1) takes out life span < Life_ of broadcast header after node receives the broadcast data packet from neighbours
Time > field value judges the size of its value: if Life_Time is equal to 1, broadcast packet life span terminates, and node reads broadcast
Bag data terminates judgement；If Life_Time is greater than 1, enter next step；
Step 2) analyzes the source IP address and broadcast sequence Sn in broadcast packet, and sentence when node is leader cluster node CH
Whether disconnected to have received and the forwarded over broadcast packet, if forwarded over, node abandons current broadcast packet, and terminates to judge；If
Node receives for the first time, saves message copy, executes step 6), forwards broadcast packet；
When node is bunch member node CN, node judges whether to have repeated to receive broadcast packet step 3), if having been received by,
Selection abandons the broadcast packet, and terminates to judge；If node receives the broadcast packet for the first time, i.e., it is upward to be currently located in broadcaster for vehicle,
And before next relaying leader cluster node, perform the next step it is rapid 4)；
Step 4) bunch member node CN reads header upper hop<Last_hop>field, the position of a upper forward node
State<Position_State>field；If upper forward node state is State_Intersect, CN node saves message
Copy, no longer forwarding broadcast packet, terminate judgement；Otherwise node perform the next step it is rapid 5)；
Step 5) cluster member CN traverses current cluster head list Cluster_List, neighbor list Neighbor_List, judgement
The location status of present node, the more excellent node of location status are preferentially forwarded, the priority of member node state from height to
It is low to be followed successively by State_Intersect, State_Nearby, State_In；The priority of node forwarding then passes through forwarding and waits
The setting of time τ (i) is distinguished；During waiting time, if after node receives the broadcast packet from other member nodes CN forwarding,
Then node is abandoned waiting, and stops forwarding competition, terminates judgement；If not receiving, broadcast packet is forwarded, and execute step 6)；
Broadcast packet Life_Time field value is subtracted 1 by step 6) node, upper hop<the Last hop>word of modification broadcast header
Section, location status<Position_State>field, and broadcast and be transmitted to neighbor node；
In the calculating of waiting time τ (i), the vehicular ad hoc network multi-hop broadcast of position competition is added based on apart from excellent
First scheme considers that the routing direction of node current location status and broadcast packet, τ (i) are calculated such as formula:
Wherein:For vehicle-state coefficient, size depends on vehicle
Current position state and neighbor node state；Formula it can be concluded that, when node be in cluster overlap state when, S (i) be 0, three
The value of S (i) is all satisfied S (i) < 1 under kind state；
In formula, τ max --- maximum waits time delay
R --- vehicle communication radius
Distance of Dij --- the vehicle i apart from a upper forward node
The related coefficient in μ --- node motion direction and broadcast direction, meets μ < 1, minimum when direction is consistent
N --- the current Neighbor_List node total number amount of node i
Ni --- state is the neighbor node number of State_Intersect in neighbor table
Nj --- state is the neighbor node number of State_In
σ --- system parameter, size depends on number of vehicles in network, and meets σ < 1
By setting different waiting time τ (i), the vehicular ad hoc network of position competition can be effectively reduced cluster member
The competition of node broadcasts forwarding, and improve the stability of broadcast.
Further, in step 3, the tournament selection of relay node includes the following steps: under the crossing model
Step 1) after junction node receives the broadcast data packet from neighbours, take out broadcast header life span <
Life_Time > field value judges the size of its value: if Life_Time is equal to 1, broadcast packet life span terminates, and node is read
Broadcast bag data is taken, judgement is terminated；If Life_Time is greater than 1, enter next step；
If step 2) node is Intersection cluster head CH, the source IP address and broadcast sequence number in broadcast packet are analyzed
Sn, judges whether to have received and the forwarded over broadcast packet, if forwarded over, node abandons current broadcast packet, and terminates to sentence
It is disconnected；If node receives for the first time, message copy is saved, executes step 7), forwards broadcast packet；
If step 3) node is Intersection member CN, and receives and processed the broadcast packet, then node
Directly abandon；If node receives the broadcast packet for the first time, enter next step；
Step 4) member node CN reads header upper hop<Last_hop>field, traverses neighbor list
Neighbor_List, if upper hop node n is the cluster head or member node under Segment, CN saves message data, executes
Step 7) forwards broadcast packet；If upper hop is the cluster head or member node under Intersection, judge into next step；
Step 5) member node CN traverses current cluster head list Cluster_List and neighbor list Neighbor_List,
Judge that the location status of present node, location status preferably node are preferentially forwarded, the priority of member node state from
High to Low to be followed successively by State_Intersect, State_Nearby and State_In, priority equally passes through the forwarding waiting time
The setting of τ (i) is distinguished；The calculating of τ (i) is different under the model of section, and under same position state, it is better that node is connected to stability
Vehicle will preferentially become broadcast forward node, τ (i) calculate such as formula:
τ (i)=τmax× [λ S (i)+(1- λ) C (i)] (0 < λ < 1)
C (i) is determined by current vehicle speed and node degree, when vehicle has lower movement speed or node degree close to system
When node degree threshold value of uniting, then C (i) is smaller, waits forwarding time smaller, and forwarding higher grade；
In formula, τ max --- maximum waits time delay
Vi --- the current movement speed of vehicle
Vmax --- vehicle maximum movement speed
Degi --- the current node degree of node
The node degree threshold value of Degth --- system
Step 6) member node CN setting time τ (i), and enter wait state；During waiting time τ (i), if CN is received
To the identical broadcast packet from neighbours, takes out header and judges upper hop<Last_hop>field, traverse Neighbor_List,
If present node and upper hop node are in same a road section direction, CN stops competition, terminates to wait, and no longer carries out broadcast and turns
Hair；Otherwise, it continues waiting for；If waiting time τ (i) terminates, perform the next step, forwards broadcast packet；
Broadcast packet Life_Time field value is subtracted 1 by step 7) node, upper hop<Last_hop>word of modification broadcast header
Section, location status<Position_State>field, and broadcast and be transmitted to neighbor node.
Further, due to vehicle-mounted from group group network, it is especially sparse or the case where be unevenly distributed in network node
Under, the feature of road is easy to cause the generation of isolated node and the appearance of network " cavity " in network, reduces the success of broadcast
Rate.In this regard, this method is set after vehicle receives broadcast packet carries time tr, within the tr time, when vehicle detection to neighbours arranges
Table is not sky, then vehicle node forwards the broadcast packet；Carrying time tr terminates, then directly abandons broadcast packet, terminates judgement；Vehicle
Node is after receiving broadcast packet, if vehicle is in following location status, enters and carries repeating process:
1) vehicle node detects current cluster members list or neighbor list as sky, i.e., node is not in the logical of any vehicle
Believe in radius, to isolate leader cluster node；
2) under Segment model, vehicle is in State_In state, and the moving direction of node is consistent with broadcast direction,
And it is located at the front position on sub-clustering boundary on the moving direction；
3) under Intersection model, vehicle is in moving condition of the crossing to section, meets the mobile side of node
To with broadcast direction it is consistent, node is located at foremost position on moving direction.
The beneficial effects of the present invention are: a kind of vehicular ad hoc network multi-hop broadcast of position competition provided by the invention
Method can carry out sub-clustering division with the stability that is connected to of node according to different road models, by the selection of broadcast relay node
It is divided into leader cluster node and carries out broadcast packet forwarding in cluster, member node is competed by position and carries out broadcast packet forwarding.It is effectively reduced
The redundancy of multi-hop broadcast, and improve the reliability of broadcast.Meanwhile this method increase the broadcast for isolating cluster head to network to take
Band forwarding strategy, ensure that the broadcast reliability under node sparse region or network " cavity " region.
Detailed description of the invention
In order to keep the purpose of the present invention, technical scheme and beneficial effects clearer, the present invention provides following attached drawing and carries out
Illustrate:
Fig. 1 is broadcast packet transmission flow figure；
Fig. 2 is competition forwarding schematic diagram under the model of section；
Fig. 3 is competition forwarding schematic diagram under the model of crossing；
Fig. 4 is carrying-forwarding schematic diagram.
Specific embodiment
Below in conjunction with attached drawing, a preferred embodiment of the present invention will be described in detail.
A kind of vehicular ad hoc network multi-hop broadcasting method of position competition provided by the invention, this method include following step
It is rapid: to be connected to the dynamic clustering of stability, the transmission of multi-hop broadcast packet, the competition forwarding of broadcast relay node.The connection stability
Dynamic clustering include in the netinit stage, node executes cluster algorithm, completes the sub-clustering based on connection stability；Institute
The transmission for stating multi-hop broadcast packet obtains current node location information including node i, calculates cluster head list and neighbor list, and will
Corresponding data are filled to the packet header of broadcast packet, and broadcast life span Life_time is arranged.The broadcast relay node competition
Forwarding includes that different relay nodes is taken to compete forwarding strategy for different road models, when network node receives broadcast packet
Afterwards, node judges current road type and executes competition forwarding judgement operation: under the model of section, vehicle node, which receives, to be come from
It after the broadcast packet of neighbours, is calculated by the judgement of node type and location status, executes the competition forwarding of broadcast relay node；?
Under the model of crossing, since crossing model is connected by multiple sections, the broadcast of crossing model needs to complete to multiple directions
Broadcast forwarding, while needing to consider the information redundancy and Forwarding Delay of node forwarding.Meanwhile the present invention provides a kind of position competition
Vehicular ad hoc network multi-hop broadcasting method, to network " cavity " problem increase broadcast carry forwarding mechanism, improve more
The reliability of hop broadcasting simultaneously effective reduces broadcasting redundant and time delay.Multi-hop broadcasting method based on position competition is wide
All there is preferable performance in terms of broadcasting packet averagely successful reception rate, broadcast average delay and average overhead.
The present invention principle comprehensive in line with decision factor, comprehensively consider existing vehicular ad hoc network algorithm decision because
Defect in element selection, emphasis consider dynamic decision factor, realize optimal access network by the processing to dynamic decision factor
Selection, the present invention select for network selection relevant Decision factor meter it is as follows:
The decision factor table of 1 network of table selection
The times N of broadcast influences average broadcast and is bundled into function acceptance rate APRR, and the times N of value and broadcast is inversely proportional, and calculates
Such as formula:
Average broadcast time delay ABD (Average Broadcast Delay) refers to that network node receives source node broadcast
The average delay of packet.Multi-hop transmission is needed since broadcast packet is distributed to the destination node in network, broadcast average delay is smaller, meaning
Taste broadcast packet can pass through the faster arrival destination node of relay forwarding, broadcast timeliness it is better.Average broadcast time delay is by each
Node receives broadcast packet time Time_rev and subtracts the average value that source node sends the sum of time Time_send of broadcast packet,
It calculates such as formula:
Node data traffic volume bit_send total during broadcast influences the average broadcast expense ABO of network, average wide
It broadcasts expense ABO (Average Broadcast Overhead) and refers to that the data transmitted required for packet networks of broadcast are total
Average value is measured, broadcast average overhead is lower, then illustrates that broadcast channel utilization rate is higher, and the redundancy of broadcast is lower, it calculates such as formula:
With the increase of network number, the average overhead of network is sharply increased, this is because all nodes are being received in network
It is all forwarded after to broadcast packet, increases the expense of broadcast and the redundancy of information, due to the vehicular ad hoc competed in position
In network multi-hop broadcasting method, the overhead for being successfully transmitted a broadcast packet not only includes to be opened as caused by repeated broadcast
Pin, and PCMB is contained during broadcast to the maintenance costs of cluster, such as the exchange of beacon message BM and sub-clustering message CM.Work as net
When network interstitial content increases, then more stable based on connection stability sub-clustering, the maintenance costs of cluster are not with number of vehicles
Increase and sharply increase, the expense of broadcast is also maintained at lower level.
Based on the vehicular ad hoc network multi-hop broadcasting method of position competition, including three big steps: being connected to the dynamic of stability
State sub-clustering, the transmission of multi-hop broadcast packet, relay node competition forwarding.The dynamic clustering of connection stability includes executing to divide to node
Cluster completes the sub-clustering based on connection stability, fills broadcast data packet and is broadcasted, node executes broadcast after receiving broadcast packet
Retransmission method realizes the competition forwarding of broadcast packet；The transmission of multi-hop broadcast packet include in the network active node need to complete
When network data carries out data broadcasting, broadcasting process is initiated.Relay node competition forwarding includes taking not different road models
Same relay node competes forwarding strategy, is broadly divided under the model of section and relays under the tournament selection of relay node and crossing model
The tournament selection of node.Data are collected and are handled by these modules, finally notify network to connect the result of decision
Mouthful, to improve the reliability of node.
Fig. 1 is broadcast packet transmission flow figure, as shown in the figure:
Node i obtains current node location information, calculates cluster head list and neighbor list, and corresponding data are filled
To the packet header of broadcast packet, and broadcast life span Life_time is set.Node further judge current neighbor list whether be
Sky illustrates that range locating for present node is isolated node, node carries out extensively again after waiting for a period of time if list is empty
It broadcasts.If detecting neighbor list not is sky, node is directly broadcasted.
Fig. 2 is competition forwarding schematic diagram under the model of section, the tournament selection of relay node under the model of section, due to road
Width dr is less than the communication radius r of node, and the relative position between cluster and cluster is point-blank.It is selected in relay forwarding node
On, leader cluster node CH will complete broadcast to cluster interior nodes, then real based on the optimal node of position competition gained in member node CN
Broadcast between existing neighbours' cluster.Bunch member node CN is divided into following location status < Position_State under the model of section
>:
State_Intersect: node is in simultaneously in the communication radius r of current cluster M (i) and neighbours cluster M (k), such as Fig. 2
Shown vehicle I is in the communication radius of cluster head CH_F and CH_K simultaneously；
State_Nearby: node is only in the communication radius r of current cluster M (i), but node is in neighbours cluster M's (k)
In communication range L.Wherein the communication range L of cluster is defined as L=lc+r, and lc is distance on node and neighbours' cluster head k line direction
Cluster head k farthest the distance between member.The communication range boundary Edge_1 of cluster head CH_A, the communication range boundary of member E
Edge_2, cluster head CH_A are lc apart from the distance between vehicle E, and vehicle H and G are then in the communication range of cluster M (A), similarly
Vehicle E is also in the communication range of cluster M (F)；
State_In: node is only in the communication radius r of current cluster M (i), and not in the communication range of any neighbours' cluster
It is interior.Vehicle B, C, D, M and L in such as figure.
Judgement and position under the model of section, after vehicle node receives the broadcast packet from neighbours, by node type
State computation is set, the competition forwarding of broadcast relay node is executed, the execution step of algorithm is described as follows:
Step 1: after node receives the broadcast data packet from neighbours, taking out life span < Life_ of broadcast header
Time > field value judges the size of its value.If Life_Time is equal to 1, broadcast packet life span terminates, and node reads broadcast
Bag data terminates judgement；If Life_Time is greater than 1, enter next step.
Step 2: when node is leader cluster node CH, analyzing the source IP address and broadcast sequence Sn in broadcast packet, and sentence
Whether disconnected to have received and the forwarded over broadcast packet, if forwarded over, node abandons current broadcast packet, and terminates to judge.If
Node receives for the first time, saves message copy, executes step 6, forwards broadcast packet.
Step 3: when node is bunch member node CN, node judges whether to have repeated to receive broadcast packet, if having been received by,
Selection abandons the broadcast packet, and terminates to judge.If node receives the broadcast packet for the first time, i.e., it is upward to be currently located in broadcaster for vehicle,
And before next relaying leader cluster node, rapid 4 are performed the next step.
Step 4: bunch member node CN reads header upper hop<Last_hop>field, the position of a upper forward node
State<Position_State>field.If upper forward node state is State_Intersect, CN node saves message
Copy, no longer forwarding broadcast packet, terminate judgement；Otherwise node performs the next step rapid 5.
Step 5: cluster member CN traverses current cluster head list Cluster_List, neighbor list Neighbor_List, judgement
The location status of present node, the more excellent node of location status are preferentially forwarded, the priority of member node state from height to
It is low to be followed successively by State_Intersect, State_Nearby, State_In.The priority of node forwarding then passes through forwarding and waits
The setting of time τ (i) is distinguished.During waiting time, if after node receives the broadcast packet from other member nodes CN forwarding,
Then node is abandoned waiting, and stops forwarding competition, terminates judgement；If not receiving, broadcast packet is forwarded, and execute step 6.
Step 6: broadcast packet Life_Time field value is subtracted 1 by node, upper hop<the Last hop>word of modification broadcast header
Section, location status<Position_State>field, and broadcast and be transmitted to neighbor node.
In the calculating of waiting time τ (i), the routing direction of node current location status and broadcast packet, τ (i) are considered
It calculates such as formula (4.1):
Wherein:For vehicle-state coefficient, size depends on vehicle
Current position state and neighbor node state.Formula it can be concluded that, when node be in cluster overlap state when, S (i) be 0, three
The value of S (i) is all satisfied S (i) < 1 under kind state.
In formula, τ max --- maximum waits time delay
R --- vehicle communication radius
Distance of Dij --- the vehicle i apart from a upper forward node
The related coefficient in μ --- node motion direction and broadcast direction, meets μ < 1, minimum when direction is consistent
N --- the current Neighbor_List node total number amount of node i
Ni --- state is the neighbor node number of State_Intersect in neighbor table
Nj --- state is the neighbor node number of State_In
σ --- system parameter, size depends on number of vehicles in network, and meets σ < 1
By setting different waiting time τ (i), the vehicular ad hoc network multi-hop broadcasting method of position competition can be effective
Ground reduces the competition of bunch member node broadcast forwarding, and improves the stability of broadcast.When multiple vehicles are in the cluster zone of intersection simultaneously
When in domain and neighbours' cluster communication zone, the vehicle of State_Intersect state is preferentially forwarded, such as vehicle C and D in left figure
Priority is higher than vehicle E, and between vehicle C and D, the vehicle D waiting time τ (i) farthest apart from upper forward node CH_A is most
It is short, become the broadcast forward node between cluster；In the communication range L that multiple vehicles are in neighbours' cluster simultaneously, such as right figure vehicle C and
Shown in D, the broadcast consistent vehicle C waiting time τ (i) in direction is most short, becomes broadcast forward node.
Fig. 3 is competition forwarding schematic diagram under the model of crossing:
Under the model of crossing, the relative movement direction between vehicle is no longer linear relation, and the location layout at crossing influences
Relative position between cluster, therefore the relay node competition forwarding under the model of crossing is more complex than section environment.
Under the model of crossing, the location status<Position_State>of bunch member node CN is equally divided into three classes:
State_Intersect, State_Nearby and State_In.State_Intersect state indicates at bunch member node CN
In overlapping covered, the vehicle J and E as shown in the figure of crossing sub-clustering and section sub-clustering；State_Nearby indicates that CN is located at road
The overlay area of mouth sub-clustering, while in the communication range in section sub-clustering, such as vehicle H；State_In indicates that vehicle only exists in
In current crossing sub-clustering.
Since crossing model is connected by multiple sections, the broadcast of crossing model needs to complete to the wide of multiple directions
Forwarding is broadcast, while needing to consider the information redundancy and Forwarding Delay of node forwarding.It is come from when the vehicle node at crossing receives for the first time
After the broadcast packet of neighbours, the position coordinates of current vehicle, and traverse node neighbor table Neighbor_List and cluster list are calculated
Cluster_List calculates current location status.If vehicle is crossing sub-clustering leader cluster node, broadcast forwarding is directly carried out；If
It then carries out competing forwarding in next step for member node, determines that forwarding is preferential yet by setting forwarding waiting time τ (i) between node
Grade.Under the model of crossing, steps are as follows for the algorithm execution of broadcast relay competition forwarding:
Step 1: after junction node receives the broadcast data packet from neighbours, take out broadcast header life span <
Life_Time > field value judges the size of its value.If Life_Time is equal to 1, broadcast packet life span terminates, and node is read
Broadcast bag data is taken, judgement is terminated；If Life_Time is greater than 1, enter next step.
Step 2: if node is Intersection cluster head CH, analyzing the source IP address and broadcast sequence number in broadcast packet
Sn, judges whether to have received and the forwarded over broadcast packet, if forwarded over, node abandons current broadcast packet, and terminates to sentence
It is disconnected；If node receives for the first time, message copy is saved, executes step 7, forwards broadcast packet.
Step 3: if node is Intersection member CN, and having received and processed the broadcast packet, then node
Directly abandon；If node receives the broadcast packet for the first time, enter next step.
Step 4: member node CN reads header upper hop<Last_hop>field, traverses neighbor list
Neighbor_List, if upper hop node n is the cluster head or member node under Segment, CN saves message data, executes
Step 7, broadcast packet is forwarded；If upper hop is the cluster head or member node under Intersection, judge into next step.
Step 5: member node CN traverses current cluster head list Cluster_List and neighbor list Neighbor_List,
Judge that the location status of present node, location status preferably node are preferentially forwarded, the priority of member node state from
High to Low to be followed successively by State_Intersect, State_Nearby and State_In, priority equally passes through the forwarding waiting time
The setting of τ (i) is distinguished.The calculating of τ (i) is different under the model of section, and under same position state, it is better that node is connected to stability
Vehicle will preferentially become broadcast forward node, τ (i) calculate such as formula:
τ (i)=τmax× [λ S (i)+(1- λ) C (i)] (0 < λ < 1)
C (i) is determined by current vehicle speed and node degree, when vehicle has lower movement speed or node degree close to system
When node degree threshold value of uniting, then C (i) is smaller, waits forwarding time smaller, and forwarding higher grade.
In formula, τ max --- maximum waits time delay
Vi --- the current movement speed of vehicle
Vmax --- vehicle maximum movement speed
Degi --- the current node degree of node
The node degree threshold value of Degth --- system
Step 6: member node CN setting time τ (i), and enter wait state.During waiting time τ (i), if CN is received
To the identical broadcast packet from neighbours, takes out header and judges upper hop<Last_hop>field, traverse Neighbor_List,
If present node and upper hop node are in same a road section direction, CN stops competition, terminates to wait, and no longer carries out broadcast and turns
Hair；Otherwise, it continues waiting for.If waiting time τ (i) terminates, perform the next step, forwards broadcast packet.
Step 7: broadcast packet Life_Time field value is subtracted 1 by node, upper hop<Last_hop>word of modification broadcast header
Section, location status<Position_State>field, and broadcast and be transmitted to neighbor node.
So far, the competition repeating process description of PCMB broadcast relay node terminates under the model of crossing, when being waited by setting
Between τ (i), the optimal member node of location status will be forwarded broadcast packet；By broadcasting neighbor node the judgement in direction,
PCMB is effectively ensured for the forwarding on each section direction.Vehicle J and E all in State_Intersect state, and mutually
In different section directions, although J and E, mutually in the communication radius of other side, after receiving the broadcast packet of cluster head, J and E are
As the relay forwarding node on respective section direction.
Due to vehicle-mounted from group group network, in the case where network node is sparse or is unevenly distributed, the feature of road
It is easy to cause the generation of isolated node and the appearance of network " cavity " in network, reduces the success rate of broadcast.In this regard, PCMB is assisted
For view for this special circumstances using " carrying-forwarding " strategy of information, i.e., vehicle is set after receiving broadcast packet carries the time
Tr, within the tr time, when vehicle detection to neighbor list is not sky, then vehicle node forwards the broadcast packet；Carry time tr knot
Beam then directly abandons broadcast packet, terminates judgement.
Fig. 4 is carrying-forwarding schematic diagram
Vehicle node is after receiving broadcast packet, if vehicle is in following location status, enters and carries repeating process:
1. vehicle node detects current cluster members list or neighbor list as sky, i.e., node is not in the logical of any vehicle
Believe in radius, to isolate leader cluster node.
2. vehicle is in State_In state, and the moving direction of node is consistent with broadcast direction under Segment model,
And it is located at the front position on sub-clustering boundary on the moving direction.
3. vehicle is in moving condition of the crossing to section under Intersection model, meet the mobile side of node
To with broadcast direction it is consistent, node is located at foremost position on moving direction.
Vehicle B, E and isolated cluster head CH_F will enter after receiving broadcast forwarding and wrapping carries forwarding state, waits and neighbour
Node is occupied to meet.The vehicular ad hoc network multi-hop broadcasting method of position competition uses " carrying-forwarding " plan under special circumstances
Although summary sacrifices certain broadcast time delay, the coverage rate and reliability of vehicle broadcast are improved.
Finally, it is stated that preferred embodiment above is only used to illustrate the technical scheme of the present invention and not to limit it, although logical
It crosses above preferred embodiment the present invention is described in detail, however, those skilled in the art should understand that, can be
Various changes are made to it in form and in details, without departing from claims of the present invention limited range.
Claims (2)
1. a kind of vehicular ad hoc network multi-hop broadcasting method of position competition, it is characterised in that: the following steps are included:
Step 1: it is connected to the dynamic clustering of stability: including completing the sub-clustering based on connection stability to node execution sub-clustering,
Filling broadcast data packet is simultaneously broadcasted, and node executes broadcast retransmission method after receiving broadcast packet, realizes that the competition of broadcast packet turns
Hair；
Step 2: the transmission of multi-hop broadcast packet: including in the network active node need to carry out data broadcasting to whole network data
When, initiate broadcasting process；
Step 3: relay node competition forwarding: including taking not on the basis of network node sub-clustering different road models
Same relay node competes forwarding strategy, is broadly divided under the model of section and relays under the tournament selection of relay node and crossing model
The tournament selection of node；
In step 1, road is divided into section model and crossing model by cluster algorithm, is calculated separately under different road environments
The connection stability of vehicle node；Cluster algorithm will be connected to the highest vehicle of stability as leader cluster node, to improve vehicle
Carry the sub-clustering stability under network environment；
In step 2, the transmission of the multi-hop broadcast packet, by the cluster algorithm of network, the vehicle node in network is divided
Broadcasting process is then initiated when active node needs to carry out data broadcasting to the whole network in network for multiple stable sub-clusterings；Node
I obtains current node location information, calculates cluster head list and neighbor list, and corresponding data are filled to the packet of broadcast packet
Head, and broadcast life span Life_time is set；Node further judges whether current neighbor list is sky, if list is
Sky then illustrates that range locating for present node is isolated node, and node is broadcasted again after waiting for a period of time, if detecting neighbour
Occupying list not is sky, then node is directly broadcasted；
In step 3, the tournament selection of relay node includes the following steps: under the section model
Step 1) takes out life span < Life_Time of broadcast header after node receives the broadcast data packet from neighbours
> field value judges the size of its value: if Life_Time is equal to 1, broadcast packet life span terminates, and node reads broadcast packet number
According to end judgement；If Life_Time is greater than 1, enter next step；
Step 2) analyzes the source IP address and broadcast sequence Sn in broadcast packet when node is leader cluster node CH, and judgement is
No to have received and the forwarded over broadcast packet, if forwarded over, node abandons current broadcast packet, and terminates to judge；If node
It receives for the first time, saves message copy, execute step 6), forward broadcast packet；
When node is bunch member node CN, node judges whether to have repeated to receive broadcast packet step 3), if having been received by, selection
The broadcast packet is abandoned, and terminates to judge；If node receives the broadcast packet for the first time, i.e., it is upward to be currently located in broadcaster for vehicle, and
Before next relaying leader cluster node, perform the next step it is rapid 4)；
Step 4) bunch member node CN reads header upper hop<Last_hop>field, the location status of a upper forward node
<Position_State>field；If upper forward node state is State_Intersect, CN node saves message pair
This, no longer forwarding broadcast packet, end judges；Otherwise node perform the next step it is rapid 5)；
Step 5) cluster member CN traverses current cluster head list Cluster_List, neighbor list Neighbor_List, and judgement is current
The location status of node, the more excellent node of location status are preferentially forwarded, the priority of member node state from high to low according to
Secondary is State_Intersect, State_Nearby, State_In；The priority of node forwarding then passes through forwarding waiting time τ
(i) setting is distinguished；During waiting time, if being saved after node receives the broadcast packet from other member nodes CN forwarding
Point is abandoned waiting, and stops forwarding competition, terminates judgement；If not receiving, broadcast packet is forwarded, and execute step 6)；
Broadcast packet Life_Time field value is subtracted 1 by step 6) node, the upper hop<Last hop>field of modification broadcast header,
Location status<Position_State>field, and broadcast and be transmitted to neighbor node；
In the calculating of waiting time τ (i), the vehicular ad hoc network multi-hop broadcast of position competition, which is added, is based on distance priority side
Case considers that the routing direction of node current location status and broadcast packet, τ (i) are calculated such as formula:
Wherein:For vehicle-state coefficient, size depends on the current of vehicle
Location status and neighbor node state；Formula it can be concluded that, when node be in cluster overlap state when, S (i) be 0, in three kinds of states
The value of lower S (i) is all satisfied S (i) < 1；In formula, τ max is maximum waiting time delay, and r is vehicle communication radius, DijFor vehicle i distance
The distance of a upper forward node, μ are node motion direction and the related coefficient for broadcasting direction, meet μ < 1, when direction is consistent most
Small, N is the current Neighbor_List node total number amount of node i, niThe neighbour for being State_Intersect for state in neighbor table
Occupy interstitial content, njThe neighbor node number for being State_In for state, σ are system parameter, and size depends on vehicle in network
Number, and meet σ < 1；
By setting different waiting time τ (i), the vehicular ad hoc network of position competition can be effectively reduced bunch member node
The competition of forwarding is broadcasted, and improves the stability of broadcast；
In step 3, the tournament selection of relay node includes the following steps: under the crossing model
Step 1) takes out life span < Life_ of broadcast header after junction node receives the broadcast data packet from neighbours
Time > field value judges the size of its value: if Life_Time is equal to 1, broadcast packet life span terminates, and node reads broadcast
Bag data terminates judgement；If Life_Time is greater than 1, enter next step；
If step 2) node is the cluster head CH under Intersection model, the source IP address and broadcast sequence in broadcast packet are analyzed
Row number Sn, judges whether to have received and the forwarded over broadcast packet, if forwarded over, node abandons current broadcast packet, and ties
Beam judgement；If node receives for the first time, message copy is saved, executes step 7), forwards broadcast packet；
If step 3) node is the member CN under Intersection model, and receives and processed the broadcast packet, then
Node directly abandons；If node receives the broadcast packet for the first time, enter next step；
Step 4) member node CN reads header upper hop<Last_hop>field, traverses neighbor list Neighbor_
List, if upper hop node n is the cluster head or member node under Segment model, CN saves message data, executes step
7) broadcast packet, is forwarded；If upper hop is the cluster head or member node under Intersection model, judge into next step；
Step 5) member node CN traverses current cluster head list Cluster_List and neighbor list Neighbor_List, judgement
The location status of present node, location status preferably node are preferentially forwarded, the priority of member node state from height to
Low to be followed successively by State_Intersect, State_Nearby and State_In, priority equally passes through forwarding waiting time τ (i)
Setting distinguish；The calculating of τ (i) is different under the model of section, and under same position state, node is connected to the better vehicle of stability
Will preferentially become broadcast forward node, τ (i) calculate such as formula:
τ (i)=τmax× [λ S (i)+(1- λ) C (i)], 0 < λ < 1
C (i) is determined by current vehicle speed and node degree, when vehicle has lower movement speed or node degree close to system section
When point degree threshold value, then C (i) is smaller, waits forwarding time smaller, and forwarding higher grade；In formula, τmaxTime delay, v are waited for maximumi
For the current movement speed of vehicle, VmaxFor vehicle maximum movement speed, DegiFor the current node degree of node, DegthFor system
Node degree threshold value；
Step 6) member node CN setting time τ (i), and enter wait state；During waiting time τ (i), come if CN is received
From the identical broadcast packet of neighbours, takes out header and judge upper hop<Last_hop>field, Neighbor_List is traversed, if working as
Front nodal point and upper hop node are in same a road section direction, then CN stops competition, terminate to wait, no longer carry out broadcast forwarding；It is no
Then, it continues waiting for；If waiting time τ (i) terminates, perform the next step, forwards broadcast packet；
Broadcast packet Life_Time field value is subtracted 1 by step 7) node, upper hop<Last_hop>field of modification broadcast header,
Location status<Position_State>field, and broadcast and be transmitted to neighbor node.
2. a kind of vehicular ad hoc network multi-hop broadcasting method of position competition according to claim 1, it is characterised in that:
Setting carries time tr after vehicle receives broadcast packet, within the tr time, when vehicle detection to neighbor list is not sky, then vehicle
Node forwards the broadcast packet；Carrying time tr terminates, then directly abandons broadcast packet, terminates judgement；Vehicle node is receiving broadcast
Bao Hou enters if vehicle is in following location status and carries repeating process:
1) vehicle node detects current cluster members list or neighbor list as sky, i.e., node is not in the communication of any vehicle half
In diameter, to isolate leader cluster node；
2) under Segment model, vehicle is in State_In state, and the moving direction of node is consistent with broadcast direction, and
The front position on sub-clustering boundary on the moving direction；
3) under Intersection model, vehicle is in moving condition of the crossing to section, meet the moving direction of node with
Broadcast direction is consistent, and node is located at foremost position on moving direction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510906415.XA CN105554839B (en) | 2015-12-07 | 2015-12-07 | A kind of vehicular ad hoc network multi-hop broadcasting method of position competition |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510906415.XA CN105554839B (en) | 2015-12-07 | 2015-12-07 | A kind of vehicular ad hoc network multi-hop broadcasting method of position competition |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105554839A CN105554839A (en) | 2016-05-04 |
| CN105554839B true CN105554839B (en) | 2019-04-02 |
Family
ID=55833715
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510906415.XA Active CN105554839B (en) | 2015-12-07 | 2015-12-07 | A kind of vehicular ad hoc network multi-hop broadcasting method of position competition |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105554839B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106131917B (en) * | 2016-06-17 | 2019-06-28 | 重庆邮电大学 | A kind of adaptive broadcasting method based on distance and speed in vehicular ad hoc network |
| CN106211089A (en) * | 2016-06-30 | 2016-12-07 | 深圳市金溢科技股份有限公司 | A kind of car networked system, communication means and car-mounted terminal |
| CN106713310B (en) * | 2016-12-21 | 2020-04-10 | 大唐高鸿信息通信研究院（义乌）有限公司 | Method for realizing improved GSD service discovery protocol suitable for vehicle-mounted short-distance communication network |
| CN107071843B (en) * | 2016-12-28 | 2020-04-28 | 上海海事大学 | Mobile self-organizing network clustering method |
| CN107493562B (en) * | 2017-08-28 | 2020-04-14 | 常熟理工学院 | Implementation method of intelligent vehicle-mounted sensor network |
| CN108134642A (en) * | 2017-12-26 | 2018-06-08 | 武汉大学 | A kind of emergency message broadcast method based on class Huffman encoding |
| CN109618292B (en) * | 2018-11-05 | 2022-02-18 | 珠海派诺科技股份有限公司 | LORA wireless communication method, system, relay method and equipment |
| CN109769033B (en) * | 2019-02-26 | 2020-09-22 | 武汉大学 | Distributed file transmission method for urban VANETs |
| CN112731201B (en) * | 2021-03-22 | 2022-08-12 | 上海宏力达信息技术股份有限公司 | Single-phase earth fault studying and judging method and system in transient zero sequence power direction |
| US11477718B1 (en) | 2021-03-31 | 2022-10-18 | Toyota Motor North America, Inc. | Systems and methods for selecting a routing protocol |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102307373A (en) * | 2011-08-23 | 2012-01-04 | 哈尔滨工业大学 | VANET clustering method taking regard of vehicle traffic characteristic |
| CN103269478A (en) * | 2013-05-17 | 2013-08-28 | 南京邮电大学 | Rapid broadcasting method based on position information in vehicular network |
| CN104185239A (en) * | 2014-08-30 | 2014-12-03 | 西安电子科技大学 | Intersection routing method in vehicle self-organized network on the basis of path segment length |
| CN104754592A (en) * | 2013-12-31 | 2015-07-01 | 北京大唐高鸿软件技术有限公司 | Vehicle-mounted communication network clustering method applicable to urban road environment |
-
2015
- 2015-12-07 CN CN201510906415.XA patent/CN105554839B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102307373A (en) * | 2011-08-23 | 2012-01-04 | 哈尔滨工业大学 | VANET clustering method taking regard of vehicle traffic characteristic |
| CN103269478A (en) * | 2013-05-17 | 2013-08-28 | 南京邮电大学 | Rapid broadcasting method based on position information in vehicular network |
| CN104754592A (en) * | 2013-12-31 | 2015-07-01 | 北京大唐高鸿软件技术有限公司 | Vehicle-mounted communication network clustering method applicable to urban road environment |
| CN104185239A (en) * | 2014-08-30 | 2014-12-03 | 西安电子科技大学 | Intersection routing method in vehicle self-organized network on the basis of path segment length |
Non-Patent Citations (1)
| Title |
|---|
| 车联网中继选择算法研究;杨宾;《中国优秀硕士学位论文全文数据库中国优秀硕士学位论文全文数据库信息科技辑2015年第1期》;20150115;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105554839A (en) | 2016-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105554839B (en) | A kind of vehicular ad hoc network multi-hop broadcasting method of position competition | |
| CN105657777B (en) | Design of Routing Protocol method based on link-quality and node transfer capability | |
| CN101980565B (en) | QoS-based Ad Hoc network adaptive node speed multi-path routing method | |
| CN102572992B (en) | Vehicular network RSU (Roadside Unit) deploy method and data forwarding method thereof | |
| CN105208616B (en) | Adaptive more copy method for routing based on road topology in vehicular ad hoc network | |
| CN106535280B (en) | A kind of car networking chance method for routing based on geographical location | |
| CN106851770B (en) | Car networking communication means based on link-quality | |
| CN102905309A (en) | Relay communication method based on cooperated multi-access control (MAC) protocol in vehicular automatic organization network | |
| CN108243480A (en) | A kind of unmanned plane ad hoc network chance routing algorithm based on the prediction of link available bandwidth and forward travel distance | |
| CN105722176A (en) | Connection method of Internet of Vehicles massive heterogeneous network with infrastructure in city scene | |
| Li et al. | Cooperative data dissemination in cellular-VANET heterogeneous wireless networks | |
| CN111683351A (en) | Three-dimensional vehicle-mounted self-organizing network routing method based on packet receiving probability | |
| CN105101086B (en) | A kind of data transfer path system of selection based on traffic density distribution | |
| CN102917372A (en) | Internet of vehicles hierarchical model design method orienting to multi-scene data exchange | |
| CN109640369B (en) | Vehicle-mounted network reliable communication method based on adaptive power | |
| CN109275154B (en) | Dynamic self-adaptive routing path planning method based on double-layer topological routing algorithm | |
| CN110428618A (en) | Two-way lane congestion detection and information forwarding method based on VANETs | |
| CN102026332B (en) | Routing method for wireless sensor networks in building automation system (BAS) | |
| CN105578552A (en) | Data transmission system and method based on vehicle-cluster-communication district three-layer structure | |
| CN108834100A (en) | A kind of efficient broadcast routing method | |
| CN104835316B (en) | Traffic flow density-based solution to problem of VANET sparse connectivity | |
| Mu et al. | Performance analysis of the ZigBee networks in 5G environment and the nearest access routing for improvement | |
| CN104837173B (en) | A kind of metropolitan area Vehicular communication system of band parking node | |
| CN106792970A (en) | A kind of vehicle self-organizing network route selection method | |
| CN103402233B (en) | Based on the high throughput wireless distributed network method for routing of serial interference elimination |
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 |