CN114650500A - Data distribution method and device, electronic equipment and storage medium - Google Patents

Data distribution method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN114650500A
CN114650500A CN202210220751.9A CN202210220751A CN114650500A CN 114650500 A CN114650500 A CN 114650500A CN 202210220751 A CN202210220751 A CN 202210220751A CN 114650500 A CN114650500 A CN 114650500A
Authority
CN
China
Prior art keywords
vehicle
cluster
vehicles
current
data distribution
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
Application number
CN202210220751.9A
Other languages
Chinese (zh)
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.)
Jiangsu Mobile Information System Integration Co ltd
China Mobile Communications Group Co Ltd
China Mobile Group Jiangsu Co Ltd
Original Assignee
Jiangsu Mobile Information System Integration Co ltd
China Mobile Communications Group Co Ltd
China Mobile Group Jiangsu Co Ltd
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 Jiangsu Mobile Information System Integration Co ltd, China Mobile Communications Group Co Ltd, China Mobile Group Jiangsu Co Ltd filed Critical Jiangsu Mobile Information System Integration Co ltd
Priority to CN202210220751.9A priority Critical patent/CN114650500A/en
Publication of CN114650500A publication Critical patent/CN114650500A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • 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
    • H04W4/026—Services making use of location information using location based information parameters using orientation information, e.g. compass
    • 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
    • H04W4/027—Services making use of location information using location based information parameters using movement velocity, acceleration information
    • 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
    • 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/46—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for vehicle-to-vehicle communication [V2V]
    • 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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • 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
    • 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)
  • Traffic Control Systems (AREA)

Abstract

The application relates to the technical field of wireless transmission, and provides a data distribution method, a data distribution device, electronic equipment and a storage medium. The method comprises the following steps: determining a sender vehicle from a vehicle cluster based on the service capability of a current vehicle and the service capability broadcasted by each member vehicle in the vehicle cluster under the condition that the current vehicle is a cluster head in the vehicle cluster, wherein the vehicle cluster is determined based on each vehicle adjacent to the current vehicle in the same driving direction; broadcasting the vehicle identification of the sender vehicle to request the sender vehicle to distribute the cache data. The data distribution method, the data distribution device, the electronic equipment and the storage medium improve the stability of communication links between vehicles in a cluster and reduce network overhead; the vehicle request meeting time is shortened, and the data distribution efficiency of the vehicle can be effectively improved.

Description

