技术领域technical field
本发明涉及车载无线通信技术领域，尤其是一种车载通信系统中无线资源的调度方法。The invention relates to the technical field of vehicle wireless communication, in particular to a method for scheduling wireless resources in a vehicle communication system.
背景技术Background technique
V2X是智能交通系统(ITS)的核心技术。它是一个以移动车辆作为网络节点的自组织网络，是十分重要的网络。ITS依靠短距离通信技术实现车与车以及车与路边基站之间的通信。与传统的基础设施网络相比，V2X网络有两个主要优势：首先，V2X网络具有成本低、容易部署和操作的优势，消费者无需订阅即可享受服务；其次，从技术角度来看，智能交通系统中传播的很多信息有很强的位置相关性，V2X网络能够很方便地为临近车辆建立实时或者非实时的短距离通信。V2X is the core technology of Intelligent Transportation System (ITS). It is an ad hoc network with mobile vehicles as network nodes, and it is a very important network. ITS relies on short-range communication technology to realize communication between vehicles and between vehicles and roadside base stations. Compared with traditional infrastructure networks, V2X networks have two main advantages: first, V2X networks have the advantages of low cost, easy deployment and operation, and consumers can enjoy services without subscription; second, from a technical point of view, smart A lot of information disseminated in the traffic system has a strong location correlation, and the V2X network can easily establish real-time or non-real-time short-distance communication for nearby vehicles.
车辆和车辆之间、车辆和其他装置之间的信息交互是车联网的重要功能之一，V2X技术是实现车辆之间信息交互的基础。V2X网络依靠短距离通信技术实现车与车以及车与路侧节点之间的通信，实现车内(CAN-Controller Area Network)、车路(Vehicle-2-RSU)、车间(Vehicle-2-Vehicle)、车外(vehicle-2-Infrastructure)、人车(Vehicle-2-Person)的各类信息的交互，从而提供安全、交通管理以及娱乐等综合性服务。Information exchange between vehicles and between vehicles and other devices is one of the important functions of the Internet of Vehicles, and V2X technology is the basis for realizing information exchange between vehicles. The V2X network relies on short-distance communication technology to realize the communication between vehicles and between vehicles and roadside nodes, and realizes the communication between vehicles (CAN-Controller Area Network), vehicle-road (Vehicle-2-RSU), workshop (Vehicle-2-Vehicle ), vehicle-2-Infrastructure, and Vehicle-2-Person (Vehicle-2-Person) to provide comprehensive services such as safety, traffic management, and entertainment.
V2X技术使车辆之间能够通过单跳或者多跳的方式进行自动互联，这好比车与车之间能够像人一样互相交谈，起到提高车辆运行的安全和疏导交通流量等作用。移动的车辆间可通过车辆间或车辆与基础设施之间的通信来获得智能交通信息或是完成车辆间的通信。其目的在于尽量避免交通堵塞、节约能源、保护环境，使交通更安全、更高效的运行，同时方便车辆间信息的交流。V2X technology enables vehicles to be automatically interconnected in a single-hop or multi-hop manner, which is like vehicles talking to each other like people, which can improve the safety of vehicle operation and ease traffic flow. Moving vehicles can obtain intelligent traffic information or complete inter-vehicle communication through inter-vehicle or vehicle-to-infrastructure communication. Its purpose is to avoid traffic jams as much as possible, save energy, protect the environment, make traffic safer and more efficient, and facilitate the exchange of information between vehicles.
无线资源调度是指为相互存在冲突的车辆分配无线资源的过程，如图1所示，无线资源的调度过程可以分为集中式(centralized)和分布式(distributed)两种方法，二者区别在于：若资源调度是通过一个中央设备，如基站来进行，则为集中式调度，若资源调度是靠每个车辆自己来完成，则为分布式调度。分布式资源调度为非协调调度(un-coordinated)和协调调度(coordinated)两种方式。Wireless resource scheduling refers to the process of allocating wireless resources for conflicting vehicles. As shown in Figure 1, the wireless resource scheduling process can be divided into two methods: centralized and distributed. The difference between the two is : If the resource scheduling is performed by a central device, such as a base station, it is a centralized scheduling, and if the resource scheduling is completed by each vehicle itself, it is a distributed scheduling. There are two ways of distributed resource scheduling: uncoordinated scheduling (un-coordinated) and coordinated scheduling (coordinated).
现有车载无线通信网络通常采用非协调调度方式。非协调调度是指互相存在干扰的车辆可以选择使用同一个无线资源，这样做的后果是可能会有冲突的产生。避免冲突产生的关键在于互相冲突的车辆间能够进行一定的信息交互来避免冲突的产生。The existing vehicular wireless communication network usually adopts non-coordinated scheduling. Non-coordinated scheduling means that vehicles that interfere with each other can choose to use the same wireless resource, and the consequence of doing so is that there may be conflicts. The key to avoiding conflicts is that conflicting vehicles can exchange certain information to avoid conflicts.
发明内容Contents of the invention
发明目的：为解决上述技术问题，提供一种避免车载无线通信网络无线资源调度过程中出现冲突的技术方案，本发明提出一种车载通信系统中无线资源的调度方法。Purpose of the invention: In order to solve the above technical problems and provide a technical solution to avoid conflicts in the wireless resource scheduling process of the vehicle-mounted wireless communication network, the present invention proposes a wireless resource scheduling method in the vehicle-mounted communication system.
技术方案：为实现上述技术效果，本发明提出的技术方案为：Technical scheme: in order to realize above-mentioned technical effect, the technical scheme that the present invention proposes is:
一种车载通信系统中无线资源的调度方法，包括步骤：A method for scheduling wireless resources in a vehicle communication system, comprising the steps of:
(1)为V2X网络中的所有车辆节点和无线资源块分配编号，定义任意一个车辆节点编号为k，k∈[1，2，…，K]，任意一个无线资源块编号为p，p∈[1，2，…，P]，K和P分别为车辆节点和无线资源块的总数；任意一个车辆节点通过广播与接收广播的方式与其一跳内邻居集合中的车辆节点进行车辆信息交互；对于任意一个车辆节点，其一跳内邻居为处于该车辆节点通信半径内的车辆节点，其车辆信息包括该车辆节点待发送的数据信息、发送当前数据所使用的资源块的信息以及该车辆节点一跳内邻居集合中的车辆节点的车辆信息；(1) Assign numbers to all vehicle nodes and wireless resource blocks in the V2X network, define any vehicle node number as k, k ∈ [1, 2, ..., K], and any wireless resource block number as p, p ∈ [1, 2, ..., P], K and P are the total number of vehicle nodes and wireless resource blocks respectively; any vehicle node communicates vehicle information with the vehicle nodes in its neighbor set within one hop by broadcasting and receiving broadcasts; For any vehicle node, its neighbors within one hop are vehicle nodes within the communication radius of the vehicle node, and its vehicle information includes the data information to be sent by the vehicle node, the resource block information used to send the current data, and the vehicle node The vehicle information of the vehicle nodes in the neighbor set within one hop;
(2)当车辆节点k竞争任意一个资源块p时，车辆节点k从自身两跳内邻居集合中选出与其竞争同一资源块的车辆节点，并将这些车辆节点归于车辆节点k一个冲突集；定义车辆节点k竞争资源块p时的冲突集为Ck[p]，Ck[p]＝{1，2，…，i，…I}；(2) When vehicle node k competes for any resource block p, vehicle node k selects vehicle nodes competing for the same resource block from its own two-hop neighbor set, and assigns these vehicle nodes to a conflict set of vehicle node k; Define the conflict set when vehicle node k competes for resource block p as Ck [p], Ck [p]={1, 2, ..., i, ... I};
(3)车辆节点k构建竞争资源块p的随机选择函数，并根据随机选择函数的输出结果判断车辆节点k是否能获得资源块p；若车辆节点k获得资源块p，则执行步骤(4)，否则，执行步骤(5)；(3) Vehicle node k builds a random selection function for competing resource block p, and judges whether vehicle node k can obtain resource block p according to the output of the random selection function; if vehicle node k obtains resource block p, then execute step (4) , otherwise, go to step (5);
(4)车辆节点k在资源块p上传输待传输数据n；传输完成后，判断车辆节点k是否存在其他待传输数据，若存在，则执行步骤(5)；若不存在，则车辆节点k停止竞争资源块，直至接收到新的待传输数据；(4) The vehicle node k transmits the data n to be transmitted on the resource block p; after the transmission is completed, it is judged whether there is other data to be transmitted in the vehicle node k, and if it exists, then step (5); if not, the vehicle node k Stop competing for resource blocks until new data to be transmitted is received;
(5)令p＝p*，返回步骤(2)；其中，资源块p*表示除了资源块p的其他任意一个资源块。(5) Set p=p* , and return to step (2); wherein, resource block p* represents any resource block except resource block p.
进一步的，所述车辆节点k的两跳内邻居集合包括车辆节点k的一跳内邻居和两跳内邻居；其中，车辆节点k的两跳内邻居为车辆节点k一跳内邻居的一跳内邻居。Further, the two-hop inner neighbor set of the vehicle node k includes the one-hop inner neighbor and the two-hop inner neighbor of the vehicle node k; wherein, the two-hop inner neighbor of the vehicle node k is one-hop of the one-hop inner neighbor of the vehicle node k Inner neighbors.
进一步的，所述步骤(3)中车辆节点k构建的竞争资源块p的随机选择函数为：Further, the random selection function of the competing resource block p constructed by the vehicle node k in the step (3) is:
S1：将val的二进制值向左位移12位的结果与val相加，赋值给val；S1: Add the result of shifting the binary value of val to the left by 12 bits to val, and assign it to val;
S2：将val的二进制值向右位移22位的结果与val相异或，赋值给val；S2: The result of shifting the binary value of val to the right by 22 bits is XORed with val, and assigned to val;
S3：将val的二进制值向左位移4位的结果与val相加，赋值给val；S3: Add the result of shifting the binary value of val to the left by 4 bits to val, and assign it to val;
S4：将val的二进制值向右位移9位的结果与val相异或，赋值给val；S4: The result of shifting the binary value of val to the right by 9 bits is XORed with val, and assigned to val;
S5：将val的二进制值向左位移10位的结果与val相加，赋值给val；S5: Add the result of shifting the binary value of val to the left by 10 bits to val, and assign it to val;
S6：将val的二进制值向右位移2位的结果与val相异或，赋值给val；S6: The result of shifting the binary value of val to the right by 2 bits is XORed with val, and assigned to val;
S7：将val的二进制值向左位移7位的结果与val相加，赋值给val；S7: Add the result of shifting the binary value of val to the left by 7 bits to val, and assign it to val;
S8：将val的二进制值向右位移12位的结果与val相异或，赋值给smear；其中，val和smear分别为随机选择函数模型的输入变量和输出变量。S8: The result of shifting the binary value of val to the right by 12 bits is XORed with val, and assigned to smear; where val and smear are input variables and output variables of the random selection function model, respectively.
进一步的，所述步骤(3)中通过随机选择函数的输出结果判断车辆节点k是否能获得资源块p的方法为：Further, in the step (3), the method for judging whether the vehicle node k can obtain the resource block p by the output result of the random selection function is:
(3-1)令依次执行步骤S1至S8；将随机选择函数模型输出变量的值记为smear_k1；令val＝k+p，依次执行步骤S1至S8；将随机选择函数模型输出变量的值记为smear_k2；(3-1) order Perform steps S1 to S8 in sequence; record the value of the output variable of the randomly selected function model as smear_k1; make val=k+p, execute steps S1 to S8 in turn; record the value of the output variable of the randomly selected function model as smear_k2;
(3-2)初始化i＝1；(3-2) Initialize i=1;
(3-3)令依次执行步骤S1至S8；将随机选择函数模型输出变量的值记为smear_i1；令val＝i+p，依次执行步骤S1至S8；将随机选择函数模型输出变量的值记为smear_i2；(3-3) order Perform steps S1 to S8 in sequence; record the value of the output variable of the randomly selected function model as smear_i1; make val=i+p, execute steps S1 to S8 in turn; record the value of the output variable of the randomly selected function model as smear_i2;
(3-4)判断是否满足smear_i1＞smear_k1，若满足，则判定车辆节点k竞争资源块p失败；若不满足，则执行步骤(3-5)；(3-4) Judging whether smear_i1>smear_k1 is satisfied, if satisfied, it is determined that vehicle node k fails to compete for resource block p; if not satisfied, then perform step (3-5);
(3-5)判断是否满足smear_i1＜smear_k1，若满足，则执行步骤(3-9)；若不满足，则执行步骤(3-6)；(3-5) Judging whether smear_i1<smear_k1 is satisfied, if so, execute step (3-9); if not, execute step (3-6);
(3-6)判断是否满足smear_i2＞smear_k2，若满足，则判定车辆节点k竞争资源块p失败；若不满足，则执行步骤(3-7)；(3-6) Judging whether smear_i2>smear_k2 is satisfied, if satisfied, it is determined that vehicle node k has failed to compete for resource block p; if not satisfied, step (3-7) is performed;
(3-7)判断是否满足smear_i2＜smear_k2，若满足，则执行步骤(3-9)；若不满足，则执行步骤(3-8)；(3-7) Judging whether smear_i2<smear_k2 is satisfied, if satisfied, then perform step (3-9); if not satisfied, then perform step (3-8);
(3-8)定义tp表示判断p是否为偶数的判断结果，若p为偶数，则令tp＝1，若p为奇数，则令tp＝0；定义tq表示判断i是否大于k的判断结果，若i＞k，则令tq＝1，若i＜k，则令tq＝0；定义布尔值为flag，flag＝tp∩tq；若flag＝1，则判定车辆节点k竞争资源块p失败；若flag＝0，执行步骤(3-9)；(3-8) Define tp to represent the judgment result of judging whether p is an even number, if p is an even number, then make tp =1, and if p is an odd number, then make tp =0; define tq to represent judging whether i is greater than The judgment result of k, if i>k, then let tq =1, if i<k, then let tq =0; define the Boolean value as flag, flag=tp ∩tq ; if flag=1, then judge Vehicle node k fails to compete for resource block p; if flag=0, execute step (3-9);
(3-9)判断是否满足i＝I，若i＝I，则判定车辆节点k竞争资源块p成功，若i≠I，则令i＝i+1，返回步(3-3)。(3-9) Judging whether i=I is satisfied, if i=I, then judging that vehicle node k competes for resource block p successfully, if i≠I, then making i=i+1, and returning to step (3-3).
进一步的，所述步骤(2)中找出车辆节点k竞争资源块p的冲突集的方法为：Further, in the step (2), the method for finding out the conflict set of the vehicle node k competing for the resource block p is as follows:
车辆节点k逐个判断自己的两跳内邻居集合中的车辆是否满足以下条件：Vehicle node k judges one by one whether the vehicles in its neighbor set within two hops meet the following conditions:
p＞m，m∈Dpp>m, m∈Dp
其中，Dp为车辆节点k的两跳内邻居集合；Among them, Dp is the set of neighbors within two hops of vehicle node k;
若判断结果为满足，则将车辆节点m归入车辆节点k竞争资源块p的冲突集。If the judgment result is satisfied, the vehicle node m is classified into the conflict set where the vehicle node k competes for the resource block p.
有益效果：与现有技术相比，本发明具有以下优势：Beneficial effect: compared with the prior art, the present invention has the following advantages:
本发明提供的调度方法是车辆设备在通信过程中，靠与邻居车辆节点的信息交互来获取邻居车辆节点信息，通过这些信息来判断自己获取哪些通信资源。整个过程都是通过每个车辆节点自己独立完成，并没有基站进行统一的资源调度。使得资源的利用率有所提高，同时避免了通信过程中冲突的产生。The dispatching method provided by the present invention is that the vehicle equipment obtains the neighbor vehicle node information through the information interaction with the neighbor vehicle node during the communication process, and judges which communication resources it obtains by using the information. The whole process is completed independently by each vehicle node, and there is no base station for unified resource scheduling. The utilization rate of resources is improved, and the generation of conflicts in the communication process is avoided at the same time.
附图说明Description of drawings
图1为资源调度的分类示意图；FIG. 1 is a schematic diagram of classification of resource scheduling;
图2为数据区资源块的一种编号结果示意图；Fig. 2 is a schematic diagram of a numbering result of resource blocks in the data area;
图3为车载网络中车辆节点位置示意图；FIG. 3 is a schematic diagram of vehicle node locations in the vehicle network;
图4为车辆信息的内容结构图；Fig. 4 is a content structure diagram of vehicle information;
图5为资源调度的流程图；FIG. 5 is a flowchart of resource scheduling;
图6为各车辆节点的平均归一化吞吐率示意图。Fig. 6 is a schematic diagram of the average normalized throughput of each vehicle node.
具体实施方式detailed description
本发明的目的在于提供一种车载通信系统中车辆设备间进行分布式的无线通信的资源调度方法，使得资源的利用率有所提高，同时避免了通信过程中冲突的产生。下面结合附图具体说明本发明所提出的技术方案的相关步骤。The purpose of the present invention is to provide a resource scheduling method for distributed wireless communication between vehicle devices in a vehicle communication system, which improves resource utilization and avoids conflicts in the communication process. The relevant steps of the technical solution proposed by the present invention will be specifically described below in conjunction with the accompanying drawings.
如图2所示数据区资源块的一种编号结果示意图，无线资源被分为两个区域，控制区域和数据传输区域，本发明中的资源块指的是数据传输区域中的资源。我们将数据传输区的无线资源按照频域优先于时域的方式由小到大依次编号，如图2所示。本发明假设所有车辆不分主次同步工作，且都可以利用数据传输区的所有无线资源。在执行本实施例所提供的技术方案前，首先为V2X网络中的所有车辆节点和无线资源块分配编号，定义任意一个车辆节点编号为k，k∈[1，2，…，K]，任意一个无线资源块编号为p，p∈[1，2，…，P]，K和P分别为车辆节点和无线资源块的总数。文中的车辆节点k和无线资源块p分别指编号为k车辆节点和编号为p的无线资源块。As shown in Figure 2, a schematic diagram of a numbering result of resource blocks in the data area, wireless resources are divided into two areas, the control area and the data transmission area, and the resource blocks in the present invention refer to resources in the data transmission area. We number the wireless resources in the data transmission area from small to large in such a way that the frequency domain takes precedence over the time domain, as shown in Figure 2. The present invention assumes that all vehicles work synchronously regardless of primary and secondary, and can utilize all wireless resources in the data transmission area. Before implementing the technical solution provided by this embodiment, first assign numbers to all vehicle nodes and wireless resource blocks in the V2X network, define any vehicle node number as k, k ∈ [1, 2, ..., K], any A radio resource block is numbered p, p ∈ [1, 2, ..., P], K and P are the total number of vehicle nodes and radio resource blocks respectively. The vehicle node k and wireless resource block p in this paper refer to the vehicle node numbered k and the wireless resource block numbered p respectively.
图3所示为车载网络中车辆节点位置示意图，对于任意一个车辆节点k，在其有效通信半径内的车辆为其一跳邻居，如图3中所示圆形区域内的车辆，车辆节点k的两跳邻居是指其一跳邻居的一跳邻居，如图3中相邻两个圆形区域内的车辆。车辆节点k通过与其一跳邻居的信息交互，可以获得自己两跳邻居范围内车辆的相关信息，也就是说，两跳内邻居的车辆节点都有可能成为车辆节点k潜在的竞争车辆，若车辆节点k与其两跳内邻居的任一车辆使用相同的资源块进行数据传输，都会导致冲突的产生。Figure 3 is a schematic diagram of the location of vehicle nodes in the vehicle network. For any vehicle node k, the vehicles within its effective communication radius are its one-hop neighbors. For vehicles in the circular area shown in Figure 3, vehicle node k The two-hop neighbors of are the one-hop neighbors of their one-hop neighbors, such as the vehicles in two adjacent circular areas in Figure 3. By interacting with the information of its one-hop neighbors, vehicle node k can obtain relevant information about vehicles within the range of its two-hop neighbors. Any vehicle of node k and its neighbor within two hops uses the same resource block for data transmission, which will lead to conflicts.
图4为车辆信息的内容结构图，车辆节点k在被分配到的资源块中发送的车辆信息的格式如图4中所示。车辆信息内容除了一些需传输的数据信息之外，还包含了分布式资源调度所需要的一些额外信息。第一部分为关于车辆节点k的信息，主要指车辆节点k发送当前数据所使用的资源块的信息。第二部分为车辆节点k的一跳邻居车辆设备的相关信息。第三部分为待传输的数据。FIG. 4 is a content structure diagram of the vehicle information, and the format of the vehicle information sent by the vehicle node k in the allocated resource block is shown in FIG. 4 . In addition to some data information to be transmitted, the vehicle information content also contains some additional information required for distributed resource scheduling. The first part is the information about the vehicle node k, mainly referring to the resource block information used by the vehicle node k to send the current data. The second part is the relevant information of the one-hop neighbor vehicle equipment of vehicle node k. The third part is the data to be transmitted.
图5为本发明所述的资源调度方案的实施流程示意图。对于车辆节点k，先求其在竞争无线资源块p时刻的两跳内邻居集合，从而求得车辆节点k的冲突集。之后通过构建随机选择函数来决定车辆节点k是否获得无线资源块p，若获得，则记录此资源块编号并且继续判断下一个车辆所使用的资源块。若未获得资源块p，则继续判断车辆节点k是否可以获得下一个资源块，直至车辆节点k成功获得了一个资源块为止。FIG. 5 is a schematic diagram of the implementation flow of the resource scheduling scheme of the present invention. For vehicle node k, first obtain its neighbor set within two hops at the time of competing for wireless resource block p, so as to obtain the conflict set of vehicle node k. Afterwards, by constructing a random selection function to determine whether the vehicle node k obtains the wireless resource block p, if obtained, record the number of the resource block and continue to judge the resource block used by the next vehicle. If the resource block p is not obtained, continue to judge whether the vehicle node k can obtain the next resource block until the vehicle node k successfully obtains a resource block.
随机选择函数的作用是使车辆节点k在当前时刻确定下一次发送信息所用资源块。其运行机制如下：The function of the random selection function is to make the vehicle node k determine the resource block used for sending information next time at the current moment. Its operating mechanism is as follows:
输入为资源块编号p，冲突集以及车辆节点编号k，输出为成功或失败，成功表示车辆k获得资源块p，失败表示车辆k未获得资源块p。The input is resource block number p, conflict set and vehicle node number k, and the output is success or failure. Success means vehicle k has obtained resource block p, and failure means vehicle k has not obtained resource block p.
首先，随机选择函数中有一个小模块，称之为子函数。其作用是对输入进行位移，相加以及抑或等操作，输出为经过一系列操作之后的结果。具体操作如下：假设输入为val，则：First, there is a small module in the random selection function, called a subfunction. Its function is to perform operations such as displacement, addition, and or, etc. on the input, and the output is the result after a series of operations. The specific operation is as follows: Assuming the input is val, then:
S1：将val的二进制值向左位移12位的结果与val相加，赋值给val；S1: Add the result of shifting the binary value of val to the left by 12 bits to val, and assign it to val;
S2：将val的二进制值向右位移22位的结果与val相异或，赋值给val；S2: The result of shifting the binary value of val to the right by 22 bits is XORed with val, and assigned to val;
S3：将val的二进制值向左位移4位的结果与val相加，赋值给val；S3: Add the result of shifting the binary value of val to the left by 4 bits to val, and assign it to val;
S4：将val的二进制值向右位移9位的结果与val相异或，赋值给val；S4: The result of shifting the binary value of val to the right by 9 bits is XORed with val, and assigned to val;
S5：将val的二进制值向左位移10位的结果与val相加，赋值给val；S5: Add the result of shifting the binary value of val to the left by 10 bits to val, and assign it to val;
S6：将val的二进制值向右位移2位的结果与val相异或，赋值给val；S6: The result of shifting the binary value of val to the right by 2 bits is XORed with val, and assigned to val;
S7：将val的二进制值向左位移7位的结果与val相加，赋值给val；S7: Add the result of shifting the binary value of val to the left by 7 bits to val, and assign it to val;
S8：将val的二进制值向右位移12位的结果与val相异或，赋值给smear；S8: The result of shifting the binary value of val to the right by 12 bits is XORed with val, and assigned to smear;
这个smear的值便是最终结果。上述随机选择函数中的左移右移指的是当前val数值的二进制表示中，每一位的移动情况，举例来说：假设当前val数值的二进制表示为：1001，左移一位的结果为0011，右移一位结果是1100。The value of this smear is the final result. The left shift and right shift in the above random selection function refers to the movement of each bit in the binary representation of the current val value. For example: suppose the binary representation of the current val value is: 1001, and the result of shifting one bit to the left is 0011, the result of shifting one bit to the right is 1100.
其次，将k与p的异或值的结果作为输入，计算出其子函数的输出结果，记作smear_k1；再求出输入为k与p之和的子函数输出结果，记作smear_k2。Secondly, the result of the XOR value of k and p is used as input, and the output result of its sub-function is calculated, denoted as smear_k1; then the output result of the sub-function whose input is the sum of k and p is calculated, denoted as smear_k2.
同样地，求出车辆节点k冲突集中车辆节点编号分别与资源块编号p异或值的子函数输出结果，记作smear_i1，以及车辆节点k冲突集中的车辆节点编号分别与p之和的子函数输出结果，记作smear_i2。Similarly, obtain the subfunction output result of the exclusive OR value of the vehicle node number in the vehicle node k conflict set and the resource block number p, denoted as smear_i1, and the subfunction of the sum of the vehicle node numbers in the vehicle node k conflict set and p The output result is denoted as smear_i2.
最后，根据以上子函数的输出结果来判断车辆节点k是否可以获得资源块p：Finally, judge whether vehicle node k can obtain resource block p according to the output of the above sub-function:
若smear_i1比smear_k1大，则判断车辆k占用资源块p失败，进而重复以上步骤，判断车辆节点k是否可以获得下一个资源块。若smear_i1比smear_k1小，则说明车辆节点k与冲突集中车辆节点i的比较过程中车辆节点k取得成功，然后车辆节点k开始与冲突集中下一个车辆设备进行比较。If smear_i1 is greater than smear_k1, it is determined that vehicle k has failed to occupy resource block p, and then repeat the above steps to determine whether vehicle node k can obtain the next resource block. If smear_i1 is smaller than smear_k1, it means that vehicle node k succeeds in the comparison process between vehicle node k and vehicle node i in the conflict set, and then vehicle node k starts to compare with the next vehicle device in the conflict set.
若smear_i1与smear_k1相等，则继续比较smear_i2与smear_k2的大小关系。若smear_i2比smear_k2大，则表示车辆节点k竞争资源块p失败，进入竞争下一个资源块的过程。若smear_i2比smear_k2小，则说明车辆节点k与冲突集中车辆节点i的比较过程中车辆节点k取得成功，进而与冲突集中下一个车辆进行比较。If smear_i1 is equal to smear_k1, continue to compare the size relationship between smear_i2 and smear_k2. If smear_i2 is greater than smear_k2, it means that vehicle node k fails to compete for resource block p, and enters the process of competing for the next resource block. If smear_i2 is smaller than smear_k2, it means that vehicle node k is successful in the comparison process between vehicle node k and vehicle node i in the conflict set, and then compared with the next vehicle in the conflict set.
若smear_i1与smear_k1相等且smear_i2与smear_k2也相等，则继续判断资源块编号p的奇偶性以及冲突集中车辆节点编号i与k的大小，以确定出k与i的比较过程中，k是否可以成功。If smear_i1 is equal to smear_k1 and smear_i2 is equal to smear_k2, continue to judge the parity of the resource block number p and the size of the vehicle node numbers i and k in the conflict set to determine whether k can succeed in the comparison process between k and i.
定义tp表示判断p是否为偶数的判断结果，若p为偶数，则令tp＝1，若p为奇数，则令tp＝0；定义tq表示判断i是否大于k的判断结果，若i＞k，则令tq＝1，若i＜k，则令tq＝0；记布尔值flag，flag＝tp∩tq；若flag＝1，则判定车辆节点k竞争资源块p失败；若flag＝0，则再进行下一轮判断。Define tp to represent the judgment result of judging whether p is an even number, if p is an even number, then make tp =1, and if p is an odd number, then make tp =0; define tq to represent the judgment result of judging whether i is greater than k, If i>k, then set tq =1, if i<k, then set tq =0; record the Boolean value flag, flag=tp ∩tq ; if flag=1, determine that vehicle node k competes for resource blocks p fails; if flag=0, proceed to the next round of judgment.
通过以上步骤，只有车辆节点k在与自己的冲突集中所有车辆节点的比较中都成功，才可以判定车辆节点k获得了资源块p，否则，只要车辆节点k在与冲突集中一个车辆节点的比较中失败，就判断车辆节点k失败，随后进入下一资源块的比较中，直至车辆节点k成功，随机选择过程才完成。Through the above steps, only when vehicle node k is successful in the comparison with all vehicle nodes in its own conflict set, can it be determined that vehicle node k has obtained resource block p, otherwise, as long as vehicle node k is compared with a vehicle node in the conflict set If it fails, it is judged that the vehicle node k fails, and then enters into the comparison of the next resource block, and the random selection process is not completed until the vehicle node k succeeds.
图6所示为各车辆节点的平均归一化吞吐率示意图，表示了每个车辆节点的广播半径分别为15米和30米时，总用户数分别为20，50，80，110，140和170时候每个车辆节点的平均归一化吞吐率。从图中可以看出，广播半径越大，平均归一化吞吐率的值越小，原因在于广播半径越大，冲突集中的车辆节点会越多，这样某个车辆节点在竞争资源块的时候，竞争成功的可能性会降低，从而导致了每个车辆节点平均归一化吞吐率的降低。横向比较可发现，其它变量不变，仅改变总车辆节点数时，车辆节点越多，平均归一化吞吐率的值越小。原因是车辆节点的增多导致道路上车辆密度增加，这同样会使每个车辆节点的冲突集中车辆节点数量增加，从而降低了每个车辆节点竞争资源块成功的概率。Figure 6 is a schematic diagram of the average normalized throughput rate of each vehicle node, indicating that when the broadcast radius of each vehicle node is 15 meters and 30 meters, the total number of users is 20, 50, 80, 110, 140 and Average normalized throughput of each vehicle node at time 170. It can be seen from the figure that the larger the broadcast radius, the smaller the value of the average normalized throughput rate. The reason is that the larger the broadcast radius, the more vehicle nodes will be in the conflict concentration. In this way, when a certain vehicle node competes for a resource block , the probability of successful competition will decrease, leading to a decrease in the average normalized throughput of each vehicle node. From the horizontal comparison, it can be found that when other variables remain unchanged and only the total number of vehicle nodes is changed, the more vehicle nodes, the smaller the value of the average normalized throughput. The reason is that the increase of vehicle nodes leads to the increase of vehicle density on the road, which will also increase the number of vehicle nodes in the conflict set of each vehicle node, thereby reducing the success probability of each vehicle node competing for resource blocks.
以上所述仅是本发明的优选实施方式，应当指出：对于本技术领域的普通技术人员来说，在不脱离本发明原理的前提下，还可以做出若干改进和润饰，这些改进和润饰也应视为本发明的保护范围。The above is only a preferred embodiment of the present invention, it should be pointed out that for those of ordinary skill in the art, without departing from the principle of the present invention, some improvements and modifications can also be made. It should be regarded as the protection scope of the present invention.
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610902493.7ACN106332296A (en) | 2016-10-17 | 2016-10-17 | A wireless resource scheduling method in a vehicle communication system |
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610902493.7ACN106332296A (en) | 2016-10-17 | 2016-10-17 | A wireless resource scheduling method in a vehicle communication system |
| Publication Number | Publication Date |
|---|---|
| CN106332296Atrue CN106332296A (en) | 2017-01-11 |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610902493.7APendingCN106332296A (en) | 2016-10-17 | 2016-10-17 | A wireless resource scheduling method in a vehicle communication system |
| Country | Link |
|---|---|
| CN (1) | CN106332296A (en) |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109391671A (en)* | 2017-08-10 | 2019-02-26 | 财团法人工业技术研究院 | Internet of vehicles resource allocation method and user equipment |
| CN110224888A (en)* | 2019-06-10 | 2019-09-10 | 公安部交通管理科学研究所 | A kind of test method of vehicle-mounted V2X communication equipment, apparatus and system |
| CN110521225A (en)* | 2017-03-23 | 2019-11-29 | 高通股份有限公司 | Realize the method and apparatus communicated in efficient queue |
| CN116782185A (en)* | 2023-08-25 | 2023-09-19 | 交通运输部公路科学研究所 | Resource scheduling method and device for vehicle-mounted wireless short-distance communication |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101801065A (en)* | 2010-01-08 | 2010-08-11 | 北京交通大学 | Mesh election competition method improved based on 802.16d |
| CN103096327A (en)* | 2013-01-08 | 2013-05-08 | 河南工业大学 | Vehicle-mounted ad hoc network self-adaptive time slot distributing method based on a time division multiple address (TDMA) |
| WO2014014394A1 (en)* | 2012-07-17 | 2014-01-23 | Telefonaktiebolaget L M Ericsson (Publ) | A network node and a method therein for scheduling a downlink data transmission to a ue, and a ue and a method therein for receiving a downlink data transmission |
| CN104349280A (en)* | 2013-08-07 | 2015-02-11 | 电信科学技术研究院 | Time slot allocation method and system |
| CN105848295A (en)* | 2016-05-13 | 2016-08-10 | 中国科学院计算技术研究所 | Heterogeneous Internet of Vehicles time slot allocation method |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101801065A (en)* | 2010-01-08 | 2010-08-11 | 北京交通大学 | Mesh election competition method improved based on 802.16d |
| WO2014014394A1 (en)* | 2012-07-17 | 2014-01-23 | Telefonaktiebolaget L M Ericsson (Publ) | A network node and a method therein for scheduling a downlink data transmission to a ue, and a ue and a method therein for receiving a downlink data transmission |
| CN103096327A (en)* | 2013-01-08 | 2013-05-08 | 河南工业大学 | Vehicle-mounted ad hoc network self-adaptive time slot distributing method based on a time division multiple address (TDMA) |
| CN104349280A (en)* | 2013-08-07 | 2015-02-11 | 电信科学技术研究院 | Time slot allocation method and system |
| CN105848295A (en)* | 2016-05-13 | 2016-08-10 | 中国科学院计算技术研究所 | Heterogeneous Internet of Vehicles time slot allocation method |
| Title |
|---|
| ROGER B.MARKS等: "Part16:Air Intrface for Fixed Broadband Wireless Access Systems", 《IEEE 802.16D》* |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110521225A (en)* | 2017-03-23 | 2019-11-29 | 高通股份有限公司 | Realize the method and apparatus communicated in efficient queue |
| CN109391671A (en)* | 2017-08-10 | 2019-02-26 | 财团法人工业技术研究院 | Internet of vehicles resource allocation method and user equipment |
| CN109391671B (en)* | 2017-08-10 | 2021-07-27 | 财团法人工业技术研究院 | Vehicle network resource allocation method and user equipment |
| CN110224888A (en)* | 2019-06-10 | 2019-09-10 | 公安部交通管理科学研究所 | A kind of test method of vehicle-mounted V2X communication equipment, apparatus and system |
| CN110224888B (en)* | 2019-06-10 | 2023-03-07 | 公安部交通管理科学研究所 | Test method, device and system for vehicle-mounted V2X communication equipment |
| CN116782185A (en)* | 2023-08-25 | 2023-09-19 | 交通运输部公路科学研究所 | Resource scheduling method and device for vehicle-mounted wireless short-distance communication |
| CN116782185B (en)* | 2023-08-25 | 2023-10-27 | 交通运输部公路科学研究所 | A resource scheduling method and device for vehicle-mounted wireless short-distance communication |
| Publication | Publication Date | Title |
|---|---|---|
| Noor-A-Rahim et al. | Broadcast performance analysis and improvements of the LTE-V2V autonomous mode at road intersection | |
| Hadded et al. | TDMA-based MAC protocols for vehicular ad hoc networks: A survey, qualitative analysis, and open research issues | |
| Shao et al. | Performance analysis of connectivity probability and connectivity-aware MAC protocol design for platoon-based VANETs | |
| CN105848295B (en) | A kind of isomery car networking slot allocation method | |
| Ni et al. | Vehicular beacon broadcast scheduling based on age of information (AoI) | |
| CN103607750A (en) | Relay selection method based on terminal straight-through communication in next-generation cellular system | |
| Wu et al. | Efficient broadcasting in VANETs using dynamic backbone and network coding | |
| Zhou et al. | DRL-based low-latency content delivery for 6G massive vehicular IoT | |
| Dror et al. | Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks | |
| CN106332296A (en) | A wireless resource scheduling method in a vehicle communication system | |
| CN107231670A (en) | Alarm relay selection algorithm based on neighbours' vehicle information with alarm direction | |
| CN109982341A (en) | A kind of V2V broadcast resource distribution method based on Hypergraph Theory | |
| Li et al. | TCGMAC: A TDMA‐based MAC protocol with collision alleviation based on slot declaration and game theory in VANETS | |
| Vegni et al. | Hybrid vehicular communications based on V2V-V2I protocol switching | |
| Mosavat-Jahromi et al. | NC–MAC: A distributed MAC protocol for reliable beacon broadcasting in V2X | |
| CN105072563A (en) | Method and apparatus for device-to-device communication | |
| Shi et al. | Sparse code multiple access assisted resource allocation for 5G V2X communications | |
| Fabian et al. | Selection of relays based on the classification of mobility‐type and localized network metrics in the Internet of Vehicles | |
| CN108834100A (en) | An Efficient Broadcast Routing Method | |
| CN103634846B (en) | By the method for greedy algorithm distribution channel resource in multi-channel multi-hop wireless network | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| CN100440832C (en) | A Construction Method of Self-Organizing Network Backbone Structure | |
| Soret et al. | Radio resource management for V2V discovery | |
| Duan et al. | Cooperative channel assignment for VANETs based on dual reinforcement learning | |
| Chen et al. | A delay‐bounded routing protocol for vehicular ad hoc networks with traffic lights |
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication | Application publication date:20170111 |