CN116546458B - Internet of vehicles bidirectional multi-hop communication method under mixed traffic scene - Google Patents

Internet of vehicles bidirectional multi-hop communication method under mixed traffic scene Download PDF

Info

Publication number
CN116546458B
CN116546458B CN202310519795.6A CN202310519795A CN116546458B CN 116546458 B CN116546458 B CN 116546458B CN 202310519795 A CN202310519795 A CN 202310519795A CN 116546458 B CN116546458 B CN 116546458B
Authority
CN
China
Prior art keywords
communication
icv
target
vehicles
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
Application number
CN202310519795.6A
Other languages
Chinese (zh)
Other versions
CN116546458A (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.)
Xidian University
Original Assignee
Xidian University
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 Xidian University filed Critical Xidian University
Priority to CN202310519795.6A priority Critical patent/CN116546458B/en
Publication of CN116546458A publication Critical patent/CN116546458A/en
Application granted granted Critical
Publication of CN116546458B publication Critical patent/CN116546458B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30—Services specially adapted for particular environments, situations or purposes
    • H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/34—Modification of an existing route
    • H04W40/38—Modification of an existing route adapting due to varying relative distances between nodes
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The application discloses a method for bidirectional multi-hop communication of the Internet of vehicles in a mixed traffic scene, which relates to the technical field of intelligent Internet of vehicles and solves the problems of unreliable communication policy links and low communication capacity in the prior art; the method comprises the following steps: acquiring data of all vehicles in a preset range, and calculating a position vector of the vehicle according to the data; according to the position vector, determining two candidate data sources ICVs which are closest to the target ICV in the positive and negative directions; respectively calculating the communication hop count and the communication distance between the two candidate data source ICVs and the target ICVs, and determining the data source ICVs and the communication links; transmitting information to a target ICV according to the data source ICV and the communication link; and further, the more comprehensive traffic environment is considered, the reliable communication multi-hop link is obtained, and the communication capacity is greatly improved.

Description

