CN108882150A - A kind of information centre's In-vehicle networking method for routing based on sub-clustering and perception of meeting - Google Patents

A kind of information centre's In-vehicle networking method for routing based on sub-clustering and perception of meeting Download PDF

Info

Publication number
CN108882150A
CN108882150A CN201810640877.5A CN201810640877A CN108882150A CN 108882150 A CN108882150 A CN 108882150A CN 201810640877 A CN201810640877 A CN 201810640877A CN 108882150 A CN108882150 A CN 108882150A
Authority
CN
China
Prior art keywords
node
cluster
ecra
cluster head
information
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
CN201810640877.5A
Other languages
Chinese (zh)
Other versions
CN108882150B (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.)
Henan University of Science and Technology
Original Assignee
Henan University of Science and 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 Henan University of Science and Technology filed Critical Henan University of Science and Technology
Priority to CN201810640877.5A priority Critical patent/CN108882150B/en
Publication of CN108882150A publication Critical patent/CN108882150A/en
Application granted granted Critical
Publication of CN108882150B publication Critical patent/CN108882150B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30—Services specially adapted for particular environments, situations or purposes
    • H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
    • H04W4/48—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for in-vehicle communication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/08—Access security
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • H04W4/025—Services making use of location information using location based information parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)

Abstract

A kind of information centre's In-vehicle networking method for routing based on sub-clustering and perception of meeting, includes the following steps：Division region carried out to vehicle, a node is selected as cluster head in each region, is responsible for managing the information of other member's vehicles and information is propagated, be set in go to crossing prevariety it is all constant and all constant with the speed of vehicle in cluster；Sub-clustering is carried out to the node in network, cluster head determines the situation of change of cluster interior nodes by periodic broadcasting, while different cluster heads are communicated according to routing algorithm in cluster, and use mechanism life cycle to storing data；Algorithm of the invention records the motion profile of node using meeting between vehicle, can be more convenient when to be routed in a network find the destination node constantly moved, sub-clustering is carried out to node using the feature of the vehicle nature sub-clustering in transportation network simultaneously, routing algorithm is made preferably to be suitable for content center In-vehicle networking.

Description

