CN112566070B - Cooperative data transmission method in Internet of vehicles environment - Google Patents
Cooperative data transmission method in Internet of vehicles environment Download PDFInfo
- Publication number
- CN112566070B CN112566070B CN202011453874.4A CN202011453874A CN112566070B CN 112566070 B CN112566070 B CN 112566070B CN 202011453874 A CN202011453874 A CN 202011453874A CN 112566070 B CN112566070 B CN 112566070B
- Authority
- CN
- China
- Prior art keywords
- vehicle
- rsu
- data
- vehicles
- target vehicle
- 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
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 35
- 238000000034 method Methods 0.000 title claims abstract description 13
- 230000002441 reversible effect Effects 0.000 claims abstract description 36
- 238000004891 communication Methods 0.000 claims abstract description 28
- 230000006855 networking Effects 0.000 claims abstract description 9
- 230000036961 partial effect Effects 0.000 claims description 7
- 230000002452 interceptive effect Effects 0.000 claims description 4
- 238000012546 transfer Methods 0.000 claims description 4
- 230000000903 blocking effect Effects 0.000 claims description 3
- 230000007246 mechanism Effects 0.000 description 5
- 230000002457 bidirectional effect Effects 0.000 description 3
- 238000011160 research Methods 0.000 description 3
- 238000010276 construction Methods 0.000 description 2
- 230000000670 limiting effect Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000002829 reductive effect Effects 0.000 description 2
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006698 induction Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
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/44—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for communication between vehicles and infrastructures, e.g. vehicle-to-cloud [V2C] or vehicle-to-home [V2H]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0226—Traffic management, e.g. flow control or congestion control based on location or mobility
-
- 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
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/121—Wireless traffic scheduling for groups of terminals or users
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/52—Allocation or scheduling criteria for wireless resources based on load
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention relates to a cooperative data transmission method in a vehicle networking environment, which belongs to the technical field of vehicle networking communication and comprises the following steps: s1: forming a cluster of download-assisting vehicles; s2: the vehicle registers self information to the road side unit; s3: the target vehicle sends a downloading request to the road side unit and downloads data from the road side unit; s4: the next road side unit coordinates and selects a reverse assisting vehicle for data downloading; s5: the reverse vehicle forwards the downloaded data; s6: the target vehicle receives the data and repeats step S1. The method and the device enable the target vehicle to still obtain the required file data in the blind Area (Dark Area, DA) without covering the Road Side Unit (RSU), improve the data downloading amount of the target vehicle, increase the data transmission throughput, reduce the influence of data transmission interruption in the blind Area, improve the utilization rate of the blind Area and improve the interruption problem of the vehicle access network of the expressway.
Description
Technical Field
The invention belongs to the technical field of vehicle networking communication, and relates to a cooperative data transmission method in a vehicle networking environment.
Background
The Intelligent internet automobile is an indispensable important component of an Intelligent Traffic System (ITS), and can complete interactive communication, induction and calculation by being equipped with wireless communication equipment, namely an On Board Unit (OBU). Meanwhile, the safety and efficiency of travel can be greatly improved by organically combining communication technologies such as V2V (Vehicle to Vehicle) and V2I (Vehicle to Infrastructure).
Resource nodes such as vehicles and road side units in the network have good capabilities of storing data files, calculating application data and the like, and the road side units have wider communication ranges and larger communication bandwidths relative to the vehicle nodes, and can simultaneously accommodate a plurality of resource nodes in a coverage range to be accessed into the resource nodes for downloading information data. These pieces of information data include not only application information such as weather and maps, but also safety information such as road traffic conditions and warnings. However, due to the deployment cost of RSUs on highways and the high mobility of vehicles, the RSUs have a limited communication range, and it is difficult to provide seamless coverage for all vehicle nodes, and transmission interruption occurs for too large data.
In this regard, a reasonable cooperative data transmission mechanism is very important for increasing data transmission amount and improving user experience. The mechanism can utilize the transmission capability of resource nodes such as bidirectional vehicles, RSUs and the like in the network to enable the nodes to cooperate to transmit data for target vehicles, and further, factors influencing data transmission such as competition transmission among the nodes are considered, so that the vehicles can continuously transmit data when driving in a blind area, and the influence of data transmission interruption of the blind area is reduced.
Most current research focuses on throughput and latency, typically such as vehicle store-and-carry-and-forward (CSCF) mechanisms, to assist data transmission of a target vehicle by selecting vehicles in the same direction and in the opposite direction, but the same-direction and opposite-direction authors only select two relay assist nodes and do not fully utilize V2V communication resources. And based on vehicle mobility prediction and throughput estimation among nodes, the constructed Storage Time Aggregation Graph (STAG) plan transmission scheme provides a V2V and V2I cooperative downloading mechanism in a similar vehicle network in order to meet services and applications requiring high throughput and low delay in an on-board network, and an iterative greedy driving algorithm is designed to derive a suboptimal solution to be distributed to vehicles in an approximately optimal mode. However, the above-mentioned assistance data transmission mechanism neglects to fully utilize the resources of the bidirectional node, the stability of the access network, and the data flow problem between vehicles in the data forwarding process. Also, the current assisted downloading is roughly divided into an expressway scene and an urban road scene according to an application scene. The urban road structure is complex, the vehicle running speed is different, the track is changeable, the traffic flow density is large, and the research is generally carried out around the vehicle running track and the arrangement of the road construction unit RSU under the condition. In a high-speed environment, RSUs are sparsely deployed, the running speed of vehicles is stable, the traffic flow density is low, and the vehicle track is easy to predict, so that the auxiliary downloading in the scene mainly researches how to improve the utilization rate of blind areas between adjacent RSUs and assist the selection of the vehicles.
Disclosure of Invention
In view of this, the present invention aims to solve the problem that the amount of blind area downloaded data in the car networking is limited, so as to increase the amount of blind area data transmission, reduce the influence of data transmission interruption, improve user experience, and provide a cooperative data transmission method in the car networking environment.
In order to achieve the purpose, the invention provides the following technical scheme:
a cooperative data transmission method in a vehicle networking environment comprises the following steps:
s1: forming a cluster of download-assisting vehicles;
s2: the vehicle registers self information with the RSU;
s3: the target vehicle sends a downloading request to the RSU and downloads data from the RSU;
s4: the next RSU coordinates and selects a reverse assisting vehicle for data downloading;
s5: the reverse vehicle forwards the downloaded data;
s6: the target vehicle receives the data and repeats step S1.
Further, in step S1, the target vehicle enters the i-th road side unit RSU i And sending a broadcast assistance request to form an assistance downloading vehicle cluster.
Further, in step S2, when the vehicle enters the RSU coverage area, the vehicle registers its own information including the ID, the vehicle speed, and the time of entering the RSU with the RSU.
Further, step S3 specifically includes:
s31: target vehicle and co-directional assisted vehicle entering RSU i To RSU i Sending a downloading request, and downloading partial data from the downloading request, wherein the number of vehicles in the cluster is calculated by the following formula (1):
wherein P is d Is the probability, ρ, that a vehicle becomes the last vehicle inside the cluster s The traffic density in the driving direction of the target vehicle is the vehicle communication radius R v ；
S32: the average amount of data received by each vehicle over the dwell time T in the RSU is calculated as follows:
wherein the speed of the vehicle in the same direction as the target vehicle is v s ，λ s ＝ρ s v s For the vehicle arrival rate in the poisson distribution, c represents the maximum number of vehicles that can be accommodated in the RSU coverage area, R i F (0) and f (c) are the probabilities of system idle and blocking for the RSU coverage radius, which is calculated by the following formula:
data transmission rate B i In relation to the area, the vehicle is in area c i Corresponding dwellAt a time of
Wherein L is i Is a region c i The length of (a) of (b),
is the total time that the vehicle stays in the RSU, and the amount of the co-directional assistance download data obtained by the target vehicle is expressed as:
further, in step S4, the target vehicle leaves the RSU i ，RSU i Transmitting the remaining file data to the next RSU i+1 ，RSU i+1 Coordinate and select reverse-aiding vehicles and download data from themselves.
Further, step S5 specifically includes:
assisting vehicles in the same-direction cluster competitively forward the downloaded data carried by the assisting vehicles to the target vehicle, wherein the forwarding time of the same-direction assisting vehicles is represented as:
Γ i,j the throughput transmitted for any two nodes except the target vehicle in the cluster, i.e. the payload sent by a single node in each transmission, is expressed as:
wherein P is suc Is the probability of successful transmission of a certain vehicle node in a certain time slot, L is the payload, i.e., the packet length, E [ T ] slot ]Is the average length of a slot; the throughput obtained by the same-direction assistance mode is as follows:
further, step S6 specifically includes:
after the same-direction forwarding is completed, the target vehicles receive the data carried by the encountered reverse assisting vehicles one by one; for the reverse assisting vehicle, firstly, the communication with the target vehicle occurs after the forward of the same-direction assisting vehicle to the target vehicle is completed; the total data amount downloaded by the forwarding reverse direction assisting vehicle is as follows:
wherein N is rev In order to assist the number of vehicles in the reverse direction,
the amount of data downloaded for a single reverse vehicle node is expressed as:
wherein v is r For reversing the vehicle speed, B v Is the rate of data transfer between the vehicles,
guiding the RSU according to the data forwarding amount and time of interactive communication for the time of communication when two vehicles meet i+1 For coordinating opposing vehicles, primarily in terms of the amount of data distributed to individual opposing vehicles and the selection of opposing vehicles;
when RSU i+1 Receiving RSU i When the transmitted data receives the request for assisting downloading, the information of the meeting time of each vehicle and the target vehicle in the List List is calculated and stored in the set M ≦ (id ≦ M n ,v n ,t n ,S n ,E n ,T n ) In, where id n I.e. the ID, t of the nth vehicle n I.e. the time to enter the RSU, S n 、E n Respectively representing the time of starting and ending communication between the nth vehicle and the target vehicle in the reverse direction, T n Indicating that the nth vehicle is in the RSU i+1 The time selected as the assisting vehicle is obtained according to the vehicle information in the registry:
where U is the distance, t, covering the blind zone between RSUs s Is the target vehicle entering the RSU i Time of (d). In order to avoid data forwarding failure, the assisting vehicle node is performed after the forwarding of the previous node is completed, and for the reverse assisting vehicle i and the following vehicle j:
T i +E i ≤T j +S j (12)
therefore, the first communication between the reverse-direction assisting vehicle and the target vehicle should occur after the forward transfer of the same-direction assisting vehicle to the target vehicle is completed, so that the following conditions are satisfied:
and the last vehicle node for reverse assistance should drive into the RSU at the target vehicle i+1 Forwarding data ends before, because the target vehicle enters the RSU once i+1 Can be selected from the RSU i+1 Direct download of unfinished data volume enjoys greater bandwidth, so we find:
for RSU i+1 Selected reverse-assisted vehicle number N rev And the total data volume D downloaded by the reverse-direction assisting vehicle is obtained through the formula (8) rev The throughput obtained in the reverse-direction assistance mode is as follows:
in summary, the overall throughput achieved by the target vehicle is:
the invention has the beneficial effects that: the method and the device enable the target vehicle to still obtain the required file data in the blind area which is not covered by the RSU, improve the data downloading amount of the target vehicle, increase the data transmission throughput, reduce the influence of data transmission interruption in the blind area, improve the utilization rate of the blind area and improve the interruption problem of the access network of the vehicles on the highway.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention may be realized and attained by the means of the instrumentalities and combinations particularly pointed out hereinafter.
Drawings
For the purposes of promoting a better understanding of the objects, aspects and advantages of the invention, reference will now be made to the following detailed description taken in conjunction with the accompanying drawings in which:
FIG. 1 is a practical application scenario of the present invention;
FIG. 2 is a flow chart of the present invention.
Detailed Description
The following embodiments of the present invention are provided by way of specific examples, and other advantages and effects of the present invention will be readily apparent to those skilled in the art from the disclosure herein. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention in a schematic way, and the features in the following embodiments and examples may be combined with each other without conflict.
Wherein the showings are for the purpose of illustration only and not for the purpose of limiting the invention, shown in the drawings are schematic representations and not in the form of actual drawings; to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product; it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The same or similar reference numerals in the drawings of the embodiments of the present invention correspond to the same or similar components; in the description of the present invention, it should be understood that if there is an orientation or positional relationship indicated by terms such as "upper", "lower", "left", "right", "front", "rear", etc., based on the orientation or positional relationship shown in the drawings, it is only for convenience of description and simplification of description, but it is not an indication or suggestion that the referred device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and therefore, the terms describing the positional relationship in the drawings are only used for illustrative purposes, and are not to be construed as limiting the present invention, and the specific meaning of the terms may be understood by those skilled in the art according to specific situations.
The general scheme of the invention is as follows: when a target vehicle enters the RSU coverage range, carrying out V2I communication with the RSU by means of competitive access so as to obtain partial data of a required file, and if the file downloading is not completed when the target vehicle exits the RSU coverage range, carrying out auxiliary downloading by carrying out V2V communication with an assisting vehicle, wherein the assisting vehicle is a cluster which downloads partial data for the target vehicle when passing through the RSU and is willing to provide help for the target vehicle, and competitively forwards the downloaded data to the target vehicle when passing through a blind area. Meanwhile, the next RSU in the traveling direction of the target vehicle selects a reverse assisting vehicle, downloads partial data and transmits the data to the target vehicle in a forwarding mode when the blind area meets the target vehicle. As such, the amount of data downloaded by the target vehicle will be further increased.
The system model considers a bidirectional expressway, and as shown in fig. 1, road construction units RSUs are deployed on the roadside and have the same interval d, and the blind area distance between the two RSUs is U. And the RSU may be connected to the core network by wireless or wire. Each vehicle entering the RSU coverage area will register its own information with the RSU, including the ID, vehicle speed, and time of entry into the RSU.
As shown in FIG. 2, a cooperative data transmission method in a car networking environment
1) The target vehicle enters the ith Road Side Unit (RSU) i Before, sending a broadcast assistance request to form an assistance downloading vehicle cluster;
2) registering self information including ID, vehicle speed and time of entering the RSU with the RSU when the vehicle enters the coverage of the RSU;
3) target vehicle and co-directional assisted vehicle entering RSU i To RSU i Sending a downloading request and downloading partial data from the downloading request;
4) target vehicle leaving RSU i Then RSU i Transmitting the remaining file data to the next RSU i+1 ，RSU i+1 Coordinating and selecting reverse assisting vehicles, and downloading data from the vehicles;
5) assisting vehicles in the equidirectional cluster to competitively forward the downloaded data carried by the vehicles to the target vehicle;
6) after the same-direction forwarding is completed, the target vehicle receives the data carried by the encountered reverse assisting vehicle;
7) and (4) the target vehicle leaves the RSU coverage blind area, a cooperation downloading period is completed, and the step 1 is repeated.
The present example is illustrated below:
the first step is as follows: target vehicle entering RSU i And sending a broadcast assistance request to form an assistance downloading vehicle cluster.
The second step is that: when the vehicle enters the coverage area of the RSU, self information including the ID, the vehicle speed and the time of entering the RSU is registered to the RSU.
The third step: target vehicle and co-directional assisted vehicle entering RSU i To RSU i Sending a downloading request, and downloading partial data from the downloading request, wherein the number of vehicles in the cluster is calculated by the following formula (1):
wherein P is d Is the probability, ρ, that a vehicle becomes the last vehicle inside the cluster s The flow density of the target vehicle in the running direction and the vehicle speed in the same direction as the target vehicle are v s The vehicle communication radius is R v ；
The average amount of data received by each vehicle over the dwell time T in the RSU is calculated as follows:
wherein the speed of the vehicle in the same direction as the target vehicle is v s ，λ s ＝ρ s v s For the vehicle arrival rate in the poisson distribution, c represents the maximum number of vehicles that can be accommodated in the RSU coverage area, R i F (0) and f (c) are the probabilities of system idle and blocking for the RSU coverage radius, which is calculated by the following formula:
data transmission rate B i In relation to the area, the vehicle is in area c i Corresponding residence times of
Wherein L is i Is a region c i The length of (a) of (b),
is the total time that the vehicle stays in the RSU, and the amount of the co-directional assistance download data obtained by the target vehicle is expressed as:
the fourth step: target vehicle leaving RSU i ，RSU i Transmitting remaining file data to RSU i+1 ，RSU i+1 Coordinate and select reverse-aiding vehicles and download data from themselves.
The fifth step: assisting vehicles in the same-direction cluster competitively forward the downloaded data carried by the assisting vehicles to the target vehicle, wherein the forwarding time of the same-direction assisting vehicles is represented as:
Γ i,j the throughput transmitted for any two nodes except the target vehicle in the cluster, i.e. the payload sent by a single node in each transmission, is expressed as:
wherein P is suc Is the probability of successful transmission of a certain vehicle node in a certain time slot, L is the payload, i.e., the packet length, E [ T ] slot ]Is the average length of a slot; the throughput obtained by the same-direction assistance mode is as follows:
and a sixth step: after the same-direction forwarding is completed, the target vehicles receive the data carried by the encountered reverse assisting vehicles one by one; for the reverse assisting vehicle, firstly, the communication with the target vehicle occurs after the forward of the same-direction assisting vehicle to the target vehicle is completed; the total data amount downloaded by the forwarding reverse direction assisting vehicle is as follows:
wherein, N rev In order to assist the number of vehicles in the reverse direction,
the amount of data downloaded for a single reverse vehicle node is expressed as:
wherein v is r For reversing the vehicle speed, B v Is the rate of data transfer between the vehicles,
guiding the RSU according to the data forwarding amount and time of interactive communication for the time of communication when two vehicles meet i+1 For coordinating opposing vehicles, primarily in terms of the amount of data distributed to individual opposing vehicles and the selection of opposing vehicles;
when RSU i+1 Receive RSU i When the transmitted data receives the request for assisting downloading, the information of the meeting time of each vehicle and the target vehicle in the List List is calculated and stored in the set M ≦ (id ≦ M n ,v n ,t n ,S n ,E n ,T n ) In, where id n I.e. the ID, t of the nth vehicle n I.e. the time to enter the RSU, S n 、E n Respectively representing the time of starting and ending communication between the nth vehicle and the target vehicle in the reverse direction, T n Indicating that the nth vehicle is in the RSU i+1 The time selected as the assisting vehicle is obtained according to the vehicle information in the registry:
where U is the distance, t, covering the blind zone between RSUs s Is the target vehicle entering the RSU i Time of (d). To avoid data forwarding failure, the assisting vehicle node is performed after the forwarding of the previous node is completed, so for the backward assisting vehicle i and the following vehicle j:
T i +E i ≤T j +S j (12)
and for the reverse-direction assisting vehicle, the first communication with the target vehicle should occur after the forward of the same-direction assisting vehicle to the target vehicle is completed, so that the following conditions are satisfied:
and the last vehicle node for reverse assistance should drive into the RSU at the target vehicle i+1 Forwarding data ends before, because the target vehicle enters the RSU once i+1 Can be selected from the RSU i+1 Direct download of unfinished data volume enjoys greater bandwidth, so we find:
for RSU i+1 Selected reverse-assisted vehicle number N rev And the total data volume D downloaded by the reverse-direction assisting vehicle is obtained through the formula (8) rev The throughput obtained in the reverse-direction assistance mode is as follows:
in summary, the overall throughput obtained by the target vehicle is:
the seventh step: the target vehicle leaves the RSU coverage blind area, a cooperative download cycle is completed, and step S1 is repeated.
Finally, the above embodiments are only intended to illustrate the technical solutions of the present invention and not to limit the present invention, and although the present invention has been described in detail with reference to the preferred embodiments, it will be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions, and all of them should be covered by the claims of the present invention.
Claims (2)
1. A cooperative data transmission method in a vehicle networking environment is characterized in that: the method comprises the following steps:
s1: the target vehicle enters the ith Road Side Unit (RSU) i Before, sending a broadcast assistance request to form an assistance downloading vehicle cluster;
s2: registering self information including ID, vehicle speed and time of entering the RSU with the RSU when the vehicle enters the coverage of the RSU;
s3: target vehicle and co-directional assisted vehicle entering RSU i To RSU i Sending a downloading request and downloading partial data from the downloading request; step S3 specifically includes:
s31: the number of vehicles inside the cluster is calculated by the following formula (1):
wherein P is d Is the probability, ρ, that a vehicle becomes the last vehicle inside the cluster s The traffic density in the driving direction of the target vehicle is the vehicle communication radius R v ；
S32: the average amount of data received by each vehicle over the dwell time T in the RSU is calculated as follows:
wherein the speed of the vehicle in the same direction as the target vehicle is v s ，λ s ＝ρ s v s For the vehicle arrival rate in the poisson distribution, c represents the maximum number of vehicles that can be accommodated in the RSU coverage area, R i F (0) and f (c) are the probabilities of system idle and blocking for the RSU coverage radius, which is calculated by the following formula:
data transmission rate B i In relation to the area, 7 means that the RSU coverage is divided into 7 areas, and the vehicle is in area c i Corresponding residence times in
Wherein L is i Is a region c i The length of (a) of (b),
is the total time that the vehicle stays in the RSU, and the amount of the co-directional assistance download data obtained by the target vehicle is expressed as:
s4: target vehicle leaving RSU i Then RSU i Transmitting the remaining file data to the next RSU i+1 ，RSU i+1 Coordinating and selecting reverse assisting vehicles, and downloading data from the vehicles;
s5: assisting vehicles in the equidirectional cluster to competitively forward the downloaded data carried by the vehicles to the target vehicle; the forwarding time of the equidirectional assist vehicle in step S5 is represented as:
Γ i,j throughput for any two nodes transmission within a cluster except for the target vehicleI.e. the amount of payload sent by a single node in each transmission, is expressed as:
wherein P is suc Is the probability of successful transmission of a certain vehicle node in a certain time slot, L is the payload, i.e., the packet length, E [ T ] slot ]Is the average length of a slot; the throughput obtained by the same-direction assistance mode is as follows:
s6: after the same-direction forwarding is completed, the target vehicle receives the data carried by the encountered reverse assisting vehicle;
s7: the target vehicle leaves the RSU coverage blind area, a cooperative download cycle is completed, and step S1 is repeated.
2. The method for cooperative data transmission in an internet of vehicles environment according to claim 1, wherein: step S6 specifically includes:
after the same-direction forwarding is completed, the target vehicles receive the data carried by the encountered reverse assisting vehicles one by one; for the reverse assisting vehicle, firstly, the communication with the target vehicle occurs after the forward of the same-direction assisting vehicle to the target vehicle is completed; the total data amount downloaded by the forwarding reverse direction assisting vehicle is as follows:
wherein N is rev In order to assist the number of vehicles in the reverse direction,
the amount of data downloaded for a single reverse vehicle node is expressed as:
wherein v is r For reversing the vehicle speed, B v Is the rate of data transfer between the vehicles,
guiding the RSU according to the data forwarding amount and time of interactive communication for the time of communication when two vehicles meet i+1 For coordinating opposing vehicles, primarily in terms of the amount of data distributed to individual opposing vehicles and the selection of opposing vehicles;
when RSU i+1 Receiving RSU i When the transmitted data receives the request for assisting downloading, the id of each vehicle and the target vehicle in the List List is calculated n ,v n ,t n ,S n ,E n ,T n And storing the set M ═ M (id) n ,v n ,t n ,S n ,E n ,T n ) In, where id n I.e. the ID, t of the nth vehicle n I.e. the time to enter the RSU, S n 、E n Respectively representing the time of starting and ending communication between the nth vehicle and the target vehicle in the reverse direction, T n Indicating that the nth vehicle is in the RSU i+1 The time selected as the assisting vehicle is obtained according to the vehicle information in the registry:
where U denotes the distance between RSUs covering a blind area, t s Is the target vehicle entering the RSU i The time of (d); to avoid data forwarding failure, the assisting vehicle node is performed after the forwarding of the previous node is completed, and for the reverse assisting vehicle i and the following vehicle j：
T i +E i ≤T j +S j (12)
The reverse assisting vehicle firstly communicates with the target vehicle, and after the forward of the same-direction assisting vehicle to the target vehicle is completed, the following conditions are met:
the last vehicle node for reverse assistance drives into the RSU at the target vehicle i+1 The data forwarding is finished before, and the following results are obtained:
for RSU i+1 Selected reverse-assisted vehicle number N rev And the total data volume D downloaded by the reverse-direction assisting vehicle is obtained through the formula (8) rev The throughput obtained in the reverse-direction assistance mode is as follows:
the overall throughput achieved by the target vehicle is:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011453874.4A CN112566070B (en) | 2020-12-09 | 2020-12-09 | Cooperative data transmission method in Internet of vehicles environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011453874.4A CN112566070B (en) | 2020-12-09 | 2020-12-09 | Cooperative data transmission method in Internet of vehicles environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112566070A CN112566070A (en) | 2021-03-26 |
| CN112566070B true CN112566070B (en) | 2022-08-09 |
Family
ID=75061633
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011453874.4A Active CN112566070B (en) | 2020-12-09 | 2020-12-09 | Cooperative data transmission method in Internet of vehicles environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112566070B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113347606B (en) * | 2021-06-25 | 2022-11-22 | 长安大学 | V2I/V2V network cooperative transmission method and system based on elastic partition |
| CN113783964B (en) * | 2021-09-17 | 2023-06-30 | 首都师范大学 | Data collaborative transmission method and device for social networking services |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103491186A (en) * | 2013-09-30 | 2014-01-01 | 中国石油大学(华东) | Vehicle internet assisting downloading method based on dynamic time slot |
| CN104601667A (en) * | 2014-12-23 | 2015-05-06 | 武汉大学 | Gapless vehicle networking assist downloading method |
| CN105847349A (en) * | 2016-03-22 | 2016-08-10 | 中国石油大学(华东) | Distributed fountain code-based Internet of Vehicles-assisted download method |
| CN107786941A (en) * | 2017-09-29 | 2018-03-09 | 西安电子科技大学 | It is a kind of to be cooperated method for down loading based on the file that prefetches |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10127810B2 (en) * | 2012-06-07 | 2018-11-13 | Zoll Medical Corporation | Vehicle safety and driver condition monitoring, and geographic information based road safety systems |
| US11012362B2 (en) * | 2018-06-18 | 2021-05-18 | Akamai Technologies, Inc. | Download management with congestion mitigation for over the air content delivery to vehicles |
| CN108985658B (en) * | 2018-08-07 | 2023-05-16 | 燕山大学 | Internet of vehicles collaborative downloading method based on fuzzy judgment and client expectation |
| CN108990016B (en) * | 2018-08-17 | 2019-11-26 | 电子科技大学 | A kind of calculating task unloading of more vehicles collaboration and transmission method |
-
2020
- 2020-12-09 CN CN202011453874.4A patent/CN112566070B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103491186A (en) * | 2013-09-30 | 2014-01-01 | 中国石油大学(华东) | Vehicle internet assisting downloading method based on dynamic time slot |
| CN104601667A (en) * | 2014-12-23 | 2015-05-06 | 武汉大学 | Gapless vehicle networking assist downloading method |
| CN105847349A (en) * | 2016-03-22 | 2016-08-10 | 中国石油大学(华东) | Distributed fountain code-based Internet of Vehicles-assisted download method |
| CN107786941A (en) * | 2017-09-29 | 2018-03-09 | 西安电子科技大学 | It is a kind of to be cooperated method for down loading based on the file that prefetches |
Non-Patent Citations (5)
| Title |
|---|
| DSRelay: A scheme of cooperative downloading based on dynamic slot;J. Liu, J. Bi, Y. Bian, X. Liu and Z. Li;《2012 IEEE International Conference on Communications (ICC)》;20121129;全文 * |
| Integrity-oriented content transmission in highway vehicular ad hoc networks;T. H. Luan, X. Sherman Shen and F. Bai;《2013 Proceedings IEEE INFOCOM》;20130725;第Ⅲ节 * |
| Routing in Sparse Vehicular Ad Hoc Wireless Networks;N. Wisitpongphan, F. Bai, P. Mudalige, V. Sadekar and O. Tonguz;《IEEE Journal on Selected Areas in Communications》;20071015;第25卷(第8期);第V节 * |
| 基于动态时槽的车联网协助下载方法研究;刘建航,孙江明,毕经平,边永超,刘新宇,李忠诚;《计算机学报》;20110831;第34卷(第8期);全文 * |
| 高速公路场景中的车联网协助下载方法研究;薛平;《信息科技辑》;20170212;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112566070A (en) | 2021-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112566070B (en) | Cooperative data transmission method in Internet of vehicles environment | |
| Mekrache et al. | Deep reinforcement learning techniques for vehicular networks: Recent advances and future trends towards 6G | |
| CN104766484B (en) | Traffic Control and Guidance system and method based on Evolutionary multiobjective optimization and ant group algorithm | |
| CN105245608A (en) | Telematics network node screening and accessibility routing construction method based on self-encoding network | |
| CN105208616A (en) | Road topology based adaptive multi-copy routing method in vehicular ad hoc network | |
| CN107426694A (en) | A kind of fuzzy cluster algorithm of vehicular ad hoc network | |
| WO2022151056A1 (en) | Parking recommendation method and system for wireless charging parking space | |
| CN109905921B (en) | Multi-channel environment Internet of vehicles V2R/V2V cooperative data transmission scheduling method | |
| CN109600715B (en) | Internet of vehicles V2X communication auxiliary file downloading method | |
| CN104080056A (en) | Message distribution method for vehicle-mounted self-organizing network based on connectivity probability perception | |
| CN108647802A (en) | Based on the anti-congestion methods of double-layer traffic network model | |
| CN110363986A (en) | A kind of centralized merging area car speed optimization method based on the game of vehicle vehicle and driving potential field power | |
| CN113132943A (en) | Task unloading scheduling and resource allocation method for vehicle-side cooperation in Internet of vehicles | |
| CN104735683A (en) | RSU arrangement method oriented to information collection time delay guarantee in urban road network | |
| CN103458482A (en) | Evolutionary game method for solving access problem of RSU in VANET | |
| CN114374741A (en) | Dynamic grouping internet-of-vehicle caching method based on reinforcement learning under MEC environment | |
| CN107786941A (en) | It is a kind of to be cooperated method for down loading based on the file that prefetches | |
| CN116261119A (en) | Intelligent collaborative task calculation and on-demand resource allocation method in vehicle-mounted environment | |
| CN106060836A (en) | Information sharing method capable of reducing transmission delay in wireless network | |
| CN106332296A (en) | Method for scheduling radio resources in car-mounted communication system | |
| CN113724507A (en) | Traffic control and vehicle induction cooperation method and system based on deep reinforcement learning | |
| CN105303836A (en) | Vehicle cluster information transmission method based on health state of vehicle | |
| CN108769948A (en) | A kind of resource allocation methods of isomery In-vehicle networking | |
| CN115830885B (en) | Vehicle ramp confluence cooperative control method considering energy consumption of multiple vehicle types | |
| CN113347606B (en) | V2I/V2V network cooperative transmission method and system based on elastic partition |
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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: Lin Feng Inventor after: Ding Pengju Inventor after: Luo Chengwen Inventor after: Jiang Jianchun Inventor before: Lin Feng Inventor before: Ding Pengju Inventor before: Liang Jishen Inventor before: Luo Chengwen Inventor before: Jiang Jianchun |
|
| CB03 | Change of inventor or designer information | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240124 Address after: No. 10-20, Building 4, No. 170 Keyuan Fourth Road, Jiulongpo District, Chongqing, 400041 Patentee after: Chongqing Mouyi Technology Co.,Ltd. Country or region after: China Address before: 400065 Chongqing Nan'an District huangjuezhen pass Chongwen Road No. 2 Patentee before: CHONGQING University OF POSTS AND TELECOMMUNICATIONS Country or region before: China |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240407 Address after: 401120 No. 19, Zhuoyue Road, Longxing Town, Liangjiang New Area, Yubei District, Chongqing Patentee after: Chongqing Yuanchuang Zhilian Technology Co.,Ltd. Country or region after: China Address before: No. 10-20, Building 4, No. 170 Keyuan Fourth Road, Jiulongpo District, Chongqing, 400041 Patentee before: Chongqing Mouyi Technology Co.,Ltd. Country or region before: China |
|
| TR01 | Transfer of patent right |