Internet of vehicles bidirectional multi-hop communication method under mixed traffic scene
Technical Field
The application relates to the technical field of intelligent Internet of vehicles, in particular to a method for bidirectional multi-hop communication of Internet of vehicles in a mixed traffic scene.
Background
The intelligent internet of vehicles (INTELLIGENT CONNECTED VEHICLES, ICV) is one of the trends of future automobile development, and with the continuous expansion of the ICV scale, the amount of data to be transmitted by the internet of vehicles increases exponentially, so that the improvement of the communication capacity is one of the key directions of the development of the internet of vehicles. In an intelligent traffic scenario where ICVs are integrated with conventional vehicles, a communication cooperation strategy between ICVs is one of the main factors affecting the communication capacity of the system.
At present, a traditional ICV cooperation strategy generally adopts a communication model under the condition of no influence of a traditional vehicle in the aspect of communication model construction, and the influence of the traditional vehicle on ICV communication in a mixed state is ignored. And the same type of vehicle speed is generally considered to be uniform, without regard to the diversity of vehicle speeds. In terms of routing strategies, the traditional ICV cooperation strategy often adopts a single-hop mode to cooperate, namely, a target vehicle must be in a communication range of the cooperation vehicle to exchange data, and when the cooperation vehicle in the communication range of the target vehicle does not contain required data, communication cannot be performed. In addition, the conventional ICV cooperation strategy provides communication support for the target ICV considering only the ICV in the opposite form when selecting the cooperative vehicle, resulting in a reduction in communication range and poor communication capability.
Disclosure of Invention
The embodiment of the application solves the problems of unreliable communication strategy links and low communication capacity in the prior art by providing the bidirectional multi-hop communication method of the Internet of vehicles under the mixed traffic scene, thereby realizing the purpose of considering more comprehensive traffic environment, obtaining reliable communication multi-hop links and greatly improving the communication capacity.
The embodiment of the invention provides a method for two-way multi-hop communication of the Internet of vehicles in a mixed traffic scene, which comprises the following steps:
Acquiring data of all vehicles in a preset range, and calculating a position vector of the vehicle according to the data;
according to the position vector, determining two candidate data sources ICVs which are closest to the target ICV in the positive and negative directions;
Respectively calculating the communication hop count and the communication distance between the two candidate data source ICVs and the target ICV, and determining the data source ICVs and the communication link;
And sending information to the target ICV according to the data source ICV and the communication link.
In one possible implementation, the data of all vehicles includes serial numbers of all vehicles, data amount carried by the vehicles, running speed of the vehicles, location of the vehicles, time of sending report, and time of receiving ICV information processing server.
In one possible implementation, the element y in the position vector is expressed as:
y＝x+v(t1-t0)
Wherein: y represents an element in the position vector Y, v represents a running speed of the vehicle, t 1 represents a time received by the ICV information processing server, t 0 represents a time at which a report is transmitted, and x represents a position of the vehicle.
In one possible implementation, the determining two candidate data sources ICV closest to the target ICV in the positive and negative directions includes:
Extracting all vehicles carrying data volume in the forward direction of the target ICV on the forward and reverse roads, and selecting the vehicle closest to the target ICV as one candidate data source ICV;
extracting all vehicles carrying data volume in the reverse direction of the target ICV on the forward and reverse roads, and selecting the vehicle closest to the target ICV as another candidate data source ICV;
and if the candidate data source ICV does not exist in the forward direction or the reverse direction of the target ICV, the target ICV is used as the candidate data source ICV.
In one possible implementation manner, the calculating the number of communication hops and the communication distance between the two candidate data source ICVs and the target ICV, and determining the data source ICV and the communication link respectively, includes:
Constructing communication adjacency matrixes of all vehicles in the boundary by taking the two candidate data sources ICVs as the boundary;
Calculating the communication adjacency matrix according to a BFS algorithm and outputting a calculation result;
And determining the data source ICV and the communication link according to the calculation result.
In one possible implementation, the data amount carried by the vehicle includes: the data volume carried by the traditional vehicle is-1, and the data volume carried by the ICV vehicle is more than or equal to 0, wherein the data volume represents the actual data bit number carried by the vehicle.
In one possible implementation, the constructing a communication adjacency matrix for all vehicles within a boundary includes:
Judging the communication range of an ith vehicle, if the traditional vehicle exists in the communication range, marking the communication range of the vehicle as R block, otherwise marking the communication range as R null, wherein R block<Rnull;
Judging whether other vehicles are in the communication range of the ith vehicle, if the data amount carried by the jth vehicle is 0 and the data amount is in the communication range, D (i, j) =1, otherwise D (i, j) =0, wherein D (i, j) represents a communication adjacency matrix;
Wherein i.ltoreq.n, j.ltoreq.n, n representing the dimension of the communication adjacency matrix.
In one possible implementation, the communication adjacency matrix is initially a pure 0 matrix.
In one possible implementation manner, the calculating the communication adjacency matrix according to the BFS algorithm and outputting a calculation result includes:
The target ICV is used as a starting point node of the BFS algorithm, the two candidate data source ICVs are used as target nodes of the BFS algorithm, whether a multi-hop link and the shortest path length exist between the starting point node and the target nodes or not is judged, the starting point node and the target nodes are known nodes, and the multi-hop link represents the communication relay number;
if the candidate data source ICVs in the positive and negative directions all have multi-hop links, respectively calculating the communication relay numbers, and selecting the link with the smallest communication relay number for communication;
If the multi-hop link exists in only one direction, selecting the multi-hop link for communication;
If no multi-hop link exists, the communication link cannot be established.
In one possible implementation, both the target ICV and the candidate data source ICV may communicate directly with the infrastructure.
One or more technical solutions provided in the embodiments of the present invention at least have the following technical effects or advantages:
The embodiment of the invention adopts a method for two-way multi-hop communication of the Internet of vehicles in a mixed traffic scene, and the method comprises the following steps: acquiring data of all vehicles in a preset range, and calculating a position vector of the vehicle according to the data, so as to avoid the influence of large calculation errors caused by setting a uniform speed to the speed of the vehicle; according to the position vector, two candidate data sources ICVs which are closest to the target ICV in the positive and negative directions are determined, the number of vehicles involved is minimum on the basis of ensuring communication, and the calculated amount is minimum when the calculation of the communication hop count is carried out; respectively calculating the communication hop count and the communication distance between the two candidate data source ICVs and the target ICVs, and determining the data source ICVs and the communication links; calculating in the forward and backward movement directions, determining the shortest communication distance, and ensuring the optimal solution of the communication distance; transmitting information to a target ICV according to the data source ICV and the communication link; the method effectively solves the problems of unreliable communication policy links and low communication capacity in the prior art, further realizes consideration of more comprehensive traffic environments, obtains reliable communication multi-hop links, and greatly improves the communication capacity.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following description will briefly explain the embodiments of the present invention or the drawings needed in the description of the prior art, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of steps of a method for two-way multi-hop communication of internet of vehicles in a mixed traffic scenario provided by an embodiment of the present application;
FIG. 2 is a flowchart illustrating steps for determining two candidate data source ICVs closest to a target ICV in positive and negative directions according to an embodiment of the present application;
FIG. 3 is a flowchart illustrating steps of an embodiment of selecting candidate data sources ICV for a target ICV in a forward direction on a forward road according to an embodiment of the present application;
FIG. 4 is a flowchart illustrating steps of an embodiment of selecting candidate data sources ICV for a target ICV on a forward road in a reverse direction according to the present application;
FIG. 5 is a flowchart illustrating steps for calculating the number of hops and distance between two candidate data source ICVs and a target ICV according to an embodiment of the present application;
FIG. 6 is a flowchart illustrating steps for constructing a communication adjacency matrix for all vehicles within a boundary provided by an embodiment of the present application;
FIG. 7 is a flowchart illustrating steps in a process for assigning a communication adjacency matrix according to an embodiment of the present application;
Fig. 8 is a flowchart of a step of calculating a communication adjacency matrix according to a BFS algorithm and outputting a calculation result according to an embodiment of the present application;
FIG. 9 is a schematic diagram of segmentation of integration intervals of continuous probability density distribution according to an embodiment of the present application;
FIG. 10 is a schematic diagram of theoretical and simulation contrasts under a bidirectional single-hop strategy provided by an embodiment of the present application;
Fig. 11 is a schematic diagram of comparing a communication capacity of a method according to an embodiment of the present application with a communication capacity under a single-hop policy.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. It will be apparent that the described embodiments are some, but not all, embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Existing internet of vehicles communication policies based on vehicle-to-vehicle (V2V) communication and vehicle-to-infrastructure (V2I) communication have various problems in terms of policy cost, policy scenario, policy efficiency, etc.
Most of the existing strategies simply combine V2V communication with V2I communication, and take one of the communication measures as an auxiliary measure of the other, but do not fully exploit the potential of two communication modes, such as: ruifeng Chen et al propose a cooperative transmission model based on infrastructure, mainly by using the infrastructure as a repeater for signal transfer when V2V communication is blocked. The most intuitive problem faced by the strategy is that the requirement on the coverage density of the infrastructure is too high, relay communication is difficult to carry out once the coverage of the infrastructure is left, and once the density of vehicles is increased, the shielding effect of the vehicles is obvious, and the communication capacity is reduced; in addition, among such policies using V2V communication as a main communication means, the infrastructure is used only as a repeater, which means that data exchanged between vehicles is basically directly from the internet, not forwarded through a roadside infrastructure, and such policy application scenarios are very limited, and for vehicles with large file download requirements, the communication efficiency is greatly reduced, and the performance of the infrastructure itself is wasted greatly.
In addition, the existing partial communication strategy performs deep fusion on V2V communication and V2I communication, but the advantages of the existing communication technology cannot be fully exerted under the strategy, so that the communication capacity is limited. Such as: jieqiong Chen et al propose a single hop communication strategy combining V2V communication with V2I communication, where V2I communication is mainly performed when the target vehicle is within the coverage of the infrastructure, and where data is transmitted to the target ICV in a single hop mode by the ICV vehicle traveling in the opposite direction when the target vehicle is outside the coverage of the infrastructure, and where the data of the ICV that cooperates is also obtained through V2I communication. The most remarkable disadvantage of this communication mode is that only a single-hop mode is adopted, and due to the limitation of the data distribution algorithm of the infrastructure, the target ICV needs to pass a certain time to possibly meet the ICV carrying the required data, and during this time, the target ICV cannot obtain new data basically, which results in a reduction of the communication capacity to a certain extent; meanwhile, the strategy only considers the ICV of opposite running, and ignores the possibility that the ICV of same-direction running exceeds the target ICV and provides data for the target ICV, so that the strategy efficiency is reduced to a certain extent; in addition, under the condition that the ICV and the traditional vehicle are fused, interference of other vehicles on V2V communication is not considered by the strategy, and the application scene of the communication strategy is limited.
The embodiment of the application provides a method for two-way multi-hop communication of the Internet of vehicles in a mixed traffic scene, which comprises the following steps S101 to S104 as shown in FIG. 1. In the method of the present application, both the target ICV and the candidate data source ICV may communicate directly with the infrastructure.
S101, acquiring data of all vehicles in a preset range, and calculating a position vector of the vehicle according to the data.
The data of all vehicles includes serial numbers of all vehicles, data amount carried by the vehicles, running speeds of the vehicles, positions of the vehicles, time of sending reports, and time of receiving by the ICV information processing server. Data volume carried by a vehicle, comprising: the data volume carried by the traditional vehicle is-1 and the data volume carried by the ICV vehicle is more than or equal to 0, wherein the data volume represents the actual carried data bit number of the vehicle. From the data described above, a communication adjacency matrix under the condition of the location can be obtained.
The element y in the position vector is expressed as:
y＝x+v(t1-t0)
Wherein: y represents an element in the position vector Y, v represents a running speed of the vehicle, t 1 represents a time received by the ICV information processing server, t 0 represents a time at which a report is transmitted, and x represents a position of the vehicle.
S102, determining two candidate data sources ICVs which are closest to the target ICV in the positive and negative directions according to the position vector.
In S102, two candidate data sources ICV closest to the target ICV in the positive and negative directions are determined, including the following steps S201 to S202 as shown in fig. 2.
S201, extracting all vehicles carrying data volume on forward and reverse roads in the forward direction of the target ICV, and selecting the vehicle closest to the target ICV as one candidate data source ICV.
In step S201, in a specific implementation manner provided in the present application, as shown in fig. 3, firstly, a vehicle carrying data in the forward direction of the target ICV of the forward road is extracted, and the position of the vehicle closest to the target ICV is recorded as A1; and extracting vehicles carrying data in the forward direction of the reverse road target ICV, and recording the vehicle position closest to the target ICV as A2.
Judging whether the A1 and the A2 are both empty, if so, outputting the position of Ap=target ICV; if not, it is determined whether both A1 and A2 are not empty, if so, ap=min (A1, A2) is output, and if not, a value not empty in A1 and A2 is output.
S202, extracting all vehicles carrying data volume in the reverse direction of the target ICV on the forward and reverse roads, and selecting the vehicle closest to the target ICV as another candidate data source ICV;
And S203, if the target ICV does not have the candidate data source ICV in the forward direction or the reverse direction, the target ICV is taken as the candidate data source ICV.
In step S201, in a specific implementation manner provided in the present application, as shown in fig. 4, firstly, a vehicle carrying data in a reverse direction of a forward road target ICV is extracted, and a vehicle position closest to the target ICV is recorded as A1; and extracting vehicles carrying data in the reverse direction of the reverse road target ICV, and recording the vehicle position closest to the target ICV as A2.
Judging whether the A1 and the A2 are both empty, if so, outputting an=the position of the target ICV; if not, it is determined whether both A1 and A2 are not empty, if yes, an=max (A1, A2) is output, and if not, a value not empty in A1 and A2 is output.
The An and Ap are the position coordinate points of the candidate data sources ICV.
Proving candidate data source ICVs in the forward direction, and assuming that multi-hop communication can be realized in the forward direction, wherein the candidate data source ICVs in the forward direction are C1, the closest ICV in the forward direction of C1 is C2, and the shortest path between the C2 and the target ICV is n hops; if C1 is on the communication path between C2 and the target ICV, the communication path between C1 and the target ICV is less than or equal to n-1; if C1 is not located on the communication path and the ICV of the n-1 th hop is named as C3, C1 is located between C2 and C3, C1 is also located within the communication range of C3, and the hop count of C1 reaching the target ICV should be less than or equal to n. Therefore, if multi-hop communication can be realized in the forward direction, the communication target to realize the shortest path is necessarily C1. The opposite direction is the same, so in the presence of multi-hop communication, to achieve shortest path communication, the final communication objective must be between two candidate data sources ICV.
Since the shortest path necessarily exists between the two candidate data sources ICV, after extracting the candidate data sources ICV, we only need to construct a communication adjacency matrix for the vehicles located between the two candidate data sources ICV, and can ignore other vehicles, so as to greatly reduce the calculation pressure of the centralized calculation device.
S103, respectively calculating the communication hop count and the communication distance between the two candidate data source ICVs and the target ICVs, and determining the data source ICVs and the communication links.
In S103, the number of communication hops and the communication distance between the two candidate data source ICVs and the target ICV are calculated, respectively, and the data source ICV and the communication link are determined, as shown in fig. 5, including the following steps S501 to S503.
S501, constructing a communication adjacency matrix of all vehicles in the boundary by taking two candidate data sources ICVs as the boundary. The communication adjacency matrix is initially a pure 0 matrix.
In S501, a communication adjacency matrix of all vehicles within the boundary is constructed, including the following steps S601 to S602 as shown in fig. 6.
S601, judging the communication range of the ith vehicle, if the traditional vehicle exists in the communication range, marking the communication range of the vehicle as R block, otherwise marking the communication range as R null, wherein R block<Rnull.
S602, judging whether other vehicles are in the communication range of the ith vehicle, if the data amount carried by the jth vehicle is 0 and the data amount is in the communication range, D (i, j) =1, otherwise D (i, j) =0, wherein D (i, j) represents a communication adjacency matrix; where i.ltoreq.n, j.ltoreq.n, n representing the dimension of the communication adjacency matrix.
The present application provides a specific embodiment, as shown in fig. 7, of creating a pure 0 matrix of n x n according to the number of vehicles, where i and j each represent all vehicles between two candidate data sources ICV. The main purpose of fig. 7 is to determine whether each vehicle between two candidate data sources ICV can communicate with the remaining vehicles, and assign the value of the communication-enabled vehicles to D (i, j) =1 in the communication adjacency matrix. A specific communication adjacency matrix is obtained by the method described above.
S502, calculating the communication adjacency matrix according to the BFS algorithm and outputting a calculation result, which includes the following steps S801 to S804 as shown in fig. 8.
S801, taking a target ICV as a starting point node of a BFS algorithm, taking two candidate data source ICVs as target nodes of the BFS algorithm, and judging whether a multi-hop link and the shortest path length exist between the starting point node and the target nodes, wherein the starting point node and the target nodes are known nodes, and the multi-hop link represents the number of communication relays.
In S801, the specific algorithm flow implemented as BFS is as follows:
input: communication adjacency matrix: adj_matrix, starting node: node_i, target node: node j.
And (3) outputting: from node_i to node node j shortest path.
The specific implementation process is as follows:
(1) The initiator node i is added to the queue while it is marked as accessed visited and the parent node array parent is initialized.
(2) When the queue is not empty, the following operations are performed:
(2.1) dequeuing node at the head of the queue.
(2.2) Traversing the node row of the communication adjacency matrix adj_matrix, if a node i is found to be adjacent to the node and not accessed, performing the following operations:
(2.2.1) adding node i to the queue while marking it as accessed visited.
(2.2.2) Setting the parent node of the node i as the node.
(2.2.3) If the node i is the target node j, the following is performed:
(2.2.3.1) starting from node_i, according to parent node array parent
All nodes on the path are determined in turn and stored in the path array path in order.
(2.2.3.1) Return path array path.
(3) If the target node j is not found after the loop is completed, a null array [ ] is returned, indicating that there is no path between node i and node j.
S802, if the candidate data sources ICV in the positive and negative directions have multi-hop links, respectively calculating the communication relay numbers, and selecting the link with the smallest communication relay number for communication.
S803, if there is a multi-hop link in only one direction, the multi-hop link is selected for communication.
S804, if there is no multi-hop link, the communication link cannot be established.
S503, determining the data source ICV and the communication link according to the calculation result.
And S104, information is sent to the target ICV according to the data source ICV and the communication link.
In a specific embodiment provided by the application, the communication mode is selected by: we consider a highway scene with bi-directional flow, a highway being a long straight line model with roadside infrastructure deployed equidistant from d. The infrastructure point is connected to the backbone network by a wired or wireless link so that the infrastructure can provide information services to all ICVs within the coverage area (radius R I). When the target ICV with the communication requirement is in the range, V2I communication is adopted, communication is carried out at a constant transmission rate W I, otherwise V2V communication with the rate W V is selected, and the radius of the V2V communication is R V.
Mixed traffic interference: the V2V communication radius R V＝Rnull of the ICV is reduced to R V＝Rblock when the traditional vehicle exists in the range of R block of the ICV.
Multi-hop transmission error code: in the single-hop case, the average error rate is p, and when the ICV adopts n-hop V2V communication, the error rate is increased to:
therefore, in V2V communication, the ICV should select a V2V communication path with a small number of hops as much as possible to improve communication capacity.
Data source ICV reception policy: for ease of representation, two adjacent infrastructures are designated herein as I 1 and I 2, respectively, the target ICV travels from I 1 to I 2 and considers this direction as the forward direction, while the opposite direction of I 1 is set to the coordinate zero point at R I. When the target ICV with the communication requirement reaches the coordinate zero point, the I 1 starts to transmit data to the data source ICV which reaches the coordinate zero point and has the speed greater than the target ICV in the positive direction at the constant transmission rate W V; i 2 starts transmitting data at a constant transmission rate W V to a data source ICV which thereafter travels in the opposite direction into its communication range.
Data source ICV empties the cache policy: when the data source ICV running in the positive direction reaches the coordinate d+2R I, the buffer memory in the previous stage is emptied; the data source ICV traveling in the opposite direction empties the previous stage buffer when it reaches the coordinate 0 point.
V2V communication policy: because of the presence of multi-hop transmission errors, to achieve maximum communication capacity, a target ICV with communication requirements should take the shortest path to establish communication with the data source ICV carrying the desired data.
In the application, the problem of unreliable links of the existing communication strategies is alleviated. The current research only considers the communicable distance in the pure ICV scenario, but ignores the attenuation of 10-20dB of the received signal strength when there is a traditional vehicle between them, at this time, if the link connection is still performed with the communicable distance in the unobstructed condition, the situation that the link is unreliable may occur, and the final communication effect is affected. The application fully considers the blocking effect of the traditional vehicle, adjusts the communication distance according to the actual situation, and ensures that the link connection is more reliable.
For the improvement of the communication capacity, according to the communication cooperation strategy proposed by Jieqiong Chen et al, the finally achievable communication capacity is as follows:
wherein, W I denotes a communication rate when V2I communication is used, R I denotes a communication radius when V2I communication is used, W V denotes a communication rate when V2V communication is used, R V denotes a communication radius when V2V communication is used, d denotes position information of the target ICV, α denotes a vehicle arrival rate, and V denotes a vehicle speed.
In order to better meet the actual situation, the invention constructs a multi-speed model when performing simulation on the strategy, considers that the vehicle speed is compliant with Gaussian distribution with a mean value of mu and a standard deviation of sigma, considers that the upper and lower speed limits of the highway are v min and v max respectively, and equally divides the highway into N parts, and then the possible speed of the vehicle is as follows:
The probability of the velocity v i being taken is:
A schematic of the segmentation of the integration interval of the continuous probability density distribution is shown in fig. 9.
However, since the model proposed by Jieqiong Chen et al does not take into account the vehicle multi-speed, there is a case of occlusion, and thus there is an overestimation of the communication capacity. Through modification of the proposed model, a bidirectional single-hop communication strategy is adopted, and the communication capacity is obtained by the following steps:
Wherein:
E[DV]＝2WIRI/u
The E [ D V ] moiety has three combined amounts of P (null), P (block) and P 1, wherein:
P(block)＝1-P(null)
P1＝P(block)P(0|block)+P(null)P(0|null)
P 1 has 2 unknown complex amounts of P (0|block) and P (0|null), and the values are as follows:
Wherein:
and is also provided with
And is also provided with
Through experimental simulation, the theoretical value is found to be matched with the simulation value, the theoretical value is proved to be deduced correctly, and the result is shown in fig. 10.
Meanwhile, the theoretical strategy after model improvement is compared with the bidirectional multi-hop strategy, ICV permeability is 0.5, and compared with the single-hop strategy, the communication capacity is improved by 46.02% on average as shown in figure 11.
In this specification, each embodiment is described in a progressive manner, and the same or similar parts of each embodiment are referred to each other, and each embodiment is mainly described as a difference from other embodiments. All or portions of the present application are operational with numerous general purpose or special purpose computer system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet devices, mobile communication terminals, multiprocessor systems, microprocessor-based systems, programmable electronic devices, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The above embodiments are only for illustrating the technical solution of the present application, and not for limiting the present application; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced with equivalents; such modifications and substitutions do not depart from the spirit of the application.

