A method to alleviate merging conflicts based on cluster-based advance allocation of time slots
By dividing clusters on the VEMAC service channel and allocating time slots in advance, the merge conflict problem caused by vehicle movement is solved, and the performance and bandwidth utilization of the vehicle ad hoc network are improved.
Patent Information
- Application Number
- CN202210924101.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-08-02
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2042-08-02
AI Technical Summary
On the VEMAC service channel, merge conflicts caused by vehicle movement are difficult to effectively resolve, affecting the performance and bandwidth utilization of the vehicle's ad hoc network.
By dividing the lanes into clusters and selecting cluster heads based on the speed and location of the vehicle, sensing node movement, and applying for time slot allocation to the RSU in advance to avoid or alleviate merge conflicts.
Effectively avoid or alleviate merge conflicts caused by node movement, improve the performance and bandwidth utilization of vehicle ad hoc networking, and enhance throughput.
Smart Images

Figure CN115835158B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to a method, in particular to a method for alleviating merging conflicts based on cluster-based advance allocation of time slots, and belongs to the technical field of wireless communication. Background Art
[0002] Vehicular Ad Hoc Network (VANET) consists of a group of vehicles equipped with on-board units for wireless communication and a group of units fixed along the road (called roadside units, RSU). The goal of the vehicle network is to provide reliable vehicle-to-vehicle (V2V) communication and vehicle-to-roadside unit (V2R) communication. Based on these two communication methods, VANET can support a wide range of applications such as security, entertainment, and vehicle traffic optimization.
[0003] Due to the importance of vehicle communications, the US Federal Communications Commission has allocated 75MHz in the 5.9GHz band to dedicated short-range communications (DSRC), which is specifically used for vehicle-to-vehicle communications (V2V) and vehicle-to-roadside unit communications (V2R). The DSRC spectrum is divided into seven 10MHz channels, one control channel (CCH) and six service channels (SCH). The control channel is used to transmit control information and high-priority short safety applications, and the service channel is used for safety and non-safety related applications.
[0004] In the VEMAC protocol, time is divided into frames, which consist of a fixed number of constant duration time slots. Each frame is divided into three groups of time slots: L, R, and F. The F set is associated with the RSU, while the L and R sets are associated with nodes moving to the left and right, respectively.
[0005] On the control channel, nodes obtain time slots in a distributed manner. Node x that wants to obtain a time slot can determine the set of time slots used by all nodes in its two-hop neighborhood by listening to a complete frame, represented by Ucch(x). Given Ucch(x), node x determines the set of accessible time slots Vcch(x). If the node is moving to the right, the set of accessible time slots can be expressed as That is, exclude the time slots used within two hops of the R set. Similarly, if the node is traveling to the right, the set of accessible time slots can be expressed as After determining the set of accessible time slots, a node randomly obtains a time slot from the set.
[0006] On the service channel, nodes allocate time slots in a centralized manner. After the RSU announces the service, the provider listens to cch during a full frame to determine the set of users I interested in the service. For each node x∈I, the RSU allocates a time slot for each x∈I and announces this slot allocation in the main time slot.
[0007] In terms of time slot selection, nodes within the two-hop range cannot select the same time slot for transmission, but nodes not within the two-hop range can use the same time slot for transmission without causing conflicts.
[0008] On the service channel, because of the time slot selection, the node and the node outside the two-hop range can share a time slot, when the node moves, it is easy to cause a merge conflict. Figure 1 For example, in the figure, A and D are not within the same THS range, that is, A is outside the two-hop range of D. In this time slot, A and D can share a time slot without causing a conflict. When A moves within the two-hop range of D, A and D will still be in the same time slot, which will cause a merge conflict. Therefore, a new solution is urgently needed to solve the above technical problems. Summary of the invention
[0009] The present invention aims at the problems existing in the prior art and provides a method for alleviating merging conflicts based on cluster-based advance allocation of time slots. The technical solution alleviates the merging conflicts caused by vehicle movement on the VEMAC service channel.
[0010] In order to achieve the above object, the technical solution of the present invention is as follows: a method for alleviating merging conflicts based on cluster-based advance allocation of time slots, characterized in that the method comprises the following steps:
[0011] Step 1: Cluster division and cluster maintenance. The specific process is as follows: Figure 2 As shown. First, the lane is divided into many clusters with a radius of L. The center of the cluster is (a, b). The cluster head is selected according to the score Si, which is determined by the speed and position of the vehicle. If the vehicle has the largest Si, the vehicle will become the cluster head CH, and the nodes within the cluster range will be cluster members CM. The cluster head CH will not be updated during the broadcast message. Only when the beacon is exchanged or the cluster head moves out of the cluster range, the score Si will be recalculated and the cluster head CH will be selected.
[0012] Step 2: Sense node movement, as follows: If a cluster member finds that its own position and the lane center point position are greater than the cluster radius, If it is not true, the cluster member does not belong to this cluster and moves out of the cluster. When it moves to another cluster, it will be sensed by the cluster head of the other cluster.
[0013] Step 3: Regarding whether the mobile node uses the relevant service, the details are as follows: When the cluster head CH detects that a new node has moved into its cluster, it determines whether the new node belongs to the node set I that is interested in the service. If it belongs to I, the node is a service node that needs to be used, and the vehicle will apply for a time slot for it later. If it does not belong to I, the node does not need a time slot.
[0014] Step 4: Regarding RSU allocating time slots to nodes using the service, the details are as follows: RSU knows the available idle time slots and centrally allocates time slots to vehicles interested in the service. When the cluster head CH senses that a new node has moved into the cluster and the new node is interested in the service, the cluster head CH requests an idle time slot from the RSU, and the RSU allocates time slots based on the known idle time slots.
[0015] Compared with the prior art, the present invention has the following advantages. First, the solution divides vehicles into clusters. The cluster head is selected according to its position and speed. The cluster members are also determined according to their positions. There is no need to install some additional equipment, increase overhead, and facilitate node management. Secondly, the cluster head can sense the movement of the node, so it is convenient to apply to the RSU for early allocation of time slots, which can avoid or alleviate the merging conflicts caused by node movement. At the same time, it is conducive to enhancing bandwidth utilization, improving throughput, and thus improving the performance of the vehicle self-organizing network. BRIEF DESCRIPTION OF THE DRAWINGS
[0016] Figure 1 Merged collision graph caused by vehicle movement;
[0017] Figure 2 Flowchart of cluster formation and maintenance performed by this solution;
[0018] Figure 3 A graph showing the changes in merge conflicts when this solution is used and when this solution is not used; DETAILED DESCRIPTION
[0019] In order to deepen the understanding of the present invention, the present embodiment is described in detail below with reference to the accompanying drawings.
[0020] Embodiment 1: Figure 1 It is a merging conflict caused by movement on the service channel. In order to solve this problem, a method based on cluster-based pre-allocation of time slots to alleviate merging conflicts is proposed. The method is as follows:
[0021] Assuming that the lane is a straight road, the clusters are divided according to the lane position. The range of each cluster is 400m, that is, L=200. The center point of the cluster is (a, b) which is a variable. The cluster mainly includes the cluster head and cluster members. The position of the vehicle node is (x, y). All vehicles can obtain accurate information from the global positioning system (GPS) and sensors, including vehicle location, vehicle speed, vehicle direction, etc. In this scheme, a score Si is defined, Where vi is the speed of the vehicle, v is the average rate between clusters, vmax is the maximum speed of the vehicle, α and β are both greater than 0 and α+β=1, these two parameters are mainly used to adjust the score.
[0022] First, the vehicle nodes exchange beacons, which include the vehicle's location, speed, and score. The score Si is 0 at the beginning. After exchanging beacons, the vehicle calculates its own score and adds the calculated score to the beacon. When it exchanges beacons again and finds that its score Si is the largest, it informs other neighboring nodes that it has become the cluster head. If there are two largest scores Si, the node with the larger address is selected as the cluster head. Other nodes within the cluster range become cluster members. When the center point of cluster A1 is (a1, b1) and the node position is (x, y), if Then the node is a member of the cluster A1.
[0023] When broadcasting messages, the cluster head and cluster members are not updated. When encountering the following two situations, the cluster head and cluster members are updated. In the first case, when exchanging beacons, a higher score Si is found, then a new cluster head appears and the cluster head is updated. In the second case, if the cluster head is about to leave the cluster, the score of the cluster head needs to be reduced to 0, and a new cluster head with a higher score needs to be selected as the cluster head. If the cluster members find If it is not true, the cluster member does not belong to this cluster and moves out of the cluster. When it moves to another cluster, it will be sensed by the cluster head of the other cluster.
[0024] When the cluster head senses that a new node has moved into the cluster, it determines whether the node belongs to the node set I that is interested in the service. If it is a node that is interested in the service, the cluster head needs to apply for a time slot for this new node from the RSU. The RSU knows the available idle time slots and centrally allocates time slots for vehicles that are interested in the service. If the cluster head CH applies for an idle time slot from the RSU, the RSU allocates the time slot based on the known idle time slot situation.
[0025] When the cluster head CH applies for a time slot from the RSU and requests to allocate a time slot in advance, the following two situations may occur:
[0026] The first case: When the idle time slots in the RSU are greater than the total number of time slots requested by the cluster head, the cluster head successfully requests the time slots and allocates the time slots to the nodes in need. In this case, the merge conflict can be directly avoided, such as Figure 3 As shown, the changes in merge conflicts with horizontal axis values less than or equal to 1.
[0027] The second situation: when the idle time slots in the RSU are less than the total number of time slots requested by the cluster head, only a part of the time slots can be successfully requested by the cluster head. The successfully requested time slots are given to the mobile nodes that are first perceived. Other nodes have no time slots to use and need to wait for idle time slots before continuing to request. In this case, the merge conflict can be alleviated, such as Figure 3 As shown, the changes in merge conflicts with horizontal axis values greater than 1.
[0028] The present invention is mainly divided into four parts. The first part is cluster division and maintenance, the second part is mobile node perception, the third part is whether the mobile node uses related services, and the fourth part is RSU allocating time slots for nodes using services. Clusters are divided by lanes, cluster heads are selected by a given formula, and the node positions are located by GPS. Then the cluster heads know their cluster members, and cluster heads are changed according to the two change conditions mentioned above to perform cluster maintenance. When a vehicle moves to another cluster, the cluster head of the other cluster will perceive it and allocate time slots for it in advance to avoid merging conflicts.
[0029] It should be noted that the above embodiments are not intended to limit the protection scope of the present invention, and equivalent changes or substitutions made on the basis of the above technical solutions all fall within the protection scope of the claims of the present invention.
Claims
1. A method for alleviating merging conflicts based on cluster-based advance allocation of time slots, characterized in that: The method comprises the following steps: Step 1: Cluster division and cluster maintenance, Step 2: Sense node movement, Step 3: Whether the mobile node uses related services, Step 4: RSU allocates time slots to nodes using the service; Step 1: Cluster division and cluster maintenance, specifically as follows: Divide the lanes into many clusters with a radius of L, the center of the cluster is (a, b), and select the cluster head according to the score Si, which is determined by the speed and position of the vehicle. If the vehicle has the largest Si, the vehicle will become the cluster head CH, and the nodes within the cluster range will be cluster members CM. The cluster head CH will not be updated during the broadcast message. Only when the beacon is exchanged or the cluster head moves out of the cluster range, the score Si will be recalculated and the cluster head CH will be selected. where vi is the speed of the vehicle, is the average rate between clusters, vmax is the maximum speed of the vehicle, (x, y) is the vehicle node position, α and β are both greater than 0 and α+β=1. These two parameters are mainly used to adjust the score Si; Step 2: Perceive node movement, as follows: If a cluster member finds that the distance between its own position and the cluster center is greater than the cluster radius, If it does not hold, the cluster member does not belong to this cluster and moves out of the cluster. When it moves to another cluster, it will be sensed by the cluster head of the other cluster. (x, y) is the position of the vehicle node, and (a, b) is the center point of the cluster; Step 3: Whether the mobile node uses the relevant service, as follows: When the cluster head detects that a new node moves into its cluster, it determines whether the new node belongs to the node set I that is interested in the service. If it belongs to I, the node is a service node that needs to be used, and the vehicle will apply for a time slot for it later. If it does not belong to I, the node does not need a time slot; Step 4: RSU allocates time slots to nodes using the service. The details are as follows: RSU knows the available idle time slots and centrally allocates time slots to vehicles interested in the service. When the cluster head CH senses that a new node has moved into the cluster and the new node is interested in the service, the cluster head CH requests an idle time slot from the RSU. The RSU allocates time slots based on the known idle time slots. Perform time slot allocation.
