CN108882150B - Information center vehicle-mounted network routing method based on clustering and encounter sensing - Google Patents

Information center vehicle-mounted network routing method based on clustering and encounter sensing Download PDF

Info

Publication number
CN108882150B
CN108882150B CN201810640877.5A CN201810640877A CN108882150B CN 108882150 B CN108882150 B CN 108882150B CN 201810640877 A CN201810640877 A CN 201810640877A CN 108882150 B CN108882150 B CN 108882150B
Authority
CN
China
Prior art keywords
node
cluster
ecra
cluster head
encounter
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810640877.5A
Other languages
Chinese (zh)
Other versions
CN108882150A (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 routing method of an information center vehicle-mounted network based on clustering and encounter perception comprises the following steps: dividing the vehicles into regions, selecting one node as a cluster head in each region, managing information and information transmission of other member vehicles, and setting that the clusters are unchanged before the vehicles arrive at the intersection and the speeds of the vehicles in the same cluster are unchanged; clustering nodes in a network, determining the change condition of the nodes in the cluster by periodically broadcasting cluster heads, simultaneously communicating different cluster heads according to an intra-cluster routing algorithm, and using a life cycle mechanism for stored data; the algorithm of the invention utilizes the meeting between vehicles to record the motion trail of the nodes, so that the destination nodes which move continuously can be found more conveniently when routing is carried out in the network, and meanwhile, the nodes are clustered by utilizing the characteristic of natural clustering of vehicles in a traffic network, so that the routing algorithm is better suitable for a content center vehicle-mounted network.

Description

Information center vehicle-mounted network routing method based on clustering and encounter sensing
Technical Field
The invention relates to the field of information center vehicle-mounted networks, in particular to an information center vehicle-mounted network routing method based on clustering and encounter perception.
Background
MANET (mobile Ad Hoc network), namely a mobile Ad Hoc network, which is a wireless multi-hop access network without a fixed control center and infrastructure, the MANET can operate as a relatively independent network, nodes in the network have no fixed positions and can move randomly, and wireless transmission of information such as voice, data, graphic images and the like among mobile nodes is supported in a severe environment in a temporary networking mode; the MANET has wide application fields, including military fields, emergency and temporary occasions, sensor network and Internet of things fields, personal communication and the like, and can play a role in the automobile field;
vanet (vehicular Ad Hoc network), i.e. a vehicle Ad Hoc network, is an application of MANET in real roads, and a vehicle-mounted network can enable a driver to more comprehensively master surrounding information including parking lot information, restaurant information, road condition information and the like, for example, a vehicle wants to obtain the parking space condition of a surrounding parking lot, the vehicle can send a request to the vehicles around the parking lot, and the vehicles around the parking lot return data to the requesting vehicle after receiving the information. Besides daily urban traffic scenes, the vehicle-mounted network can transmit information in the network for emergencies so that drivers can obtain surrounding relevant conditions, including the conditions that a base station is damaged and communication cannot be carried out due to emergencies such as earthquakes and fires. VANETs consist of a group of vehicles with communication functions and roadside units. The vehicle-mounted unit is arranged to support the wireless communication vehicle, and the existing vehicles are numerous, so that the application prospect is wide;
it is well known that an important function of the network is to share information efficiently, however, the dynamic nature of VANET results in inefficient data acquisition, but CCN performs better in terms of data collection by the network caching mechanism. Therefore, by utilizing the advantages of the CCN to improve the data acquisition efficiency, researchers introduce the CCN into VANET forming an information center. Due to the fact that the high-speed movement of the nodes causes the vehicle moving speed of the VANET taking information as the center to be high, the network topology changes continuously, and the nodes cannot keep stable transmission links for a long time. Therefore, how to realize stable and efficient data transmission in the vehicle-mounted network becomes a critical problem to be solved urgently.
Disclosure of Invention
In view of the above, to solve the above-mentioned deficiencies of the prior art, an object of the present invention is to provide a routing method for an information center vehicle-mounted network based on clustering and encounter sensing, where the algorithm uses encounter between vehicles to record the motion trajectory of nodes, so that a continuously moving destination node can be found more conveniently when routing is performed in the network, and meanwhile, the routing algorithm is better adapted to the content center vehicle-mounted network by clustering the nodes by using the characteristic of natural clustering of vehicles in a traffic network.
In order to achieve the purpose, the technical scheme adopted by the invention is as follows: a routing method of an information center vehicle-mounted network based on clustering and encounter perception comprises the following steps:
(1) dividing the vehicles into regions, selecting one node as a cluster head in each region, managing information and information transmission of other member vehicles, and setting that the clusters are unchanged before the vehicles arrive at the intersection and the speeds of the vehicles in the same cluster are unchanged;
(2) clustering nodes in a network, wherein the nodes in each cluster comprise two types: one is a common node which maintains an ECRA table for recording the encounter records with other nodes, the other is a cluster head which is the manager of the whole cluster, the cluster head maintains two tables which are a member table and a g-ECRA table respectively, and the form of the member table is (ID, ID)i) Wherein ID represents a unique identification of a node in the network, IDiRepresenting the unique identification of the data cached by the node, the form of the g-ECRA table is (ID, Time, L (x, y)), Time represents the encounter Time, L (x, y) represents the encounter position;
(3) the cluster head determines the change condition of the nodes in the cluster through periodic broadcasting: when a node joins a cluster, the node needs to send an ECRA table to a cluster head, the cluster head processes information in the ECRA table of the node to form a g-ECRA table, the cluster head has ECRA table data of all members in the cluster, only the cluster head needs to communicate with cluster heads of other clusters, and the g-ECRA table is exchanged when different cluster heads meet;
(4) different cluster heads communicate according to an intra-cluster routing algorithm, wherein N represents a node in a vehicle-mounted network, Ns represents a source node, Nd represents a destination node, D represents content requested by the source node Ns, and CH represents a cluster head of a group where the node N is located, and the process is as follows:
s1: when a source node Ns requests data, firstly, the request content D is sent to a cluster head CH, the cluster head CH searches whether a node in the cluster caches the request content D or not in the group, and if the node has cached the request content D, the data is directly delivered to the source node Ns; if not, searching an encounter record related to the destination node Nd in the g-ECRA table, and sending a request to other surrounding cluster heads by using local flooding;
s2: other cluster heads receiving the broadcast request inquire a local g-ECRA table, if the same information as the destination node Nd is found, the meeting record is returned, and the time and the place of the last meeting of the cluster with the destination node Nd are informed to the source request node Ns;
s3, when the request cluster head receives the response information, the latest encounter record is screened from all the response information, the encounter point L (x, y) of the record is used as the next hop anchor, the source cluster head sends the request information to the node N near L (x, y), and the step S1 is repeated continuously;
s4: when the cluster head does not find the last encounter route record related to the destination node Nd, the source cluster head carries out local search with wider range, the nodes receiving the information repeat the steps S2 and S3 until the destination node Nd is found, and finally the data are sent to the destination node Nd;
s5: along with the continuous movement of the nodes, when the cluster moves to the crossroad, the cluster head needs to manage the newly added node or the leaving node and update the g-ECRA table and the member table;
(5) the survival cycle mechanism is used for stored data, more and more encounter records are stored in an ECRA table along with the continuous movement of nodes, the timeliness of the data is lost after long time, the data is deleted when the life cycle TT L of the data expires, the time and the place of the encounter are recorded when the nodes meet the nodes, the ID of the cached data is recorded and the TT L is updated when the ECRA table does not have the record of the node, the data is added into the ECRA table when the two vehicles do not meet in the previous period of events, and the information of the encounter time and the encounter place in the ECRA table is updated when the record of the node already exists in the ECRA table, the two vehicles meet in the previous period of time.
Further, the process of managing the node joining in the group by the cluster head is as follows: wherein N isjRepresents joining node, CH represents cluster head, TimegqRepresents the encounter Time, of the encountering node IDq in the g-ECRA tableqRepresenting a joining node NjECRA tables in (1) regarding the encounter time of IDq;
s1: when there is no meeting node IDq and joining node N in the g-ECRA table of the cluster headjThe encounter information of (2) is added into the node NjSending its ECRA table to cluster head CH, cluster head CH updating member table and meeting Time of node IDq in g-ECRA tablegq；
S2: when the g-ECRA table of the cluster head contains the encounter node IDq and the joining node NjMeet information of, and Timegq≤TimeqThe cluster head updates the latest encounter information in the g-ECRA table and discards the encounter node IDq Information (ID) in the g-ECRA tableq，Timeq，L(x，y)q)。
Further, the process of managing departure of the intra-group node by the cluster head is as follows: wherein N is1Represents a node that wants to leave the cluster, CH: represents a cluster head, CHnRepresents a new cluster head;
s1: when node N1Judging whether the cluster head CH is the cluster head CH or not when the cluster head CH leaves, if so, selecting a new cluster head CHnIn succession, the cluster head CH sends the g-ECRA table and the member table to the new cluster head CHnNew cluster head CHnDeleting node N from member table1Simultaneously update node N in the g-ECRA table1The information of (a);
s2: when node N1Is a member, the cluster head CH deletes the associated N from the member table1And sends the g-ECRA table toN1Simultaneously updating N in the g-ECRA table1The information of (1).
Further, the method comprises a performance evaluation method for the routing algorithm in the cluster, and the process is as follows:
the routing cost of ECRA is expressed as:
Figure BDA0002502654360000051
wherein p is1Representing the request rate in the network, D is the network radius,
Figure BDA0002502654360000052
represents the average path distance over which the message is forwarded during the route lookup, during which the SPT distance between the source and destination is m, SqIn order to request the size of the packet,
Figure BDA0002502654360000053
for the cost of broadcasting, n is the number of nodes in the network, SrFor broadcasting the size of the response packet, p2Representing the probability of an encounter record with the requested data;
the management cost comprises the maintenance of nodes in the cluster and the joining and leaving of the nodes:
Figure BDA0002502654360000061
wherein ShIs the size of the hello packet, N is the number of nodes in the cluster, T is the total time, TvFor hello packet transmission interval, PjProbability of joining a cluster to a junction node, SjIs the size of the join packet, P1Probability of leaving cluster for node to intersection, SlIs the size of the leave packet;
the total cost is the sum of the routing cost and the management cost of the clusters in the network:
CT＝Cs+kCMwhere k is the total number of clusters in the network.
The invention has the beneficial effects that:
(1) the algorithm of the invention records the movement track of the node by using the encounter between vehicles so as to more conveniently find the destination node which continuously moves when routing is carried out in the network, and simultaneously clusters the node by using the characteristic of natural clustering of vehicles in a traffic network, so that the routing algorithm is better suitable for a content center vehicle-mounted network;
(2) the application scenario of the invention is that the information is a central vehicle-mounted network, which combines the advantages of the CCN and the VANET, and the content in the network is cached in the nodes, on one hand, due to the characteristic of distributed storage in the CCN, the data transmission does not need to be carried out along a fixed link, therefore, an attacker can not attack the transmission link to ensure the security of the data; on the other hand, data can be obtained from a node which caches the requested data, which means that if the requested data is cached in the node, the node can directly return the data packet without further forwarding the data packet, so that the combination of the CCN and the VANETs has obvious advantages;
(3) the present invention solves this problem by providing a real-time mechanism in which, before TT L expires, the cached data is still considered to be present in the node, and the data should generally be deleted after expiration, but sometimes the deleted data is still popular, so that the cached data is not deleted directly, but rather marked as invalid after expiration, and at the same time, the present invention maintains a pointer to the copy so that the copied data can be retrieved, when multiple nodes frequently request invalid data copies, the nodes can find the data copy and cache the data again via the pointer, and of course, the invalid data should not be stored permanently in the cache, and if invalid data copies are not requested after expiration, the data copy will be deleted completely.
Detailed Description
The following specific examples are given to further clarify, complete and detailed the technical solution of the present invention. The present embodiment is a preferred embodiment based on the technical solution of the present invention, but the scope of the present invention is not limited to the following embodiments.
Examples
A routing method of an information center vehicle-mounted network based on clustering and encounter perception comprises the following steps:
(1) dividing the vehicles into regions, selecting one node as a cluster head in each region, managing information and information transmission of other member vehicles, and setting that the clusters are unchanged before the vehicles arrive at the intersection and the speeds of the vehicles in the same cluster are unchanged;
(2) clustering nodes in a network, wherein the nodes in each cluster comprise two types: one is a common node which maintains an ECRA table for recording the encounter records with other nodes, the other is a cluster head which is the manager of the whole cluster, the cluster head maintains two tables which are a member table and a g-ECRA table respectively, and the form of the member table is (ID, ID)i) Wherein ID represents a unique identification of a node in the network, IDiRepresenting the unique identification of the data cached by the node, the form of the g-ECRA table is (ID, Time, L (x, y)), Time represents the encounter Time, L (x, y) represents the encounter position;
(3) the cluster head determines the change condition of the nodes in the cluster through periodic broadcasting: when a node joins a cluster, the node needs to send an ECRA table to a cluster head, the cluster head processes information in the ECRA table of the node to form a g-ECRA table, the cluster head has ECRA table data of all members in the cluster, only the cluster head needs to communicate with cluster heads of other clusters, and the g-ECRA table is exchanged when different cluster heads meet;
(4) different cluster heads communicate according to an intra-cluster routing algorithm, wherein N represents a node in a vehicle-mounted network, Ns represents a source node, Nd represents a destination node, D represents content requested by the source node Ns, and CH represents a cluster head of a group where the node N is located, and the process is as follows:
s1: when a source node Ns requests data, firstly, the request content D is sent to a cluster head CH, the cluster head CH searches whether a node in the cluster caches the request content D or not in the group, and if the node has cached the request content D, the data is directly delivered to the source node Ns; if not, searching an encounter record related to the destination node Nd in the g-ECRA table, and sending a request to other surrounding cluster heads by using local flooding;
s2: other cluster heads receiving the broadcast request inquire a local g-ECRA table, if the same information as the destination node Nd is found, the meeting record is returned, and the time and the place of the last meeting of the cluster with the destination node Nd are informed to the source request node Ns;
s3, when the request cluster head receives the response information, the latest encounter record is screened from all the response information, the encounter point L (x, y) of the record is used as the next hop anchor, the source cluster head sends the request information to the node N near L (x, y), and the step S1 is repeated continuously;
s4: when the cluster head does not find the last encounter route record related to the destination node Nd, the source cluster head carries out local search with wider range, the nodes receiving the information repeat the steps S2 and S3 until the destination node Nd is found, and finally the data are sent to the destination node Nd;
s5: along with the continuous movement of the nodes, when the cluster moves to the crossroad, the cluster head needs to manage the newly added node or the leaving node and update the g-ECRA table and the member table;
(5) the survival cycle mechanism is used for stored data, more and more encounter records are stored in an ECRA table along with the continuous movement of nodes, the timeliness of the data is lost after long time, the data is deleted when the life cycle TT L of the data expires, the time and the place of the encounter are recorded when the nodes meet the nodes, the ID of the cached data is recorded and the TT L is updated when the ECRA table does not have the record of the node, the data is added into the ECRA table when the two vehicles do not meet in the previous period of events, and the information of the encounter time and the encounter place in the ECRA table is updated when the record of the node already exists in the ECRA table, the two vehicles meet in the previous period of time.
Further, the process of managing the node joining in the group by the cluster head is as follows: wherein N isjRepresents joining node, CH represents cluster head, TimegqRepresents the encounter Time, of the encountering node IDq in the g-ECRA tableqRepresenting a joining node NjECRA tables in (1) regarding the encounter time of IDq;
s1: when cluster head in g-ECRA tableThere is no correlation between the encounter node IDq and the joining node NjThe encounter information of (2) is added into the node NjSending its ECRA table to cluster head CH, cluster head CH updating member table and meeting Time of node IDq in g-ECRA tablegq；
S2: when the g-ECRA table of the cluster head contains the encounter node IDq and the joining node NjMeet information of, and Timegq≤TimeqThe cluster head updates the latest encounter information in the g-ECRA table and discards the encounter node IDq Information (ID) in the g-ECRA tableq，Timeq，L(x，y)q)。
Further, the process of managing departure of the intra-group node by the cluster head is as follows: wherein N is1Represents a node that wants to leave the cluster, CH: represents a cluster head, CHnRepresents a new cluster head;
s1: when node N1Judging whether the cluster head CH is the cluster head CH or not when the cluster head CH leaves, if so, selecting a new cluster head CHnIn succession, the cluster head CH sends the g-ECRA table and the member table to the new cluster head CHnNew cluster head CHnDeleting node N from member table1Simultaneously update node N in the g-ECRA table1The information of (a);
s2: when node N1Is a member, the cluster head CH deletes the associated N from the member table1And sends the g-ECRA table to N1Simultaneously updating N in the g-ECRA table1The information of (1).
Further, the performance evaluation process of the intra-cluster routing algorithm is as follows:
the routing cost of ECRA is expressed as:
Figure BDA0002502654360000101
wherein p is1Representing the request rate in the network, D is the network radius,
Figure BDA0002502654360000102
representing the average path distance over which messages are forwarded during a route lookup procedure during which the source isSPT distance from destination is m, SqIn order to request the size of the packet,
Figure BDA0002502654360000103
for the cost of broadcasting, n is the number of nodes in the network, SrFor broadcasting the size of the response packet, p2Representing the probability of an encounter record with the requested data;
the management cost comprises the maintenance of nodes in the cluster and the joining and leaving of the nodes:
Figure BDA0002502654360000104
wherein ShIs the size of the hello packet, N is the number of nodes in the cluster, T is the total time, TvFor hello packet transmission interval, PjProbability of joining a cluster to a junction node, SjIs the size of the join packet, P1Probability of leaving cluster for node to intersection, SlIs the size of the leave packet;
the total cost is the sum of the routing cost and the management cost of the clusters in the network:
CT＝Cs+kCMwhere k is the total number of clusters in the network.
The algorithm of the invention records the movement track of the node by using the encounter between vehicles so as to more conveniently find the destination node which continuously moves when routing is carried out in the network, and simultaneously clusters the node by using the characteristic of natural clustering of vehicles in a traffic network, so that the routing algorithm is better suitable for a content center vehicle-mounted network;
the application scenario of the invention is that the information is a central vehicle-mounted network, which combines the advantages of the CCN and the VANET, and the content in the network is cached in the nodes, on one hand, due to the characteristic of distributed storage in the CCN, the data transmission does not need to be carried out along a fixed link, therefore, an attacker can not attack the transmission link to ensure the security of the data; on the other hand, data can be obtained from a node which caches the requested data, which means that if the requested data is cached in the node, the node can directly return the data packet without further forwarding the data packet, so that the combination of the CCN and the VANETs has obvious advantages;
the present invention solves this problem by providing a real-time mechanism in which, before TT L expires, the cached data is still considered to be present in the node, and the data should generally be deleted after expiration, but sometimes the deleted data is still popular, so that the cached data is not deleted directly, but rather marked as invalid after expiration, and at the same time, the present invention maintains a pointer to the copy so that the copied data can be retrieved, when multiple nodes frequently request invalid data copies, the nodes can find the data copy and cache the data again via the pointer, and of course, the invalid data should not be stored permanently in the cache, and if invalid data copies are not requested after expiration, the data copy will be deleted completely.
The principal features, principles and advantages of the invention have been shown and described above. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are described in the specification and illustrated only to explain the principles of the invention, but that various changes and modifications may be made therein without departing from the spirit and scope of the invention as expressed in the following claims. The scope of the invention is defined by the appended claims and equivalents thereof.

