CN112566070A - Cooperative data transmission method in Internet of vehicles environment - Google Patents

Cooperative data transmission method in Internet of vehicles environment Download PDF

Info

Publication number
CN112566070A
CN112566070A CN202011453874.4A CN202011453874A CN112566070A CN 112566070 A CN112566070 A CN 112566070A CN 202011453874 A CN202011453874 A CN 202011453874A CN 112566070 A CN112566070 A CN 112566070A
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.)
Granted
Application number
CN202011453874.4A
Other languages
Chinese (zh)
Other versions
CN112566070B (en
Inventor
林峰
丁鹏举
梁吉申
罗铖文
蒋建春
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing Yuanchuang Zhilian Technology Co.,Ltd.
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN202011453874.4A priority Critical patent/CN112566070B/en
Publication of CN112566070A publication Critical patent/CN112566070A/en
Application granted granted Critical
Publication of CN112566070B publication Critical patent/CN112566070B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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

Cooperative data transmission method in Internet of vehicles environment
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 excessively 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 bidirectional vehicles and the RSUs to cooperate to transmit data for target vehicles, and further, factors influencing data transmission, such as competition transmission among the nodes and the like, are considered, so that the vehicles can continuously transmit data when driving in a blind area, and the influence of interruption of data transmission in 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 RSUiAnd 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 RSUiTo RSUiSending 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):
Figure BDA0002825991600000021
wherein P isdIs the probability, ρ, that a vehicle becomes the last vehicle inside the clustersThe traffic density in the driving direction of the target vehicle is the vehicle communication radius Rv；
S32: the average amount of data received by each vehicle over the dwell time T in the RSU is calculated as follows:
Figure BDA0002825991600000022
wherein the speed of the vehicle in the same direction as the target vehicle is vs，λs＝ρsvsFor the vehicle arrival rate in the poisson distribution, c represents the maximum number of vehicles that can be accommodated in the RSU coverage area, RiF (0) and f (c) are the probabilities of system idle and blocking for the RSU coverage radius, which is calculated by the following formula:
Figure BDA0002825991600000031
data transmission rate BiIn relation to the area, the vehicle is in area ciCorresponding residence times of
Figure BDA0002825991600000032
Wherein L isiIs a region ciThe length of (a) of (b),
Figure BDA0002825991600000033
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:
Figure BDA0002825991600000034
further, in step S4, the target vehicle leaves the RSUi，RSUiTransmitting the remaining file data to the next RSUi+1，RSUi+1Coordinate 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:
Figure BDA0002825991600000035
Γi,jthe 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:
Figure BDA0002825991600000036
wherein P issucIs 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 an average of one time slotA length; the throughput obtained by the same-direction assistance mode is as follows:
Figure BDA0002825991600000037
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:
Figure BDA0002825991600000038
wherein N isrevIn order to assist the number of vehicles in the reverse direction,
Figure BDA0002825991600000039
the amount of data downloaded for a single reverse vehicle node is expressed as:
Figure BDA00028259916000000310
wherein v isrFor reversing the vehicle speed, BvIs the rate of data transfer between the vehicles,
Figure BDA0002825991600000041
guiding the RSU according to the data forwarding amount and time of interactive communication for the time of communication when two vehicles meeti+1For coordinating opposing vehicles, primarily in terms of the amount of data distributed to individual opposing vehicles and the selection of opposing vehicles;
when RSUi+1Receiving RSUiWhen 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 ≦ Mn,vn,tn,Sn,En,Tn) In, where idnI.e. the ID, t of the nth vehiclenI.e. the time to enter the RSU, Sn、EnRespectively representing the time of starting and ending communication between the nth vehicle and the target vehicle in the reverse direction, TnIndicating that the nth vehicle is in the RSUi+1The time selected as the assisting vehicle is obtained according to the vehicle information in the registry:
Figure BDA0002825991600000042
Figure BDA0002825991600000043
where U is the distance, t, covering the blind zone between RSUssIs the target vehicle entering the RSUiTime 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:
Ti+Ei≤Tj+Sj (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:
Figure BDA0002825991600000044
and the last vehicle node for reverse assistance should drive into the RSU at the target vehiclei+1Forwarding data ends before, because the target vehicle enters the RSU oncei+1Can be selected from the RSUi+1Direct download of unfinished data volume enjoys greater bandwidth, so we find:
Figure BDA0002825991600000045
for RSUi+1Selected reverse-assisted vehicle number NrevAnd the total data volume D downloaded by the reverse-direction assisting vehicle is obtained through the formula (8)revThe throughput obtained in the reverse-direction assistance mode is as follows:
Figure BDA0002825991600000046
in summary, the overall throughput achieved by the target vehicle is:
Figure BDA0002825991600000047
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 embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. 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 illustrating the invention only and not for the purpose of limiting the same, and in which there is shown by way of illustration only and not in the drawings in which there is no intention to limit the invention thereto; 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)iBefore, 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 RSUiTo RSUiSending a downloading request and downloading partial data from the downloading request;
4) target vehicle leaving RSUiThen RSUiTransmitting the remaining file data to the next RSUi+1，RSUi+1Coordinating 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 RSUiAnd 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 RSUiTo RSUiSending 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):
Figure BDA0002825991600000061
wherein P isdIs the probability, ρ, that a vehicle becomes the last vehicle inside the clustersThe flow density of the target vehicle in the running direction and the vehicle speed in the same direction as the target vehicle are vsThe vehicle communication radius is Rv；
The average amount of data received by each vehicle over the dwell time T in the RSU is calculated as follows:
Figure BDA0002825991600000062
wherein the speed of the vehicle in the same direction as the target vehicle is vs，λs＝ρsvsFor the vehicle arrival rate in the poisson distribution, c represents the maximum number of vehicles that can be accommodated in the RSU coverage area, RiF (0) and f (c) are the probabilities of system idle and blocking for the RSU coverage radius, which is calculated by the following formula:
Figure BDA0002825991600000071
data transmission rate BiIn relation to the area, the vehicle is in area ciCorresponding residence times of
Figure BDA0002825991600000072
Wherein L isiIs a region ciThe length of (a) of (b),
Figure BDA0002825991600000073
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:
Figure BDA0002825991600000074
the fourth step: target vehicle leaving RSUi，RSUiTransmitting remaining file data to RSUi+1，RSUi+1Coordinate 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:
Figure BDA0002825991600000075
Γi,jthe 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:
Figure BDA0002825991600000076
wherein P issucIs 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:
Figure BDA0002825991600000077
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:
Figure BDA0002825991600000078
wherein N isrevIn order to assist the number of vehicles in the reverse direction,
Figure BDA0002825991600000079
the amount of data downloaded for a single reverse vehicle node is expressed as:
Figure BDA00028259916000000710
wherein v isrFor reversing the vehicle speed, BvIs the rate of data transfer between the vehicles,
Figure BDA00028259916000000711
guiding the RSU according to the data forwarding amount and time of interactive communication for the time of communication when two vehicles meeti+1For coordinating opposing vehicles, primarily in terms of the amount of data distributed to individual opposing vehicles and the selection of opposing vehicles;
when RSUi+1Receiving RSUiWhen 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 ≦ Mn,vn,tn,Sn,En,Tn) In, where idnI.e. the ID, t of the nth vehiclenI.e. the time to enter the RSU, Sn、EnRespectively representing the time of starting and ending communication between the nth vehicle and the target vehicle in the reverse direction, TnIndicating that the nth vehicle is in the RSUi+1The time selected as the assisting vehicle is obtained according to the vehicle information in the registry:
Figure BDA0002825991600000081
Figure BDA0002825991600000082
where U is the distance, t, covering the blind zone between RSUssIs the target vehicle entering the RSUiTime 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:
Ti+Ei≤Tj+Sj (12)
and for the reverse direction assisting vehicle to firstly communicate with the target vehicle, the communication should occur after the forward of the same direction assisting vehicle to the target vehicle is completed, so that the following conditions are satisfied:
Figure BDA0002825991600000083
and the last vehicle node for reverse assistance should drive into the RSU at the target vehiclei+1Forwarding data ends before, because the target vehicle enters the RSU oncei+1Can be selected from the RSUi+1Direct download of unfinished data volume enjoys greater bandwidth, so we find:
Figure BDA0002825991600000084
for RSUi+1Selected reverse-assisted vehicle number NrevAnd the total data volume D downloaded by the reverse-direction assisting vehicle is obtained through the formula (8)revThe throughput obtained in the reverse-direction assistance mode is as follows:
Figure BDA0002825991600000085
in summary, the overall throughput achieved by the target vehicle is:
Figure BDA0002825991600000086
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 (4)

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)iBefore, 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 RSUiTo RSUiSending a downloading request and downloading partial data from the downloading request;
s4: target vehicle leaving RSUiThen RSUiTransmitting the remaining file data to the next RSUi+1，RSUi+1Coordinating 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;
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 S3 specifically includes:
s31: the number of vehicles inside the cluster is calculated by the following formula (1):
Figure FDA0002825991590000011
wherein P isdIs the probability, ρ, that a vehicle becomes the last vehicle inside the clustersThe traffic density in the driving direction of the target vehicle is the vehicle communication radius Rv；
S32: the average amount of data received by each vehicle over the dwell time T in the RSU is calculated as follows:
Figure FDA0002825991590000012
wherein the speed of the vehicle in the same direction as the target vehicle is vs，λs＝ρsvsFor the vehicle arrival rate in the poisson distribution, c represents the maximum number of vehicles that can be accommodated in the RSU coverage area, RiF (0) and f (c) are the probabilities of system idle and blocking for the RSU coverage radius, which is calculated by the following formula:
Figure FDA0002825991590000013
data transmission rate BiIn relation to the area, 7 means that the RSU coverage is divided into 7 areas, and the vehicle is in area ciCorresponding residence times in
Figure FDA0002825991590000014
Wherein L isiIs a region ciThe length of (a) of (b),
Figure FDA0002825991590000015
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:
Figure FDA0002825991590000016
3. the method for cooperative data transmission in an internet of vehicles environment according to claim 1, wherein: the forwarding time of the equidirectional assist vehicle in step S5 is represented as:
Figure FDA0002825991590000021
Γi,jthe 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:
Figure FDA0002825991590000022
wherein P issucIs 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:
Figure FDA0002825991590000023
4. 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:
Figure FDA0002825991590000024
wherein N isrevIn order to assist the number of vehicles in the reverse direction,
Figure FDA0002825991590000025
the amount of data downloaded for a single reverse vehicle node is expressed as:
Figure FDA0002825991590000026
wherein v isrFor reversing the vehicle speed, BvIs the rate of data transfer between the vehicles,
Figure FDA0002825991590000027
guiding the RSU according to the data forwarding amount and time of interactive communication for the time of communication when two vehicles meeti+1For coordinating opposing vehicles, primarily in terms of the amount of data distributed to individual opposing vehicles and the selection of opposing vehicles;
when RSUi+1Receiving RSUiWhen 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 ≦ Mn,vn,tn,Sn,En,Tn) In, where idnI.e. the ID, t of the nth vehiclenI.e. the time to enter the RSU, Sn、EnRespectively representing the time of starting and ending communication between the nth vehicle and the target vehicle in the reverse direction, TnIndicating that the nth vehicle is in the RSUi+1The time selected as the assisting vehicle is obtained according to the vehicle information in the registry:
Figure FDA0002825991590000028
Figure FDA0002825991590000031
where U denotes the distance between RSUs covering a blind area, tsIs the target vehicle entering the RSUiThe 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:
Ti+Ei≤Tj+Sj (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:
Figure FDA0002825991590000032
the last vehicle node for reverse assistance drives into the RSU at the target vehiclei+1The data forwarding is finished before, and the following results are obtained:
Figure FDA0002825991590000033
for RSUi+1Selected reverse-assisted vehicle number NrevAnd the total data volume D downloaded by the reverse-direction assisting vehicle is obtained through the formula (8)revThe throughput obtained in the reverse-direction assistance mode is as follows:
Figure FDA0002825991590000034
the overall throughput achieved by the target vehicle is:
Figure FDA0002825991590000035
CN202011453874.4A 2020-12-09 2020-12-09 Cooperative data transmission method in Internet of vehicles environment Active CN112566070B (en)

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 true CN112566070A (en) 2021-03-26
CN112566070B 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)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113347606A (en) * 2021-06-25 2021-09-03 长安大学 V2I/V2V network cooperative transmission method and system based on elastic partition
CN113783964A (en) * 2021-09-17 2021-12-10 首都师范大学 Data collaborative transmission method and device for social networking

