CN106131161B - The vehicle-mounted road based on stability sub-clustering is by protocol method under a kind of urban environment - Google Patents
The vehicle-mounted road based on stability sub-clustering is by protocol method under a kind of urban environment Download PDFInfo
- Publication number
- CN106131161B CN106131161B CN201610508467.6A CN201610508467A CN106131161B CN 106131161 B CN106131161 B CN 106131161B CN 201610508467 A CN201610508467 A CN 201610508467A CN 106131161 B CN106131161 B CN 106131161B
- Authority
- CN
- China
- Prior art keywords
- node
- clustering
- sub
- cluster
- cluster head
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Landscapes
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention proposes that the vehicle-mounted road based on stability sub-clustering is by protocol method under a kind of urban environment, comprising: approximate node clustering collection formed, election of cluster head and sub-clustering maintenance.The formation of approximate node clustering collection refers between the identical adjacent node of moving direction through Beacon MESSAGE EXCHANGE oneself state information, the movement speed changed at random is modeled as normal distribution model, exclude node collection approximate with composition after the especially big node of bulk velocity difference, creation and the approximate node table of update；Election of cluster head is that the speed of approximate node table interior joint, position and adjacent segments points are modeled as normal distribution model again, selects optimal leader cluster node by calculating competition priority；Sub-clustering maintenance phase pointedly handles node and is added or is detached from sub-clustering and sub-clustering merging etc. to guarantee the stability of sub-clustering.The sub-clustering mechanism of this method has smaller cluster head change rate and longer cluster head to hold time；Packet-based transport can be effectively improved in urban environment and reduces time delay.
Description
Technical field
The present invention relates to vehicular ad hoc Routing Protocol vehicular ad hoc network technical field, in particular to a kind of city ring
Vehicle-mounted road based on stability sub-clustering under border is by protocol method.
Background technique
Vehicular ad hoc net VANET is one that road vehicle and numerous Intelligent mobile equipments are connected to building
Multi-hop, ad-hoc communication network are the novel wireless mobile self-organizing network MANET under a kind of environment applied to intelligent transportation.
Wherein, Routing Protocol is the key technology for determining VANET COMMUNICATION NETWORK PERFORMANCES superiority and inferiority.Traditional MANET Design of Routing Protocol
Consideration is different with VANET, and VANET is with node motion is quick, network topology change is frequent, communication link is unstable
The features such as complicated with urban traffic environment, this undoubtedly increases the challenge of Design of Routing Protocol.Therefore, it is strong to design a kind of stabilization
Strong VANET Routing Protocol is to have very important significance.
VANET network in urban environment be made of intensive vehicle and numerous smart machines it is ultra-large
Communication network can be improved network using the Routing Protocol based on sub-clustering and expand to can be reduced routing cost and avoid network congestion
Malleability.The node status and function of planar structure Routing Protocol are all identical, and apply the network of clustering route protocol that can be divided
For multiple sub-clustering subsets, the rank and function different from of node, each sub-clustering includes ordinary node, leader cluster node and gateway section
Point three classes.Clustering route protocol generally comprises 4 major parts: routing, cluster-level routing and sub-clustering maintenance in cluster algorithm, cluster,
Member node can be communicated directly with cluster head in cluster, and cluster intermediate node can carry out multi-hop communication by cluster head or gateway node, and
Leader cluster node needs to manage and maintain member node and communicate between cluster, and resource overhead is larger.Therefore, for how to form one
A stable healthy and strong cluster structured and one reasonable cluster head of selection, to reduction router-level topology expense, communication load and promotes net
Network overall performance is of great significance.It include typically CGSR, CBRP etc. based on clustering route protocol.
CGSR Routing Protocol is the clustering route protocol being extended on the basis of DSDV agreement, and leader cluster node needs the period
Property broadcast message with safeguard whole network topology, cause biggish route maintenance expense.CBRP Routing Protocol is to route to assist to DSR
View extension is improved a kind of based on cluster structured source routing on-demand routing protocol, and LID cluster algorithm is not particularly suited for VANET
Network.
Summary of the invention
The present invention in order to overcome at least one of the drawbacks of the prior art described above (deficiency), proposes under a kind of urban environment
Vehicle-mounted road based on stability sub-clustering is by protocol method, this protocol method is based on the sub-clustering mechanism ratio LID of stability and HC sub-clustering
There is algorithm smaller cluster head change rate and longer cluster head to hold time；Opposite AODV and CBRP agreement, this agreement is in city
Packet-based transport can be effectively improved under environment and reduces time delay.
In order to achieve the above objectives, technical solution of the present invention specifically:
The vehicle-mounted road based on stability sub-clustering is by protocol method under a kind of urban environment, comprising the following steps:
First: by being broadcast periodically Beacon message come switching node between the adjacent node in default communication range
The movement speed of vehicle node is modeled as normal distribution model using statistical analysis technique by the status information of itself, is only chosen
Node of the speed in setting fiducial interval range, excludes have the node of otherness to reformulate new approximate node clustering
Set.After setting confidence interval, speed will be met in Vmin≤Vj≤VmaxNeighbor node in range will be reformulated new
Set, and specially create approximation node table SNT and store the node status information in the set.
Second: calculating competition priority using adjacent segments points, speed and location parameter in election of cluster head mechanism and come
Select optimal leader cluster node, and the node broadcasts cluster head message into approximate node collection is stable cluster structured to be formed.Weight
The average speed and mean place spacing of k node in SNT table are newly calculated, the node collection in SNT table is unusual in exclusion speed
There is usually no the nodes that velocity deviation is excessive after node, therefore mean difference statistical can be used to indicate sub-clustering collection internal segment
The difference degree of point.It asks node i and each node in the mean difference of speed and position spacing again, and seeks the speed of node i itself
With the relative different of position spacing and integral node average value, the competition priority of last calculate node.Once competing priority
Maximum, the node just have the node broadcasts cluster head message packet as cluster head both candidate nodes into SNT table, and adjacent node receives
Response message and that sub-clustering is added is stable cluster structured to be formed after information.
Third: node addition or disengaging sub-clustering and sub-clustering merging etc. are pointedly handled in sub-clustering maintenance phase and causes sub-clustering
The case where structure change.
Leader cluster node is detached from sub-clustering: when cluster head is detached from sub-clustering, triggering member node re-elects leader cluster node, cluster as early as possible
Member node will re-initiate election of cluster head process in the SNT table of maintenance, calculate the competition priority CP at current time with weight
The node of new selection substitution.
Bunch member node is detached from sub-clustering: single bunch member node will lose contacting between adjacent node after being detached from, from it
The information of the node is deleted in neighbor table and SNT table to update topological database.The node of the disengaging sub-clustering then remove SNT table and
Change state is C_UNDECIDED, then regenerates Beacon message notifying adjacent node and is added with sub-clustering again or request
Another sub-clustering；If surrounding does not have adjacent node, itself becomes leader cluster node.
Sub-clustering is added in node request: after a node m in undefined behavior enters the communication range of a sub-clustering,
Beacon message will be sent to inform the current information of itself, after cluster head receives information, not to the leader cluster node of sub-clustering
Cluster head broadcasting packet is sent immediately, but judges the diversity factor DD between cluster head c and node m first to decide whether to receive the section
Point.If node m receives the cluster head broadcasting packet of multiple sub-clusterings simultaneously in communication range, node m will be wide from multiple cluster heads
The speed and location information of cluster head are obtained in casting text, then select which point is added by the diversity factor of calculate node and cluster head
The small sub-clustering of diversity factor is added in cluster, node m selection.
Adjacent sub-clustering merges: in the intersection section in city, often making two points due to vehicle deceleration or stopping etc.
Cluster meets, and generally for the sub-clustering redundancy for reducing entirety VANET network, the few sub-clustering of member node number is incorporated into big sub-clustering
In structure.
Again sub-clustering: after establishing cluster structured a period of time, it may be necessary to reselect leader cluster node to maintain point
The stability of clustering architecture.Moreover, should judge whether the leader cluster node needs to change its state, cluster head section before re-electing cluster head
Point need from SNT table obtain nodal information and recalculate at this time adjacent segments points, speed and position spacing average value
And its mean difference, then recalculate its cluster head competition priority.When the competition priority of leader cluster node meets condition, cluster
Head node abandons C_HEAD state and modifies oneself state to be C_MEMBER, and the variation of oneself is then stated by HELLO message
Situation.Other bunch member nodes need to reselect when losing leader cluster node suitable cluster head, therefore can call directly cluster
Head election process.
The vehicle-mounted road based on stability sub-clustering is by protocol method under a kind of urban environment.The present invention will be in the base of CBRP agreement
It is improved on plinth, introduces a kind of routing mechanism SBCRP based on stability sub-clustering, simulation result shows that SBCRP agreement is based on
There is the sub-clustering mechanism ratio LID and HC cluster algorithm of stability smaller cluster head change rate and longer cluster head to hold time；Phase
To AODV and CBRP agreement, SBCRP agreement can effectively improve packet-based transport in urban environment and reduce time delay.
Compared with the existing technology, the invention has the advantages that and the utility model has the advantages that
It is big for vehicle density in urban environment, be unevenly distributed, the problems such as traffic route is complicated caused network topology
Situations such as structure frequently changes and communication link is unstable, the invention proposes a kind of vehicular ad hocs based on stability sub-clustering
Network routing protocol (SBCRP agreement).The agreement is improved mainly for cluster algorithm, guarantees the stability of sub-clustering interior nodes,
Then a suitable and stable leader cluster node is elected, finally, the further stabilization of maintenance cluster structure.
It is compared and analyzed by the simulation result to LID, HC cluster algorithm and the stability sub-clustering mechanism of SBCRP,
SBCRP agreement is held time in cluster head change rate and cluster head with better performance；Then again by AODV, CBRP and
The simulation result of SBCRP agreement carries out control parsing, shows SBCRP agreement and although increases routing cost and computing cost,
But it improves packet-based transport and reduces end-to-end time delay.
The sub-clustering mechanism is designed mainly for the feature under urban environment, it can be improved cluster structured steady
It is fixed, it reduces network topology structure and frequently changes on the influence of communication link bring.In addition, the sub-clustering mechanism is to a certain extent
It is equally applicable to High-speed Circumstance, the vehicle under high velocity environment equally can use the letter such as direction, speed and positional distance of vehicle
Breath is to form the sub-clustering with certain stability.
Detailed description of the invention
Fig. 1 is the forming process figure of approximate node clustering collection.
Fig. 2 is election of cluster head schematic diagram of mechanism.
Fig. 3 is that clustering process figure is added in node request.
Specific embodiment
The attached figures are only used for illustrative purposes and cannot be understood as limitating the patent；In order to better illustrate this embodiment, attached
Scheme certain components to have omission, zoom in or out, does not represent the size of actual product；
To those skilled in the art, it is to be understood that certain known features and its explanation, which may be omitted, in attached drawing
's.The following further describes the technical solution of the present invention with reference to the accompanying drawings and examples.
The vehicle-mounted road based on stability sub-clustering is by protocol method under a kind of urban environment, comprising the following steps:
First: the formation of approximate node clustering collection, between node can by the direction of Beacon Receive message adjacent node,
The movement speed of vehicle node is modeled as normal distribution model using statistical analysis technique by the information such as speed and position, is only selected
Node of the speed of picking up the car in certain fiducial interval range excludes to have the node of different to reformulate new approximate section
Point sub-clustering set.After setting confidence interval, speed will be met in Vmin≤Vj≤VmaxNeighbor node in range will again
New set is formed, and creates an approximation node table SNT specially to store the node status information in the set, and it is optimal
Leader cluster node will be generated using the competition of election of cluster head mechanism in the table.Specific implementation process such as Fig. 1, specifically:
It whether identical first determines whether node motion direction, if moving direction is not identical, abandons Beacon message refusal
Node j terminates；If mobile moving direction is identical, the neighbor table of more new node, then calculates the velocity interval of approximate node table
Vmax, Vmin；Judge node j speed VjWith Vmax、VminRelationship, i.e. Vmin≤Vj≤VmaxIt is whether true, if invalid, lose
It abandons Beacon message and refuses node j, terminate；If set up, node j is added in approximate node table, and update approximate node
Table then terminates.
Second: election of cluster head calculates competition using adjacent segments points, speed and location parameter in election of cluster head mechanism
Priority selects optimal leader cluster node, and the node broadcasts cluster head message into approximate node collection is to form stable sub-clustering
Structure.Node i establishes a SNT table to store the similar node of feature, it is assumed that depositing in the table after excluding abnormal nodes
In k node, in order to compete leader cluster node, again by the speed of node, position spacing and adjacent segments points parameter model normal state
Distributed model.When speed and position spacing bigger closer to whole mean value, adjacent segments points, the competition priority CP of calculating is got over
Greatly, node be chosen as cluster head chance it is bigger.
First defined parameters: VjIndicate the speed of approximate node table interior joint j；Indicate being averaged for approximate node table interior joint
Speed；xj、yjRespectively indicate the location parameter of approximate node table interior joint j；Pj、Respectively indicate node node table approximate with its
The position spacing and mean place spacing of interior joint j；dcv、dcpRespectively indicate the mean difference of node c speed and position spacing；d
'cv、d'cpRespectively indicate the relative different of node c speed Yu position spacing and its average value；CP indicates that the cluster head competition of node is excellent
First grade.
The average speed and mean place spacing for first recalculating k node in SNT table, are respectively as follows:
Node collection in SNT table node excessive there is usually no velocity deviation after excluding the unusual node of speed, because
This can indicate the difference degree of sub-clustering collection interior nodes with mean difference statistical.So by formula (1) and formula (2) resulting knot
Fruit can acquire node i and each node in the mean difference of speed and position spacing, be respectively as follows:
Again by formula (1) to the resulting speed of formula (4) and position and its mean difference, formula (5) and formula (6) are substituted into respectively, is acquired
The speed of node i itself and the relative different of position spacing and integral node average value, are respectively as follows:
Finally, the competition priority of calculate node are as follows:
Once the competition priority that node itself calculates is maximum, which just can be used as cluster head both candidate nodes into SNT table
Node broadcasts cluster head message packet, adjacent node receives response message after information and sub-clustering is added to form stable sub-clustering knot
Structure.If node is in undefined behavior or leader cluster node is detached from sub-clustering and node carries out approximate spy according to the information of adjacent node
Sign node screens and creates SNT table, as long as nodal test starts progress election of cluster head and compete optimal cluster to SNT table non-empty
Head node.As shown in Fig. 2, being election of cluster head mechanism.
(1) nodal test exists to SNT table first and calculate node itself competes priority and into when keeping out of the way after non-empty
Between TwaitTiming course, back off time TwaitDuration determined by the competition window of MAC layer.
(2) in back off time section, if node receives the cluster head broadcasting packet from arbitrary node j, transmission report is inquired
The node ID of text whether there is in SNT table.If it does not exist, the possible reason is node j enters the communication range of node i, but
Not carrying out the speed that otherness judgement either both is judged as between two nodes also, there is some difference, and node j still sends cluster
Head broadcasting packet.Therefore, node i abandons the cluster head broadcasting packet of node j, and continues TwaitTiming.
(3) if node j obtains its CP there are in SNT table from the messagej, and judge whether to meet condition C Pi<
CPj, if not satisfied, still abandoning the cluster head broadcasting packet.
(4) if meeting CPi< CPj, then the competition priority CP of node jjIt is bigger, and the cluster head of neighbor node is had become, because
This node i deletes the cluster head broadcasting packet of itself and removes Twait, it is then C_ by the status modifier of neighbor table interior joint j
HEAD oneself becomes the bunch member node of node j and updates neighbor table information；
(5) as back off time TwaitTiming terminates, and becomes the cluster head of node i still without node at this time, then node i is sentenced again
Whether the number of nodes of disconnected SNT table changes, if number of nodes increases, node i recalculates competition priority and starts newly
Cluster head competition process；
(6) if SNT table number of nodes does not increase, adjacent node of the node i into SNT table sends cluster head broadcasting packet to declare
Cloth oneself becomes the cluster structured interior cluster head, final updating neighbor table information.
Third: sub-clustering maintenance pointedly handles node in sub-clustering maintenance phase and is added or is detached from sub-clustering and sub-clustering merging
The case where etc. cluster structured variation is caused, the utmostly stability of maintenance cluster structure.The sub-clustering mechanism utilizes the office of node
Portion's information carries out sub-clustering, that is, considers the advantageous informations such as direction, speed, position and the adjacent segments points of vehicle to form stable point
Clustering architecture, to effectively improve packet-based transport and reduce cluster head variation.Sub-clustering maintenance phase need to be to following five classes situation
Corresponding processing is carried out, it is cluster structured adaptively to adjust.
(1) the case where being detached from sub-clustering for bunch member node, node is in (HELLO_LOSS+1) * HELLO_INTERVAL week
When can not receive HELLO message in the phase, it only need to trigger node and remove the node from neighbor table and SNT table and notify other sections
Point；And it is C_UNDECIDED that the node for being detached from sub-clustering changes state after removing SNT table, then regenerates Beacon message
Notify adjacent node to request to be added a certain sub-clustering or re-establish sub-clustering；If surrounding does not have adjacent node, itself becomes cluster
Head node.
(2) the case where being detached from sub-clustering for leader cluster node, each bunch member node then trigger itself into election of cluster head shape
Condition elects new leader cluster node immediately, and broadcasts cluster head message to SNT table, and election of cluster head process is consistent with Fig. 2, only needs
Call directly election of cluster head process.
(3) scene that sub-clustering is added is requested for node m, will start one when node m is in C_UNDECIDED state
Timer u_timer, and it is broadcast periodically HELLO message, the shape then will be detached from time cycle UNDECIDED_PD
State；If not receiving any cluster head broadcasting packet yet after timer, just changing oneself state is C_HEAD.Such as
Fruit enters during the timing of u_timer in the communication range of sub-clustering c, and node both sides can be notified to by HELLO message, and
Node m can trigger broadcast Beacon message immediately to inform the status information of itself, and then the sub-clustering is added in request.Leader cluster node
After c receives the Beacon message of a C_UNDECIDED state node, will start calculate two nodes between diversity factor DD simultaneously
Judge whether DD is less than threshold value, if meeting condition, recipient node m simultaneously sends cluster head broadcasting packet, and otherwise directly refusal saves
Point m abandons its Beacon message.If node m is not received by cluster head broadcasting packet, continue the timing of u_timer timer；
If receiving single cluster head broadcasting packet, cluster head response message is responded, and modifies oneself node state, neighbor table and SNT
Table；If node m receives a plurality of cluster head broadcasting packets simultaneously, the information and meter of each leader cluster node are obtained from message
Then diversity factor DD between operator node selects the leader cluster node of the smallest DD and sends cluster head response message so that the sub-clustering is added.
Cluster head equally updates nodes neighbors table and SNT table after receiving the cluster head response message of node m, and implementation process is as shown in Figure 3.
(4) adjacent sub-clustering merges: in the intersection section in city, two are often made due to vehicle deceleration or stopping etc.
Sub-clustering is met, and generally for entirety VANET network cluster dividing redundancy is reduced, the few sub-clustering of member node number is incorporated into big sub-clustering knot
In structure.Firstly, both sides are established a connection by HELLO message, and inform that when two sub-clusterings enter mutual communication range
This bunch member node number, then judges whether the bunch member node number summation of the two meets n1+n2≤n, if exceeding sub-clustering member
Otherwise the limitation of node total number then nonjoinder carries out sub-clustering merging.Secondly, leader cluster node triggering broadcast Beacon message, node
The diversity factor DD between cluster head is calculated after acquisition information, if DD is less than threshold value, the leader cluster node of small sub-clustering abandons cluster head status,
It is added another cluster structured.If same that sub-clustering is added finally, for its bunch member node in cluster head communication range, if not
It is then voluntarily rebuilding cluster structured or is re-electing leader cluster node, realizing that process is consistent with front.
(5) after establishing cluster structured a period of time, leader cluster node may sub-clustering again: be reselected to maintain point
The stability of clustering architecture.Moreover, should judge whether the leader cluster node needs to change its state, cluster head section before re-electing cluster head
Point need from SNT table obtain nodal information and recalculate at this time adjacent segments points, speed and position spacing average value
And its mean difference, then recalculate its cluster head competition priority.
A) after node competition becomes cluster head, it is arranged between sub-clustering by judging the average movement speed of leader cluster node first
Every.Usual time interval is longer when speed is less than 10m/s, is c1；Then on the contrary, being c3 when speed is greater than 20m/s；Speed is in 10-
Median is then taken when 20m/s, is c2.
B) start a timer c_interval, at the end of timer timing, cluster head section after setting up sub-clustering interval
Point recalculates competition priority CPcAnd Rule of judgmentNode continues to serve as cluster if meeting condition
Head, and enable sub-clustering intervalometer c_interval reclocking.
If c) CPcBe worth it is too small, then cluster head still need to detection whether have at this time task do not complete, i.e., cluster head transmitting data or
It carries out route finding process, therefore, timer still reclocking and waits the sub-clustering chance of next time.
If d) cluster head is now in idle state, changing its state is C_MEMBER, and state is within a certain period of time not
It is changed again to avoid loop occurs, and triggers broadcast HELLO message to notify bunch member node.Member node is losing cluster
Election of cluster head process is called directly after head to pick out optimal leader cluster node again.
Obviously, the above embodiment of the present invention be only to clearly illustrate example of the present invention, and not be pair
The restriction of embodiments of the present invention.For those of ordinary skill in the art, may be used also on the basis of the above description
To make other variations or changes in different ways.There is no necessity and possibility to exhaust all the enbodiments.It is all this
Made any modifications, equivalent replacements, and improvements etc., should be included in the claims in the present invention within the spirit and principle of invention
Protection scope within.
Claims (1)
1. the vehicle-mounted road based on stability sub-clustering under a kind of urban environment is by protocol method characterized by comprising
Step 1, form new approximate node clustering collection: between node can by the direction of Beacon Receive message adjacent node,
The movement speed of vehicle node is modeled as normal distribution model using statistical analysis technique by the information of speed and position, is only selected
Speed pick up the car in Vmin≤Vj≤VmaxNeighbor node in range generates new set, excludes to have the node of different to incite somebody to action
New set reformulates new approximate node clustering set, and creates an approximation node table SNT specially to store the approximation
Node status information in node clustering set, the method for the step 1 specifically: first determine whether Beacon message interior joint j
It is whether identical as the moving direction of adjacent node, if moving direction is not identical, abandon Beacon message refusal node j, knot
Beam；If mobile moving direction is identical, node j, then the velocity interval Vmax of calculate node table are added in node table,
Vmin；Judge the speed Vj of node j and the relationship of Vmax, Vmin, i.e. whether Vmin≤Vj≤Vmax is true, if invalid,
Beacon message refusal node j is then abandoned, is terminated；If set up, addition node j is formed new in approximate node table SNT
Set, and approximate node table SNT is updated, generate new set；
Step 2, election of cluster head: using adjacent segments points, speed and location parameter as election of cluster head in election of cluster head mechanism
Race condition calculates the competition priority of all nodes, selects optimal node as leader cluster node, which saves to approximation
Node broadcasts cluster head message in point sub-clustering collection is stable cluster structured to be formed, and first assumes that there are k in approximate node table SNT
Node, in order to compete leader cluster node, again by the speed of node, position spacing and adjacent segments points parameter model normal distribution mould
Type, when speed and position spacing bigger closer to whole mean value, adjacent segments points, the competition priority CP of calculating is bigger, section
The chance that point is chosen as cluster head is bigger,
First defined parameters: Vj indicates the speed of approximate node table interior joint j；Indicate in approximate node table being averaged for k node
Speed；Xj, yj respectively indicate the location parameter of approximate node table interior joint j；PjIndicate approximate node table SNT interior joint i and j it
Between position spacing,Indicate the mean place spacing of node i node table interior joint j approximate with its；dcv、dcpIt respectively indicates close
Like the speed of k node in node table and the mean difference of position spacing；d'cv、d'cpRespectively indicate node i speed and position spacing
With the relative different of k node speed in approximate node table and position spacing average value；CP indicates that the cluster head competition of node is preferential
Grade；
Calculate the average speed of k node in approximate node table SNTBetween approximate node table SNT interior joint i and other nodes
Mean place spacingIt is respectively as follows:
The mean difference d of k node speed in approximate node table SNT is acquired by formula (1) and formula (2) resulting resultcvBetween position
Away from mean difference dcp, it is respectively as follows:
Formula (1) to formula (4) is substituted into formula (5) and formula (6) respectively, acquires the speed and the phase of k node speed average value of node i
To difference d'cvWith the relative different d' of position spacing and k node location spacing average valuecp, it is respectively as follows:
Finally, the competition priority CP of calculate node are as follows:
Step 3, sub-clustering is safeguarded:
Leader cluster node is detached from sub-clustering: when cluster head is detached from sub-clustering, triggering member node re-elects leader cluster node, cluster member as early as possible
Node will re-initiate election of cluster head process in the approximate node table SNT of maintenance, calculate the competition priority CP at current time
To reselect the node of substitution；
Bunch member node is detached from sub-clustering: single bunch member node will lose contacting between adjacent node after being detached from, from its neighbour
The information of the node is deleted in table and approximate node table SNT to update topological database；The node of the disengaging sub-clustering is then removed closely
Like node table SNT and change state is C_UNDECIDED, regenerates Beacon message notifying adjacent node then to divide again
Another sub-clustering is added in cluster or request；If surrounding does not have adjacent node, itself becomes leader cluster node；
Sub-clustering is added in node request: after a node m in undefined behavior enters the communication range of a sub-clustering, it will
Beacon message is sent to inform the current information of itself, after cluster head receives information, not immediately to the leader cluster node of sub-clustering
Cluster head broadcasting packet is sent, but judges the diversity factor DD between cluster head c and node m first to decide whether to receive the node；If
Node m receives the cluster head broadcasting packet of multiple sub-clusterings simultaneously in communication range, then node m will be from multiple cluster head broadcasting packets
The middle speed and location information for obtaining cluster head, then select which sub-clustering is added by the diversity factor of calculate node and cluster head, it saves
The small sub-clustering of diversity factor is added in point m selection；
Adjacent sub-clustering merges: the few sub-clustering of member node number is merged into greatly by the sub-clustering redundancy in order to reduce whole VANET network
It is cluster structured in；
Again it sub-clustering: after establishing cluster structured period T, determines whether to reselect leader cluster node to maintain sub-clustering knot
The stability of structure；It should judge whether the leader cluster node needs to change its state before re-electing cluster head simultaneously, leader cluster node needs
Nodal information is obtained from approximate node table SNT and recalculate adjacent segments points at this time, speed and position spacing it is flat
Then mean value and its mean difference recalculate its cluster head competition priority；When the competition priority of leader cluster node meets condition
When, leader cluster node abandons C_HEAD state and modifies oneself state to be C_MEMBER, then states oneself by HELLO message
Situation of change；Other bunch member nodes need to reselect cluster head when losing leader cluster node, can call directly election of cluster head
Process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610508467.6A CN106131161B (en) | 2016-06-28 | 2016-06-28 | The vehicle-mounted road based on stability sub-clustering is by protocol method under a kind of urban environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610508467.6A CN106131161B (en) | 2016-06-28 | 2016-06-28 | The vehicle-mounted road based on stability sub-clustering is by protocol method under a kind of urban environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106131161A CN106131161A (en) | 2016-11-16 |
| CN106131161B true CN106131161B (en) | 2019-09-20 |
Family
ID=57468849
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610508467.6A Active CN106131161B (en) | 2016-06-28 | 2016-06-28 | The vehicle-mounted road based on stability sub-clustering is by protocol method under a kind of urban environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106131161B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106878083B (en) * | 2017-02-28 | 2019-12-06 | 新华三技术有限公司 | node election method and device |
| CN107086962A (en) * | 2017-04-01 | 2017-08-22 | 天津理工大学 | It is a kind of towards vehicle networking by multi-hop reaction equation clustering method |
| CN107426694B (en) * | 2017-06-26 | 2020-06-09 | 湖南大学 | Fuzzy clustering method for vehicle-mounted self-organizing network |
| CN108712758B (en) * | 2018-04-27 | 2021-07-27 | 中山大学 | Safe dynamic stable clustering method applied to vehicle-mounted ad hoc network |
| CN108882150B (en) * | 2018-06-21 | 2020-07-24 | 河南科技大学 | Information center vehicle-mounted network routing method based on clustering and encounter sensing |
| CN109495547B (en) * | 2018-10-26 | 2022-05-03 | 北京车和家信息技术有限公司 | Vehicle signal acquisition method and device, cloud server and vehicle |
| CN110225452B (en) * | 2019-06-19 | 2021-07-06 | 广东工业大学 | Running vehicle communication method, device and medium based on clustering routing protocol |
| CN110310480B (en) * | 2019-06-25 | 2021-12-03 | 电子科技大学 | Real-time path planning method based on congestion control |
| CN110650458B (en) * | 2019-11-04 | 2021-05-28 | 中山大学 | Stable clustering method applied to vehicle-mounted self-organizing network route establishment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101207572A (en) * | 2007-12-14 | 2008-06-25 | 北京科技大学 | Method for clustering vehicle mounted Ad hoc network based on signal strength |
| CN104754592A (en) * | 2013-12-31 | 2015-07-01 | 北京大唐高鸿软件技术有限公司 | Vehicle-mounted communication network clustering method applicable to urban road environment |
| CN105682175A (en) * | 2016-01-20 | 2016-06-15 | 电子科技大学 | Cluster routing method based on AdHoc Network |
-
2016
- 2016-06-28 CN CN201610508467.6A patent/CN106131161B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101207572A (en) * | 2007-12-14 | 2008-06-25 | 北京科技大学 | Method for clustering vehicle mounted Ad hoc network based on signal strength |
| CN104754592A (en) * | 2013-12-31 | 2015-07-01 | 北京大唐高鸿软件技术有限公司 | Vehicle-mounted communication network clustering method applicable to urban road environment |
| CN105682175A (en) * | 2016-01-20 | 2016-06-15 | 电子科技大学 | Cluster routing method based on AdHoc Network |
Non-Patent Citations (1)
| Title |
|---|
| 基于城市道路的稳定车载网分簇路由策略;卫鹏伟 等;《移动通信》;20141230;第36-41页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106131161A (en) | 2016-11-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106131161B (en) | The vehicle-mounted road based on stability sub-clustering is by protocol method under a kind of urban environment | |
| Ren et al. | A mobility-based scheme for dynamic clustering in vehicular ad-hoc networks (VANETs) | |
| Ren et al. | A unified framework of clustering approach in vehicular ad hoc networks | |
| Hou et al. | A access-based clustering protocol for multihop wireless ad hoc networks | |
| CN109041127B (en) | Self-adaptive stable clustering method and system suitable for load balancing of high-dynamic wireless network | |
| CN105722176A (en) | Connection method of Internet of Vehicles massive heterogeneous network with infrastructure in city scene | |
| CN109922513A (en) | A kind of OLSR method for routing and system based on moving projection and latency prediction | |
| CN109302696B (en) | Multi-role classification community clustering method for self-organizing network of Internet of vehicles | |
| CN107071843A (en) | Mobile self-organizing network cluster dividing method | |
| CN106034322A (en) | Routing switching method based on chain quality in mobile ad hoc network | |
| CN109640369A (en) | A kind of vehicle-mounted net reliable communication method based on adaptive power | |
| Garcia-Luna-Aceves et al. | A new approach to on-demand loop-free routing in ad hoc networks | |
| Hadded et al. | Using road IDs to enhance clustering in vehicular ad hoc networks | |
| CN107040884B (en) | Mobile ad hoc network data transmission method based on strong neighborhood connectivity | |
| CN108881016B (en) | Method for constructing self-organizing network community of Internet of vehicles and balancing communication load of community nodes | |
| Huang et al. | A new distributed mobility-based multi-hop clustering algorithm for vehicular ad hoc networks in highway scenarios | |
| Huang et al. | The k-hop V2V data offloading using the predicted utility-centric path switching (PUPS) method based on the SDN-controller inside the multi-access edge computing (MEC) architecture | |
| Liu et al. | A Position Sensitive Clustering Algorithm for VANET. | |
| Hollerung | The cluster-based routing protocol | |
| CN110519338A (en) | A kind of data transmission mechanism based on communication for coordination | |
| Uchida et al. | Construction and Maintenance of a Novel Cluster-based Architecture for Ad Hoc Sensor Networks. | |
| CN114390631A (en) | Multipath routing protocol method for unmanned aerial vehicle ad hoc network mobility prediction | |
| Shi et al. | Distributed and weighted clustering based on d-hop dominating set for vehicular networks | |
| Chinara et al. | Topology control by transmission range adjustment protocol for clustered mobile ad hoc networks | |
| CN103595657B (en) | Layer-stepping network route method based on distributed context aware |
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 |