CN105657068A - Implement method based on vehicle moving information clustering - Google Patents
Implement method based on vehicle moving information clustering Download PDFInfo
- Publication number
- CN105657068A CN105657068A CN201610181921.1A CN201610181921A CN105657068A CN 105657068 A CN105657068 A CN 105657068A CN 201610181921 A CN201610181921 A CN 201610181921A CN 105657068 A CN105657068 A CN 105657068A
- Authority
- CN
- China
- Prior art keywords
- bunch
- node
- vehicle
- head
- vehicle node
- 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.)
- Pending
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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
- H04W4/08—User group management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an implement method based on vehicle moving information clustering and belongs to the field of vehicle-mounted wireless communication. The method comprises the steps of vehicle node initializing, cluster head initialization selecting, vehicle node adding, cluster member leaving and cluster dividing. Navigation systems installed on vehicle nodes are connected with a wireless communication device, on the premise that the direction of each intersection is known, the steering information and speed information of the vehicle nodes at the next intersection are acquired, the vehicle node with the speed closest to the average speed of a neighboring node around steering is selected from maximal steering at the next interaction to serve as a cluster head node, change frequency of a cluster head and cluster members can be reduced, and cluster stability can be effectively kept.
Description
Technical field
The invention belongs to in-vehicle wireless communication field, especially relate to a kind of realize method based on vehicular movement information sub-clustering.
Background technology
In-vehicle networking is the mobile ad-hoc network a kind of special applications in field of road traffic, is one of most crucial technology in intelligent transportation system. Due to the fast development of Global Auto industry Yu self-organization network technology, In-vehicle networking has become as the focus of a research. Cluster structured is key technology in In-vehicle networking, and the performance of wireless self-organization network is had direct impact by its quality.
GerlaM disclosed in prior art, the document " Multicluster; mobile; multimediaradionetwork (many bunches; mobile; multimedia broadcasting network) " of TsaiJTC, teaches the advantage of the designing axiom of Cluster Networks, main thought, network structure and Cluster Networks, and gives concrete cluster algorithm. But, bunch head in this algorithm is likely to be at longer time the state of bunch head so that the turnover rate of bunch head is relatively low, lacks fairness.
ChiangCC disclosed in prior art, WuHK, LiuW, the document " Routinginclusteredmultihop, mobilewirelessnetworkswithfadingchannel (have the route in the multi-hop wireless network of fading channel) " of etal is on GerlaM, TsaiJTC basis, the cluster algorithm of a kind of most tuftlet change is proposed, by selecting a bunch head in conjunction with the sequence number of nodes and node degree, increase a bunch time for head survival, the stability that improve bunch.
SivavakeesarS disclosed in prior art, in " Aprediction-basedclusteringalgorithmtoachievequalityofse rviceinmultihopadhocnetworks (in ad hoc networks the cluster algorithm of a kind of position-based prediction obtaining service quality) ", network being divided into virtual cluster in the document of PavlouG, the probability being left virtual cluster by computing node chooses a bunch head. Relative mobility owing to being chosen as bunch head is minimum, and therefore this algorithm can effectively reduce the more probability of bunch head, makes bunch stability that maintenance is good. But, this algorithm does not account for the problem of node mobility, clustering architecture also can be made to change if the quickly ease of nodes is dynamic, the stability of reduction bunch.
AlmalagMS disclosed in prior art, in the document of WeigleMC " Usingtrafficflowforclusterformationinvehicularad-hocnetw orks (based on the cluster algorithm in track in In-vehicle networking) ", this algorithm utilizes the navigation that vehicle node is equipped with to obtain lane information, account for the ratio in whole track by calculating each track, the probability that leader cluster node is chosen from highest proportion of track is big. This algorithm adds the time-to-live of bunch head to a certain extent, the stability maintained bunch. But, if the vehicle node in the track that track ratio is little is more, increases the probability changing bunch head on the contrary and become big, the unstability caused bunch, and, the parameter affecting algorithm is not made normalizing standardization by this algorithm, reduces the accuracy that bunch head selects.
Summary of the invention
Present invention aims to above shortcomings in prior art, it is provided that a kind of realize method based on vehicular movement information sub-clustering.
The present invention comprises the steps:
The first step, vehicle node initialization
1.1) state in the starting stage of the vehicle node in In-vehicle networking is unsettled condition;
1.2) the rolling stock node in network has the mobile message of a unique ID and real-time velocity information and vehicle when initial;
In step 1.2) in, the mobile message of described vehicle includes keeping straight on, turning left and turn right.
Second step, bunch head initialization select
2.1) all vehicle node in network periodically broadcast " HELLO " message to periphery one hop neighbor vehicle node;
2.2) after the message that have collected neighbours' vehicle node, calculating vehicle node each vehicle turned to of next crossing number and calculate place turn to around the average speed of a hop neighbor node;
2.3) select speed closest to the vehicle node of average speed as initial cluster head in that of the maximum quantity of vehicle turns to;
2.4) if the direction that there is different vehicle node is the same with speed, then choose node less for ID as a bunch head;
2.5) after Cluster Networks is formed, owing to vehicle node is highly mobile, cause that vehicle node constantly sends more fresh information, and calculate the average speed of the surrounding one hop neighbor node that place turns to, select speed to elect optimum bunch head as closest to the vehicle node of average speed in that of the maximum quantity of vehicle turns to; If the direction that there is different vehicle node is the same with speed, then choose node less for ID as a bunch head;
3rd step, vehicle node addition
3.1) when a vehicle node being in unsettled condition moves in the communication range of certain bunch, after receiving bunch message of head broadcast, send " HELLO " message application and add this bunch;
3.2), after bunch head receives " HELLO " message of this node, this node is added in the list of bunch member at place bunch;
3.3) when upper optimum bunch of head of once selection, the node being newly added just can determine whether to be chosen as a bunch head according to according to algorithm;
4th step, the leaving of bunch member
4.1) when a bunch member leaves bunch, its state can be changed into pseudo-bunch member condition;
4.2) if coming back to the scope of bunch head in the time threshold values of regulation, then its state becomes again a bunch member condition again, and otherwise, it is deleted by bunch head from bunch members list, and its state transfer is unsettled condition;
5th step, bunch division
5.1) when bunch moving to certain crossing, it is likely that the division produced bunch, namely it would appear that bunch head or a part bunch member leave bunch; Before bunch this situation occurs, after calculating the average speed in the steering node of place, speed is closest to average speed and the node ID less vehicle node standard bunch head as direction, place;
5.2) after bunch division, accurate bunch head can become a bunch head at once, is managed producing new bunch, so it is possible not only to increase the time-to-live of bunch head, the new bunch time formed and calculating can also be reduced, reduce bunch head rate of change, improve the stability of clustering architecture.
The navigation system that the present invention is installed by vehicle node is connected with Wireless Telecom Equipment, make under the known premise in the direction at each crossing of vehicle node, vehicle node is according to the direction information broadcasted at next crossing and velocity information, around in selecting speed to turn to closest to this in next crossing turns at most, the vehicle node of the average speed of a hop neighbor node is as leader cluster node, so it is possible not only to reduce the change frequency of bunch head and bunch member, and the stability that can effectively keep bunch.
Accompanying drawing explanation
Fig. 1 is initialized communication scenes in the present invention.
Fig. 2 is the communication scenes of vehicle node addition bunch in the present invention.
Fig. 3 is the communication scenes that in the present invention, bunch member leaves.
Fig. 4 is the communication scenes of bunch division in the present invention.
Fig. 5 is the selection algorithm of bunch head in the present invention.
Detailed description of the invention
In order to become apparent from understanding the present invention, below in conjunction with the accompanying drawing of the present invention, by following example, present invention is described in detail through row, but protection scope of the present invention is not limited to following embodiment.
The embodiment of the present invention comprises the following steps:
The first step, consideration communication scenes as shown in Figure 1, the state in the starting stage of the vehicle node in In-vehicle networking is unsettled condition; The rolling stock node in network ID when initial is the real time speed information respectively 30km/h from 1��6, vehicle node 1 to 6,29km/h, 30km/h, 30km/h, 31km/h, 30km/h, the mobile message of vehicle is that vehicle node 1,2,4 and 5 is kept straight at next crossing, vehicle node 3 is turned right at next crossing, and vehicle node 6 is turned left;
Second step, consideration communication scenes as shown in Figure 1, all vehicle node in network periodically broadcast " HELLO " message to periphery one hop neighbor vehicle node; After the message that have collected neighbours' vehicle node, owing to there are 4 automobiles in craspedodrome direction, therefore bunch head must be selected from these 4 vehicle node, it is after 30km/h again through the average speed calculated between these 4 vehicle node, learn that vehicle node 1 is the same with the speed of 4 and closest to average speed, but due to little than vehicle node 4 of the ID of vehicle node 1, therefore vehicle node 1 is as initial cluster head; After Cluster Networks is formed, owing to vehicle node is highly mobile, cause that vehicle node constantly sends more fresh information, and calculate and the average speed of surrounding one hop neighbor node, the vehicle node of the average speed in selecting speed to turn to closest to this in that of the maximum quantity of vehicle turns to elects optimum bunch head as; If the direction that there is different vehicle node is the same with speed, then choose node less for ID as a bunch head;
3rd step, consideration communication scenes as shown in Figure 2, when a vehicle node 7 being in unsettled condition moves in the communication range of a bunch head (vehicle node 1), after receiving bunch message of head broadcast, send " HELLO " message application and add this bunch; This node is added in the list of bunch member at place bunch after receiving " HELLO " message of this node by bunch head; When upper optimum bunch of head of once selection, the node being newly added just can determine whether to be chosen as a bunch head according to according to algorithm;
4th step, considering communication scenes as shown in Figure 3, when vehicle node 2 is left bunch, its state can be changed into pseudo-bunch member condition; Owing to vehicle node 2 does not come back to the scope of bunch head in the time threshold values of regulation, therefore, it is deleted by bunch head from bunch members list, and its state transfer is unsettled condition;
5th step, consider communication scenes as shown in Figure 3, when bunch moving to crossing, it is likely that the division produced bunch, namely it would appear that bunch head or a part bunch member leave bunch; Before bunch this situation occurs, after calculating the average speed in the steering node of place, speed is closest to average speed and the node ID less the vehicle node 3 and 6 standard bunch head respectively as direction, place; Consider communication scenes as shown in Figure 4, after bunch division, quasi-leader cluster node 3 and 6 can become a bunch head at once, it is managed producing new bunch, so it is possible not only to increase the time-to-live of bunch head, the new bunch time formed and calculating can also be reduced, reduce bunch head rate of change, improve the stability of clustering architecture.
What the invention provides the cluster algorithm based on vehicular movement information in In-vehicle networking realizes method, and the navigation system installed by vehicle node is connected with Wireless Telecom Equipment, it is thus achieved that the vehicle node direction information at next crossing and velocity information. As shown in Figure 5, in selecting speed to turn to closest to this in next crossing turns at most, the vehicle node of the average speed of a hop neighbor node is as leader cluster node, so it is possible not only to reduce the change frequency of bunch head and bunch member, and the stability that can effectively keep bunch.
Claims (2)
1. one kind realizes method based on vehicular movement information sub-clustering, it is characterised in that comprise the steps:
The first step, vehicle node initialization
1.1) state in the starting stage of the vehicle node in In-vehicle networking is unsettled condition;
1.2) the rolling stock node in network has the mobile message of a unique ID and real-time velocity information and vehicle when initial;
Second step, bunch head initialization select
2.1) all vehicle node in network periodically broadcast " HELLO " message to periphery one hop neighbor vehicle node;
2.2) after the message collecting neighbours' vehicle node, calculating vehicle node each vehicle turned to of next crossing number and calculate place turn to around the average speed of a hop neighbor node;
2.3) select speed closest to the vehicle node of average speed as initial cluster head in that of the maximum quantity of vehicle turns to;
2.4) if the direction that there is different vehicle node is the same with speed, then choose node less for ID as a bunch head;
2.5) after Cluster Networks is formed, owing to vehicle node is highly mobile, cause that vehicle node constantly sends more fresh information, and calculate the average speed of the surrounding one hop neighbor node that place turns to, select speed to elect optimum bunch head as closest to the vehicle node of average speed in that of the maximum quantity of vehicle turns to; If the direction that there is different vehicle node is the same with speed, then choose node less for ID as a bunch head;
3rd step, vehicle node addition
3.1) when a vehicle node being in unsettled condition moves in the communication range of certain bunch, after receiving bunch message of head broadcast, send " HELLO " message application and add this bunch;
3.2), after bunch head receives " HELLO " message of this node, this node is added in the list of bunch member at place bunch;
3.3) when upper optimum bunch of head of once selection, the node being newly added just can determine whether to be chosen as a bunch head according to according to algorithm;
4th step, the leaving of bunch member
4.1) when a bunch member leaves bunch, its state can be changed into pseudo-bunch member condition;
4.2) if coming back to the scope of bunch head in the time threshold values of regulation, then its state becomes again a bunch member condition again, and otherwise, it is deleted by bunch head from bunch members list, and its state transfer is unsettled condition;
5th step, bunch division
5.1) when bunch moving to certain crossing, it is likely that the division produced bunch, namely it would appear that bunch head or a part bunch member leave bunch; Before bunch this situation occurs, after calculating the average speed in the steering node of place, speed is closest to average speed and the node ID less vehicle node standard bunch head as direction, place;
5.2) after bunch division, accurate bunch head can become a bunch head at once, is managed producing new bunch, so it is possible not only to increase the time-to-live of bunch head, the new bunch time formed and calculating can also be reduced, reduce bunch head rate of change, promote the stability of clustering architecture.
2. a kind of as claimed in claim 1 realize method based on vehicular movement information sub-clustering, it is characterised in that in step 1.2) in, the mobile message of described vehicle includes keeping straight on, turning left and turn right.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610181921.1A CN105657068A (en) | 2016-03-28 | 2016-03-28 | Implement method based on vehicle moving information clustering |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610181921.1A CN105657068A (en) | 2016-03-28 | 2016-03-28 | Implement method based on vehicle moving information clustering |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105657068A true CN105657068A (en) | 2016-06-08 |
Family
ID=56494565
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610181921.1A Pending CN105657068A (en) | 2016-03-28 | 2016-03-28 | Implement method based on vehicle moving information clustering |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105657068A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107426694A (en) * | 2017-06-26 | 2017-12-01 | 湖南大学 | A kind of fuzzy cluster algorithm of vehicular ad hoc network |
| CN108882150A (en) * | 2018-06-21 | 2018-11-23 | 河南科技大学 | A kind of information centre's In-vehicle networking method for routing based on sub-clustering and perception of meeting |
| CN110719144A (en) * | 2018-07-12 | 2020-01-21 | 上海交通大学 | Wireless communication transmission method based on pre-grouping and receiving and transmitting bidirectional confirmation |
| CN112243213A (en) * | 2020-09-30 | 2021-01-19 | 北京航空航天大学 | Vehicle clustering method, device and equipment in Internet of vehicles and storable medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103873485A (en) * | 2014-04-03 | 2014-06-18 | 重庆邮电大学 | Cluster MAC protocol implementation method based on link duration time in vehicle-mounted self-organizing network |
| CN105245563A (en) * | 2015-08-27 | 2016-01-13 | 重庆邮电大学 | Dynamic clustering method based on vehicle node connection stability |
-
2016
- 2016-03-28 CN CN201610181921.1A patent/CN105657068A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103873485A (en) * | 2014-04-03 | 2014-06-18 | 重庆邮电大学 | Cluster MAC protocol implementation method based on link duration time in vehicle-mounted self-organizing network |
| CN105245563A (en) * | 2015-08-27 | 2016-01-13 | 重庆邮电大学 | Dynamic clustering method based on vehicle node connection stability |
Non-Patent Citations (2)
| Title |
|---|
| LEANDROS A. MAGLARAS等: "Distributed Clustering in Vehicular Networks", 《2012 IEEE 8TH INTERNATIONAL CONFERENCE》 * |
| PEIZHI YANG等: "Clustering Algorithm in VANETs:A Survey", 《2015 IEEE INTERNATIONAL CONFERENCE》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107426694A (en) * | 2017-06-26 | 2017-12-01 | 湖南大学 | A kind of fuzzy cluster algorithm of vehicular ad hoc network |
| CN108882150A (en) * | 2018-06-21 | 2018-11-23 | 河南科技大学 | A kind of information centre's In-vehicle networking method for routing based on sub-clustering and perception of meeting |
| CN108882150B (en) * | 2018-06-21 | 2020-07-24 | 河南科技大学 | Information center vehicle-mounted network routing method based on clustering and encounter sensing |
| CN110719144A (en) * | 2018-07-12 | 2020-01-21 | 上海交通大学 | Wireless communication transmission method based on pre-grouping and receiving and transmitting bidirectional confirmation |
| CN110719144B (en) * | 2018-07-12 | 2021-09-03 | 上海交通大学 | Wireless communication transmission method based on pre-grouping and receiving and transmitting bidirectional confirmation |
| CN112243213A (en) * | 2020-09-30 | 2021-01-19 | 北京航空航天大学 | Vehicle clustering method, device and equipment in Internet of vehicles and storable medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chen et al. | A connectivity-aware intersection-based routing in VANETs | |
| Abedi et al. | Enhancing AODV routing protocol using mobility parameters in VANET | |
| CN105245563B (en) | A kind of dynamic clustering method based on vehicle node connection stability | |
| CN105657068A (en) | Implement method based on vehicle moving information clustering | |
| CN103781198A (en) | 802.11p and LTE/LTE-A based vehicle networking message propagation method | |
| CN103781141B (en) | Singlecast router retransmission method, chip and the communication system of vehicular ad hoc network | |
| CN106211260B (en) | Position information self-adaptive opportunistic routing method in Internet of vehicles | |
| CN107171965A (en) | Car networking cross-layer chance method for routing based on Distributed Congestion Control Mechanisms | |
| CN107105389B (en) | Geographic information routing method based on road topological structure in vehicle-mounted network | |
| CN106851770B (en) | Car networking communication means based on link-quality | |
| CN102883263A (en) | VANET clustering and maintenance method based on distance of adjacent vehicles | |
| CN107343024A (en) | A kind of centralized car networking MAC layer merges prediction of collision and avoiding method | |
| CN109640369B (en) | Vehicle-mounted network reliable communication method based on adaptive power | |
| Hande et al. | Comprehensive survey on clustering-based efficient data dissemination algorithms for VANET | |
| Hadded et al. | Using road IDs to enhance clustering in vehicular ad hoc networks | |
| CN103475752B (en) | What the vehicle-mounted net address of a kind of next generation configured realizes method | |
| CN110248392B (en) | Opportunity forwarding method based on node efficiency in Internet of vehicles | |
| CN109561392B (en) | Self-adaptive dynamic sensing route for driving environment of Internet of vehicles | |
| CN108541040A (en) | A kind of cross-layer routing protocol suitable under City scenarios | |
| Senouci et al. | An efficient weight-based clustering algorithm using mobility report for IoV | |
| Rana et al. | VANET: expected delay analysis for location aided routing (LAR) Protocol | |
| CN107360609B (en) | Message forwarding method for realizing low-delay communication in V2V communication of Internet of vehicles | |
| CN106793142B (en) | A kind of dispatch channel resource optimization method of vehicle-mounted short haul connection net | |
| Wu et al. | An adaptive TDMA scheduling strategy based on beacon messages for vehicular ad-hoc network | |
| CN109600712B (en) | Self-adaptive routing method based on software defined internet of vehicles |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160608 |