Data distribution method and device, electronic equipment and storage medium
Technical Field
The present application relates to the field of wireless transmission technologies, and in particular, to a data distribution method, apparatus, electronic device, and storage medium.
Background
The vehicle-mounted self-organizing network is formed by connecting vehicles through an ad hoc (point-to-point) network and consists of a Road Side Unit (RSU) and a vehicle-mounted control unit (OBU). The OBU installed in a Vehicle can be regarded as a mobile node, and the basic communication form of the Vehicle can be divided into Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I).
Due to the high-speed mobility of the vehicle, the limited bandwidth of V2I and the high demand for data service, the RSU is likely to be unable to complete the service within its coverage area, so that in the current vehicle ad hoc network, the request delay of the vehicle is long and the data distribution efficiency is low.
Disclosure of Invention
The embodiment of the application provides a data distribution method, a data distribution device, electronic equipment and a storage medium, and aims to solve the technical problems that in the existing vehicle-mounted ad hoc network, the request time delay of a vehicle is long, and the data distribution efficiency is low.
In a first aspect, an embodiment of the present application provides a data distribution method, including:
determining a sender vehicle from a vehicle cluster based on the service capability of a current vehicle and the service capability broadcasted by each member vehicle in the vehicle cluster under the condition that the current vehicle is a cluster head in the vehicle cluster, wherein the vehicle cluster is determined based on each vehicle adjacent to the current vehicle in the same driving direction;
broadcasting the vehicle identification of the sender vehicle to request the sender vehicle to distribute the cache data.
In one embodiment, the cluster head of the cluster of vehicles is determined based on the steps of:
detecting each vehicle of the vehicle cluster to obtain at least one of the running speed, the vehicle position and the number of communication covered vehicles of each vehicle;
determining a cluster head of the cluster of vehicles based on at least one of a travel speed, a vehicle location, and a number of communication covered vehicles of the respective vehicles.
In one embodiment, the determining the cluster head of the vehicle cluster based on at least one of the traveling speed, the vehicle position and the number of communication covered vehicles of each vehicle includes:
determining a speed weight of each vehicle based on a difference between a travel speed of each vehicle and an average speed of the cluster of vehicles;
determining a position weight of each vehicle based on a distance between each vehicle and the cluster center point;
determining a coverage weight of each vehicle based on the number of communication coverage vehicles of each vehicle;
determining a fusion weight of each vehicle based on the speed weight, the position weight and the coverage weight of each vehicle;
and determining the vehicle with the maximum fusion weight as the cluster head of the vehicle cluster.
In one embodiment, the cluster head of the vehicle cluster is updated based on the steps of:
receiving adjacent vehicle information broadcast by member vehicles in the vehicle cluster;
updating and broadcasting control information of the vehicle cluster based on the adjacent vehicle information so that member vehicles in the vehicle cluster calculate the fusion weight according to the control information;
calculating the fusion weight of the current vehicle, and accepting the fusion weight broadcasted by the member vehicles in the vehicle cluster;
and updating the cluster head of the vehicle cluster based on the fusion weight of the current vehicle and the fusion weight broadcasted by the member vehicles in the vehicle cluster, and broadcasting vehicle cluster control information carrying the updated cluster head identifier.
In one embodiment, before detecting each vehicle in the vehicle cluster and obtaining at least one of a traveling speed, a vehicle location, and a number of communication covered vehicles of each vehicle, the method further includes:
and eliminating the interference of the vehicle-mounted radar for sensing the running information of the adjacent vehicles and the communication transceiver for sensing the information sharing in the same frequency band by adopting an interference elimination algorithm based on an atomic norm minimization theory.
In a second aspect, an embodiment of the present application provides a data distribution method, including: in the case that a current vehicle is a member vehicle in a vehicle cluster to which the current vehicle belongs, broadcasting service capability of the current vehicle so that a cluster head in the vehicle cluster to which the current vehicle belongs can determine a sender vehicle from the vehicle cluster based on the service capability of the cluster head and the service capability broadcasted by each member vehicle in the vehicle cluster, the vehicle cluster being determined based on each vehicle adjacent to the current vehicle in the same driving direction;
receiving a vehicle identification of the sender vehicle broadcast by the cluster head;
and under the condition that the vehicle identification of the sender vehicle is consistent with the vehicle identification of the current vehicle, distributing the cache data.
In one embodiment, further comprising: and updating the vehicle cluster attribution state of the current vehicle based on the distance between the current vehicle and the cluster head of the vehicle cluster to which the current vehicle belongs and/or the distance between the current vehicle and the cluster head of other vehicle clusters.
In one embodiment, the service capability of the current vehicle is determined based on the steps of:
determining a service capability of the current vehicle based on the cached data of the current vehicle and request data of vehicles adjacent to the current vehicle in an opposite driving direction.
In a third aspect, an embodiment of the present application provides a data distribution apparatus, including:
a sender vehicle determination unit configured to determine a sender vehicle from a vehicle cluster based on a service capability of a current vehicle and a service capability broadcast by each member vehicle in the vehicle cluster, in a case where the current vehicle is a cluster head in the vehicle cluster to which the current vehicle belongs, the vehicle cluster being determined based on each vehicle adjacent to the current vehicle in the same traveling direction;
and the vehicle identification broadcasting unit is used for broadcasting the vehicle identification of the vehicle of the sender to request the vehicle of the sender to distribute the cache data.
In a fourth aspect, an embodiment of the present application provides a data distribution apparatus, including:
a service capability broadcasting unit for broadcasting a service capability of a current vehicle in a case where the current vehicle is a member vehicle in a vehicle cluster to which the current vehicle belongs, so that a cluster head in the vehicle cluster to which the current vehicle belongs can determine a sender vehicle from the vehicle cluster based on the service capability of the cluster head and the service capability broadcasted by each member vehicle in the vehicle cluster, the vehicle cluster being determined based on each vehicle adjacent to the current vehicle in the same traveling direction;
a vehicle identification receiving unit for receiving the vehicle identification of the sender vehicle broadcasted by the cluster head;
and the data distribution unit is used for distributing the cache data under the condition that the vehicle identification of the sender vehicle is consistent with the vehicle identification of the current vehicle.
In a fifth aspect, an embodiment of the present application provides an electronic device, which includes a processor and a memory storing a computer program, where the processor implements the data distribution method according to the first aspect or the second aspect when executing the program.
In a sixth aspect, embodiments of the present application provide a non-transitory computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the data distribution method of the first aspect or the second aspect.
According to the data distribution method, the data distribution device, the electronic equipment and the storage medium, vehicles in the same driving direction are clustered and divided into vehicle clusters before data distribution is carried out, so that the stability of communication links among vehicles in the clusters is improved, and the network overhead is reduced; the cluster head appoints the sender vehicle according to the service capability of the vehicles in the vehicle cluster so as to request the sender vehicle to distribute the cache data, thereby reducing the vehicle request satisfying time and effectively improving the data distribution efficiency of the vehicles.
Drawings
In order to more clearly illustrate the technical solutions in the present application or the prior art, the drawings needed for the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic flow chart of a data distribution method provided in an embodiment of the present application;
fig. 2 is a schematic application scenario diagram of a data distribution method provided in an embodiment of the present application;
fig. 3 is a second schematic flowchart of a data distribution method according to an embodiment of the present application;
fig. 4 is a third schematic flowchart of a data distribution method provided in an embodiment of the present application;
FIG. 5 is a schematic structural diagram of a data distribution apparatus according to an embodiment of the present application;
fig. 6 is a second schematic structural diagram of a data distribution apparatus according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an electronic device provided in an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application clearer, the technical solutions of the present application will be described clearly and completely with reference to the accompanying drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Although the vehicle-mounted Ad Hoc Network is an extension of the Mobile Ad Hoc Network in the car networking scene, the vehicle-mounted Ad Hoc Network is incompatible in a VANET (Vehicular Ad Hoc Network) environment by directly applying a traditional Network hierarchical topology structure of MANET (Mobile Ad Hoc Network) due to the high-speed mobility of vehicle nodes. In addition, data forwarding in the VANET requires low-delay transmission and high reliability, the number of vehicle nodes is large, the deployment of routers is few, and the application of a flat network structure of a traditional self-organizing network can cause poor network expandability.
Fig. 1 is a schematic flow chart of a data distribution method according to an embodiment of the present application. Referring to fig. 1, an embodiment of the present application provides a data distribution method, which may include:
and step 110, in the case that the current vehicle is a cluster head in the belonging vehicle cluster, determining a sender vehicle from the vehicle cluster based on the service capability of the current vehicle and the service capability broadcasted by each member vehicle in the vehicle cluster, wherein the vehicle cluster is determined by each vehicle adjacent to the current vehicle in the same driving direction.
Specifically, fig. 2 is a schematic view of an application scenario of the data distribution method provided in the embodiment of the present application, as shown in fig. 2, where an arrow indicates a driving direction of a vehicle; each rectangular dashed box represents a vehicle cluster, each vehicle cluster including a cluster head and cluster member vehicles; the roadside includes two RSUs, and the circle represents the coverage of the RSU, and it can be seen that the vehicle is out of the coverage of the RSU.
The method can be applied to the scene of a bidirectional road, the RSU and the vehicle are ready for content pre-caching, the vehicle may not finish the downloading of the required content in the coverage range of one RSU, and the vehicle in the opposite lane provides the required content through V2V communication to finish the downloading process before reaching the coverage range of the next RSU. The execution subject of the method may be an onboard control unit of each vehicle node.
Before data distribution, vehicles in the same driving direction can be clustered and divided into vehicle clusters, and vehicles with similar attributes (such as speed, position and the like of the vehicles) can become members of the same cluster, so that the stability of communication links among the vehicles in the cluster is high, and the network overhead is reduced.
Here, the current vehicle is a cluster head in the cluster of the vehicle to which the current vehicle belongs, and each vehicle adjacent to the current vehicle is a vehicle whose distance from the cluster head is within a communication range of a preset communication transceiver, for example, within a V2V communication range. After the cluster head is determined, the cluster head and each vehicle adjacent to the cluster head can be used for generating a vehicle cluster.
The service capacity can reflect the number of vehicles to be replied to the request which can be met by each vehicle, and the more the number of vehicles which can be met is, the higher the service capacity is; the smaller the number of vehicles that can be satisfied, the lower the service capability. The request to reply here may be, for example, multimedia entertainment information, traffic status information, etc.
Each vehicle in the vehicle cluster broadcasts a respective unfinished request, each member in the cluster head and the vehicle cluster sends a request data item to be replied according to the data item cached by the member and the request vehicle, the service capability of the member is calculated respectively, and then each member in the vehicle cluster broadcasts the service capability of the member.
The cluster head determines a sender vehicle from the vehicle cluster according to the service capability of the cluster head and the service capability of each member, wherein the sender vehicle is specified by the cluster head, and the vehicle with the highest service capability in the vehicle cluster can be specified as the sender vehicle.
And step 120, broadcasting the vehicle identification of the vehicle of the sender to request the vehicle of the sender to distribute the cache data.
Specifically, after the sender vehicle determines that the sender vehicle is ready, the cluster head broadcasts the vehicle identifier of the sender vehicle, which may be, for example, the serial number, license plate number, vehicle identification number, etc. of the vehicle in the vehicle cluster, and after the sender vehicle receives the data distribution indication of the cluster head, the sender vehicle distributes the cache data, which may broadcast, for example, the data item with the largest number of unserviceable requests, so that the requesting vehicle receives the request data item to be replied.
According to the method provided by the embodiment of the application, before data distribution is carried out, vehicles in the same driving direction are clustered and divided into vehicle clusters, so that the stability of communication links among the vehicles in the clusters is improved, and the network overhead is reduced; the cluster head appoints the sender vehicle according to the service capability of the vehicles in the vehicle cluster so as to request the sender vehicle to distribute the cache data, thereby reducing the vehicle request satisfying time and effectively improving the data distribution efficiency of the vehicles.
Based on the above embodiment, the cluster head of the vehicle cluster is determined based on the following steps:
detecting each vehicle adjacent to the current vehicle to obtain at least one of the running speed, the vehicle position and the number of communication covered vehicles of each vehicle;
a cluster head of the cluster of vehicles is determined based on at least one of a travel speed, a vehicle position, and a number of communication covered vehicles of each vehicle.
Specifically, the method performs clustering in vehicles in the same direction, and may first group vehicles that are adjacent to the current vehicle in the same driving direction and do not belong to any vehicle cluster into one vehicle cluster, where the current vehicle may be any vehicle that is driving.
The vehicle-mounted radar on the vehicle can detect information such as the running speed, the position and the distance of each vehicle; the vehicle communication sharing may detect a vehicle capable of communicating with the current vehicle, i.e., the number of vehicles that the current vehicle is communicatively covered.
Considering that the building of the cluster is a precondition for realizing data distribution, and the main role of the cluster head is to collect the service capabilities of the cluster members and to designate the sending vehicle, frequent information exchange with the cluster members is required, in order to further improve the stability of the communication link between the cluster members, the cluster head of the vehicle cluster may be determined based on at least one of the following indexes:
in order to prevent frequent change of cluster heads, a vehicle whose traveling speed is closer to the average traveling speed of the vehicles within the cluster may be determined as a cluster head of the cluster of vehicles;
to enhance the stability of a cluster of vehicles, a vehicle closer to the center point of the vehicle within the cluster may be determined as the cluster head of the cluster of vehicles;
in order to maintain the number of vehicles in the vehicle cluster, the vehicle that has the largest number of communication coverage neighboring vehicles may be determined as the cluster head of the vehicle cluster.
It is to be understood that, when determining the cluster head of the vehicle cluster, only the traveling speed of each vehicle may be considered, only the vehicle position may be considered, only the number of communication coverage vehicles may be considered, of course, both or all of them may be considered at the same time, and this is not particularly limited in this embodiment of the present application.
According to the method provided by the embodiment of the application, the cluster head of the vehicle cluster is determined based on at least one of the running speed, the vehicle position and the number of communication covered vehicles of each vehicle, so that the stability of a communication link between the vehicles in the cluster is further improved, the data request time delay is reduced, and the data distribution efficiency is improved.
Based on any one of the above embodiments, determining a cluster head of a cluster of vehicles based on at least one of a traveling speed, a vehicle position, and a number of communication covered vehicles of each vehicle includes:
determining a speed weight of each vehicle based on a difference between a travel speed of each vehicle and an average speed of the cluster of vehicles;
determining the position weight of each vehicle based on the distance between each vehicle and the center point of the vehicle cluster;
determining a coverage weight of each vehicle based on the number of communication coverage vehicles of each vehicle;
determining a fusion weight of each vehicle based on the speed weight, the position weight and the coverage weight of each vehicle;
and determining the vehicle with the maximum fusion weight as the cluster head of the vehicle cluster.
Specifically, when determining the cluster head, the vehicle with the cluster head is selected by taking the difference between the running speed of the vehicle and the average speed of the vehicle cluster, the vehicle position of each vehicle, namely the position of the vehicle in the vehicle cluster, and the number of communication covered vehicles, namely the number of vehicle cluster members as the measuring criteria of the weighted clustering algorithm.
The speed weight can represent the difference between the running speed of each vehicle and the average speed of the vehicle cluster, and the smaller the difference between the running speed and the average speed is, the closer the running speed is to the average speed is, the larger the speed weight is; the greater the difference between the running speed and the average speed, the more the running speed deviates from the average speed, the smaller the speed weight.
The position weight can represent the position of each vehicle in the vehicle cluster, and the smaller the distance from the center point of the vehicle cluster, the larger the position weight is, the more the position of the vehicle is in the center of the vehicle cluster; the greater the distance from the center point of the cluster of vehicles, the more the position of the vehicle deviates from the center of the cluster of vehicles, the smaller the position weight.
The coverage weight can represent the number of covered vehicles in the communication range of each vehicle, and the larger the number of covered vehicles is, the larger the coverage weight is; the smaller the number of vehicles that can be covered, the smaller the coverage weight.
The velocity weight, the position weight, and the coverage weight of each vehicle are fused to obtain a fusion weight, and for example, the velocity weight, the position weight, and the coverage weight of each vehicle may be directly added to obtain a fusion weight of each vehicle. The fusion weight represents the comprehensive weight of each vehicle on three indexes of the driving speed, the vehicle position and the communication coverage vehicle number.
And then, determining the vehicle with the maximum fusion weight value as a cluster head of the vehicle cluster, wherein the cluster head can declare the self role and the vehicle cluster ID to the adjacent vehicle through the control information. The fusion weight of the determined cluster head determined by the three indexes of the running speed, the vehicle position and the number of communication covered vehicles is the largest, so that the communication link between the vehicles in the generated vehicle cluster is more stable, and the reclustering frequency is reduced.
In one embodiment, the cluster head determination process for a cluster of vehicles is as follows:
V(t)＝{V1，V2，...，Vj，...，V|V(t)|represents the vehicle set, j represents the number of the vehicle, | v (t) | represents the number of vehicles in the set;
1) to prevent frequent changing of cluster heads, giving a speed close to the average speed of several adjacent vehicles
Figure BDA0003537237840000101
Vehicle VjHigher weight, adjacent vehicle in set V (t), with vehicle VjVehicles V whose distance therebetween is within the V2V communication range rV2VhExpressed as a set
Figure BDA0003537237840000102
Figure BDA0003537237840000103
In the scenario of a bidirectional road, vehicle VjIncludes adjacent vehicles in the same direction and in opposite directions, i.e.
Figure BDA0003537237840000104
Wherein the content of the first and second substances,
Figure BDA0003537237840000105
show and vehicle VjThe co-directional adjacent vehicle set, dir (.) represents the vehicle driving direction;
Figure BDA0003537237840000106
to representAnd a vehicle VjA set of opposing neighboring vehicles.
The method carries out clustering in vehicles in the same direction, so that the average speed of the adjacent vehicles is considered as a vehicle set in the same direction
Figure BDA0003537237840000107
Average speed of a number of vehicles in and not belonging to any cluster of vehicles, i.e.
Figure BDA0003537237840000108
Then, the speed is close to the average speed of several adjacent vehicles
Figure BDA0003537237840000109
The assigned weight of the vehicle is represented as:
Figure BDA00035372378400001010
wherein, s (V)j) Indicating vehicle VjThe speed of the motor vehicle is set to be,
Figure BDA00035372378400001011
representing the average speed of several adjacent vehicles.
2) To enhance stability of a cluster of vehicles, vehicles V closer to the center points of several adjacent vehicles are givenjHigher weights, expressed as:
Figure BDA0003537237840000111
wherein, VfIndicating the vehicle in the foremost position among the adjacent vehicles, VrIndicating the vehicle in the rearmost position among the adjacent vehicles.
When the vehicle VjAt the centre point position, the weight value is greatest, i.e.
Figure BDA0003537237840000112
Because wc (V)j) ' > 0 or more, using max (wc (V)j) ') normalize it, i.e.
Figure BDA0003537237840000113
3) To maintain the number of vehicles in a cluster, a vehicle V is given that can cover the most adjacent vehiclesjHigher weight, expressed as
Figure BDA0003537237840000114
Synthesizing the three-point indexes to calculate the vehicle V in a plurality of adjacent vehiclesjIs represented as W (V)j)＝ws(Vj)+wc(Vj)+wn(Vj)。
Based on any one of the above embodiments, there is provided a data distribution method, including:
and updating the vehicle cluster attribution state of the current vehicle based on the distance between the current vehicle and the cluster head of the vehicle cluster to which the current vehicle belongs and/or the distance between the current vehicle and the cluster heads of other vehicle clusters.
Specifically, since the traveling speed and the traveling direction of each vehicle are constantly changing, the cluster head of the vehicle cluster and the cluster member vehicles may also be changing, that is, the vehicle cluster belonging state of the current vehicle is also constantly updated.
It is understood that the vehicle cluster attribution state of the current vehicle includes:
1) leaving the cluster of vehicles: when the kth vehicle cluster (C)k) Cluster Head (CH)k) And a vehicle VjThe distance between the two is greater than the V2V communication range, namely the condition is satisfied
dis(CHk，Vj)＞rV2V
Where dis () represents the distance between vehicles and rV2V represents the V2V communication range, then vehicle VjAnd exiting the vehicle cluster.
2) Adding a vehicle cluster: vehicle with wheelsVehicle VjAt cluster head CHkCoverage according to vehicle VjThere are three cases, specifically as follows:
case a) vehicle VjNot belonging to any cluster of vehicles, when the condition is satisfied
dis(CHk，Vj)≤rV2V
Vehicle VjAdding Ck；
Case b) vehicle VjHas been added with CkTo avoid frequent changes of clusters, only when a new cluster (C) is presentk+1) Containing more vehicles than the currently joining cluster (C)k) When the number of included vehicles is more than VjThe addition of a new cluster of vehicles is allowed. Namely, satisfies the condition
dis(Vj，CHk+1)≤rV2V∧|Ck|＜|Ck+1|
Vehicle VjA new cluster of vehicles C can be addedk+1；
Case c) the cluster head may join another vehicle cluster after the vehicle cluster is disassembled by the control message; the disaggregated cluster member may join an adjacent vehicle cluster.
3) Generating vehicle clusters
A plurality of adjacent vehicles which do not belong to any vehicle cluster designate the vehicle with the maximum weight value as a cluster head to generate a new vehicle cluster;
and generating a new vehicle cluster when the cluster members scattered by the original vehicle cluster do not have adjacent vehicle clusters in the coverage area of the cluster members.
According to the method provided by the embodiment of the application, the vehicle cluster attribution state of the current vehicle is determined based on the distance between the current vehicle and the cluster head of the vehicle cluster, and effective management of the vehicle cluster is achieved.
Based on any of the above embodiments, the cluster head of the vehicle cluster is updated based on the following steps:
receiving adjacent vehicle information broadcast by member vehicles in a vehicle cluster;
updating and broadcasting control information of the vehicle cluster based on the adjacent vehicle information so that member vehicles in the vehicle cluster calculate fusion weight according to the control information;
calculating the fusion weight of the current vehicle, and receiving the fusion weight broadcasted by the member vehicles in the vehicle cluster;
and updating the cluster head of the vehicle cluster based on the fusion weight of the current vehicle and the fusion weight broadcasted by the member vehicles in the vehicle cluster, and broadcasting vehicle cluster control information carrying the updated cluster head identifier.
Specifically, after a vehicle cluster is generated, information interaction is performed between a cluster head and member vehicles in the cluster. The interaction process is as follows:
1) cluster members send sensed neighboring vehicle information (ID, location and speed of the affiliated vehicle cluster) to the cluster head;
2) the cluster head updates the number of cluster members, the average speed of the cluster of vehicles, and the front-most vehicle (V) in the cluster of vehicles based on the received informationf) And a rearmost vehicle (V)r) The position of (a). Then, the cluster head broadcasts the updated control information;
3) the cluster head and the cluster members calculate the fusion weight according to the received information, and the cluster members send the calculated fusion weight to the cluster head, wherein the calculation process of the fusion weight is as follows:
C(t)＝{C1，C2，...，Ck，...，C|C(t)|denotes a vehicle cluster set, k denotes the number of vehicle clusters, | C (t) | denotes the number of vehicle clusters in the set, and after the vehicle clusters are generated, similar indices to those in the above-described embodiment are considered, but the object under consideration becomes the generated vehicle cluster Ck：
First, to prevent frequent change of cluster head, a speed is given to approach an average cluster speed as (C) of vehiclesk) Vehicle VjHigher weight, expressed as
Figure BDA0003537237840000131
② to strengthen the stability of the vehicle cluster, give the vehicle V closer to the center point of the vehicle clusterjHigher weight, expressed as
Figure BDA0003537237840000132
When the vehicle VjAt the position of the centre point of the vehicle cluster, the weight value is maximum, i.e.
Figure BDA0003537237840000133
Because wc (V)j) ' > 0 or more, using max (wc (V)j) ') normalize it, i.e.
Figure BDA0003537237840000134
Third, to keep the number of vehicles in a cluster, a vehicle V is given that can cover more vehicles in the same clusterjHigher weight, i.e. the next cluster head selected can cover the most cluster members, denoted as
Figure BDA0003537237840000141
Wherein, the first and the second end of the pipe are connected with each other,
Figure BDA0003537237840000142
is shown in the vehicle cluster CkMedium vehicle VjOf adjacent vehicles.
The vehicle V in the vehicle cluster is calculated by integrating the three indexesjIs represented as W (V)j)＝ws(Vj)+wc(Vj)+wn(Vj)。
4) And selecting the vehicle with the maximum fusion weight value as the next cluster head by the cluster head. Then, the cluster head announces the next cluster head to the cluster members through the control information. The control information may include WAVE service broadcasts, basic security messages, auxiliary information for service scheduling, etc.
According to the method provided by the embodiment of the application, the fusion weight of the cluster head is calculated according to the received information through information interaction between the cluster head and the cluster members, and the cluster head designates the vehicle with the largest fusion weight as the next cluster head, so that the update of the cluster head is realized, the stability of the vehicle cluster is maintained, and conditions are provided for data distribution.
Based on any of the above embodiments, fig. 3 is a second schematic flow chart of the data distribution method provided in the embodiments of the present application. Referring to fig. 3, an embodiment of the present application provides a data distribution method, which may include:
step 310, under the condition that the current vehicle is a member vehicle in the vehicle cluster, broadcasting the service capability of the current vehicle, so that a cluster head in the vehicle cluster can determine a sender vehicle from the vehicle cluster based on the service capability of the cluster head and the service capability broadcasted by each member vehicle in the vehicle cluster, wherein the vehicle cluster is determined by each vehicle adjacent to the current vehicle on the basis of the same driving direction;
step 320, receiving the vehicle identification of the sender vehicle broadcasted by the cluster head;
and step 330, distributing the cache data under the condition that the vehicle identification of the sender vehicle is consistent with the vehicle identification of the current vehicle.
Specifically, under the condition that the current vehicle is a member vehicle in the vehicle cluster to which the current vehicle belongs, firstly, a cluster head and a cluster member declare an incomplete request, the cluster member and the cluster head calculate the service capability of the cluster member and the cluster head according to the data item cached by the cluster member and the request to be replied of the adjacent vehicle running in the opposite direction, and then the cluster member broadcasts the service capability of the cluster member;
the cluster head designates the sender vehicle according to the service capability of receiving the broadcast of each member vehicle and the service capability of the cluster head itself. The cluster head assigns a vehicle identification of the sender vehicle, which has the highest service capability in the cluster.
The designated sender vehicle searches its own cached data items and broadcasts the data items with the most unserviceable requests. Other member vehicles that are not the sender vehicle may switch to the reception channel so that the distribution data of the adjacent vehicle traveling in the opposite direction can be received.
Based on any of the above embodiments, the service capability of the current vehicle is determined based on the following steps:
the service capability of the current vehicle is determined based on the cached data of the current vehicle and the request data of vehicles adjacent to the current vehicle in the opposite driving direction.
Specifically, the service capacity may reflect the number of vehicles to be requested to reply that each vehicle can satisfy, and the larger the number of vehicles that can satisfy, the higher the service capacity is represented; the smaller the number of vehicles that can be satisfied, the lower the service capability.
The number of vehicles which can meet the request to be replied can be determined according to the cached data of the current vehicle and the request data of the request vehicle.
If the request data of any request vehicle is contained in the cached data set of the current vehicle, indicating that the current vehicle can satisfy the request vehicle; if the request data of a plurality of request vehicles are all contained in the cached data set of the current vehicle, the request data indicates that the current vehicle can simultaneously satisfy the plurality of request vehicles.
In one embodiment, the current vehicle service capability may be determined by the following equation:
database D ═ D1，d2，...，d|D|Divide into a number of data items, | D | represents the total number of data items,
Figure BDA0003537237840000151
Figure BDA0003537237840000152
indicating vehicle VjAdjacent vehicle VhThe set of data items received to be replied to the request,
Figure BDA0003537237840000161
Figure BDA0003537237840000162
indicating vehicle VjCached data item set capable of satisfying vehicle VjAdjacent vehicles in a reverse road
Figure BDA0003537237840000163
The vehicle to which the request is to be replied is denoted as
Figure BDA0003537237840000164
Service capability according to vehicle VjThe determination of the number of vehicles that can satisfy the most pending request to reply can be expressed as
Figure BDA0003537237840000165
Based on any one of the embodiments, before detecting each vehicle in the vehicle cluster and obtaining at least one of the traveling speed, the vehicle position, and the number of communication covered vehicles of each vehicle, the method further includes:
and eliminating the interference of the vehicle-mounted radar for sensing the running information of the adjacent vehicles and the communication transceiver for sensing the information sharing in the same frequency band by adopting an interference elimination algorithm based on an atomic norm minimization theory.
In particular, the Intelligent Transportation System (ITS) is an emerging application of today's fifth generation (5G) communication architecture. High capacity low latency V2V communication and accurate sensing are critical to ITS. The need for high speed V2V communication also enables the communication system to shift to higher frequency resources, with modern cars equipped with car radar to locate surrounding cars, pedestrians, and infrastructure. Therefore, spectrum sharing between the automotive radar and the large capacity V2V communication between the bands is necessary, which may provide higher spectrum utilization, however, the spectrum sharing between the two systems may cause serious interference.
One solution to achieve spectrum sharing is to allocate different resources for the radar system and the communication system, and the radar and the communication do not use the same resource at the same time, so that no interference occurs. This approach does not allow both systems to take full advantage of existing resources;
another way to share the spectrum is to consider that the radar system and the communication system operate in an overlapping manner, wherein one overlapping spectrum sharing method is to modify the other system to mitigate the effect of one system, but this method will cause a certain loss in the performance of the radar system.
In view of the above problems, in the embodiments of the present application, an interference cancellation algorithm based on an atomic norm minimization theory is used to cancel interference that a vehicle-mounted radar for sensing driving information of an adjacent vehicle and a communication transceiver for sensing information sharing operate in the same frequency band. The information received by the vehicle communication share may include, among other things, the request ID of the non-service, the request vehicle ID, and the latest status of the vehicle.
Reconstructing an FMCW (Frequency Modulated Continuous Wave) interference signal, converting the interference reconstruction problem into a spectrum estimation problem, realizing accurate spectrum estimation through an algorithm based on an atomic norm minimization theory, deriving the starting Frequency of FMCW interference on the next OFDM (Orthogonal Frequency Division Multiplexing) symbol according to the current Frequency estimation result and the sharing parameters of the FMCW waveform, and then completing interference reconstruction and elimination on each OFDM symbol.
Assuming that the radar and the communication entity share some side information (the OFDM receiver knows the basic parameters of the radar waveform), the OFDM-based communication system reserves the reference signal in a specific time interval and performs radar interference estimation on the reference signal, and interference signal reconstruction is achieved based on the assumption.
The FMCW interference signal has a variable frequency at each OFDM sampling point, so that the algorithm based on the atomic norm minimization theory cannot be directly applied to convert the FMCW signal into a single-frequency signal:
Figure BDA0003537237840000171
wherein the content of the first and second substances,
Figure BDA0003537237840000172
representing a noisy frequency modulated continuous wave interference signal;
Figure BDA0003537237840000173
representing the frequency modulation slope of the frequency-modulated continuous wave signal, BRRepresents the bandwidth of the radar system, and T represents one period of the FMCW waveform; t issRepresents a sampling interval based on an OFDM communication system; n denotes the number of fast fourier transform points. After the FMCW interference signal is converted to a single frequency signal, it is modeled as a mixture of sinusoidal signals:
Figure BDA0003537237840000174
cl，fl∈[0，1]，φle 0, 2 pi) respectively represent the amplitude, normalized frequency, phase of the l-th sine wave.
The mixed signal is rewritten based on the atomic norm minimization theory, and an atom alpha (f, phi) is defined as alpha (f, phi)0，...，α(f，φ)M-1]TFor f e [0, 1 ∈]φ E [0, 2 π), further denoted as α (f, φ)m＝ej(2πfm+φ)M-0, so, M-1, and thus, the radar interference vector i-i (0), so, i (M-1)]Can be rewritten as
Figure BDA0003537237840000181
Wherein, cl> 0 and the phase of the interfering sine wave is at phil；
Set of atoms a ═ { α (f, Φ): f is the component of interference (0, 1), phi is the component of interference (0, 2 pi), and the atomic norm of interference signal is expressed as
Figure BDA0003537237840000182
conv (A) represents the convex hull of the set of atoms A. The atomic norm has semi-definite programming property, and the above formula can be expressed as
Figure BDA0003537237840000183
Figure BDA0003537237840000184
T (u) denotes the Hermitian-Toeplitz matrix:
Figure BDA0003537237840000185
and solving the atomic norm according to a linear semi-definite programming theory method. According to Caratheodory's theorem, any semi-positive Toeplitz matrix can be decomposed by Vandermonde to obtain
Figure BDA0003537237840000186
As＝[α(f1，0)，...，α(fs，0)]
C＝diag([c1，...，cs])
Interference frequency f1，...，fs]Solved by the Proney method or other super-resolution methods, the frequency estimation result contains only one element, i.e. f, since the FMCW interference has been converted into a single frequency form1；
Reconstructed FMCW interference on OFDM symbols may be represented as
Figure BDA0003537237840000191
Wherein, PRRepresents the transmit power of the radar signal;
by taking into account the frequency modulation slope K of the FMCW signalrThe start frequency on the next OFDM symbol is calculated, then the FMCW radar interference on each OFDM symbol is reconstructed, the reconstructed interference on each OFDM symbol is subtracted, and the demodulation process is completed at the communication receiver.
According to the method provided by the embodiment of the application, the interference elimination algorithm based on the atomic norm minimization theory is adopted, and the interference of the vehicle-mounted radar for perceiving the driving information of the adjacent vehicle and the V2V communication transceiver for perceiving information sharing working in the same frequency band is eliminated.
Based on any of the above embodiments, fig. 4 is a third schematic flowchart of the data distribution method provided in the embodiment of the present application. Referring to fig. 4, an embodiment of the present application provides a data distribution method, which may include:
s1, eliminating the interference of the vehicle-mounted radar for sensing the running information of the adjacent vehicles and the V2V communication transceiver for sensing information sharing in the same frequency band by adopting an interference elimination algorithm based on an atomic norm minimization theory, sensing the speed, the position and the quantity of the adjacent vehicles in the same direction by the vehicles through FMCW radar waveforms after the interference is eliminated, and sharing the sensed information with the adjacent vehicles based on OFDM communication.
And S2, selecting cluster heads and clustering vehicles through a weighted clustering algorithm according to the information sensed by the vehicles in the step S1, and updating the vehicle cluster attribution state of the current vehicle according to the distance between the current vehicle and the cluster heads. The vehicle cluster attribution state comprises that a current vehicle leaves the vehicle cluster, joins the vehicle cluster and generates the vehicle cluster.
The average speed difference between the vehicles and the vehicle cluster, the positions of the vehicles in the vehicle cluster and the number of the members of the vehicle cluster are used as indexes of a weighted clustering algorithm to select cluster heads, and the re-clustering frequency is reduced.
S3, calculating respective service capabilities of the cluster head and the cluster member vehicles, determining a sender vehicle from the vehicle cluster based on the service capabilities of the current vehicle and the service capabilities broadcasted by each member vehicle in the vehicle cluster under the condition that the current vehicle is the cluster head in the vehicle cluster to which the current vehicle belongs, and broadcasting the vehicle identification of the sender vehicle to request the sender vehicle to distribute the cache data;
under the condition that the current vehicle is a member vehicle in the vehicle cluster, broadcasting the service capability of the current vehicle, so that a cluster head in the vehicle cluster can determine a sender vehicle from the vehicle cluster based on the service capability of the cluster head and the service capability broadcasted by each member vehicle in the vehicle cluster; receiving a vehicle identification of a sender vehicle broadcasted by a cluster head; and distributing the cache data under the condition that the vehicle identification of the vehicle at the sending party is consistent with the vehicle identification of the current vehicle.
In specific distribution, after the vehicle of the sender broadcasts the data item with the largest number of unserviceable requests, other data items are broadcasted by the RSU and another vehicle cluster. Each RSU has two queues for outstanding requests, one submitted within its coverage area and the other for transmitting the content of the request from the peer RSUs, the vehicles between RSUs caching the content of the peer RSUs transmission request.
The following describes a data distribution device provided in an embodiment of the present application, and the data distribution device described below and the data distribution method described above may be referred to correspondingly.
Based on any of the above embodiments, fig. 5 is a schematic structural diagram of a data distribution apparatus provided in an embodiment of the present application. Referring to fig. 5, an embodiment of the present application provides a data distribution apparatus, including:
a sender vehicle determining unit 510, configured to determine a sender vehicle from a vehicle cluster, where a current vehicle is a cluster head in the vehicle cluster, based on a service capability of the current vehicle and a service capability broadcasted by each member vehicle in the vehicle cluster, where the vehicle cluster is determined based on each vehicle adjacent to the current vehicle in the same driving direction;
a vehicle identification broadcasting unit 520, configured to broadcast the vehicle identification of the sender vehicle to request the sender vehicle to distribute the cached data.
According to the data distribution device provided by the embodiment of the application, vehicles in the same driving direction are clustered and divided into vehicle clusters before data distribution is carried out, so that the stability of communication links among the vehicles in the clusters is improved, and the network overhead is reduced; the cluster head appoints the sender vehicle according to the service capability of the vehicles in the vehicle cluster so as to request the sender vehicle to distribute the cache data, thereby reducing the vehicle request satisfying time and effectively improving the data distribution efficiency of the vehicles.
Based on any of the above embodiments, the apparatus includes a cluster head determining unit configured to:
detecting each vehicle of the vehicle cluster to obtain at least one of the running speed, the vehicle position and the number of communication covered vehicles of each vehicle;
determining a cluster head of the cluster of vehicles based on at least one of a travel speed, a vehicle location, and a number of communication covered vehicles of the respective vehicles.
Based on any of the above embodiments, the cluster head determining unit is further configured to:
determining a speed weight of each vehicle based on a difference between a travel speed of each vehicle and an average speed of the cluster of vehicles;
determining a location weight for each vehicle based on the vehicle location for each vehicle;
determining a coverage weight of each vehicle based on the number of communication coverage vehicles of each vehicle;
determining a fusion weight of each vehicle based on the speed weight, the position weight and the coverage weight of each vehicle;
and determining the vehicle with the maximum fusion weight as the cluster head of the vehicle cluster.
Based on any of the above embodiments, the apparatus includes a cluster head updating unit, configured to:
receiving adjacent vehicle information broadcast by member vehicles in the vehicle cluster;
updating and broadcasting control information of the vehicle cluster based on the adjacent vehicle information so that member vehicles in the vehicle cluster calculate the fusion weight according to the control information;
calculating the fusion weight of the current vehicle, and accepting the fusion weight broadcasted by the member vehicles in the vehicle cluster;
and updating the cluster head of the vehicle cluster based on the fusion weight of the current vehicle and the fusion weight broadcasted by the member vehicles in the vehicle cluster, and broadcasting vehicle cluster control information carrying the updated cluster head identifier.
Based on any of the above embodiments, the apparatus includes an interference cancellation unit configured to:
and eliminating the interference of the vehicle-mounted radar for sensing the running information of the adjacent vehicles and the communication transceiver for sensing the information sharing in the same frequency band by adopting an interference elimination algorithm based on an atomic norm minimization theory.
Based on any of the above embodiments, fig. 6 is a second schematic structural diagram of the data distribution apparatus provided in the embodiment of the present application. Referring to fig. 6, an embodiment of the present application provides a data distribution apparatus, including:
a service capability broadcasting unit 610 for broadcasting a service capability of a current vehicle in a case where the current vehicle is a member vehicle in a vehicle cluster to which the current vehicle belongs, so that a cluster head in the vehicle cluster to which the current vehicle belongs can determine a sender vehicle from the vehicle cluster based on the service capability of the cluster head and the service capability broadcasted by each member vehicle in the vehicle cluster, the vehicle cluster being determined based on each vehicle adjacent to the current vehicle in the same traveling direction;
a vehicle identification receiving unit 620 configured to receive a vehicle identification of the sender vehicle broadcasted by the cluster head;
a data distribution unit 630, configured to distribute the cached data when the vehicle identifier of the sender vehicle is consistent with the vehicle identifier of the current vehicle.
Based on any of the above embodiments, the apparatus further includes a home status updating unit, configured to:
and updating the vehicle cluster attribution state of the current vehicle based on the distance between the current vehicle and the cluster head of the vehicle cluster to which the current vehicle belongs and/or the distance between the current vehicle and the cluster head of other vehicle clusters.
Based on any of the above embodiments, the apparatus further includes a service capability determining unit, configured to:
determining a service capability of the current vehicle based on the cached data of the current vehicle and request data of vehicles adjacent to the current vehicle in an opposite driving direction.
Fig. 7 illustrates a physical structure diagram of an electronic device, and as shown in fig. 7, the electronic device may include: a processor (processor)710, a Communication Interface (Communication Interface)720, a memory (memory)730 and a Communication bus 740, wherein the processor 710, the Communication Interface 720 and the memory 730 communicate with each other via the Communication bus 740. Processor 710 may invoke computer programs in memory 730 to perform data distribution methods, including, for example: determining a sender vehicle from a vehicle cluster based on the service capability of a current vehicle and the service capability broadcasted by each member vehicle in the vehicle cluster under the condition that the current vehicle is a cluster head in the vehicle cluster, wherein the vehicle cluster is determined based on each vehicle adjacent to the current vehicle in the same driving direction; and broadcasting the vehicle identification of the vehicle at the sending party to request the vehicle at the sending party to distribute the cache data.
Processor 710 may invoke computer programs in memory 730 to perform data distribution methods, including, for example: in the case that a current vehicle is a member vehicle in a vehicle cluster to which the current vehicle belongs, broadcasting service capability of the current vehicle so that a cluster head in the vehicle cluster to which the current vehicle belongs can determine a sender vehicle from the vehicle cluster based on the service capability of the cluster head and the service capability broadcasted by each member vehicle in the vehicle cluster, the vehicle cluster being determined based on each vehicle adjacent to the current vehicle in the same driving direction;
receiving a vehicle identification of the sender vehicle broadcast by the cluster head;
and under the condition that the vehicle identification of the sender vehicle is consistent with the vehicle identification of the current vehicle, distributing the cache data.
In addition, the logic instructions in the memory 730 can be implemented in the form of software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
In another aspect, the present application further provides a computer program product, where the computer program product includes a computer program, where the computer program may be stored on a non-transitory computer-readable storage medium, and when the computer program is executed by a processor, a computer can execute the data distribution method provided in the foregoing embodiments, for example, the computer program includes: determining a sender vehicle from a vehicle cluster based on the service capability of a current vehicle and the service capability broadcasted by each member vehicle in the vehicle cluster under the condition that the current vehicle is a cluster head in the vehicle cluster, wherein the vehicle cluster is determined based on each vehicle adjacent to the current vehicle in the same driving direction; broadcasting the vehicle identification of the sender vehicle to request the sender vehicle to distribute the cache data.
When the computer program is executed by a processor, a computer can execute the data distribution method provided by the above embodiments, for example, the method includes: in the case that a current vehicle is a member vehicle in a vehicle cluster to which the current vehicle belongs, broadcasting service capability of the current vehicle so that a cluster head in the vehicle cluster to which the current vehicle belongs can determine a sender vehicle from the vehicle cluster based on the service capability of the cluster head and the service capability broadcasted by each member vehicle in the vehicle cluster, the vehicle cluster being determined based on each vehicle adjacent to the current vehicle in the same driving direction;
receiving a vehicle identification of the sender vehicle broadcast by the cluster head;
and under the condition that the vehicle identification of the sender vehicle is consistent with the vehicle identification of the current vehicle, distributing the cache data.
On the other hand, an embodiment of the present application further provides a processor-readable storage medium, where the processor-readable storage medium stores a computer program, where the computer program is configured to cause a processor to execute the steps of the data distribution method provided in each of the above embodiments, for example, the method includes: determining a sender vehicle from a vehicle cluster based on the service capability of a current vehicle and the service capability broadcasted by each member vehicle in the vehicle cluster under the condition that the current vehicle is a cluster head in the vehicle cluster, wherein the vehicle cluster is determined based on each vehicle adjacent to the current vehicle in the same driving direction; broadcasting the vehicle identification of the sender vehicle to request the sender vehicle to distribute the cache data.
The computer program is configured to cause a processor to execute the steps of the data distribution method provided in the foregoing embodiments, and for example, includes: in the case that a current vehicle is a member vehicle in a vehicle cluster to which the current vehicle belongs, broadcasting service capability of the current vehicle so that a cluster head in the vehicle cluster to which the current vehicle belongs can determine a sender vehicle from the vehicle cluster based on the service capability of the cluster head and the service capability broadcasted by each member vehicle in the vehicle cluster, the vehicle cluster being determined based on each vehicle adjacent to the current vehicle in the same driving direction;
receiving a vehicle identification of the sender vehicle broadcast by the cluster head;
and distributing the cache data under the condition that the vehicle identification of the sender vehicle is consistent with the vehicle identification of the current vehicle.
The processor-readable storage medium can be any available medium or data storage device that can be accessed by a processor, including, but not limited to, magnetic memory (e.g., floppy disks, hard disks, magnetic tape, magneto-optical disks (MOs), etc.), optical memory (e.g., CDs, DVDs, BDs, HVDs, etc.), and semiconductor memory (e.g., ROMs, EPROMs, EEPROMs, non-volatile memory (NAND FLASH), Solid State Disks (SSDs)), etc.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present application.