A kind of information centre's In-vehicle networking method for routing based on sub-clustering and perception of meeting
Technical field
The present invention relates to information centre's In-vehicle networking fields, are based on sub-clustering and perception of meeting more specifically to one kind Information centre's In-vehicle networking method for routing.
Background technique
MANET (Mobile Ad Hoc Network), i.e. mobile self-grouping network, it is a kind of without fixing control centre, Without the wireless multihop access network network of infrastructure, MANET being capable of a kind of section as relatively independent network operation, in network Point without fixed position, can arbitrary motion, support the language between mobile node in harsh environment by way of interim networking The wireless transmission of the information such as sound, data, graph image；MANET application field is extensive, including military field, urgent and interim field It closes, in addition sensor network and internet of things field and personal communication etc. can also play its effect in automotive field；
VANET (Vehicular Ad Hoc Network), i.e. vehicular ad hoc network, then be MANET answering in real road With it includes (parking lot information, dining room information, traffic information etc. that vehicle-mounted net, which can make driver more fully grasp peripheral information, Deng), for example, a vehicle goes for the parking stall situation in parking lot around, then vehicle can be sent a request to around parking lot Vehicle, the vehicle around parking lot returns data to request vehicle after receiving information.In addition to daily urban transportation scene In addition, vehicle-mounted net can also carry out in a network the correlation circumstance that information transmission makes driver obtain surrounding, packet to emergency event It includes and situations such as emergencies such as earthquake fire cause base station damage that can not communicate occurs.VANETs by one group have communication function and The vehicle of roadside unit forms.It is equipped on board unit, the vehicle of wireless communication is supported to answer since existing vehicle fleet size is numerous With having a extensive future；
It is well known that the critical function of network is to effectively share information, however the dynamic characteristic of VANET causes data acquisition to be imitated Rate is lower, but CCN is performed better than in terms of the data acquisition of network-caching mechanism.Therefore, number is improved using the advantage of CCN According to acquisition efficiency, researcher by CCN be introduced into VANET formed information centre VANET in.Due to the high-speed motion of node The vehicle movement speed for resulting in the VANET centered on information is fast, and network topology constantly changes, and causes node can not be for a long time Keep stable transmission link.Therefore how to realize that the data transmission of stability and high efficiency becomes pass urgently to be solved in vehicle-mounted net Key problem.
Summary of the invention
In view of this, to solve above-mentioned the deficiencies in the prior art, the purpose of the present invention is to provide one kind based on sub-clustering and Meet information centre's In-vehicle networking method for routing of perception, which records the movement rail of node using meeting between vehicle Mark, can be more convenient when to be routed in a network find the destination node constantly moved, while using existing The feature of vehicle nature sub-clustering carries out sub-clustering to node in transportation network, so that routing algorithm is preferably suitable for content center vehicle-mounted Network.
To achieve the above object, the technical scheme adopted by the invention is that：A kind of information based on sub-clustering and perception of meeting Center In-vehicle networking method for routing, includes the following steps：
(1) division region is carried out to vehicle, each region selects a node as cluster head, is responsible for managing other member's vehicles Information and information are propagated, be set in go to crossing prevariety it is all constant and all constant with the speed of vehicle in cluster；
(2) sub-clustering is carried out to the node in network, the node in each cluster includes two classes：One kind is ordinary node, ordinary node Safeguard that an ECRA table is used to record the record that meets with other nodes, another kind of is cluster head, and cluster head is the manager of entire cluster, cluster Two tables of head maintenance, are membership table and g-ECRA table respectively, and the form of membership table is (ID, IDi), wherein ID is represented in network and is saved The unique identification of point, IDiThe unique identification of the data of this nodal cache is represented, the form of g-ECRA table is (ID, Time, L (x, y)), wherein ID represents the node that meets, and Time represents Encounter Time, and L (x, y) represents encountered location；
(3) cluster head determines the situation of change of cluster interior nodes by periodic broadcasting：When cluster is added in node, node needs to send out to cluster head Send ECRA table, cluster head is handled the information in the ECRA table of node to form g-ECRA table, cluster head have in cluster it is all at The ECRA table data of member, and only cluster head needs and the cluster head of other clusters is communicated, and exchanges g- when different cluster heads are met ECRA table；
(4) different cluster heads are communicated according to routing algorithm in cluster, and wherein N represents the node in vehicle-mounted net, and Ns indicates source node, Nd indicates destination node, and D represents the content of source node Ns request, and CH represents the cluster head organized where node N, and process is as follows：
S1：When source node Ns request data, request content D is sent to cluster head CH first, cluster head CH is searched in group Whether there is nodal cache request content D, if buffered, data are directly just consigned to source node Ns in this cluster；Such as Fruit does not have, then needs to search the record that meets of related destination node Nd in g-ECRA table, and use part flooding normal direction week It encloses other cluster heads and sends request；
S2：Other receive the g-ECRA table of the cluster head inquiry local of broadcast request, if found identical with destination node Nd Information, is returned to this record that meets, inform time that this cluster of source requesting node Ns last time is met with destination node Nd with Place；
S3：After requesting cluster head to receive response message, the newest record that meets is screened from all response messages, and this is remembered For the place L (x, y) that meets of record as next-hop anchor, solicited message is sent to the node N of L (x, y) nearby by source cluster head, continues weight Multiple step S1；
S4：When cluster head has not found the route record that finally meets relevant to destination node Nd, then source cluster head carries out range more Add extensive local search, the node for receiving information repeats step S2, S3 and finally data are sent out until finding destination node Nd Give destination node Nd；
S5：With the continuous movement of node, when cluster goes to crossroad, cluster head is needed to newly added node or is left Node is managed and updates g-ECRA table and membership table；
(5) mechanism life cycle is used to storing data：With the continuous movement of node, stored in ECRA table more and more Meet record, the data of time too long can no longer effective property, just deleted when the life cycle TTL of data is expired, node with The time met, place and data cached ID are recorded when node meets and update TTL；If there is no this node in ECRA table Record, as soon as show that two vehicle of section event does not meet before this, then adding this data in ECRA table；If ECRA The record that this node is had existed in table shows that two vehicles once met in a period of time before this, then just updating ECRA table In the information such as Encounter Time, place of meeting.
Further, it is as follows group interior nodes to be added the process being managed for cluster head：Wherein NjIt represents and node, CH generation is added Table cluster head, TimegqRepresent Encounter Time of the node ID q in g-ECRA table of meeting, TimeqIt represents and node N is addedjIn ECRA In relation to the Encounter Time of IDq in table；
S1：When in the g-ECRA table of cluster head not about meet node ID q and be added node NjInformation of meeting, be added node Nj The ECRA table of oneself is sent to cluster head CH, cluster head CH updates the Encounter Time of membership table and node ID q in g-ECRA table Timegq；
S2：When in the g-ECRA table of cluster head about meet node ID q and be added node NjInformation of meeting, and Timegq≤ Timeq, then cluster head updates newest information of meeting in g-ECRA table, abandons information of the node ID q in g-ECRA table of meeting (IDq,Timeq,L(x,y)q)。
Further, it is as follows to leave the process being managed to group interior nodes for cluster head：Wherein NlRepresentative is wanted to leave cluster Node, CH：Represent cluster head, CHnRepresent new cluster head；
S1：As node NlCluster head CH is first judged whether it is when leaving, and if it is cluster head CH, then selects a new cluster head CHnIt takes over, cluster head CH is sent to g-ECRA table and membership table new cluster head CHn, new cluster head CHnSection is deleted from membership table Point NlInformation, while updating g-ECRA table interior joint NlInformation；
S2：As node NlIt is a member, then cluster head CH deletes related N from membership tablelInformation, and g-ECRA table send To Nl, while updating N in g-ECRA tablelInformation.
Further, including the performance estimating method to routing algorithm in the cluster, process is as follows：
The routing cost of ECRA is expressed as：
Wherein p1The request rate in network is represented, D is network radius,It represents during route querying, message is turned The average path distance of hair, the SPT distance during this between source and destination is m, SqFor the size of request packet,It is wide The cost broadcast, n are nodes number, SrFor the size for broadcasting response bag, p2Represent the record that meets for having requested date Probability；
Managing cost includes the maintenance of cluster interior nodes and joining and departing for node：
Wherein ShFor the size of hello packet, N is cluster interior joint number, and T is total time, tvIt sends and is spaced for hello packet, PjFor to The probability of cluster, S is added in junction nodejFor the size of join packet, PlFor the probability for leaving cluster to junction node, SlFor leave packet Size；
Total cost is the summation of the management cost of cluster in routing cost and network：CT=CS+kCM, wherein k is the total of cluster in network Number.
The beneficial effects of the invention are as follows：
(1) algorithm of the invention records the motion profile of node using meeting between vehicle, to be routed in a network When can be more convenient find the destination node constantly moved, while utilizing the vehicle nature sub-clustering in transportation network Feature carries out sub-clustering to node, and routing algorithm is made preferably to be suitable for content center In-vehicle networking；
(2) it is center In-vehicle networking that application scenarios of the invention, which are information, the advantages of combining CCN and VANET, in network in Appearance all caches in node, on the one hand, since the characteristics of distributed storage, data transmission needs not be along fixed chain in CCN Road carries out, and therefore, attacker cannot attack transmission link to ensure the safety of data；It on the other hand, can be from cache request The nodes of data obtains data, it means that if the data buffer storage of request is in node, node can direct returned data packet, Without further forwarding data packet, therefore, CCN is combined with VANETs with apparent advantage；
(3) in view of guaranteeing that data cached consistency will pay a high price in the VANET centered on information, therefore, The present invention solves this problem using real-time mechanism, in this mechanism, before TTL expires, still believes that data cached deposit It is in node, data should generally delete after expired, but sometimes deleted data are still popular, therefore, Bu Huizhi It is data cached to connect deletion, but is marked as after expired in vain；Meanwhile the present invention saves the finger for being directed toward the copy Needle, so as to retrieve replicate data, when multiple node frequent requests invalid data copies, node can be found by pointer Data copy is simultaneously data cached again, and certainly, invalid data should not store in the buffer forever, if invalid data are multiple System is not requested after expired, and data copy will be by complete deletion.
Specific embodiment
Specific embodiment is given below, to technical solution of the present invention make further it is clear, complete, explain in detail.This Embodiment is most preferred embodiment based on the technical solution of the present invention, but protection scope of the present invention is not limited to following implementation Example.
Embodiment
A kind of information centre's In-vehicle networking method for routing based on sub-clustering and perception of meeting, includes the following steps：
(1) division region is carried out to vehicle, each region selects a node as cluster head, is responsible for managing other member's vehicles Information and information are propagated, be set in go to crossing prevariety it is all constant and all constant with the speed of vehicle in cluster；
(2) sub-clustering is carried out to the node in network, the node in each cluster includes two classes：One kind is ordinary node, ordinary node Safeguard that an ECRA table is used to record the record that meets with other nodes, another kind of is cluster head, and cluster head is the manager of entire cluster, cluster Two tables of head maintenance, are membership table and g-ECRA table respectively, and the form of membership table is (ID, IDi), wherein ID is represented in network and is saved The unique identification of point, IDiThe unique identification of the data of this nodal cache is represented, the form of g-ECRA table is (ID, Time, L (x, y)), wherein ID represents the node that meets, and Time represents Encounter Time, and L (x, y) represents encountered location；
(3) cluster head determines the situation of change of cluster interior nodes by periodic broadcasting：When cluster is added in node, node needs to send out to cluster head Send ECRA table, cluster head is handled the information in the ECRA table of node to form g-ECRA table, cluster head have in cluster it is all at The ECRA table data of member, and only cluster head needs and the cluster head of other clusters is communicated, and exchanges g- when different cluster heads are met ECRA table；
(4) different cluster heads are communicated according to routing algorithm in cluster, and wherein N represents the node in vehicle-mounted net, and Ns indicates source node, Nd indicates destination node, and D represents the content of source node Ns request, and CH represents the cluster head organized where node N, and process is as follows：
S1：When source node Ns request data, request content D is sent to cluster head CH first, cluster head CH is searched in group Whether there is nodal cache request content D, if buffered, data are directly just consigned to source node Ns in this cluster；Such as Fruit does not have, then needs to search the record that meets of related destination node Nd in g-ECRA table, and use part flooding normal direction week It encloses other cluster heads and sends request；
S2：Other receive the g-ECRA table of the cluster head inquiry local of broadcast request, if found identical with destination node Nd Information, is returned to this record that meets, inform time that this cluster of source requesting node Ns last time is met with destination node Nd with Place；
S3：After requesting cluster head to receive response message, the newest record that meets is screened from all response messages, and this is remembered For the place L (x, y) that meets of record as next-hop anchor, solicited message is sent to the node N of L (x, y) nearby by source cluster head, continues weight Multiple step S1；
S4：When cluster head has not found the route record that finally meets relevant to destination node Nd, then source cluster head carries out range more Add extensive local search, the node for receiving information repeats step S2, S3 and finally data are sent out until finding destination node Nd Give destination node Nd；
S5：With the continuous movement of node, when cluster goes to crossroad, cluster head is needed to newly added node or is left Node is managed and updates g-ECRA table and membership table；
(5) mechanism life cycle is used to storing data：With the continuous movement of node, stored in ECRA table more and more Meet record, the data of time too long can no longer effective property, just deleted when the life cycle TTL of data is expired, node with The time met, place and data cached ID are recorded when node meets and update TTL；If there is no this node in ECRA table Record, as soon as show that two vehicle of section event does not meet before this, then adding this data in ECRA table；If ECRA The record that this node is had existed in table shows that two vehicles once met in a period of time before this, then just updating ECRA table In the information such as Encounter Time, place of meeting.
Further, it is as follows group interior nodes to be added the process being managed for cluster head：Wherein NjIt represents and node, CH generation is added Table cluster head, TimegqRepresent Encounter Time of the node ID q in g-ECRA table of meeting, TimeqIt represents and node N is addedjIn ECRA In relation to the Encounter Time of IDq in table；
S1：When in the g-ECRA table of cluster head not about meet node ID q and be added node NjInformation of meeting, be added node Nj The ECRA table of oneself is sent to cluster head CH, cluster head CH updates the Encounter Time of membership table and node ID q in g-ECRA table Timegq；
S2：When in the g-ECRA table of cluster head about meet node ID q and be added node NjInformation of meeting, and Timegq≤ Timeq, then cluster head updates newest information of meeting in g-ECRA table, abandons information of the node ID q in g-ECRA table of meeting (IDq,Timeq,L(x,y)q)。
Further, it is as follows to leave the process being managed to group interior nodes for cluster head：Wherein NlRepresentative is wanted to leave cluster Node, CH：Represent cluster head, CHnRepresent new cluster head；
S1：As node NlCluster head CH is first judged whether it is when leaving, and if it is cluster head CH, then selects a new cluster head CHnIt takes over, cluster head CH is sent to g-ECRA table and membership table new cluster head CHn, new cluster head CHnSection is deleted from membership table Point NlInformation, while updating g-ECRA table interior joint NlInformation；
S2：As node NlIt is a member, then cluster head CH deletes related N from membership tablelInformation, and g-ECRA table send To Nl, while updating N in g-ECRA tablelInformation.
Further, the Performance Evaluation process of routing algorithm is as follows in the cluster：
The routing cost of ECRA is expressed as：
Wherein p1The request rate in network is represented, D is network radius,It represents during route querying, message is turned The average path distance of hair, the SPT distance during this between source and destination is m, SqFor the size of request packet,It is wide The cost broadcast, n are nodes number, SrFor the size for broadcasting response bag, p2Represent the record that meets for having requested date Probability；
Managing cost includes the maintenance of cluster interior nodes and joining and departing for node：
Wherein ShFor the size of hello packet, N is cluster interior joint number, and T is total time, tvIt sends and is spaced for hello packet, PjFor to The probability of cluster, S is added in junction nodejFor the size of join packet, PlFor the probability for leaving cluster to junction node, SlFor leave packet Size；
Total cost is the summation of the management cost of cluster in routing cost and network：CT=CS+kCM, wherein k is the total of cluster in network Number.
Algorithm of the invention records the motion profile of node using meeting between vehicle, to be routed in a network When can be more convenient find the destination node constantly moved, while utilizing the vehicle nature sub-clustering in transportation network Feature carries out sub-clustering to node, and routing algorithm is made preferably to be suitable for content center In-vehicle networking；
It is center In-vehicle networking that application scenarios of the invention, which are information, the advantages of combining CCN and VANET, content in network It all caches in node, on the one hand, since the characteristics of distributed storage, data transmission needs not be along fixed link in CCN It carries out, therefore, attacker cannot attack transmission link to ensure the safety of data；It on the other hand, can be from caching number of request According to node obtain data, it means that if the data buffer storage of request is in node, node can direct returned data packet, and Without further forwarding data packet, therefore, CCN is combined with VANETs with apparent advantage；
In view of guaranteeing that data cached consistency will pay a high price in the VANET centered on information, therefore, this hair It is bright to solve this problem using real-time mechanism, in this mechanism, before TTL expires, still believe that data cached be present in In node, data should generally delete after expired, but sometimes deleted data are still popular, and therefore, will not directly delete Except data cached, but be marked as after expired it is invalid；Meanwhile the present invention saves the pointer for being directed toward the copy, with Replicate data can be retrieved, when multiple node frequent requests invalid data copies, node can find data by pointer Copy is simultaneously data cached again, and certainly, invalid data should not store in the buffer forever, if invalid data are replicated in It is not requested after expired, data copy will be by complete deletion.
Main feature of the invention, basic principle and advantages of the present invention has been shown and described above.Industry technology Personnel are it should be appreciated that the present invention is not limited to the above embodiments, and the above embodiments and description only describe this The principle of invention, without departing from the spirit and scope of the present invention, the present invention can also have various change according to the actual situation And improvement, these changes and improvements all fall within the protetion scope of the claimed invention.The claimed scope of the invention is by appended Claims and its equivalent thereof.