Claims (4)

1. A routing method of an information center vehicle-mounted network based on clustering and encounter perception is characterized by comprising the following steps:
(1) dividing the vehicles into regions, selecting one node as a cluster head in each region, managing information and information transmission of other member vehicles, and setting that the clusters are unchanged before the vehicles arrive at the intersection and the speeds of the vehicles in the same cluster are unchanged;
(2) clustering nodes in a network, wherein the nodes in each cluster comprise two types: one is a common node, and the common node maintains an ECRA table for recording the ECRA tableThe other kind is a cluster head which is a manager of the whole cluster, the cluster head maintains two tables which are a member table and a g-ECRA table respectively, and the form of the member table is (ID, ID)i) Wherein ID represents a unique identification of a node in the network, IDiRepresenting the unique identification of the data cached by the node, the form of the g-ECRA table is (ID, Time, L (x, y)), Time represents the encounter Time, L (x, y) represents the encounter position;
(3) the cluster head determines the change condition of the nodes in the cluster through periodic broadcasting: when a node joins a cluster, the node needs to send an ECRA table to a cluster head, the cluster head processes information in the ECRA table of the node to form a g-ECRA table, the cluster head has ECRA table data of all members in the cluster, only the cluster head needs to communicate with cluster heads of other clusters, and the g-ECRA table is exchanged when different cluster heads meet;
(4) different cluster heads communicate according to an intra-cluster routing algorithm, wherein N represents a node in a vehicle-mounted network, Ns represents a source node, Nd represents a destination node, D represents content requested by the source node Ns, and CH represents a cluster head of a group where the node N is located, and the process is as follows:
s1: when a source node Ns requests data, firstly, the request content D is sent to a cluster head CH, the cluster head CH searches whether a node in the cluster caches the request content D or not in the group, and if the node has cached the request content D, the data is directly delivered to the source node Ns; if not, searching an encounter record related to the destination node Nd in the g-ECRA table, and sending a request to other surrounding cluster heads by using local flooding;
s2: other cluster heads receiving the broadcast request inquire a local g-ECRA table, if the same information as the destination node Nd is found, the meeting record is returned, and the time and the place of the last meeting of the cluster with the destination node Nd are informed to the source request node Ns;
s3, when the request cluster head receives the response information, the latest encounter record is screened from all the response information, the encounter point L (x, y) of the record is used as the next hop anchor, the source cluster head sends the request information to the node N near L (x, y), and the step S1 is repeated continuously;
s4: when the cluster head does not find the last encounter route record related to the destination node Nd, the source cluster head carries out local search with wider range, the nodes receiving the information repeat the steps S2 and S3 until the destination node Nd is found, and finally the data are sent to the destination node Nd;
s5: along with the continuous movement of the nodes, when the cluster moves to the crossroad, the cluster head needs to manage the newly added node or the leaving node and update the g-ECRA table and the member table;
(5) the survival cycle mechanism is used for stored data, more and more encounter records are stored in an ECRA table along with the continuous movement of nodes, the timeliness of the data is lost after long time, the data is deleted when the life cycle TT L of the data expires, the time and the place of the encounter are recorded when the nodes meet the nodes, the ID of the cached data is recorded and the TT L is updated when the ECRA table does not have the record of the node, the data is added into the ECRA table when the two vehicles do not meet in the previous period of events, and the information of the encounter time and the encounter place in the ECRA table is updated when the record of the node already exists in the ECRA table, the two vehicles meet in the previous period of time.
2. The method for routing the information center vehicle-mounted network based on the clustering and the encounter awareness as claimed in claim 1, wherein the process of managing the joining of the intra-group nodes by the cluster head is as follows: wherein N isjRepresents joining node, CH represents cluster head, TimegqRepresents the encounter Time, of the encountering node IDq in the g-ECRA tableqRepresenting a joining node NjECRA tables in (1) regarding the encounter time of IDq;
s1: when there is no meeting node IDq and joining node N in the g-ECRA table of the cluster headjThe encounter information of (2) is added into the node NjSending its ECRA table to cluster head CH, cluster head CH updating member table and meeting Time of node IDq in g-ECRA tablegq；
S2: when the g-ECRA table of the cluster head contains the encounter node IDq and the joining node NjMeet information of, and Timegq≤TimeqThe cluster head updates the latest encounter information in the g-ECRA tableDiscard the Information (ID) of the encounter node IDq in the g-ECRA tableq，Timeq，L(x，y)q)。
3. The method for routing the information center vehicle-mounted network based on the clustering and the encounter awareness as claimed in claim 1, wherein the cluster head manages the departure of the intra-group nodes as follows: wherein N is1Represents a node that wants to leave the cluster, CH: represents a cluster head, CHnRepresents a new cluster head;
s1: when node N1Judging whether the cluster head CH is the cluster head CH or not when the cluster head CH leaves, if so, selecting a new cluster head CHnIn succession, the cluster head CH sends the g-ECRA table and the member table to the new cluster head CHnNew cluster head CHnDeleting node N from member table1Simultaneously update node N in the g-ECRA table1The information of (a);
s2: when node N1Is a member, the cluster head CH deletes the associated N from the member table1And sends the g-ECRA table to N1Simultaneously updating N in the g-ECRA table1The information of (1).
4. The method for routing the information center vehicle-mounted network based on the clustering and the encounter awareness as claimed in claim 1, wherein the method for evaluating the performance of the routing algorithm in the cluster comprises the following steps:
the routing cost of ECRA is expressed as:
Figure FDA0002502654350000041
wherein p is1Representing the request rate in the network, D is the network radius,
Figure FDA0002502654350000042
represents the average path distance over which the message is forwarded during the route lookup, during which the SPT distance between the source and destination is m, SqIn order to request the size of the packet,
Figure FDA0002502654350000043
for the cost of broadcasting, n is the number of nodes in the network, SrFor broadcasting the size of the response packet, p2Representing the probability of an encounter record with the requested data;
the management cost comprises the maintenance of nodes in the cluster and the joining and leaving of the nodes:
Figure FDA0002502654350000044
wherein ShIs the size of the hello packet, N is the number of nodes in the cluster, T is the total time, TvFor hello packet transmission interval, PjProbability of joining a cluster to a junction node, SjIs the size of the join packet, P1Probability of leaving cluster for node to intersection, SlIs the size of the leave packet;
the total cost is the sum of the routing cost and the management cost of the clusters in the network:
CT＝CS+kCMwhere k is the total number of clusters in the network.
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 CN108882150A (en) 2018-11-23
CN108882150B true 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)

