CN102325306A - VANET (vehicular ad-hoc network) clustered broadcasting method based on comprehensive weighting - Google Patents

VANET (vehicular ad-hoc network) clustered broadcasting method based on comprehensive weighting Download PDF

Info

Publication number
CN102325306A
CN102325306A CN201110243485A CN201110243485A CN102325306A CN 102325306 A CN102325306 A CN 102325306A CN 201110243485 A CN201110243485 A CN 201110243485A CN 201110243485 A CN201110243485 A CN 201110243485A CN 102325306 A CN102325306 A CN 102325306A
Authority
CN
China
Prior art keywords
node
bunch
bag
head
gateway
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201110243485A
Other languages
Chinese (zh)
Other versions
CN102325306B (en
Inventor
崔刚
周连科
付忠传
暴建民
朱东杰
王秀峰
莫毓昌
张策
张必英
刘永文
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Harbin Institute of Technology
Original Assignee
Harbin Institute of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Harbin Institute of Technology filed Critical Harbin Institute of Technology
Priority to CN201110243485.3A priority Critical patent/CN102325306B/en
Publication of CN102325306A publication Critical patent/CN102325306A/en
Application granted granted Critical
Publication of CN102325306B publication Critical patent/CN102325306B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention relates to a broadcasting method for vehicular ad-hoc networks, in particular to a VANET (vehicular ad-hoc network) clustered broadcasting method based on comprehensive weighting. The invention solves the defect that the conventional clustering algorithm in the vehicular ad-hoc network broadcasting method is carried out according to one of connectivity, stability, load balance and other factors affecting the clustering structure but does not take the other aspects affecting clustering into consideration. The VANET clustered broadcasting method based on comprehensive weighting includes the following steps: (1) the clustering of a vehicular ad-hoc network; (2) the determination of a cluster head node in each cluster; (3) the determination of a gateway node for each two neighboring clusters; (4) broadcasting communication. The method for determining the cluster head node in each cluster in step 2 is as follows: comprehensively taking the location, speed, connectivity and running behavior of the node into consideration, and the weight calculation formula for selecting the cluster head nodes is as follows: Wi equal to w1Ci plus w2Di plus w3Vi plus w4Li.

Description

VANET sub-clustering broadcasting method based on aggregative weighted
Technical field
The present invention relates to the broadcasting method of onboard wireless MANET.
Background technology
In traditional mobile ad hoc network, for solving the stable and load balance problem of network, the researcher has proposed the method for some layering broadcasting.Promptly be divided into several bunches (Cluster) to whole network, each bunch is by a bunch of head and a plurality of member composition.Bunch with bunch between be connected by gateway (Gateway).Communication between bunch member is through bunch entering row for the first time, and the communication between bunch then can be passed through bunch head or gateway forwards.Its advantage is that extensibility is good, and network size is unrestricted.At present, the algorithm of network cluster dividing is mainly distinguished following five types:
(1) based on the sub-clustering algorithm of node ID
(Link Clustering Algorithm LCA) is a kind of sub-clustering algorithm based on high node ID to link sub-clustering algorithm.In the LCA algorithm, neighbor node has that the node of the highest ID becomes a bunch head, and if the highest neighbor node of ID that node is its certain neighbor node, this node also can become a bunch head.This cluster-dividing method at first selects the highest node of ID to become a bunch head.If exist in the scope that node covered of inferior high ID not by the highest bunch first node that covers of ID, the node of time high ID also becomes a bunch head so, otherwise continues the higher node of the next ID of inspection, all belongs to certain bunch up to all nodes.This cluster-dividing method is realized simple, but can produce too much bunch head, and when the order linear that particularly increases progressively by ID when node was arranged, this moment, other nodes all were bunch head except that first node.Another kind of sub-clustering algorithm based on node ID is minimum ID (Lowest-ID, LID) a sub-clustering algorithm.In LID sub-clustering algorithm, be the unique at all ID of each node.The regular phase of node is to the ID value of its neighbor node broadcasting oneself.Whether the ID value that each node is confirmed oneself to be through the ID size of relatively more own ID value and its neighbor node is minimum in the node of not definite state.If do not have a bunch first node among this node ID minimum and the neighbours, then this node is claimed as a bunch first node.A node is received a bunch of first statement, then adds this bunch, and states oneself to be the member, receives that simultaneously the node of two bunches of first statements is a gateway.In case this type of major defect based on the method for node ID is a node is assigned to little ID then its possibility that becomes bunch head will be far above other nodes; Can make such node often be bunch head by election; Thereby make its load be far longer than other node, make the fairness of network reduce laod unbalance.
(2) high node degree sub-clustering algorithm
[through degree of communication (degree) relatively, promptly node neighbours quantity is selected a bunch first node to high node degree (Max-Degree) sub-clustering algorithm.Implementation method and min algorithm are similar, and node is through its neighbours' number of broadcasting, and promptly degree of communication and its neighbors compare degree of communication, and selecting the maximum node of degree of communication is a bunch head.In mobile ad hoc network, especially in the fast network of change in topology, because the degree of communication of node is with change in topology, so the less stable of the clustering architecture of its formation.
(3) minimum mobility sub-clustering algorithm
In the sub-clustering algorithm, the stability that generates clustering architecture has the greatest impact to network performance.In order to improve the stability of clustering architecture, minimum translational speed (Lowest speed) algorithm has appearred, and this algorithm selects the little node of translational speed preferentially to become a bunch first node through the comparison node translational speed.Think that the low node of translational speed is stable as bunch first clustering architecture that forms, bunch change frequency is low.But this algorithm only is fit to the low network of node motion speed, for as the high network of relatively moving property of network, the especially node of the node high-speed mobile of VANET (onboard wireless MANET), the clustering architecture of its formation is unstable, bunch changes the frequency height.
(4) algorithm of position-based prediction
Sivavakeesar and Pavlou have proposed bunch first-selection of position-based prediction and have selected algorithm.The notion of " empty bunch " has been proposed in this algorithm; Whole network's coverage area is divided into a plurality of " empty bunch " zone; With each node with comparing with its other node in same " empty bunch ", select place " empty bunch " probability minimum or with the shortest node conduct bunch head of distance at current " empty bunch " center.Node can obtain its geography information through GPS or other localization method, and under confirming " empty bunch ".The clustering architecture that this algorithm forms when node mobility is more weak is stable, and bunch first quantity is comparatively fixing, has preferable performance.But, higher in node motion speed, the cluster structured instability that forms in the fast network of change in topology, bunch first change frequency and member's change frequency are higher.
In VANET, the node scale is big, and variable density is big, especially some the time vehicle with sailing, divide the cluster shape naturally, the method that also is fit to the employing layering is carried out data broadcasting.But VANET is a kind of provisional network, and change in topology is big, and node speed is fast, and the link life period is short, the structure that these characteristics can have influence on bunch.Simultaneously, bunch stability be a major issue of sub-clustering algorithm, bunch variation inevitable, change minimumly but should make every effort to clustering architecture, changes of topology structure should be able to surveyed and tackle to algorithm to keep suitable clustering architecture.Thereby need bigger control expense, increased offered load if adopt based on the method for information exchange and safeguard that a hierarchical network need keep through the periodic broadcasting control information this moment.
Traditional VANET sub-clustering algorithm generally carries out to the some factors in the factors such as the cluster structured connectedness of influence, stability, load balance, and does not consider to influence the others of sub-clustering.
Summary of the invention
The purpose of this invention is to provide a kind of VANET sub-clustering broadcasting method based on aggregative weighted; Carry out to the some factors in the factors such as the cluster structured connectedness of influence, stability, load balance to solve sub-clustering algorithm traditional in the onboard wireless MANET broadcasting method, and do not consider to influence the shortcoming of the others of sub-clustering.
The present invention includes following step:
One, the sub-clustering of onboard wireless MANET;
Two, confirm bunch first node in each bunch;
Three, confirm the gateway node of per two adjacent cluster;
Four, broadcast communication;
The method of confirming bunch first node in each bunch in second step is following: the behavior of going of position, speed, the connected sum of taking all factors into consideration node, select the power computing formula of bunch first node following:
W i＝w 1C i+w 2D i+w 3V i+w 4L i (4-2)
C in the formula i---the degree of communication component is used to represent the connection situation of node;
D i---distance component, the mean value of expression node and neighbor node distance;
V i---the velocity component of synthetic weights, the difference of expression node speed and its neighbours' average speed;
L i---the traveling lane component of node i, promptly according to the go weight term of Rule Design of node, expression node traveling lane and control vehicle Taoist monastic name difference;
Wherein, get C i=| N i-δ |, wherein, N iBe neighbours' number of node i, promptly actual degree of communication, δ is desirable degree of communication; The δ value is calculated by following formula:
δ＝2R t×133×m/1000 (4-3)
R wherein t---the node transmission range;
The number of track-lines of m---highway;
D iCalculate through following formula:
D i = 1 n Σ j = 1 n Dist ( i , j ) - - - ( 4 - 4 )
Wherein Dist (i, j)---node i is to the distance of node j;
Neighbours' number of n---node;
V iCalculate through following formula:
V i = | v i - v ‾ | - - - ( 4 - 5 )
V wherein i---the speed of node i;
Figure BDA0000085497980000033
---neighbors average speed, its value by formula (4-6) is calculated:
v ‾ = 1 n Σ j = 1 n v j - - - ( 4 - 6 )
Track component L iCalculate through following formula:
L i＝|l i-L s| (4-7)
L wherein i---the car Taoist monastic name that node went;
L s---the control vehicle Taoist monastic name;
Pass through l iWith L sAsk difference to confirm that node is in the chance size in normal track;
w 1～w 4Be the coefficient of each component,, should satisfy w in order to regulate the proportion of each component in comprehensive weights 1+ w 2+ w 3+ w 4=1, (0≤w 1, w 2, w 3, w 4≤1).
The present invention has taken all factors into consideration each factor in the factors such as cluster structured connectedness, stability, load balance in onboard wireless MANET broadcasting method sub-clustering algorithm, solved the problem that conventional method exists.
Description of drawings
Fig. 1-the 1st, the normal cluster structured structural representation of onboard wireless MANET of the present invention; Fig. 1-2 is that node a is not covered cluster structured structural representation by any bunch of head; Fig. 1-the 3rd has the onboard wireless MANET clustering architecture of distributed network gate; Fig. 2 is the schematic flow sheet of safeguarding of onboard wireless MANET bunch first node; Fig. 3 is the schematic flow sheet of safeguarding of onboard wireless MANET gateway; Fig. 4 is the schematic flow sheet of safeguarding of onboard wireless MANET member node.
Embodiment
Embodiment one: this execution mode comprises the steps: one, the sub-clustering of onboard wireless MANET;
Two, confirm bunch first node in each bunch;
Three, confirm the gateway node of per two adjacent cluster;
Four, broadcast communication; Certain node in certain cluster to bunch in when broadcasting, send to a bunch head to broadcasted content earlier, by bunch first to bunch in all node broadcasts contents; Certain node in certain cluster to bunch outside other bunch when broadcasting; Send to broadcasted content bunch head of this bunch earlier; Send to bunch head of adjacent cluster to broadcasted content through the gateway node that belongs to two adjacent cluster altogether by the bunch first of this bunch, send broadcasted content by this adjacent cluster head to each node of adjacent cluster again; Just broadcasted content can be propagated into the node of all onboard wireless MANETs successively through the gateway node transmission broadcasted content of adjacent cluster by adjacent bunch head.
The method of confirming bunch first node in each bunch in second step is following: in VANET; Vehicle goes in traffic flow as node; Its motor behavior is regular to follow; Each bunch all chosen the vehicle node of the same direction of motion among the present invention, and this moment, the translational speed of bunch first node was stable more near the average speed clustering architecture of traffic flow more; Vehicle ' is in road, and its motor behavior receives the traffic rules constraint, and then can exert an influence to network configuration.As on ordinary highway; The outermost track is generally overtaking lane; And fast lane is a slow lane, and middle lane is the cruising track, supposes that vehicle all goes by rule; Then be in the vehicle that link retention time between node and the neighbors of fast and slow lane is smaller than the cruising track, when bunch first-selection is selected, should select to be in the vehicle in the cruising track as far as possible; Under the application background of VANET information broadcast; Just reduce hop count for improving broadcasting efficiency as far as possible; Improve the stability of sub-clustering, its joint bunch scale should be tried one's best greatly (under the traffic flow condition, owing to the reason of vehicle safety spacing; It is limited that node density increases, so bunch scale also can not be infinitely great).To sum up, the behavior of going of position, speed, the connected sum of taking all factors into consideration node, select the power computing formula of bunch first node following:
W i＝w 1C i+w 2D i+w 3V i+w 4L i (4-2)
C in the formula i---the degree of communication component is used to represent the connection situation of node;
D i---distance component, the mean value of expression node and neighbor node distance, usefulness is so that the center that bunch first node is positioned at bunch as far as possible;
V i---the velocity component of synthetic weights, the difference of expression node speed and its neighbours' average speed;
L i---the traveling lane component of node i, promptly according to the go weight term of Rule Design of node, expression node traveling lane and control vehicle Taoist monastic name difference;
Wherein, get C i=| N i-δ |, wherein, N iBe neighbours' number of node i, promptly actual degree of communication, δ is desirable degree of communication.
As previously mentioned, big as far as possible for making bunch scale, the δ value can be calculated by following formula:
δ＝2R t×133×m/1000 (4-3)
R wherein t---the node transmission range;
The number of track-lines of m---highway;
D iCalculate through following formula:
D i = 1 n Σ j = 1 n Dist ( i , j ) - - - ( 4 - 4 )
Wherein Dist (i, j)---node i is to the distance of node j;
Neighbours' number of n---node;
V iCalculate through following formula:
V i = | v i - v ‾ | - - - ( 4 - 5 )
V wherein i---the speed of node i;
---neighbors average speed, its value by formula (4-6) is calculated.
v ‾ = 1 n Σ j = 1 n v j - - - ( 4 - 6 )
Track component L iCalculate through following formula:
L i＝|l i-L s| (4-7)
L wherein i---the car Taoist monastic name that node went;
L s---the control vehicle Taoist monastic name, this control vehicle Taoist monastic name does not exist in reality, is merely actual track according to reference parameter, can the people for choosing;
Pass through l iWith L s(like one 4 track highway, then middle two tracks are the cruising track, then desirable L to ask difference to confirm to be in the chance size in normal track by node s=2.5).
w 1～w 4Be the coefficient of each component,, should satisfy w in order to regulate the proportion of each component in comprehensive weights 1+ w 2+ w 3+ w 4=1, (0≤w 1, w 2, w 3, w 4≤1).(w in the embodiment 1～w 4Individual occurrence should be arranged, ask the inventor to give roughly and confirm)
Communication protocol principle of the present invention is following:
(1) assumed condition
(1) all vehicle node all distribute (promptly only consider to go on road node) along road among the VANET, and only consider the broadcast message transmitted along road direction.
(2) node density changes, but network is communicated with all the time, does not promptly have isolated node and not segmentation in the network.
(2) design philosophy of agreement
Layered approach is a strategy commonly used that carries out data broadcasting in the wireless self-networking.Its main purpose is to form rational clustering architecture and it is effectively safeguarded.When the network topology structure variation is fast,, reduce broadcasting efficiency if bunch instability that forms can be brought very big control expense.This agreement is intended to combine the traffic behavior characteristics of vehicle node among the VANET, and design adapts to the sub-clustering algorithm of the environment that the VANET node density is changeable, topology is changeable, forms stable hierarchical network, effectively reduces the control expense, improves broadcasting efficiency.
Agreement has adopted bunch first-selected algorithm of lifting based on aggregative weighted to make up the sub-clustering network.Take all factors into consideration position, speed, connection and the traffic behavior factor thereof of node at bunch establishment stage, make every effort under the frequent VANET environment of topologies change, set up stable, clustering architecture efficiently.Then monitor clustering architecture through the method for bunch head and member's exchange message at bunch maintenance phase with the active behavior monitoring replacement that bunch first node carries out according to the traffic behavior characteristic of vehicle node; Bunch renewal is just carried out in case of necessity as required; And more new range is controlled in the cluster, prevents to produce too much control communication.In addition, in this agreement, a bunch first node is not preserved member's tabulation; Only by member record bunch first ID; Representing itself and this bunch belongingness, is a complete distributed sub-clustering algorithm, effectively reduces calculating and storage overhead that bunch head is used to form and safeguards bunch and produces.The combined closely traffic characteristic of VANET of agreement can reduce the control expense as far as possible under the prerequisite that guarantees the broadcasting coverage rate, improve broadcasting efficiency, and can adapt to node density and change violent traffic flow environment.
(3) agreement realizes
1, the classification of node in the agreement
For forming the layering radio network of a connection, bear in network according to node, node is divided into three types:
(1) bunch first node:
The Centroid that bunch first node is bunch is elected through the aggregative weighted method at bunch establishment stage.Be responsible for heavily broadcasting the broadcast data information that it is received, and the broadcast message that bunch interior nodes is sent is forwarded to the whole network to bunch interior nodes.Be responsible for this node state of traffic behavior characteristic monitoring according to node simultaneously to safeguard clustering architecture, where necessary bunch in initiate the gravity treatment of bunch head.
(2) gateway node:
In VANET, consider the non-unified characteristic of provisional, the sudden and node of network, should adopt standard emission power, so the node transmission range is certain, gateway node can be set be communicated with adjacent bunch.Gateway node can be entered row communication for the first time with two bunches simultaneously, is responsible on request a bunch of information of running initially out being transmitted to the first node of another bunch.
(3) member node:
Be the ordinary node in the sub-clustering network, this category node receives only oneself bunch broadcast message of running initially out and does not carry out any forwarding operation.
The classification of packet in the broadcasting
2, in this agreement, set up and data broadcasting for accomplishing network, defined seven kinds of packets, specific as follows:
(1) broadcast data packet (Broadcast Data Packet, BDP)
Refer to carry the packet of actual broadcast content, form by packet header and data field, in packet header definition bag ID, initiation node ID, on information such as jumping ID, an ID and bag rise time.
(2) the nodal information exchange packets (Information Exchange Packet, IEP)
In order to initiate bunch foundation, the packet of switching node information.Content comprises speed, position, car Taoist monastic name of node etc.
(3) bunch first statement bag (Head Announced Packet, HAP)
Node is sent out the weights of this bag to its neighbor statement oneself when thinking that oneself has less weights.Receive the node of HAP and also send out HAP and demur if having littler weights.
(4) head keep bag (Head Maintenance Packet, HMP)
Node sends this bag after quilt is elected into head node (i.e. bunch head) oneself be head node to show, and think oneself still to be that regularly send a bunch head back at the monitoring oneself state.Receive that the node of HMP becomes the member of this bunch.Its content comprises head node ID.
(5) gateway keep bag (Gateway Maintenance Packet, GMP)
Node sends two bunch first middle existing gateways of this bag to tell own neighbours oneself to connect after becoming gateway.The node of receiving GMP is not competed gateway after receiving the HMP of two bunches of head yet.
(6) gateway resign bag (Gateway Resign Packet, GRP)
When gateway node can't be received the HMP of two bunches of head in turn, promptly think oneself to be not suitable for remaking gateway, send out GRP this moment to tell that node can be competed gateway on every side.
(7) distributed network gate inquiry bag (Distributed Gateway Request Packet, DGRP)
Node is sent out this bag to seek the pairing gateway when needs are set up distributed network gate.Its content comprises, node ID, an ID.
3, bunch set up process
Bunch foundation can be initiated by arbitrary node, through between neighbors, sending the synthetic weights that IEP comes these nodes of information calculations such as exchange velocity, position, track, and carries out bunch first-selected an act with this.After the power of node calculating oneself, think that the power of oneself is less; Then send out a bunch first statement bag, each receives that the node of HAP therefrom extracts the weights in the statement bag, and compares with own weights; If own weights are littler; Then send out HAP demuring, otherwise the bag of no longer issuing a statement, wait for that other node sends out HMP.Send and do not receive the objection statement after head is stated the node wait certain hour that wraps, then send out head and keep to wrap to represent it oneself is a bunch head.Receive that the node of this HMP is the member of this bunch, and remember the head node of this node ID for oneself.First receives that it oneself is gateway node that the node of two bunches of first HMP is sent out the GMP statement.Finally form the sub-clustering network of the connection shown in Fig. 1-1.In addition, also there are two kinds of special situation:
Shown in Fig. 1-2, one take turns bunch election finish the back at certain node just by any bunch of first the covering, and its weights have become member's neighbors greater than some, then gravity treatment bunch head between these nodes.
Shown in Fig. 1-3, the first covering in zero lap zone or its overlapping region of two adjacent cluster that after takes turns election, form do not have node, then adopts distributed network gate to connect two bunches.If node is becoming member T gDo not receive yet after time that any effective GMP states promptly do not have gateway around it, then send out the DGRP bag and seek the pairing gateway that first hears the non-distributed network gate that forms pairing with this GMP of cluster knot point response with it of this message.T wherein gBe used for the wait duration of Control Node, send out DGRP, form the network that is communicated with so that be in the node that bunch first node covers the edge.
4, bunch maintenance
Bunch maintenance strategy should be able to guarantee that stable management is cluster structured, and the clustering architecture that upgrades in time to be to adapt to the variation of network, and the connection that guarantees bunch also should reduce the control expense, simultaneously to improve communication efficiency as far as possible.In existing sub-clustering algorithm, its bunch safeguarded most switching node information between bunch head and member regularly of passing through, and strategies such as renewal bunch first member's tabulation are realized, need pay a large amount of communication and storage overhead for bunch maintenance.
(1) maintenance of bunch first node
For reducing to control expense, bunch first a maintenance need not communicate with the member, but combines VANET node movement characteristic; Decide oneself whether to continue to be a bunch head through real-time monitoring oneself state; If be fit to, then sending out HMP, to notify neighbors oneself be head, if be not suitable for; Then bunch in initiate bunch first gravity treatment, as shown in Figure 2.Traffic behavior characteristic according to the VANET vehicle node; Bunch head mainly monitor oneself velocity variations, lane changing and with indexs such as leading vehicle distance; Lane changing, average speed and traffic flow gaps between their growth rates are dull to be increased or increases with leading vehicle distance is dull if take place, and this node all is not suitable for continuing to be a bunch head.Process is as shown in Figure 2.
(2) maintenance of gateway node
Head node is the ID of storage gateway node not, and by gateway monitoring oneself whether with bunch first a connection, if it receives the HMP of two bunches of head in turn, then bag is kept in the hairnet pass, notifying has gateway between oneself these two bunches of the neighborss; If receive the HMP of one of them bunch head continuously; Then proof is out of touch with another bunch head, has not then had gateway between these two bunches of head of node around the hairnet pass resignation bag notice, can compete gateway; At this moment, first node of receiving these two bunches of first HMP is claimed as gateway.Process is as shown in Figure 3.
(3) maintenance of member node
Head node is not preserved member's tabulation, and preserves head node ID by the member, belongs to this bunch to prove it.Simultaneously member node is confirmed the survival that concerns under own and this bunch through the HMP that monitors its bunch head., the member can alternately receive the HMP of two bunches of head when moving into the process of another bunch from one bunch; Check the own gateway that has or not this moment earlier on every side; If do not have, then oneself is claimed as gateway, otherwise; When treating to receive continuously the HMP of new bunch of head oneself ID is updated to this bunch head, to avoid alternately changing subordinate relation.This process is without any need for communication process.Member node does not have gateway around thinking after receiving the resignation bag that gateway sends, then be claimed as gateway if alternately receive the HMP of two bunches of head this moment.If member a period of time T mIn can't listen to any HMP, then oneself be claimed as a bunch head, send out HMP.Detailed process such as Fig. 4, wherein T HMPFor receiving the time behind the HMP.
(4) bunch merging
If the first node of certain cluster is received the HMP bag that the first node of other bunch is sent out, prove that then these two bunches of head get into communication coverage mutually, then in these two bunches of scopes, initiate bunch first gravity treatment by this bunch head, select new bunch first node.
4, data broadcasting process
Initiating node and generate packet according to upper layer application, initiate data broadcasting, is head node if initiate node, then own ID is write directly broadcasting behind the ID territory of BDP; Broadcast after member node or gateway node then write the ID territory of BDP with bunch first node ID under it if initiate node and be.Member node receives that bunch first packet that send by under own bunch then receives and do handled, otherwise directly loses; Head node judges whether its ID territory is the ID of oneself after receiving BDP, if then transmit, otherwise loses; Gateway node judges whether a hop node is one of own bunch head that is connected on it after receiving BDP; If whether transmit according to the decision of the direction of propagation among the BDP again; Transmits and gets final product (if distributed network gate then changes it into and matches the ID of gateway) behind the first ID of another bunch that during forwarding the ID territory of BDP is made into oneself to connect.

Claims (7)

1. based on the VANET sub-clustering broadcasting method of aggregative weighted, it comprises the steps:
One, the sub-clustering of onboard wireless MANET;
Two, confirm bunch first node in each bunch;
Three, confirm the gateway node of per two adjacent cluster;
Four, broadcast communication;
It is characterized in that in second step confirming that the method for bunch first node in each bunch is following: the behavior of going of position, speed, the connected sum of taking all factors into consideration node, select the power computing formula of bunch first node following:
W i＝w 1C i+w 2D i+w 3V i+w 4L i (4-2)
C in the formula i---the degree of communication component is used to represent the connection situation of node;
D i---distance component, the mean value of expression node and neighbor node distance;
V i---the velocity component of synthetic weights, the difference of expression node speed and its neighbours' average speed;
L i---the traveling lane component of node i, promptly according to the go weight term of Rule Design of node, expression node traveling lane and control vehicle Taoist monastic name difference;
Wherein, get C i=| N i-δ |, wherein, N iBe neighbours' number of node i, promptly actual degree of communication, δ is desirable degree of communication; The δ value is calculated by following formula:
δ＝2R t×133×m/1000 (4-3)
R wherein t---the node transmission range;
The number of track-lines of m---highway;
D iCalculate through following formula:
D i = 1 n Σ j = 1 n Dist ( i , j ) - - - ( 4 - 4 )
Wherein Dist (i, j)---node i is to the distance of node j;
Neighbours' number of n---node;
V iCalculate through following formula:
V i = | v i - v ‾ | - - - ( 4 - 5 )
V wherein i---the speed of node i;
Figure FDA0000085497970000013
---neighbors average speed, its value by formula (4-6) is calculated:
v ‾ = 1 n Σ j = 1 n v j - - - ( 4 - 6 )
Track component L iCalculate through following formula:
L i＝|l i-L s| (4-7)
L wherein i---the car Taoist monastic name that node went;
L s---the control vehicle Taoist monastic name;
Pass through l iWith L sAsk difference to confirm that node is in the chance size in normal track;
w 1～w 4Be the coefficient of each component,, should satisfy w in order to regulate the proportion of each component in comprehensive weights 1+ w 2+ w 3+ w 4=1,0≤w 1, w 2, w 3, w 4≤1.
2. the VANET sub-clustering broadcasting method based on aggregative weighted according to claim 1; The process that it is characterized in that step 4 is following: certain node in certain cluster to bunch in when broadcasting; Earlier send to a bunch head to broadcasted content, by bunch first to bunch in all node broadcasts contents; Certain node in certain cluster to bunch outside other bunch when broadcasting; Send to broadcasted content bunch head of this bunch earlier; Send to bunch head of adjacent cluster to broadcasted content through the gateway node that belongs to two adjacent cluster altogether by the bunch first of this bunch, send broadcasted content by this adjacent cluster head to each node of adjacent cluster again; Just broadcasted content can be propagated into the node of all onboard wireless MANETs successively through the gateway node transmission broadcasted content of adjacent cluster by adjacent bunch head.
3. the VANET sub-clustering broadcasting method based on aggregative weighted according to claim 1 is characterized in that in the step 1 that a bunch first node do not preserve member's tabulation, only by member record bunch first ID, representes itself and this bunch belongingness.
4. the VANET sub-clustering broadcasting method based on aggregative weighted according to claim 1 is characterized in that having used seven kinds of packets in sub-clustering and the data broadcasting process, and is specific as follows:
Broadcast data packet:
Refer to carry the packet of actual broadcast content, form by packet header and data field, in packet header definition bag ID, initiation node ID, on jumping ID, an ID and the bag rise time;
The nodal information exchange packets:
In order to initiating bunch foundation, the packet of switching node information, content comprises speed, position, the car Taoist monastic name of node;
Bunch first statement bag:
Node is sent out this bag to the weights of its neighbor statement oneself when thinking that oneself has less weights, receive bunch node of first statement bag and also send out a bunch first statement and wrap and demur if having littler weights;
Head is kept bag:
Node sends this bag after being elected into head node oneself be head node to show, and think oneself still to be that regularly send a bunch first back at the monitoring oneself state; Receive that a node of keeping bag becomes the member of this bunch;
Gateway is kept bag:
Node sends two bunch first middle existing gateways of this bag to tell own neighbours oneself to connect after becoming gateway; Receive that gateway keeps the node of bag and receive that the head of two bunches of head do not compete gateway after keeping bag yet;
Gateway is resigned and is wrapped:
Gateway node can't be received when the head of two bunches of head is kept bag in turn, promptly thinks oneself to be not suitable for remaking gateway, and this moment, hairnet closed the bag of resigning to tell that node can be competed gateway on every side.
Distributed network gate inquiry bag:
Node is sent out this bag to seek the pairing gateway when needs are set up distributed network gate, its content comprises: a node ID and an ID.
5. the VANET sub-clustering broadcasting method based on aggregative weighted according to claim 4; It is characterized in that bunch foundation can be initiated by arbitrary node in the first step; Come exchange velocity, position, lane information to calculate the synthetic weights of this node by sending node information exchange bag between neighbors, and carry out a bunch first-selection with this and lift; After the power of node calculating oneself, think that the power of oneself is less; Then send out a bunch first statement bag; Each receives that bunch node of first statement bag therefrom extracts the weights in the statement bag; And compare with own weights; If own weights are littler; Then send out bunch first statement bag demuring, otherwise the bag of no longer issuing a statement, wait for that other node is sent out to keep bag; Send and do not receive the objection statement after head is stated the node wait certain hour that wraps, then send out head and keep to wrap to represent it oneself is a bunch head; Receive that this node of keeping bag is the member of this bunch, and remember the head node of this node ID for oneself; First node hairnet of receiving that two bunches of first heads are kept bag closes to keep to wrap states that oneself is gateway node.
6. the VANET sub-clustering broadcasting method based on aggregative weighted according to claim 5; It is characterized in that taking turns a bunch election end back one is covered by any bunch of head at certain node just; And its weights have become member's neighbors greater than some, then gravity treatment bunch head between these nodes.
7. the VANET sub-clustering broadcasting method based on aggregative weighted according to claim 5; It is characterized in that taking turns bunch first-selected first the covering in zero lap zone or its overlapping region of two adjacent cluster of lifting back formation one does not have node, then adopts distributed network gate to connect two bunches; If node is becoming member T gDo not receive yet after time that any effective gateway keeps bag statement, promptly do not have gateway around it, then send out distributed network gate inquiry bag bag and seek the pairing gateway, first hears that the non-of this message keep the distributed network gate that bag forms pairing with it with this gateway of cluster knot point response; T wherein gBe used for the wait duration of Control Node, send out distributed network gate inquiry bag, form the network that is communicated with so that be in the node that bunch first node covers the edge.
CN201110243485.3A 2011-08-23 2011-08-23 VANET (vehicular ad-hoc network) clustered broadcasting method based on comprehensive weighting Expired - Fee Related CN102325306B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110243485.3A CN102325306B (en) 2011-08-23 2011-08-23 VANET (vehicular ad-hoc network) clustered broadcasting method based on comprehensive weighting

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110243485.3A CN102325306B (en) 2011-08-23 2011-08-23 VANET (vehicular ad-hoc network) clustered broadcasting method based on comprehensive weighting

Publications (2)

Publication Number Publication Date
CN102325306A true CN102325306A (en) 2012-01-18
CN102325306B CN102325306B (en) 2014-01-22

Family

ID=45452964

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110243485.3A Expired - Fee Related CN102325306B (en) 2011-08-23 2011-08-23 VANET (vehicular ad-hoc network) clustered broadcasting method based on comprehensive weighting

Country Status (1)

Country Link
CN (1) CN102325306B (en)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102880975A (en) * 2012-09-13 2013-01-16 大连理工大学 Bidding game method based on load balancing in VANET
CN103369578A (en) * 2013-07-23 2013-10-23 中国科学技术大学苏州研究院 Group generation and maintenance method in wireless self-organizing network environment
CN104754592A (en) * 2013-12-31 2015-07-01 北京大唐高鸿软件技术有限公司 Vehicle-mounted communication network clustering method applicable to urban road environment
CN105245563A (en) * 2015-08-27 2016-01-13 重庆邮电大学 Dynamic clustering method based on vehicle node connection stability
CN105448115A (en) * 2016-01-20 2016-03-30 南通大学 A method for communication among passive-clustering vehicles in a high-speed traffic network
CN107426794A (en) * 2017-03-17 2017-12-01 兰州交通大学 A kind of combined weighted cluster head choosing method suitable for VANET networks
CN109041127A (en) * 2018-09-26 2018-12-18 北航（四川）西部国际创新港科技有限公司 The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network
CN111436025A (en) * 2019-01-15 2020-07-21 财团法人工业技术研究院 Driving information issuing method and system
WO2020199185A1 (en) * 2019-04-04 2020-10-08 株式会社Ntt都科摩 Cluster head parameter determination method and terminal
US10887928B2 (en) 2019-04-24 2021-01-05 Here Global B.V. Lane aware clusters for vehicle to vehicle communication
CN112243213A (en) * 2020-09-30 2021-01-19 北京航空航天大学 Vehicle clustering method, device and equipment in Internet of vehicles and storable medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050094574A1 (en) * 2003-11-04 2005-05-05 Samsung Electronics Co., Ltd. Method of electing a leader in an ad-hoc network
CN101207572A (en) * 2007-12-14 2008-06-25 北京科技大学 Method for clustering vehicle mounted Ad hoc network based on signal strength

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050094574A1 (en) * 2003-11-04 2005-05-05 Samsung Electronics Co., Ltd. Method of electing a leader in an ad-hoc network
CN101207572A (en) * 2007-12-14 2008-06-25 北京科技大学 Method for clustering vehicle mounted Ad hoc network based on signal strength

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
《计算机应用》 20100731 林磊等 面向稳定性的基于权值的车辆自组网分簇算法--SWBCA 全文 1-7 第30卷, 第7期 *
L.ZHOU ET AL: "NBBP:A Broadcast Scheme in Dense VANETs", 《INFORMATION TECHNOLOGY JOURNAL,2010》 *
林磊等: "面向稳定性的基于权值的车辆自组网分簇算法——SWBCA", 《计算机应用》 *

Cited By (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102880975B (en) * 2012-09-13 2015-07-29 大连理工大学 A kind of price game method based on load balancing in VANET
CN102880975A (en) * 2012-09-13 2013-01-16 大连理工大学 Bidding game method based on load balancing in VANET
CN103369578B (en) * 2013-07-23 2017-04-19 中国科学技术大学苏州研究院 Group generation and maintenance method in wireless self-organizing network environment
CN103369578A (en) * 2013-07-23 2013-10-23 中国科学技术大学苏州研究院 Group generation and maintenance method in wireless self-organizing network environment
CN104754592A (en) * 2013-12-31 2015-07-01 北京大唐高鸿软件技术有限公司 Vehicle-mounted communication network clustering method applicable to urban road environment
CN104754592B (en) * 2013-12-31 2018-03-06 北京大唐高鸿软件技术有限公司 A kind of vehicle-mounted short distance communication network cluster-dividing method suitable for urban road environment
CN105245563A (en) * 2015-08-27 2016-01-13 重庆邮电大学 Dynamic clustering method based on vehicle node connection stability
CN105245563B (en) * 2015-08-27 2018-05-15 重庆邮电大学 A kind of dynamic clustering method based on vehicle node connection stability
CN105448115A (en) * 2016-01-20 2016-03-30 南通大学 A method for communication among passive-clustering vehicles in a high-speed traffic network
CN107426794A (en) * 2017-03-17 2017-12-01 兰州交通大学 A kind of combined weighted cluster head choosing method suitable for VANET networks
CN109041127A (en) * 2018-09-26 2018-12-18 北航（四川）西部国际创新港科技有限公司 The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network
CN111436025A (en) * 2019-01-15 2020-07-21 财团法人工业技术研究院 Driving information issuing method and system
US11170648B2 (en) 2019-01-15 2021-11-09 Industrial Technology Research Institute Vehicle information distributing method and system
CN111436025B (en) * 2019-01-15 2022-01-07 财团法人工业技术研究院 Driving information issuing method and system
WO2020199185A1 (en) * 2019-04-04 2020-10-08 株式会社Ntt都科摩 Cluster head parameter determination method and terminal
CN113498614A (en) * 2019-04-04 2021-10-12 株式会社Ntt都科摩 Cluster head parameter determination method and terminal
US10887928B2 (en) 2019-04-24 2021-01-05 Here Global B.V. Lane aware clusters for vehicle to vehicle communication
US11382148B2 (en) 2019-04-24 2022-07-05 Here Global B.V. Lane aware clusters for vehicle to vehicle communication
CN112243213A (en) * 2020-09-30 2021-01-19 北京航空航天大学 Vehicle clustering method, device and equipment in Internet of vehicles and storable medium

Also Published As

Publication number Publication date
CN102325306B (en) 2014-01-22

Similar Documents

Publication Publication Date Title
CN102307373A (en) VANET clustering method taking regard of vehicle traffic characteristic
CN102325306A (en) VANET (vehicular ad-hoc network) clustered broadcasting method based on comprehensive weighting
Zhang et al. New multi-hop clustering algorithm for vehicular ad hoc networks
CN102036308B (en) Energy balancing wireless sensor network clustering method
Wang et al. A position-based clustering technique for ad hoc intervehicle communication
Rawashdeh et al. A novel algorithm to form stable clusters in vehicular ad hoc networks on highways
CN102158927A (en) Efficient inhomogeneous clustering routing method of wireless sensor network
Gajjar et al. Lifetime improvement of LEACH protocol for Wireless Sensor Network
CN110401931B (en) Network architecture and resource scheduling and distributing method based on network architecture
Fan Improving broadcasting performance by clustering with stability for inter-vehicle communication
Chiti et al. Content sharing in Internet of Vehicles: Two matching-based user-association approaches
CN102244914B (en) Route recognizing method applicable to multihop wireless network
CN110121200B (en) Energy-efficient networking method in heterogeneous sensor network
CN107071843A (en) Mobile self-organizing network cluster dividing method
CN113347605A (en) Vehicle information transmission network construction method, network and BSM information distribution method
CN104065574A (en) Uneven clustering routing method inside wireless sensor network layer
Ghimire et al. Dynamic clustering in IoV using behavioral parameters and contention window adaptation
Azar et al. Energy-and delay-efficient algorithm for large-scale data collection in mobile-sink WSNs
Wu et al. An adaptive TDMA scheduling strategy based on beacon messages for vehicular ad-hoc network
Jabbar et al. Clustering Review in Vehicular Ad hoc Networks: Algorithms, Comparisons, Challenges and Solutions.
CN113329368B (en) Route clustering method and device based on affinity propagation algorithm
Liu et al. A Position Sensitive Clustering Algorithm for VANET.
Neamatollahi et al. A novel fuzzy metric to evaluate clusters for prolonging lifetime in wireless sensor networks
Yang et al. A novel energy-efficient data gathering algorithm for wireless sensor networks
CN108055686B (en) Dynamic subnet dividing and collecting method for mobile sink nodes of agricultural wireless sensor network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20140122

Termination date: 20140823

EXPY Termination of patent right or utility model