Claims (4)

1. a kind of information centre's In-vehicle networking method for routing based on sub-clustering and perception of meeting, which is characterized in that including following step Suddenly：
(1) division region is carried out to vehicle, each region selects a node as cluster head, is responsible for managing other member's vehicles Information and information are propagated, be set in go to crossing prevariety it is all constant and all constant with the speed of vehicle in cluster；
(2) sub-clustering is carried out to the node in network, the node in each cluster includes two classes：One kind is ordinary node, ordinary node Safeguard that an ECRA table is used to record the record that meets with other nodes, another kind of is cluster head, and cluster head is the manager of entire cluster, cluster Two tables of head maintenance, are membership table and g-ECRA table respectively, and the form of membership table is (ID, IDi), wherein ID is represented in network and is saved The unique identification of point, IDiThe unique identification of the data of this nodal cache is represented, the form of g-ECRA table is (ID, Time, L (x, y)), wherein ID represents the node that meets, and Time represents Encounter Time, and L (x, y) represents encountered location；
(3) cluster head determines the situation of change of cluster interior nodes by periodic broadcasting：When cluster is added in node, node needs to send out to cluster head Send ECRA table, cluster head is handled the information in the ECRA table of node to form g-ECRA table, cluster head have in cluster it is all at The ECRA table data of member, and only cluster head needs and the cluster head of other clusters is communicated, and exchanges g- when different cluster heads are met ECRA table；
(4) different cluster heads are communicated according to routing algorithm in cluster, and wherein N represents the node in vehicle-mounted net, and Ns indicates source node, Nd indicates destination node, and D represents the content of source node Ns request, and CH represents the cluster head organized where node N, and process is as follows：
S1：When source node Ns request data, request content D is sent to cluster head CH first, cluster head CH is searched in group Whether there is nodal cache request content D, if buffered, data are directly just consigned to source node Ns in this cluster；Such as Fruit does not have, then needs to search the record that meets of related destination node Nd in g-ECRA table, and use part flooding normal direction week It encloses other cluster heads and sends request；
S2：Other receive the g-ECRA table of the cluster head inquiry local of broadcast request, if found identical with destination node Nd Information, is returned to this record that meets, inform time that this cluster of source requesting node Ns last time is met with destination node Nd with Place；
S3：After requesting cluster head to receive response message, the newest record that meets is screened from all response messages, and this is remembered For the place L (x, y) that meets of record as next-hop anchor, solicited message is sent to the node N of L (x, y) nearby by source cluster head, continues weight Multiple step S1；
S4：When cluster head has not found the route record that finally meets relevant to destination node Nd, then source cluster head carries out range more Add extensive local search, the node for receiving information repeats step S2, S3 and finally data are sent out until finding destination node Nd Give destination node Nd；
S5：With the continuous movement of node, when cluster goes to crossroad, cluster head is needed to newly added node or is left Node is managed and updates g-ECRA table and membership table；
(5) mechanism life cycle is used to storing data：With the continuous movement of node, stored in ECRA table more and more Meet record, the data of time too long can no longer effective property, just deleted when the life cycle TTL of data is expired, node with The time met, place and data cached ID are recorded when node meets and update TTL；If there is no this node in ECRA table Record, as soon as show that two vehicle of section event does not meet before this, then adding this data in ECRA table；If ECRA The record that this node is had existed in table shows that two vehicles once met in a period of time before this, then just updating ECRA table In the information such as Encounter Time, place of meeting.
2. a kind of information centre's In-vehicle networking method for routing based on sub-clustering and perception of meeting according to claim 1, It is characterized in that, it is as follows that cluster head group interior nodes is added the process being managed：Wherein NjIt representing and node is added, CH represents cluster head, TimegqRepresent Encounter Time of the node ID q in g-ECRA table of meeting, TimeqIt represents and node N is addedjIn ECRA table in have Close the Encounter Time of IDq；
S1：When in the g-ECRA table of cluster head not about meet node ID q and be added node NjInformation of meeting, be added node Nj The ECRA table of oneself is sent to cluster head CH, cluster head CH updates the Encounter Time of membership table and node ID q in g-ECRA table Timegq；
S2：When in the g-ECRA table of cluster head about meet node ID q and be added node NjInformation of meeting, and Timegq≤ Timeq, then cluster head updates newest information of meeting in g-ECRA table, abandons information of the node ID q in g-ECRA table of meeting (IDq,Timeq,L(x,y)q)。
3. a kind of information centre's In-vehicle networking method for routing based on sub-clustering and perception of meeting according to claim 1, It is characterized in that, it is as follows that cluster head leaves the process being managed to group interior nodes：Wherein NlRepresent the node for wanting to leave cluster, CH： Represent cluster head, CHnRepresent new cluster head；
S1：As node NlCluster head CH is first judged whether it is when leaving, and if it is cluster head CH, then selects a new cluster head CHn It takes over, cluster head CH is sent to g-ECRA table and membership table new cluster head CHn, new cluster head CHnThe deletion of node N from membership tablel Information, while updating g-ECRA table interior joint NlInformation；
S2：As node NlIt is a member, then cluster head CH deletes related N from membership tablelInformation, and g-ECRA table send To Nl, while updating N in g-ECRA tablelInformation.
4. a kind of information centre's In-vehicle networking method for routing based on sub-clustering and perception of meeting according to claim 1, It is characterized in that, including the performance estimating method to routing algorithm in the cluster, process is as follows：
The routing cost of ECRA is expressed as：
Wherein p1The request rate in network is represented, D is network radius,It represents during route querying, message is forwarded Average path distance, during this between source and destination SPT distance be m, SqFor the size of request packet,For broadcast Cost, n be nodes number, SrFor the size for broadcasting response bag, p2Represent the general of the record that meets for having requested date Rate；
Managing cost includes the maintenance of cluster interior nodes and joining and departing for node：
Wherein ShFor the size of hello packet, N is cluster interior joint number, and T is total time, tvIt sends and is spaced for hello packet, PjFor to The probability of cluster, S is added in junction nodejFor the size of join packet, PlFor the probability for leaving cluster to junction node, SlFor leave packet Size；
Total cost is the summation of the management cost of cluster in routing cost and network：CT=CS+kCM, wherein k is the total of cluster in network Number.
CN201810640877.5A 2018-06-21 2018-06-21 Information center vehicle-mounted network routing method based on clustering and encounter sensing Active CN108882150B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810640877.5A CN108882150B (en) 2018-06-21 2018-06-21 Information center vehicle-mounted network routing method based on clustering and encounter sensing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810640877.5A CN108882150B (en) 2018-06-21 2018-06-21 Information center vehicle-mounted network routing method based on clustering and encounter sensing