Claims (6)

1. A method for internet of vehicles two-way multi-hop communication in a mixed traffic scene, comprising:
Acquiring data of all vehicles in a preset range, and calculating a position vector of the vehicle according to the data;
according to the position vector, determining two candidate data sources ICVs which are closest to the target ICV in the positive and negative directions; the ICV is an intelligent Internet of vehicles;
Constructing communication adjacency matrixes of all vehicles in the boundary by taking the two candidate data sources ICVs as the boundary; wherein the communication adjacency matrix of all vehicles within the construction boundary comprises: judging the communication range of the ith vehicle, if the traditional vehicle exists in the communication range, marking the communication range of the vehicle as R block, otherwise marking the communication range as R null, wherein R block<Rnull; judging whether other vehicles are in the communication range of the ith vehicle, if the data amount carried by the jth vehicle is 0 and the data amount is in the communication range, D (i, j) =1, otherwise D (i, j) =0, wherein D (i, j) represents a communication adjacency matrix; wherein i is less than or equal to n, j is less than or equal to n, and n represents the dimension of the communication adjacency matrix;
Calculating the communication adjacency matrix according to a breadth-first algorithm and outputting a calculation result; the method for calculating the communication adjacency matrix according to the breadth-first algorithm and outputting a calculation result comprises the following steps: taking the target ICV as a starting point node of the breadth-first algorithm, taking the two candidate data source ICVs as target nodes of the breadth-first algorithm, and judging whether a multi-hop link and a shortest path length exist between the starting point node and the target nodes, wherein the starting point node and the target nodes are known nodes, and the multi-hop link represents the number of communication relays; if the candidate data source ICVs in the positive and negative directions all have multi-hop links, respectively calculating the communication relay numbers, and selecting the link with the smallest communication relay number for communication; if the multi-hop link exists in only one direction, selecting the multi-hop link for communication; if no multi-hop link exists, a communication link cannot be established;
determining a data source ICV and a communication link according to the calculation result;
And sending information to the target ICV according to the data source ICV and the communication link.
2. The method of claim 1, wherein the data for all vehicles comprises: the serial numbers of all vehicles, the data amount carried by the vehicles, the running speed of the vehicles, the positions of the vehicles, the time of sending reports, and the time of receiving by the ICV information processing server.
3. The method of claim 2, wherein the amount of data carried by the vehicle comprises: the data volume carried by the traditional vehicle is-1, and the data volume carried by the ICV vehicle is more than or equal to 0, wherein the data volume represents the actual data bit number carried by the vehicle.
4. The method of claim 2, wherein the element y in the position vector is represented as:
y＝x+v(t1-t0)
Wherein: y represents an element in the position vector Y, v represents a running speed of the vehicle, t 1 represents a time received by the ICV information processing server, t 0 represents a time at which a report is transmitted, and x represents a position of the vehicle.
5. The method of claim 1, wherein the determining two candidate data sources ICV closest to the target ICV in positive and negative directions comprises:
Extracting all vehicles carrying data volume in the forward direction of the target ICV on the forward and reverse roads, and selecting the vehicle closest to the target ICV as one candidate data source ICV;
extracting all vehicles carrying data volume in the reverse direction of a target ICV on a forward road and a reverse road, and selecting a vehicle closest to the target ICV as another candidate data source ICV;
and if the candidate data source ICV does not exist in the forward direction or the reverse direction of the target ICV, the target ICV is used as the candidate data source ICV.
6. The method of claim 1, wherein the target ICV and the candidate data source ICV are both in direct communication with an infrastructure.
CN202310519795.6A 2023-05-09 2023-05-09 Internet of vehicles bidirectional multi-hop communication method under mixed traffic scene Active CN116546458B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310519795.6A CN116546458B (en) 2023-05-09 2023-05-09 Internet of vehicles bidirectional multi-hop communication method under mixed traffic scene

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310519795.6A CN116546458B (en) 2023-05-09 2023-05-09 Internet of vehicles bidirectional multi-hop communication method under mixed traffic scene