Families Citing this family (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
CN111194018B (en) * 2020-01-06 2021-03-02 北京邮电大学 Vehicle ad hoc network-oriented mobile edge data uploading method and system
US11432106B2 (en) * 2020-01-28 2022-08-30 Huawei Technologies Co., Ltd. Side link resource management

Citations (6)

* 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
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

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130079964A1 (en) * 2011-09-27 2013-03-28 Saturna Green Systems Inc. Vehicle communication, analysis and operation system

Patent Citations (6)

* 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
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
Parallel Control and Management for Intelligent Transportation Systems_ Concepts, Architectures, and Applications;Fei-Yue Wang;《IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS》;20100930;全文 *

Also Published As

Publication number Publication date
CN108882150A (en) 2018-11-23

Similar Documents

Publication Publication Date Title
US20210345075A1 (en) Content centric dynamic ad hoc networking
Nadeem et al. TrafficView: traffic data dissemination using car-to-car communication
CN108882150B (en) Information center vehicle-mounted network routing method based on clustering and encounter sensing
CN106255153B (en) Vehicle under car networking with caching capabilities divides group's cooperation transmission method
Tsao et al. Design and evaluation of a two-tier peer-to-peer traffic information system
CN109600715B (en) Internet of vehicles V2X communication auxiliary file downloading method
CN108430049B (en) Vehicle-mounted named data network data distribution method based on roadside unit
KR101209197B1 (en) Vehicle group management method and vehicle group registration method for providing vehicle location service
CN106603658B (en) Internet of vehicles data transmission method and device based on software defined network
Chen et al. VAN: Vehicle-assisted shortest-time path navigation
Prates et al. GeoZone: An interest-packet forwarding mechanism based on dissemination zone for content-centric vehicular networks
CN111050300B (en) Internet of vehicles routing method based on named data network
Tian et al. Routing approach in CarTALK 2000 project
Vaghela et al. Vehicular parking space discovery with agent approach
Morales et al. An adaptable destination-based dissemination algorithm using a publish/subscribe model in vehicular networks
CN111641923B (en) Social networking car dual-mode interest tag forwarding system and method based on fog calculation
Ahmadifard et al. ISEFF: an ID-based scalable and efficient distributed file sharing technique in vehicular ad hoc networks
Bai et al. VLS: A map-based vehicle location service for city environments
Marinov Comparative analysis of AODV, DSDV and DSR routing protocols in VANET
Al-Qutwani et al. Request/advertise-based content forwarding in vehicular named data networking
Boussedjra et al. Map-based location service for VANET
CN109285386A (en) A kind of city vehicle-mounted net network data transmission mechanism towards intelligent transportation
Hsieh et al. Road layout adaptive overlay multicast for urban vehicular ad hoc networks
Toulni et al. Cluster-based routing protocol using traffic information
Seet et al. Multi-home region location service for wireless ad hoc networks: An adaptive demand-driven approach

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