Claims (12)

1. A method for data distribution, comprising:
determining a sender vehicle from a vehicle cluster based on the service capability of a current vehicle and the service capability broadcasted by each member vehicle in the vehicle cluster under the condition that the current vehicle is a cluster head in the vehicle cluster, wherein the vehicle cluster is determined based on each vehicle adjacent to the current vehicle in the same driving direction;
broadcasting the vehicle identification of the sender vehicle to request the sender vehicle to distribute the cache data.
2. The data distribution method of claim 1, wherein the cluster head of the cluster of vehicles is determined based on the steps of:
detecting each vehicle of the vehicle cluster to obtain at least one of the running speed, the vehicle position and the number of communication covered vehicles of each vehicle;
determining a cluster head of the cluster of vehicles based on at least one of a travel speed, a vehicle location, and a number of communication covered vehicles of the respective vehicles.
3. The data distribution method according to claim 2, wherein the determining a cluster head of the cluster of vehicles based on at least one of a traveling speed, a vehicle position, and a number of communication covered vehicles of the respective vehicles comprises:
determining a speed weight of each vehicle based on a difference between a travel speed of each vehicle and an average speed of the cluster of vehicles;
determining a position weight of each vehicle based on a distance between each vehicle and the cluster center point;
determining a coverage weight of each vehicle based on the number of communication coverage vehicles of each vehicle;
determining a fusion weight of each vehicle based on the speed weight, the position weight and the coverage weight of each vehicle;
and determining the vehicle with the maximum fusion weight as the cluster head of the vehicle cluster.
4. The data distribution method according to claim 2 or 3, wherein the cluster head of the vehicle cluster is updated based on the steps of:
receiving adjacent vehicle information broadcast by member vehicles in the vehicle cluster;
updating and broadcasting control information of the vehicle cluster based on the adjacent vehicle information so that member vehicles in the vehicle cluster calculate the fusion weight according to the control information;
calculating the fusion weight of the current vehicle, and accepting the fusion weight broadcasted by the member vehicles in the vehicle cluster;
and updating the cluster head of the vehicle cluster based on the fusion weight of the current vehicle and the fusion weight broadcasted by the member vehicles in the vehicle cluster, and broadcasting vehicle cluster control information carrying updated cluster head identification.
5. The data distribution method according to claim 2, wherein before detecting each vehicle of the vehicle cluster and obtaining at least one of a traveling speed, a vehicle position, and a number of communication-covered vehicles of the vehicle cluster, the method further comprises:
and eliminating the interference of the vehicle-mounted radar for sensing the running information of the adjacent vehicles and the communication transceiver for sensing the information sharing in the same frequency band by adopting an interference elimination algorithm based on an atomic norm minimization theory.
6. A method for data distribution, comprising:
in the case that a current vehicle is a member vehicle in a vehicle cluster to which the current vehicle belongs, broadcasting service capability of the current vehicle so that a cluster head in the vehicle cluster to which the current vehicle belongs can determine a sender vehicle from the vehicle cluster based on the service capability of the cluster head and the service capability broadcasted by each member vehicle in the vehicle cluster, the vehicle cluster being determined based on each vehicle adjacent to the current vehicle in the same driving direction;
receiving a vehicle identification of the sender vehicle broadcast by the cluster head;
and under the condition that the vehicle identification of the sender vehicle is consistent with the vehicle identification of the current vehicle, distributing the cache data.
7. The data distribution method according to claim 6, further comprising:
and updating the vehicle cluster attribution state of the current vehicle based on the distance between the current vehicle and the cluster head of the vehicle cluster to which the current vehicle belongs and/or the distance between the current vehicle and the cluster head of other vehicle clusters.
8. The data distribution method according to claim 1 or 6, wherein the service capability of the current vehicle is determined based on the steps of:
determining a service capability of the current vehicle based on the cached data of the current vehicle and request data of vehicles adjacent to the current vehicle in an opposite driving direction.
9. A data distribution apparatus, comprising:
a sender vehicle determination unit configured to determine a sender vehicle from a vehicle cluster based on a service capability of a current vehicle and a service capability broadcast by each member vehicle in the vehicle cluster, in a case where the current vehicle is a cluster head in the vehicle cluster to which the current vehicle belongs, the vehicle cluster being determined based on each vehicle adjacent to the current vehicle in the same traveling direction;
and the vehicle identification broadcasting unit is used for broadcasting the vehicle identification of the vehicle of the sender to request the vehicle of the sender to distribute the cache data.
10. A data distribution apparatus, comprising:
a service capability broadcasting unit for broadcasting a service capability of a current vehicle in a case where the current vehicle is a member vehicle in a vehicle cluster to which the current vehicle belongs, so that a cluster head in the vehicle cluster to which the current vehicle belongs can determine a sender vehicle from the vehicle cluster based on the service capability of the cluster head and the service capability broadcasted by each member vehicle in the vehicle cluster, the vehicle cluster being determined based on each vehicle adjacent to the current vehicle in the same traveling direction;
a vehicle identification receiving unit for receiving the vehicle identification of the sender vehicle broadcasted by the cluster head;
and the data distribution unit is used for distributing the cache data under the condition that the vehicle identification of the sender vehicle is consistent with the vehicle identification of the current vehicle.
11. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the data distribution method of any one of claims 1 to 5 or implements the data distribution method of any one of claims 6 to 8 when executing the program.
12. A non-transitory computer-readable storage medium on which a computer program is stored, the computer program, when executed by a processor, implementing the data distribution method of any one of claims 1 to 5, or implementing the data distribution method of any one of claims 6 to 8.
CN202210220751.9A 2022-03-08 2022-03-08 Data distribution method and device, electronic equipment and storage medium Pending CN114650500A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210220751.9A CN114650500A (en) 2022-03-08 2022-03-08 Data distribution method and device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210220751.9A CN114650500A (en) 2022-03-08 2022-03-08 Data distribution method and device, electronic equipment and storage medium