Publications (2)

Publication Number Publication Date
CN116546458A CN116546458A (en) 2023-08-04
CN116546458B true CN116546458B (en) 2024-08-13

Family

ID=87443136

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310519795.6A Active CN116546458B (en) 2023-05-09 2023-05-09 Internet of vehicles bidirectional multi-hop communication method under mixed traffic scene

Country Status (1)

Country Link
CN (1) CN116546458B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102289935A (en) * 2006-03-03 2011-12-21 因瑞克斯有限公司 Assessing road traffic conditions using data from mobile data sources
CN107071854A (en) * 2017-04-25 2017-08-18 西安电子科技大学 The distributed multihop Radio Broadcasting Agreements of relay forwarding probability is maximized based on car networking

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101170004B1 (en) * 2010-12-03 2012-08-03 재단법인대구경북과학기술원 Adaptive Beam based Communication System and Multi-hop Relay Transmission Method Thereof
US9937795B2 (en) * 2015-06-24 2018-04-10 Nissan North America, Inc. Vehicle operation assistance information management for autonomous vehicle control transfer
WO2018125989A2 (en) * 2016-12-30 2018-07-05 Intel Corporation The internet of things
JP7460044B2 (en) * 2019-03-29 2024-04-02 インテル・コーポレーション Autonomous vehicle, and apparatus, program, and computer-readable medium relating to an autonomous vehicle system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102289935A (en) * 2006-03-03 2011-12-21 因瑞克斯有限公司 Assessing road traffic conditions using data from mobile data sources
CN107071854A (en) * 2017-04-25 2017-08-18 西安电子科技大学 The distributed multihop Radio Broadcasting Agreements of relay forwarding probability is maximized based on car networking