Citations (8)

* Cited by examiner, † Cited by third party
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
US20170263120A1 (en) * 2012-06-07 2017-09-14 Zoll Medical Corporation Vehicle safety and driver condition monitoring, and geographic information based road safety systems
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
CN108985658A (en) * 2018-08-07 2018-12-11 燕山大学 One kind cooperateing with method for down loading based on fuzzy evaluation and the desired car networking of client
CN108990016A (en) * 2018-08-17 2018-12-11 电子科技大学 A kind of calculating task unloading of more vehicles collaboration and transmission method
US20190386923A1 (en) * 2018-06-18 2019-12-19 Akamai Technologies, Inc. Download management with congestion mitigation for over the air content delivery to vehicles

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170263120A1 (en) * 2012-06-07 2017-09-14 Zoll Medical Corporation Vehicle safety and driver condition monitoring, and geographic information based road safety systems
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
US20190386923A1 (en) * 2018-06-18 2019-12-19 Akamai Technologies, Inc. Download management with congestion mitigation for over the air content delivery to vehicles
CN108985658A (en) * 2018-08-07 2018-12-11 燕山大学 One kind cooperateing with method for down loading based on fuzzy evaluation and the desired car networking of client
CN108990016A (en) * 2018-08-17 2018-12-11 电子科技大学 A kind of calculating task unloading of more vehicles collaboration and transmission method

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
J. LIU, J. BI, Y. BIAN, X. LIU AND Z. LI: "DSRelay: A scheme of cooperative downloading based on dynamic slot", 《2012 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC)》 *
N. WISITPONGPHAN, F. BAI, P. MUDALIGE, V. SADEKAR AND O. TONGUZ: "Routing in Sparse Vehicular Ad Hoc Wireless Networks", 《IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》 *
T. H. LUAN, X. SHERMAN SHEN AND F. BAI: "Integrity-oriented content transmission in highway vehicular ad hoc networks", 《2013 PROCEEDINGS IEEE INFOCOM》 *
刘建航,孙江明,毕经平,边永超,刘新宇,李忠诚: "基于动态时槽的车联网协助下载方法研究", 《计算机学报》 *
薛平: "高速公路场景中的车联网协助下载方法研究", 《信息科技辑》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113347606A (en) * 2021-06-25 2021-09-03 长安大学 V2I/V2V network cooperative transmission method and system based on elastic partition
CN113783964A (en) * 2021-09-17 2021-12-10 首都师范大学 Data collaborative transmission method and device for social networking
CN113783964B (en) * 2021-09-17 2023-06-30 首都师范大学 Data collaborative transmission method and device for social networking services

Also Published As

Publication number Publication date
CN112566070B (en) 2022-08-09

Similar Documents

Publication Publication Date Title
CN112566070B (en) Cooperative data transmission method in Internet of vehicles environment
CN108877256B (en) Wireless communication-based method for controlling scattered cooperative self-adaptive cruise near intersection
CN110070707A (en) A method of realizing that cooperating type adaptive learning algorithms fleet forms a team and separates
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
CN107426694A (en) A kind of fuzzy cluster algorithm of vehicular ad hoc network
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
JP2011094995A (en) Route guide device for vehicle
CN107786941A (en) It is a kind of to be cooperated method for down loading based on the file that prefetches
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
CN105303836A (en) Vehicle cluster information transmission method based on health state of vehicle
Wang et al. Popular Content Distribution in CR-VANETs with Joint Spectrum Sensing and Channel Access using Coalitional Games
CN113724507A (en) Traffic control and vehicle induction cooperation method and system based on deep reinforcement learning
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
Zhu et al. Transfer problem in a cloud-based public vehicle system with sustainable discomfort

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

TR01 Transfer of patent right
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