Publications (2)

Publication Number Publication Date
CN108882150A true CN108882150A (en) 2018-11-23
CN108882150B CN108882150B (en) 2020-07-24

Family

ID=64340632

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810640877.5A Active CN108882150B (en) 2018-06-21 2018-06-21 Information center vehicle-mounted network routing method based on clustering and encounter sensing

Country Status (1)

Country Link
CN (1) CN108882150B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109819497A (en) * 2019-02-27 2019-05-28 中国联合网络通信集团有限公司 A kind of cluster head selection method and device
CN111194018A (en) * 2020-01-06 2020-05-22 北京邮电大学 Vehicle ad hoc network-oriented mobile edge data uploading method and system
CN114930957A (en) * 2020-01-28 2022-08-19 华为技术有限公司 Sidelink resource management

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102137462A (en) * 2011-04-19 2011-07-27 西安电子科技大学 Prediction-based routing method at intersection in vehicle self-organizing network
US20130079964A1 (en) * 2011-09-27 2013-03-28 Saturna Green Systems Inc. Vehicle communication, analysis and operation system
CN105657068A (en) * 2016-03-28 2016-06-08 厦门大学 Implement method based on vehicle moving information clustering
CN106131161A (en) * 2016-06-28 2016-11-16 中山大学 Under a kind of urban environment, vehicle-mounted road based on stability sub-clustering is by protocol method
CN106572512A (en) * 2016-07-18 2017-04-19 吉林大学 In-vehicle network GPSR protocol greedy forwarding method
CN106792977A (en) * 2017-01-25 2017-05-31 南通大学 Double cluster head method for routing based on traffic density in vehicular ad hoc network
CN108012244A (en) * 2017-11-29 2018-05-08 南京工业大学 Highway vehicular ad hoc network data services communication system and method based on cluster

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102137462A (en) * 2011-04-19 2011-07-27 西安电子科技大学 Prediction-based routing method at intersection in vehicle self-organizing network
US20130079964A1 (en) * 2011-09-27 2013-03-28 Saturna Green Systems Inc. Vehicle communication, analysis and operation system
CN105657068A (en) * 2016-03-28 2016-06-08 厦门大学 Implement method based on vehicle moving information clustering
CN106131161A (en) * 2016-06-28 2016-11-16 中山大学 Under a kind of urban environment, vehicle-mounted road based on stability sub-clustering is by protocol method
CN106572512A (en) * 2016-07-18 2017-04-19 吉林大学 In-vehicle network GPSR protocol greedy forwarding method
CN106792977A (en) * 2017-01-25 2017-05-31 南通大学 Double cluster head method for routing based on traffic density in vehicular ad hoc network
CN108012244A (en) * 2017-11-29 2018-05-08 南京工业大学 Highway vehicular ad hoc network data services communication system and method based on cluster

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
FEI-YUE WANG: "Parallel Control and Management for Intelligent Transportation Systems_ Concepts, Architectures, and Applications", 《IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109819497A (en) * 2019-02-27 2019-05-28 中国联合网络通信集团有限公司 A kind of cluster head selection method and device
CN111194018A (en) * 2020-01-06 2020-05-22 北京邮电大学 Vehicle ad hoc network-oriented mobile edge data uploading method and system
CN111194018B (en) * 2020-01-06 2021-03-02 北京邮电大学 Vehicle ad hoc network-oriented mobile edge data uploading method and system
CN114930957A (en) * 2020-01-28 2022-08-19 华为技术有限公司 Sidelink resource management