Also Published As

Publication number Publication date
CN116546458A (en) 2023-08-04

Similar Documents

Publication Publication Date Title
Gao et al. V2VR: reliable hybrid-network-oriented V2V data transmission and routing considering RSUs and connectivity probability
CN111741448B (en) Clustering AODV (Ad hoc on-demand distance vector) routing method based on edge computing strategy
Zhang et al. A kind of novel RSAR protocol for mobile vehicular ad hoc network
Luo et al. CFT: A cluster-based file transfer scheme for highway VANETs
CN110058928B (en) Calculation task allocation method based on halter strap theory in heterogeneous Internet of vehicles
Dua et al. ReIDD: Reliability-aware intelligent data dissemination protocol for broadcast storm problem in vehicular ad hoc networks
Liu et al. An efficient and reliable QoF routing for urban VANETs with backbone nodes
CN108811022B (en) Dynamic high-efficiency routing method for vehicle network application environment
Nabil et al. Predicting the route of the longest lifetime and the data packet delivery time between two vehicles in VANET
Yadav et al. Secure and reliable routing protocols for VANETs
CN109890060B (en) RSU auxiliary information transmission method based on node cooperation degree in vehicle-mounted opportunity network
Debalki et al. Multi-hop data dissemination using a multi-metric contention-based broadcast suppression strategy in VANETs
Badole et al. An optimized framework for VANET routing: A multi-objective hybrid model for data synchronization with digital twin
CN110248392A (en) Chance retransmission method based on node efficiency in a kind of car networking
CN116546458B (en) Internet of vehicles bidirectional multi-hop communication method under mixed traffic scene
Barki et al. Improving the selection of MPRs in OLSR protocol: a survey of methods and techniques.
Oliveira et al. On the performance of social-based and location-aware forwarding strategies in urban vehicular networks
CN115802314A (en) Dynamic routing method and device for vehicle-mounted self-organizing network in C-V2X environment
Chen et al. PTCCR: a path transmission costs-based multi-lane connectivity routing protocol for urban internet of vehicles
CN107124359B (en) Method for ensuring stable routing of link based on 802.11 perception transmission quality and vehicle-mounted self-organizing network
Tang et al. Knowledge‐based replica deletion scheme using directional anti‐packets for vehicular delay‐tolerant networks
Yang et al. Research on data distribution for VANET based on deep reinforcement learning
CN113726664B (en) Internet of vehicles node forwarding utility learning method based on double updating strategies
CN111935002B (en) High-adaptability vehicle-mounted routing communication method based on AODV (Ad hoc on-demand distance vector)
Natsheh et al. Adaptive Fuzzy Route Lifetime for Wireless Ad-hoc Networks.

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