Publications (1)

Publication Number Publication Date
CN114650500A true CN114650500A (en) 2022-06-21

Family

ID=81992965

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210220751.9A Pending CN114650500A (en) 2022-03-08 2022-03-08 Data distribution method and device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN114650500A (en)

Citations (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102307373A (en) * 2011-08-23 2012-01-04 哈尔滨工业大学 VANET clustering method taking regard of vehicle traffic characteristic
CN102325306A (en) * 2011-08-23 2012-01-18 哈尔滨工业大学 VANET (vehicular ad-hoc network) clustered broadcasting method based on comprehensive weighting
CN102395111A (en) * 2011-11-28 2012-03-28 北京新岸线移动多媒体技术有限公司 Data transmission method and device
KR20140054673A (en) * 2012-10-29 2014-05-09 현대자동차주식회사 Apparatus for transmitting message based on v2x and method thereof
CN106412820A (en) * 2016-05-23 2017-02-15 北京邮电大学 Mobile ad hoc network cluster head determination method and apparatus
CN107071843A (en) * 2016-12-28 2017-08-18 上海海事大学 Mobile self-organizing network cluster dividing method
CN107426694A (en) * 2017-06-26 2017-12-01 湖南大学 A kind of fuzzy cluster algorithm of vehicular ad hoc network
CN107464436A (en) * 2017-08-02 2017-12-12 北京邮电大学 Information processing method and device based on vehicle sub-clustering
CN108012244A (en) * 2017-11-29 2018-05-08 南京工业大学 Highway vehicular ad hoc network data services communication system and method based on cluster
US20180146471A1 (en) * 2015-06-26 2018-05-24 Zte Corporation Method and apparatus for grouping vehicles in internet of vehicles
CN108650657A (en) * 2018-04-20 2018-10-12 京东方科技集团股份有限公司 Content distribution method, content updating method and relevant apparatus in a kind of car networking
CN109769224A (en) * 2019-03-05 2019-05-17 维沃移动通信有限公司 A kind of car networking information transferring method, the network equipment and terminal
US20190235488A1 (en) * 2018-01-26 2019-08-01 Above Daas, Inc. Autonomous long range aerial vehicles and fleet management system
US20190268725A1 (en) * 2018-02-25 2019-08-29 Qualcomm Incorporated Systems and methods for efficiently supporting broadcast of location assistance data in a wireless network
CN111132257A (en) * 2019-12-24 2020-05-08 中国联合网络通信集团有限公司 C-V2X communication method and device
CN114071631A (en) * 2020-11-10 2022-02-18 北京市天元网络技术股份有限公司 Distributed sensor network data fusion method and system
CN114143350A (en) * 2021-12-02 2022-03-04 安徽江淮汽车集团股份有限公司 Safety communication method based on vehicle-mounted cloud and center cloud communication architecture

Patent Citations (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102325306A (en) * 2011-08-23 2012-01-18 哈尔滨工业大学 VANET (vehicular ad-hoc network) clustered broadcasting method based on comprehensive weighting
CN102307373A (en) * 2011-08-23 2012-01-04 哈尔滨工业大学 VANET clustering method taking regard of vehicle traffic characteristic
CN102395111A (en) * 2011-11-28 2012-03-28 北京新岸线移动多媒体技术有限公司 Data transmission method and device
KR20140054673A (en) * 2012-10-29 2014-05-09 현대자동차주식회사 Apparatus for transmitting message based on v2x and method thereof
US20180146471A1 (en) * 2015-06-26 2018-05-24 Zte Corporation Method and apparatus for grouping vehicles in internet of vehicles
CN106412820A (en) * 2016-05-23 2017-02-15 北京邮电大学 Mobile ad hoc network cluster head determination method and apparatus
CN107071843A (en) * 2016-12-28 2017-08-18 上海海事大学 Mobile self-organizing network cluster dividing method
CN107426694A (en) * 2017-06-26 2017-12-01 湖南大学 A kind of fuzzy cluster algorithm of vehicular ad hoc network
CN107464436A (en) * 2017-08-02 2017-12-12 北京邮电大学 Information processing method and device based on vehicle sub-clustering
CN108012244A (en) * 2017-11-29 2018-05-08 南京工业大学 Highway vehicular ad hoc network data services communication system and method based on cluster
US20190235488A1 (en) * 2018-01-26 2019-08-01 Above Daas, Inc. Autonomous long range aerial vehicles and fleet management system
US20190268725A1 (en) * 2018-02-25 2019-08-29 Qualcomm Incorporated Systems and methods for efficiently supporting broadcast of location assistance data in a wireless network
CN108650657A (en) * 2018-04-20 2018-10-12 京东方科技集团股份有限公司 Content distribution method, content updating method and relevant apparatus in a kind of car networking
CN109769224A (en) * 2019-03-05 2019-05-17 维沃移动通信有限公司 A kind of car networking information transferring method, the network equipment and terminal
CN111132257A (en) * 2019-12-24 2020-05-08 中国联合网络通信集团有限公司 C-V2X communication method and device
CN114071631A (en) * 2020-11-10 2022-02-18 北京市天元网络技术股份有限公司 Distributed sensor network data fusion method and system
CN114143350A (en) * 2021-12-02 2022-03-04 安徽江淮汽车集团股份有限公司 Safety communication method based on vehicle-mounted cloud and center cloud communication architecture

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
何清: "基于公交车的簇内基本安全信息分发机制研究", 《中国优秀硕士学位论文全文数据库》, 15 January 2021 (2021-01-15) *
佚名: "移动机会网络中的节点分簇路由算法", Retrieved from the Internet <URL:《https://blog.csdn.net/ls158390/article/details/122931641》> *
李杏姣等.: "基于公交车辅助的城市车载自组织网络数据分发策略", 《湖南科技大学学报(自然科学版)》, vol. 36, no. 3, 20 September 2021 (2021-09-20) *
杨琼;邢松;夏玮玮;沈连丰;: "一种基于MAC层时延上限的VANET自适应分簇算法", 东南大学学报(自然科学版), no. 01, 20 January 2016 (2016-01-20) *

Similar Documents

Publication Publication Date Title
Yuan et al. Toward efficient content delivery for automated driving services: An edge computing solution
Su et al. An edge caching scheme to distribute content in vehicular networks
Cao et al. Toward pre-empted EV charging recommendation through V2V-based reservation system
Javed et al. Ai-empowered content caching in vehicular edge computing: Opportunities and challenges
Ko et al. RSU-assisted adaptive scheduling for vehicle-to-vehicle data sharing in bidirectional road scenarios
Althamary et al. A survey on multi-agent reinforcement learning methods for vehicular networks
Alsarhan et al. Novel fuzzy and game theory based clustering and decision making for VANETs
Yu et al. A distance-based interest forwarding protocol for vehicular information-centric networks
Noorani et al. SDN-and fog computing-based switchable routing using path stability estimation for vehicular ad hoc networks
Din et al. Left-right-front caching strategy for vehicular networks in icn-based internet of things
CN103763334A (en) Multimedia cooperative sharing method based on P2P-BT in VANET
Huo et al. An enhanced low overhead and stable clustering scheme for crossroads in VANETs
Sadatpour et al. A collision aware opportunistic routing protocol for VANETs in highways
Chen et al. Distribution-aware cache replication for cooperative road side units in VANETs
Rahim et al. An intelligent content caching protocol for connected vehicles
CN111132083A (en) NOMA-based distributed resource allocation method in vehicle formation mode
CN114449477A (en) Internet of vehicles content distribution method based on edge cache and immune clone strategy
Zeng et al. A bus-oriented mobile FCNs infrastructure and intra-cluster BSM transmission mechanism
Wei et al. Identifying transmission opportunity through transmission power and bit rate for improved VANET efficiency
Sun et al. Control efficient power allocation of uplink NOMA in UAV-aided vehicular platooning
Li et al. Deep reinforcement learning for intelligent computing and content edge service in ICN-based IoV
Yu et al. Vehicular ad-hoc networks: an information-centric perspective
Shirani et al. Store-carry-forward message dissemination in vehicular ad-hoc networks with local density estimation
Hu Peer-to-peer data dissemination for deadline-sensitive streaming in vanets
CN114650500A (en) Data distribution method and device, electronic equipment and storage medium

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