Also Published As

Publication number Publication date
CN108882150B (en) 2020-07-24

Similar Documents

Publication Publication Date Title
Glass et al. Leveraging MANET-based cooperative cache discovery techniques in VANETs: A survey and analysis
Kumar et al. Peer-to-peer cooperative caching for data dissemination in urban vehicular communications
CN104009920B (en) The processing method of data source movement, the method for E-Packeting and its device
Yu et al. Scalable VANET content routing using hierarchical bloom filters
Coutinho et al. Design guidelines for information-centric connected and autonomous vehicles
CN105682046B (en) Interest package transmitting method in vehicle-mounted name data network based on data attribute
CN108882150A (en) A kind of information centre's In-vehicle networking method for routing based on sub-clustering and perception of meeting
Nandan et al. AdTorrent: Delivering location cognizant advertisements to car networks
CN106255153B (en) Vehicle under car networking with caching capabilities divides group's cooperation transmission method
CN103780682B (en) A kind of information sharing system towards Ad Hoc network
CN104661275A (en) Method for transmitting data in opportunity network
Tiwari et al. Cooperative gateway cache invalidation scheme for internet-based vehicular ad hoc networks
Kumar et al. BIIR: A beacon information independent VANET routing algorithm with low broadcast overhead
Zhang et al. ECRA: An encounter-aware and clustering-based routing algorithm for information-centric VANETs
Rui et al. MUPF: Multiple unicast path forwarding in content-centric VANETs
Tiwari et al. Minimizing query delay using co-operation in ivanet
Woodrow et al. SPIN-IT: a data centric routing protocol for image retrieval in wireless networks
CN105228215B (en) More copy method for routing based on decision tree mechanism in vehicular ad hoc network
Morales et al. An adaptable destination-based dissemination algorithm using a publish/subscribe model in vehicular networks
CN109285386A (en) A kind of city vehicle-mounted net network data transmission mechanism towards intelligent transportation
Vaghela et al. Vehicular parking space discovery with agent approach
CN107181683A (en) With reference to name data network and the In-vehicle networking data distribution route maintenance method of road name
Wang et al. NDNVIC: named data networking for vehicle infrastructure cooperation
Wang et al. Varied priority-based data forwarding via NDN in VANET
Verma et al. Context-based routing protocols for oppnets

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant