[go: up one dir, main page]

CN110601778B - A Cognitive Spectrum Allocation Method for Unidirectional Straight-Road Vehicle Networking Based on Clustering Structure - Google Patents

A Cognitive Spectrum Allocation Method for Unidirectional Straight-Road Vehicle Networking Based on Clustering Structure Download PDF

Info

Publication number
CN110601778B
CN110601778B CN201910739704.3A CN201910739704A CN110601778B CN 110601778 B CN110601778 B CN 110601778B CN 201910739704 A CN201910739704 A CN 201910739704A CN 110601778 B CN110601778 B CN 110601778B
Authority
CN
China
Prior art keywords
cognitive
channel
spectrum
user
priority
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
CN201910739704.3A
Other languages
Chinese (zh)
Other versions
CN110601778A (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.)
Yuan Guanghong
Original Assignee
Xian University of Technology
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 Xian University of Technology filed Critical Xian University of Technology
Priority to CN201910739704.3A priority Critical patent/CN110601778B/en
Publication of CN110601778A publication Critical patent/CN110601778A/en
Application granted granted Critical
Publication of CN110601778B publication Critical patent/CN110601778B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B17/00Monitoring; Testing
    • H04B17/30Monitoring; Testing of propagation channels
    • H04B17/382Monitoring; Testing of propagation channels for resource allocation, admission control or handover
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/12Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30Services specially adapted for particular environments, situations or purposes
    • H04W4/40Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本发明公开了一种基于分簇结构的单向直路车联网认知频谱分配机制,包括以下步骤:判断网络负载状态,将网络负载状态定义为三种:轻载、重载、超重载;当网络负载状态为重载或超重载时,启动认知频谱机制,首先采用基于距离与拥堵指数的联合等级比例分配算法进行簇间频谱分配,利用各认知小区的等级与所有认知小区总的等级之和的比例关系,分配授权用户提供的空闲频谱;然后采用基于消息优先级的竞价拍卖频谱分配算法进行簇内频谱分配,根据用户传输消息的优先级在出价函数中引入消息的优先级系数,解决了单向直路这一特定车联网场景下频谱资源匮乏问题,频谱收益及频谱利用率高,减少了交通拥堵。

Figure 201910739704

The invention discloses a unidirectional straight road vehicle networking cognitive spectrum allocation mechanism based on a clustering structure, comprising the following steps: judging network load states, and defining the network load states into three types: light load, heavy load, and super-heavy load; When the network load state is overloaded or super-heavy, the cognitive spectrum mechanism is activated. First, the joint level proportional allocation algorithm based on distance and congestion index is used to allocate spectrum between clusters. The level of each cognitive cell and all cognitive cells are used. The ratio of the sum of the total levels to allocate the idle spectrum provided by authorized users; then use the bidding auction spectrum allocation algorithm based on message priority to allocate spectrum within the cluster, and introduce the priority of the message into the bidding function according to the priority of the user's transmission message. The level coefficient solves the problem of lack of spectrum resources in the specific IoV scenario of one-way straight road, and the spectrum revenue and spectrum utilization rate are high, reducing traffic congestion.

Figure 201910739704

Description

一种基于分簇结构的单向直路车联网认知频谱分配方法A Cognitive Spectrum Allocation Method for Unidirectional Straight-Road Vehicle Networking Based on Clustering Structure

技术领域technical field

本发明属于车联网认知频谱分配技术领域,涉及一种基于分簇结构的单向直路车联网认知频谱分配方法。The invention belongs to the technical field of vehicle networking cognitive spectrum allocation, and relates to a unidirectional straight road vehicle networking cognitive spectrum allocation method based on a clustering structure.

背景技术Background technique

车联网是目前智能交通系统最热门的研究领域之一,其是由道路上具有感知、计算、存储和无线通信单元组成的一种新型的自组织网络。车联网利用先进的信息通信技术在解决各类交通问题上发挥着重要的作用,信息共享与及时传递是车联网的主要目标。近年来,随着车联网的发展,人们在享受汽车出行便利的同时,对车辆服务提出了更高的要求,希望车辆在改善道路安全的同时增加车载娱乐,同时随着经济的发展,汽车数量迅猛增长,据Gartner报告,2020年将有25亿辆汽车可以使用车联网,由此可知车联网数据量将呈指数增长。The Internet of Vehicles is one of the most popular research fields of intelligent transportation systems. It is a new type of self-organizing network composed of sensing, computing, storage and wireless communication units on the road. The Internet of Vehicles uses advanced information and communication technology to play an important role in solving various traffic problems. Information sharing and timely transmission are the main goals of the Internet of Vehicles. In recent years, with the development of the Internet of Vehicles, while enjoying the convenience of car travel, people have put forward higher requirements for vehicle services. It is hoped that vehicles can improve road safety and increase in-vehicle entertainment. At the same time, with the development of the economy, the number of cars Rapid growth. According to Gartner, 2.5 billion vehicles will be able to use the Internet of Vehicles in 2020. It can be seen that the amount of Internet of Vehicles data will increase exponentially.

车联网中数据传输主要通过无线通信技术,而无线频谱资源是无线通信的前提,目前我国频谱分配采用固定分配方式,不同的应用领域具有自己固定的通信频段,车联网通信的专用频谱(FCC分配的5.9GHz频带)日益紧张,已经不能满足车联网通信的需求量。一些研究机构采用链路自适应技术、多天线及多用户检测、正交频分复用、时分复用等先进的无线通信技术来解决频谱资源匮乏问题,这些方法虽然在一定程度上提高了固定频谱利用率,但是频谱资源本身是有限的,这些方法远远不能解决现在的频谱匮乏问题。据美国联邦通信委员会(Federal Communications Commission,FCC)的调查报告可知,现有频谱资源的使用非常不均衡,一些频段长期处于被占用的状态,而另一些频段长期处于空闲状态,造成了频谱资源的浪费。因此,人们从频谱共享的角度,提出不同的方案,如免授权频段Industrial Scientific and Medial,ISM),该方案虽可以实现频谱共享,但会增加系统干扰,且只适用固定频段,对无线通信系统的容量与灵活性有一定的限制。超宽带(UItra-Wide Band,UWB)技术,可以实现与窄带通信系统间的频谱共享,但其缺少组网的灵活性。因此,人们不断地探索,发现认知无线电(Cognitive Radio,CR)技术拥有智能学习的功能,可以通过智能技术在环境中学习,可靠地感知周围频谱环境,并探测合法的授权用户,自适应地改变参数(如传输功率、载波频率和调制技术等),在保证不对授权用户造成干扰的前提下,灵活利用频谱空洞,实现可靠通信。因此,近年来许多学者将CR应用于车联网中,用于解决频谱匮乏问题,从而出现了认知车联网(Cognitive Internet of Vehicles,CIoV)。Data transmission in the Internet of Vehicles mainly uses wireless communication technology, and wireless spectrum resources are the premise of wireless communication. At present, the spectrum allocation in my country adopts a fixed allocation method. Different application fields have their own fixed communication frequency bands. The dedicated spectrum for Internet of Vehicles communication (FCC allocation). 5.9GHz frequency band) is becoming increasingly tight, and it can no longer meet the demand for Internet of Vehicles communication. Some research institutions use advanced wireless communication technologies such as link adaptation technology, multi-antenna and multi-user detection, orthogonal frequency division multiplexing, and time division multiplexing to solve the problem of lack of spectrum resources. spectrum utilization, but the spectrum resources themselves are limited, and these methods are far from solving the current spectrum scarcity problem. According to the investigation report of the Federal Communications Commission (FCC), the use of existing spectrum resources is very unbalanced, some frequency bands are occupied for a long time, while other frequency bands are idle for a long time, resulting in the shortage of spectrum resources. waste. Therefore, people have proposed different schemes from the perspective of spectrum sharing, such as the unlicensed frequency band Industrial Scientific and Medial (ISM). Although this scheme can realize spectrum sharing, it will increase system interference, and it is only applicable to fixed frequency bands, which is not suitable for wireless communication systems. capacity and flexibility are limited. Ultra-Wide Band (UItra-Wide Band, UWB) technology can realize spectrum sharing with narrow-band communication systems, but it lacks the flexibility of networking. Therefore, people continue to explore and find that Cognitive Radio (CR) technology has the function of intelligent learning, which can learn in the environment through intelligent technology, reliably perceive the surrounding spectrum environment, and detect legitimate authorized users. Change parameters (such as transmission power, carrier frequency and modulation technology, etc.), and flexibly utilize spectrum holes to achieve reliable communication on the premise of ensuring no interference to authorized users. Therefore, in recent years, many scholars have applied CR to the Internet of Vehicles to solve the problem of spectrum scarcity, resulting in the emergence of the Cognitive Internet of Vehicles (CIoV).

认知频谱分配技术是认知车联网中的关键技术之一,目前认知车联网研究处于初始阶段,车联网中的认知频谱分配的研究极少,但认知无线网络中频谱分配技术比较成熟。认知无线网络中频谱分配按照模型可分为:基于图论、基于频谱交易、基于拍卖竞价和基于博弈论的频谱分配。基于图论的方案是将频谱分配问题建模为图着色的过程,其中简单图代表认知无线网络,顶点代表认知用户,一种颜色表示一段频谱,若两认知用户之间存在干扰,则将两点之间连接起来,此时这两个认知用户不能共用相同频谱。基于图论的方法虽简单易行,但多适用于静态的网络环境,若网络拓扑改变需重新分配,频谱分配的所需时间由认知用户的数量、空闲信道数及网络的动态性决定。只要网络拓扑改变,就要重新构造网络图,若网络变化比较频繁,这对分配算法有很大的挑战。基于频谱交易的频谱分配方案将频谱视为商品,认知用户与授权用户通过频谱交易,授权用户根据不同的交易规则将空闲频谱分配给认知用户,实现频谱共享。基于频谱交易的认知频谱分配方法授权用户可通过租用其空闲频谱获取一定的经济收益,这可以激励更多的授权用户与认知用户共享自己的频谱,从而提高频谱利用率。基于拍卖的认知频谱分配方法即就是拍卖频谱,这与微观经济学中的拍卖原理相同,其中基站或中心控制接入点作为拍卖人,认知用户作为频谱买主进行竞价,基本原则是:“公平公开竞价,价高者得”,即出价最高的买主赢得空闲频谱的暂时使用权。基于拍卖的认知频谱分配方法,虽然系统可使授权用户获取济收益,来促进授权用户共享其空闲频谱的积极性,但拍卖最注重认知用户的公平性,而要同时实现高效性与有效性,会将问题复杂化。基于博弈论认知频谱分配方法即就是不同认知用户频谱策略选择的博弈过程,其中博弈论的行为集就是认知用户从空闲频谱中选择不同频段的不同方案,系统总收益为所有认知用户选择某空闲频段后产生的收益和,基于博弈论的分配方法最重要的是纳什均衡是否存在。基于博弈论认知频谱分配方法可以有效提高CR环境下频谱分配的效率和公平性,有良好的灵活性和扩展性,适合动态网络环境,但算法的复杂性比较高,算法开销大。Cognitive spectrum allocation technology is one of the key technologies in cognitive car networking. At present, the research on cognitive car networking is in the initial stage. There are very few studies on cognitive spectrum allocation in car networking, but the comparison of spectrum allocation technology in cognitive wireless network Mature. Spectrum allocation in cognitive wireless network can be divided into: based on graph theory, based on spectrum trading, based on auction bidding and based on game theory. The scheme based on graph theory is to model the spectrum allocation problem as a process of graph coloring, in which a simple graph represents a cognitive wireless network, a vertex represents a cognitive user, and a color represents a spectrum. If there is interference between two cognitive users, Then the two points are connected, and the two cognitive users cannot share the same spectrum at this time. Although the method based on graph theory is simple and feasible, it is mostly suitable for static network environment. If the network topology changes and needs to be re-allocated, the time required for spectrum allocation is determined by the number of cognitive users, the number of idle channels and the dynamics of the network. As long as the network topology changes, it is necessary to reconstruct the network graph. If the network changes frequently, this poses a great challenge to the allocation algorithm. The spectrum allocation scheme based on spectrum trading regards spectrum as a commodity. Cognitive users and authorized users conduct spectrum transactions, and authorized users allocate idle spectrum to cognitive users according to different transaction rules to realize spectrum sharing. Cognitive spectrum allocation method based on spectrum transaction Authorized users can obtain certain economic benefits by leasing their idle spectrum, which can motivate more authorized users to share their own spectrum with cognitive users, thereby improving spectrum utilization. The auction-based cognitive spectrum allocation method is the auction of spectrum, which is the same as the auction principle in microeconomics, in which the base station or the central control access point acts as the auctioneer, and the cognitive user acts as the spectrum buyer to bid. The basic principles are: " Fair and open auction, the highest bidder wins", that is, the buyer with the highest bid wins the temporary right to use the idle spectrum. Auction-based cognitive spectrum allocation method, although the system can enable authorized users to obtain economic benefits to promote the enthusiasm of authorized users to share their idle spectrum, but auction most focuses on the fairness of cognitive users, and at the same time achieves efficiency and effectiveness , will complicate the problem. The cognitive spectrum allocation method based on game theory is the game process of the spectrum strategy selection of different cognitive users, in which the behavior set of game theory is the different schemes for cognitive users to select different frequency bands from the idle spectrum, and the total system revenue is all cognitive users. The most important thing in the distribution method based on game theory is whether the Nash equilibrium exists or not. The cognitive spectrum allocation method based on game theory can effectively improve the efficiency and fairness of spectrum allocation in the CR environment. It has good flexibility and scalability, and is suitable for dynamic network environments.

现有的认知频谱分配以车联网为研究场景的较少,现有的认知频谱分配技术均不能实现合理分配频谱资源,造成频谱资源匮乏及发生交通拥堵时平均频谱分配算法下车联网中紧急消息不能及时传输,尤其是在单向直路上不能及时传输安全消息,出现交通拥堵不好疏导,容易发生连续追尾事故,会进一步加剧交通拥堵给人们的安全出行带来极大的不便。Few of the existing cognitive spectrum allocation use the Internet of Vehicles as the research scenario, and none of the existing cognitive spectrum allocation technologies can achieve reasonable allocation of spectrum resources, resulting in the lack of spectrum resources and the average spectrum allocation algorithm in the event of traffic congestion. Emergency messages cannot be transmitted in time, especially on one-way straight roads, safety messages cannot be transmitted in time, traffic congestion is difficult to guide, and continuous rear-end collisions are prone to occur, which will further aggravate traffic congestion and bring great inconvenience to people's safe travel.

发明内容SUMMARY OF THE INVENTION

本发明的目的是提供一种基于分簇结构的单向直路车联网认知频谱分配方法,解决了现有技术中存在的认知频谱分配技术不能实现合理分配频谱资源,造成频谱资源匮乏及发生交通拥堵时紧急消息不能及时传输的问题。The purpose of the present invention is to provide a one-way straight road car networking cognitive spectrum allocation method based on a clustering structure, which solves the problem that the cognitive spectrum allocation technology existing in the prior art cannot achieve reasonable allocation of spectrum resources, resulting in lack of spectrum resources and occurrence of The problem that emergency messages cannot be transmitted in time during traffic jams.

本发明所采用的技术方案是,一种基于分簇结构的单向直路车联网认知频谱分配方法,包括以下步骤:The technical solution adopted in the present invention is a method for allocating a cognitive spectrum for one-way straight road IoV based on a clustering structure, comprising the following steps:

步骤1、根据当前网络可以提供的总信道容量及各类业务的最小速率需求,判断网络负载状态,将网络负载状态定义为三种:轻载、重载、超重载;Step 1. According to the total channel capacity that the current network can provide and the minimum rate requirements of various services, determine the network load state, and define the network load state into three types: light load, heavy load, and super heavy load;

步骤2、当网络负载状态达到步骤1中的重载或超重载时,启动认知频谱机制,首先采用基于距离与拥堵指数的联合等级比例分配算法进行簇间频谱分配,利用各认知小区的等级与所有认知小区总的等级之和的比例关系,分配授权用户提供的空闲频谱;Step 2. When the network load state reaches the overload or super-heavy load in Step 1, the cognitive spectrum mechanism is activated. First, a joint level-proportional allocation algorithm based on distance and congestion index is used to allocate spectrum between clusters, and each cognitive cell is used. The proportional relationship between the level of all cognitive cells and the sum of the total levels of all cognitive cells, allocate the idle spectrum provided by authorized users;

步骤3、然后采用基于消息优先级的竞价拍卖频谱分配算法进行步骤2中分配后各个簇首的簇内频谱分配,根据用户传输消息的优先级在出价函数中引入消息的优先级系数,实现频谱分配的最优化。Step 3. Then use the bidding auction spectrum allocation algorithm based on message priority to perform the intra-cluster spectrum allocation of each cluster head after the allocation in step 2, and introduce the priority coefficient of the message into the bidding function according to the priority of the user transmission message to realize the spectrum. Allocation optimization.

本发明的特点还在于:The feature of the present invention also lies in:

步骤1中网络负载状态的计算公式为:The calculation formula of the network load state in step 1 is:

Figure GDA0002671526400000041
Figure GDA0002671526400000041

式中NLS为网络负载状态;

Figure GDA0002671526400000042
为当前网络安全的最小速率需求;
Figure GDA0002671526400000043
为当前网络非安全业务的最小速率需求;Rtotal为当前网络可以提供的总信道容量。where NLS is the network load state;
Figure GDA0002671526400000042
The minimum rate requirement for current network security;
Figure GDA0002671526400000043
is the minimum rate requirement for non-secure services on the current network; R total is the total channel capacity that the current network can provide.

各网络负载状态对应的取值范围如表1所示:The value range corresponding to each network load state is shown in Table 1:

表1网络负载状态Table 1 Network Load Status

Figure GDA0002671526400000044
Figure GDA0002671526400000044

Figure GDA0002671526400000051
Figure GDA0002671526400000051

步骤2中采用基于距离与拥堵指数的联合等级比例分配算法进行簇间频谱分配的具体步骤如下:In step 2, the specific steps of using the joint level proportional allocation algorithm based on distance and congestion index to allocate spectrum between clusters are as follows:

步骤2.1、认知小区的划分与簇首的选择Step 2.1. Division of cognitive cells and selection of cluster heads

当网络负载状态达到步骤1中的重载或超重载时,启动认知频谱机制,首先选择距每个认知小区中心位置最近的车辆作为簇首,各小区内的认知节点在簇首节点确定后将自己所需的信道数上报给簇首节点;When the network load state reaches the heavy load or super heavy load in step 1, the cognitive spectrum mechanism is activated. First, the vehicle closest to the center of each cognitive cell is selected as the cluster head, and the cognitive nodes in each cell are at the cluster head. After the node is determined, it reports the number of channels it needs to the cluster head node;

步骤2.2、优先级的确定Step 2.2, priority determination

多认知小区采用基于距离与拥堵指数的联合等级比例分配算法,因此需要获取各个簇首节点与主用户间的距离Dpci和各个认知小区即路段的拥堵系数TPIi,认知小区的优先级的计算公式为:The multi-cognitive cell adopts a joint level proportional allocation algorithm based on distance and congestion index. Therefore, it is necessary to obtain the distance Dpc i between each cluster head node and the main user and the congestion coefficient TPI i of each cognitive cell, that is, the road section. The priority of the cognitive cell is The formula for calculating the level is:

Tci=[a*TPIi+b*Dpci] (2)Tc i =[a*TPI i +b*Dpc i ] (2)

式中Tci为第i个认知小区的优先级;TPIi为第i个认知小区的拥堵系数;Dpci为第i个簇首节点与主用户间的距离,可以通过GPS获取各个节点的位置,然后通过两点间距离来获取Dpci值;a、b为常数,a表示小区拥堵状态对优先级的影响,b表示簇首节点与主用户间的距离对优先级的影响,各认知小区的优先级取值如表2所示:where Tci is the priority of the i -th cognitive cell; TPI i is the congestion coefficient of the i-th cognitive cell; Dpc i is the distance between the i-th cluster head node and the main user, and each node can be obtained through GPS and then obtain the Dpc i value through the distance between the two points; a and b are constants, a represents the influence of the congestion state of the cell on the priority, and b represents the influence of the distance between the cluster head node and the main user on the priority. The priority values of cognitive cells are shown in Table 2:

表2认知小区优先级Table 2 Cognitive cell priorities

Figure GDA0002671526400000052
Figure GDA0002671526400000052

Figure GDA0002671526400000061
Figure GDA0002671526400000061

步骤2.3、频谱分配Step 2.3, spectrum allocation

采用等级比例分配算法,各个簇首从主用户分得的频谱数Wi为:Using the rank proportional allocation algorithm, the spectrum number W i that each cluster head gets from the main user is:

Figure GDA0002671526400000062
Figure GDA0002671526400000062

式中W为主用户提供共享的空闲信道总数,可以通过能量检测来判断信道是否空闲得到W;Tci为第i个认知小区的优先级;

Figure GDA0002671526400000063
为认知小区的优先级总和。In the formula, W provides the total number of idle channels shared by the main user, and W can be obtained by judging whether the channel is idle through energy detection; Tc i is the priority of the i-th cognitive cell;
Figure GDA0002671526400000063
is the sum of priorities of cognitive cells.

步骤3中采用基于消息优先级的竞价拍卖频谱分配算法进行簇内频谱分配的具体步骤如下:In step 3, the specific steps of using the bidding and auction spectrum allocation algorithm based on message priority to allocate spectrum within the cluster are as follows:

步骤3.1、簇首节点公布空闲信道向量P=(P1,P2,…,Pj)及信道的底价向量d=(d1,d2,…,dj);Step 3.1. The cluster head node announces the idle channel vector P=(P 1 , P 2 ,...,P j ) and the channel floor price vector d=(d 1 ,d 2 ,...,d j );

其中簇首节点给出的各空闲信道的底价dj为:The floor price d j of each idle channel given by the cluster head node is:

dj=A+αj (4)d j =A+α j (4)

式中A为信道出租成本;αj为拍卖中信道j竞拍的激烈程度;where A is the channel rental cost; α j is the intensity of channel j bidding in the auction;

步骤3.2、认知用户感知空闲信道并给出信道估价向量vi={vi1,vi2,…,vij};Step 3.2, the cognitive user perceives the idle channel and gives the channel evaluation vector v i ={v i1 ,v i2 ,...,v ij };

认知用户对信道的估价函数为:The evaluation function of the cognitive user on the channel is:

vij=βiγ(Bij) (5)v iji γ(B ij ) (5)

式中vij表示认知用户i对信道j的估价;βi为认知用户i传输消息优先级系数;γ(Bij)为认知用户使用信道所获取的频谱效用函数经过取整后得到的出价函数;where v ij represents the evaluation of the channel j by cognitive user i; β i is the priority coefficient of the message transmitted by the cognitive user i; γ(B ij ) is the spectral utility function obtained by the cognitive user using the channel after rounding. the bid function;

消息优先级系数βi反映信息的重要性,消息越重要βi值越大,其取值范围为0<βi<1,认知用户传输不同类型信息的βi的取值对应关系如表3所示:The message priority coefficient β i reflects the importance of the information. The more important the message is, the larger the value of β i is, and its value range is 0 < β i <1 . 3 shows:

表3消息类型与βi的取值关系Table 3 Value relationship between message type and β i

Figure GDA0002671526400000071
Figure GDA0002671526400000071

步骤3.3、计算信道估价与底价的差值vij-dj,得到差值矩阵D;Step 3.3, calculate the difference v ij -d j between the channel evaluation and the reserve price to obtain the difference matrix D;

步骤3.4、分别对差值矩阵D的每行(即同一信道估价与底价差值)按照大小进行排序;Step 3.4, sort each row of the difference matrix D (that is, the difference between the evaluation of the same channel and the floor price) according to the size;

步骤3.5、将信道分配给该信道估价与底价差值最大的认知用户:Step 3.5: Allocate the channel to the cognitive user with the largest difference between the channel estimate and the floor price:

信道分配矩阵M反映各认知用户分配到信道的情况,M={bij|bij∈{0,1},bij表示是否将信道j分配给用户i,若bij=1表示信道j分配给用户i,否则bij=0;为防止干扰,每个信道只能分配给一个认知用户,两个认知用户不能共用一个信道,即∑ibij≤1,∑jbij≤1;The channel allocation matrix M reflects the situation that each cognitive user is allocated to the channel, M={b ij |b ij ∈ {0,1}, bij indicates whether the channel j is allocated to the user i, if bij=1 means that the channel j is allocated to the User i, otherwise b ij =0; to prevent interference, each channel can only be assigned to one cognitive user, and two cognitive users cannot share a channel, that is, ∑ i b ij ≤1, ∑ j b ij ≤1;

步骤3.6、分配到信道的认知用户推出竞价,未分配到信道的用户继续估价,回到步骤3.3;Step 3.6. Cognitive users assigned to the channel launch bidding, and users who are not assigned to the channel continue to evaluate, and go back to step 3.3;

认知用户新估价为:The new valuation for cognitive users is:

vij′=vij+G (7)v ij ′=v ij +G (7)

式中vij′为认知用户i对信道j的新估价;vij为认知用户i对信道j的最初的估价;G为补贴函数,补贴函数G具体的补贴条件为:where v ij ′ is the new evaluation of channel j by cognitive user i; v ij is the initial evaluation of channel j by cognitive user i; G is the subsidy function, and the specific subsidy conditions of the subsidy function G are:

Figure GDA0002671526400000081
Figure GDA0002671526400000081

式中△αi为认知用户i在频谱分配中连续未分到频谱的次数;g为补贴因子;a为补贴门限值,是常数;其中只有当认知用户i在频谱分配中连续未分到频谱的次数超过补贴门限值即△αi≥a时,认知用户i才可获得补贴;In the formula, △α i is the number of times that cognitive user i has not been allocated spectrum continuously in spectrum allocation; g is the subsidy factor; a is the subsidy threshold value, which is a constant; When the frequency of spectrum allocation exceeds the subsidy threshold, that is, Δα i ≥ a, cognitive user i can obtain subsidy;

步骤3.7、判断信道分配是否结束,直至各信道估价与底价的差值最大值≤0,分配结束。Step 3.7: Determine whether the channel allocation is over, until the maximum value of the difference between the channel evaluation and the reserve price is ≤ 0, and the allocation is over.

步骤3.2中出价函数γ(Bij)是由认知用户所获取的频谱效用函数Bij经过取整转换得到的,Bij为:In step 3.2, the bidding function γ(B ij ) is obtained by rounding the spectral utility function B ij obtained by the cognitive user, and B ij is:

Figure GDA0002671526400000082
Figure GDA0002671526400000082

式中W为信道带宽,单位Hz;S为信号功率;N为噪声功率。where W is the channel bandwidth, in Hz; S is the signal power; N is the noise power.

步骤3.6中补贴门限值a=3。The subsidy threshold a=3 in step 3.6.

本发明的有益效果是:本发明簇间频谱分配采用基于距离与拥堵指数的联合等级比例频谱分配算法,将主用户空闲信道分配给相对比较拥堵的认知小区,保证交通拥堵时拥堵小区内安全关键类消息的优先传输,减少交通拥堵;簇内频谱分配采用基于消息优先级的竞价拍卖频谱分配算法,将分配给认知小区的空闲信道分配给传输安全关键类消息的认知用户,使得安全关键类消息的优先传输,提高了认知小区的平均效益和频谱利用率;本发明解决了现有技术中存在的认知频谱分配技术不能实现合理分配频谱资源,造成单向直路这一特定车联网场景下频谱资源匮乏及发生交通拥堵时紧急消息不能及时传输的问题,将通过认知无线电技术感知的“频谱空洞”划分成正交等带宽的信道,将空闲信道优先分配给拥堵且距主用户近的认知小区,认知小区内将频谱优先分配给传输安全关键类消息的用户,采用该机制分配的信道数与认知用户的实际信道需求相差不大,频谱收益及频谱利用率高,保证车联网中安全关键类消息的优先传输,减少了交通拥堵。The beneficial effects of the present invention are as follows: the spectrum allocation between clusters of the present invention adopts a joint-level proportional spectrum allocation algorithm based on distance and congestion index, and allocates idle channels of primary users to relatively congested cognitive cells to ensure safety in the congested cells when traffic is congested. Priority transmission of critical messages reduces traffic congestion; intra-cluster spectrum allocation adopts a bidding and auction spectrum allocation algorithm based on message priority, and allocates idle channels allocated to cognitive cells to cognitive users transmitting safety-critical messages, ensuring safety The priority transmission of key messages improves the average benefit and spectrum utilization rate of the cognitive cell; the present invention solves the problem that the cognitive spectrum allocation technology existing in the prior art cannot achieve reasonable allocation of spectrum resources, resulting in the one-way straight road, which is a specific vehicle. In the networking scenario, due to the lack of spectrum resources and the problem that emergency messages cannot be transmitted in time when traffic congestion occurs, the "spectrum hole" sensed by cognitive radio technology is divided into channels with orthogonal equal bandwidths, and the idle channels are preferentially allocated to congested and distant mains. Cognitive cells that are close to users. In the cognitive cell, the spectrum is preferentially allocated to users transmitting safety-critical messages. The number of channels allocated by this mechanism is not much different from the actual channel requirements of cognitive users, and the spectrum income and spectrum utilization rate are high. , to ensure the priority transmission of safety-critical messages in the Internet of Vehicles, reducing traffic congestion.

附图说明Description of drawings

图1是本发明一种基于分簇结构的单向直路车联网认知频谱分配方法中的簇间分配结构示意图;Fig. 1 is a kind of structure schematic diagram of inter-cluster allocation in the one-way straight road vehicle networking cognitive spectrum allocation method based on clustering structure of the present invention;

图2是本发明一种基于分簇结构的单向直路车联网认知频谱分配方法中基于消息优先级竞价拍卖分配算法流程图;2 is a flowchart of an allocation algorithm based on message priority bidding and auction in a one-way straight road vehicle networking cognitive spectrum allocation method based on clustering structure of the present invention;

图3是本发明一种基于分簇结构的单向直路车联网认知频谱分配方法中的流程图;Fig. 3 is the flow chart in a kind of one-way straight road vehicle networking cognitive spectrum allocation method based on clustering structure of the present invention;

图4是本发明一种基于分簇结构的单向直路车联网认知频谱分配方法与其他不同分配算法的频谱数对比图;Fig. 4 is a kind of spectrum number comparison diagram of the one-way straight road car networking cognitive spectrum allocation method based on clustering structure of the present invention and other different allocation algorithms;

图5是本发明一种基于分簇结构的单向直路车联网认知频谱分配方法在不同空闲信道数下认知小区的平均收益对比图;FIG. 5 is a comparison diagram of the average income of cognitive cells under different numbers of idle channels for a one-way straight road vehicle networking cognitive spectrum allocation method based on a clustering structure of the present invention;

图6是本发明一种基于分簇结构的单向直路车联网认知频谱分配方法在不同空闲信道数下与不同分配算法的公平性对比图。FIG. 6 is a comparison diagram of fairness between a method for cognitive spectrum allocation based on a clustering structure for one-way straight road IoV according to the present invention under different numbers of idle channels and different allocation algorithms.

具体实施方式Detailed ways

下面结合附图和具体实施方式对本发明进行详细说明。The present invention will be described in detail below with reference to the accompanying drawings and specific embodiments.

本发明提出的基于分簇结构的单向直路车联网认知频谱分配机制假设道路上的车辆均配备CR功能,采用overlay的动态频谱接入技术,即主用户与认知用户在不同时间使用同一段频谱资源,但主用户对该频段的使用具有绝对的优势,只要主用户使用该频段,认知用户须无条件退出。假设通过频谱检测技术可以精准地感知到认知用户一定范围内的空闲频谱,且能获取主用户使用频谱的规律性,主用户使用频谱的时间可以预测;此外,假设获取的道路的交通拥堵指数具有良好的实时性和准确性。The one-way straight-way vehicle networking cognitive spectrum allocation mechanism based on the clustering structure proposed by the present invention assumes that all vehicles on the road are equipped with the CR function, and adopts the dynamic spectrum access technology of overlay, that is, the primary user and the cognitive user use the same frequency spectrum at different times. A segment of spectrum resources, but the primary user has an absolute advantage in using this frequency band. As long as the primary user uses this frequency band, the cognitive user must withdraw unconditionally. It is assumed that the spectrum detection technology can accurately perceive the idle spectrum within a certain range of cognitive users, and can obtain the regularity of the spectrum used by the main user, and the time when the main user uses the spectrum can be predicted; in addition, it is assumed that the traffic congestion index of the road is obtained. Has good real-time and accuracy.

本发明一种基于分簇结构的单向直路车联网认知频谱分配方法,包括以下步骤:A method for allocating cognitive spectrum for one-way straight road vehicle networking based on a clustering structure of the present invention comprises the following steps:

步骤1、根据当前网络可以提供的总信道容量及各类业务的最小速率需求,判断网络负载状态,将网络负载状态定义为三种:轻载、重载、超重载;Step 1. According to the total channel capacity that the current network can provide and the minimum rate requirements of various services, determine the network load state, and define the network load state into three types: light load, heavy load, and super heavy load;

步骤2、当网络负载状态达到步骤1中的重载或超重载时,启动认知频谱机制,首先采用基于距离与拥堵指数的联合等级比例分配算法进行簇间频谱分配,利用各认知小区的等级与所有认知小区总的等级之和的比例关系,分配主用户提供的空闲频谱;Step 2. When the network load state reaches the overload or super-heavy load in Step 1, the cognitive spectrum mechanism is activated. First, a joint level-proportional allocation algorithm based on distance and congestion index is used to allocate spectrum between clusters, and each cognitive cell is used. The proportional relationship between the level of all cognitive cells and the sum of the total levels of all cognitive cells, allocate the idle spectrum provided by the primary user;

步骤3、然后采用基于消息优先级的竞价拍卖频谱分配算法进行步骤2中分配后各个簇首的簇内频谱分配,根据用户传输消息的优先级在出价函数中引入消息的优先级系数,实现频谱分配的最优化。Step 3. Then use the bidding auction spectrum allocation algorithm based on message priority to perform the intra-cluster spectrum allocation of each cluster head after the allocation in step 2, and introduce the priority coefficient of the message into the bidding function according to the priority of the user transmission message to realize the spectrum. Allocation optimization.

步骤1中网络负载状态的计算公式为:The calculation formula of the network load state in step 1 is:

Figure GDA0002671526400000101
Figure GDA0002671526400000101

式中NLS为网络负载状态;

Figure GDA0002671526400000102
为当前网络安全的最小速率需求;
Figure GDA0002671526400000103
为当前网络非安全业务的最小速率需求;Rtotal为当前网络可以提供的总信道容量。where NLS is the network load state;
Figure GDA0002671526400000102
It is the minimum rate requirement for current network security;
Figure GDA0002671526400000103
is the minimum rate requirement for non-secure services on the current network; R total is the total channel capacity that the current network can provide.

各网络负载状态对应的取值范围如表1所示:The value range corresponding to each network load state is shown in Table 1:

表1网络负载状态Table 1 Network Load Status

Figure GDA0002671526400000104
Figure GDA0002671526400000104

Figure GDA0002671526400000111
Figure GDA0002671526400000111

步骤2中采用基于距离与拥堵指数的联合等级比例分配算法进行簇间频谱分配的具体步骤如下:In step 2, the specific steps of using the joint level proportional allocation algorithm based on distance and congestion index to allocate spectrum between clusters are as follows:

步骤2.1、认知小区的划分与簇首的选择Step 2.1. Division of cognitive cells and selection of cluster heads

当网络负载状态达到步骤1中的重载或超重载时,启动认知频谱机制,首先选择距每个认知小区中心位置最近的车辆作为簇首,如图1所示是单向直路车联网认知频谱分配机制的簇间分配图,每个小区的长度为L,各小区内的认知节点在簇首节点确定后将自己所需的信道数上报给簇首节点;When the network load state reaches the heavy load or super heavy load in step 1, the cognitive spectrum mechanism is activated. First, the vehicle closest to the center of each cognitive cell is selected as the cluster head. As shown in Figure 1, it is a one-way straight vehicle The inter-cluster allocation diagram of the networked cognitive spectrum allocation mechanism, the length of each cell is L, and the cognitive nodes in each cell report the number of channels they need to the cluster head node after the cluster head node is determined;

步骤2.2、优先级的确定Step 2.2, priority determination

多认知小区采用基于距离与拥堵指数的联合等级比例分配方法,因此需要获取各个簇首节点与主用户间的距离Dpci和各个认知小区即路段的拥堵系数TPIi,认知小区的优先级的计算公式为:The multi-cognitive cell adopts the joint level proportional allocation method based on distance and congestion index. Therefore, it is necessary to obtain the distance Dpc i between each cluster head node and the main user and the congestion coefficient TPI i of each cognitive cell, that is, the road section. The priority of the cognitive cell is The formula for calculating the level is:

Tci=[a*TPIi+b*Dpci] (2)Tc i =[a*TPI i +b*Dpc i ] (2)

式中Tci为第i个认知小区的优先级;TPIi为第i个认知小区的拥堵系数;Dpci为第i个簇首节点与主用户间的距离,可以通过GPS获取各个节点的位置,然后通过两点间距离来获取Dpci值;a、b为常数,a表示小区拥堵状态对优先级的影响,b表示簇首节点与主用户间的距离对优先级的影响,各认知小区的优先级取值如表2所示:where Tci is the priority of the i -th cognitive cell; TPI i is the congestion coefficient of the i-th cognitive cell; Dpc i is the distance between the i-th cluster head node and the main user, and each node can be obtained through GPS and then obtain the Dpc i value through the distance between the two points; a and b are constants, a represents the influence of the congestion state of the cell on the priority, and b represents the influence of the distance between the cluster head node and the main user on the priority. The priority values of cognitive cells are shown in Table 2:

表2认知小区优先级Table 2 Cognitive cell priorities

Figure GDA0002671526400000112
Figure GDA0002671526400000112

Figure GDA0002671526400000121
Figure GDA0002671526400000121

步骤2.3、频谱分配Step 2.3, spectrum allocation

采用等级比例分配算法,各个簇首从主用户分得的频谱数Wi为:Using the rank proportional allocation algorithm, the spectrum number W i that each cluster head gets from the main user is:

Figure GDA0002671526400000122
Figure GDA0002671526400000122

式中W为主用户提供共享的空闲信道总数;Tci为第i个认知小区的优先级;

Figure GDA0002671526400000123
为认知小区的优先级总和。In the formula, W provides the total number of idle channels shared by the main user; Tc i is the priority of the i-th cognitive cell;
Figure GDA0002671526400000123
is the sum of priorities of cognitive cells.

步骤3簇内的频谱分配即单个认知小区内的频谱相当于移动的集中式网络的频谱分配问题,簇首节点相当于卖家,簇内的认知节点相当于买家,由于车联网中的应用场景包括了车载导航与定位、合作路况监测、车流控制、道路拥塞分析、事故预警、移动办公、商业推广以及休闲娱乐等等,因此其信息可大致分为安全关键类、交通效率类、商娱类信息。信息类型不同,对频谱需求的急迫程度不同,其中传输安全关键类消息的认知用户对频谱需求最迫切,因此频谱最终的成交价也越高。Step 3: Spectrum allocation within a cluster, that is, the spectrum in a single cognitive cell is equivalent to the spectrum allocation problem of a mobile centralized network. The cluster head node is equivalent to the seller, and the cognitive node in the cluster is equivalent to the buyer. The application scenarios include in-vehicle navigation and positioning, cooperative road condition monitoring, traffic control, road congestion analysis, accident warning, mobile office, business promotion, leisure and entertainment, etc., so its information can be roughly divided into safety-critical, traffic efficiency, business entertainment information. Different types of information have different degrees of urgency for spectrum needs. Among them, cognitive users who transmit safety-critical messages have the most urgent need for spectrum, so the final transaction price of spectrum is also higher.

采用封闭价格的信道拍卖思想,即各个认知用户互相不知道其对某个信道的估价,也不知道簇首用户对各个信道的给出的底价,认知用户只能根据自身使用信道的效益及前几轮的竞价调整价格。簇首用户根据各个认知用户对信道的估价进行信道分配,若认知用户没有分配到信道,认知用户重新出价,进行下一轮拍卖,直至分配到信道,如果各认知用户对信道的估价均低于信道底价,则拍卖结束。The channel auction idea of closed price is adopted, that is, each cognitive user does not know each other's valuation of a certain channel, nor does he know the reserve price given by the cluster head user for each channel, and cognitive users can only use the channel according to their own benefits. and previous rounds of bidding to adjust the price. The cluster head user allocates the channel according to the evaluation of the channel by each cognitive user. If the cognitive user is not allocated to the channel, the cognitive user re-bids, and the next round of auction is carried out until it is allocated to the channel. If the estimates are lower than the channel reserve price, the auction ends.

如图2所示,步骤3中采用基于消息优先级的竞价拍卖频谱分配算法进行簇内频谱分配的具体步骤如下:As shown in Figure 2, in step 3, the specific steps of using the bidding and auction spectrum allocation algorithm based on message priority to allocate spectrum within the cluster are as follows:

步骤3.1、簇首节点公布空闲信道向量P=(P1,P2,…,Pj)及信道的底价向量d=(d1,d2,…,dj);Step 3.1. The cluster head node announces the idle channel vector P=(P 1 , P 2 ,...,P j ) and the channel floor price vector d=(d 1 ,d 2 ,...,d j );

其中簇首节点给出的各空闲信道的底价dj为:The floor price d j of each idle channel given by the cluster head node is:

dj=A+αj (4)d j =A+α j (4)

式中A为信道出租成本;αj为拍卖中信道j竞拍的激烈程度;where A is the channel rental cost; α j is the intensity of channel j bidding in the auction;

步骤3.2、认知用户感知空闲信道并给出信道估价向量vi={vi1,vi2,…,vij};每个认知用户对同一个信道的估价是不同的,该估价可以反映认知用户使用某一信道获取的效益,当认知用户使用某一信道获取的效益越高,则其对该信道的估价就越高;保证交通安全与效率是车联网首要任务,因此在估价函数中引入了信息的优先级系数,消息优先级越高,系数越大,其对信道估价越高,保证传输交通安全与效率消息的认知用户应优先分配到信道;Step 3.2. Cognitive users perceive idle channels and give a channel evaluation vector v i ={v i1 ,v i2 ,...,v ij }; the evaluation of each cognitive user for the same channel is different, and the evaluation can reflect The benefits obtained by cognitive users using a certain channel, the higher the benefits obtained by cognitive users using a certain channel, the higher the evaluation of the channel; ensuring traffic safety and efficiency is the primary task of the Internet of Vehicles, so in the evaluation The function introduces the priority coefficient of information. The higher the priority of the message, the larger the coefficient, and the higher the channel evaluation. The cognitive users who ensure the transmission of traffic safety and efficiency messages should be assigned to the channel first;

认知用户对信道的估价函数为:The evaluation function of the cognitive user on the channel is:

vij=βiγ(Bij) (5)v iji γ(B ij ) (5)

式中vij表示认知用户i对信道j的估价;βi为认知用户i传输消息优先级系数;γ(Bij)为认知用户使用信道所获取的频谱效用函数经过取整后得到的出价函数;where v ij represents the evaluation of the channel j by cognitive user i; β i is the priority coefficient of the message transmitted by the cognitive user i; γ(B ij ) is the spectral utility function obtained by the cognitive user using the channel after rounding. the bid function;

消息优先级系数βi反映信息的重要性,消息越重要βi值越大,其取值范围为0<βi<1,认知用户传输不同类型信息的βi的取值对应关系如表3所示:The message priority coefficient β i reflects the importance of the information. The more important the message is, the larger the value of β i is, and its value range is 0 < β i <1 . 3 shows:

表3消息类型与βi的取值关系Table 3 Value relationship between message type and β i

Figure GDA0002671526400000141
Figure GDA0002671526400000141

步骤3.3、计算信道估价与底价的差值vij-dj,得到差值矩阵D;Step 3.3, calculate the difference v ij -d j between the channel evaluation and the reserve price to obtain the difference matrix D;

步骤3.4、分别对差值矩阵D的每行(即同一信道估价与底价差值)按照大小进行排序;Step 3.4, sort each row of the difference matrix D (that is, the difference between the evaluation of the same channel and the floor price) according to the size;

步骤3.5、将信道分配给该信道估价与底价差值最大的认知用户:Step 3.5: Allocate the channel to the cognitive user with the largest difference between the channel estimate and the floor price:

信道分配矩阵M反映各认知用户分配到信道的情况,M={bij|bij∈{0,1},bij表示是否将信道j分配给用户i,若bij=1表示信道j分配给用户i,否则bij=0;为防止干扰,每个信道只能分配给一个认知用户,两个认知用户不能共用一个信道,即∑ibij≤1,∑jbij≤1;The channel allocation matrix M reflects the situation that each cognitive user is allocated to the channel, M={b ij |b ij ∈ {0,1}, bij indicates whether the channel j is allocated to the user i, if bij=1 means that the channel j is allocated to the User i, otherwise b ij =0; to prevent interference, each channel can only be assigned to one cognitive user, and two cognitive users cannot share a channel, that is, ∑ i b ij ≤1, ∑ j b ij ≤1;

步骤3.6、分配到信道的认知用户推出竞价,未分配到信道的用户回到步骤3.3继续估价;Step 3.6. Cognitive users assigned to the channel launch bidding, and users who are not assigned to the channel go back to step 3.3 to continue the evaluation;

认知用户新估价为:The new valuation for cognitive users is:

vij′=vij+G (7)v ij ′=v ij +G (7)

式中vij′为认知用户i对信道j的新估价;vij为认知用户i对信道j的最初的估价;G为补贴函数,补贴函数G主要目的是保证分配算法的公平性,效益低认知用始终分配不到信道,提升其竞争力,完成其通信需求,补贴函数G具体的补贴条件为:where v ij ′ is the new evaluation of the cognitive user i on the channel j; v ij is the initial evaluation of the channel j by the cognitive user i; G is the subsidy function, the main purpose of the subsidy function G is to ensure the fairness of the allocation algorithm, Low-efficiency cognitive users can never be allocated channels, improve their competitiveness, and fulfill their communication needs. The specific subsidy conditions of subsidy function G are:

Figure GDA0002671526400000151
Figure GDA0002671526400000151

式中△αi为认知用户i在频谱分配中连续未分到频谱的次数;g为补贴因子,根据实际情况取值;a为补贴门限值,是常数;其中只有当认知用户i在频谱分配中连续未分到频谱的次数超过补贴门限值即△αi≥a时,认知用户i才可获得补贴;In the formula, △α i is the number of times that cognitive user i has not been allocated spectrum continuously in spectrum allocation; g is the subsidy factor, which is valued according to the actual situation; a is the subsidy threshold value, which is a constant; When the number of consecutive unallocated spectrums in spectrum allocation exceeds the subsidy threshold, that is, Δα i ≥ a, cognitive user i can obtain subsidy;

步骤3.7、判断信道分配是否结束,直至各信道估价与底价的差值最大值≤0,分配结束,频谱分配实现了最优化。Step 3.7: Determine whether the channel allocation is over, until the maximum value of the difference between the channel evaluation and the reserve price is ≤ 0, the allocation is over, and the spectrum allocation is optimized.

步骤3.2中出价函数γ(Bij)是由认知用户所获取的频谱效用函数Bij经过取整转换得到的,Bij为:In step 3.2, the bidding function γ(B ij ) is obtained by rounding the spectral utility function B ij obtained by the cognitive user, and B ij is:

Figure GDA0002671526400000152
Figure GDA0002671526400000152

式中W为信道带宽,单位Hz;S为信号功率;N为噪声功率。where W is the channel bandwidth, in Hz; S is the signal power; N is the noise power.

步骤3.6中补贴门限值a=3。The subsidy threshold a=3 in step 3.6.

通过本发明提出的单向直路车联网认知频谱分配机制可以使某一时间段内无线网络中的空闲频谱得到有效利用,提供总的频谱利用率,也可以保证车联网处于超载或超重载(即交通拥堵)时,交通安全消息的优先传输,降低事故发生率、减少人身及经济损失。直路车联网认知频谱分配机制具体的实现过程如图3所示。Through the one-way straight-way vehicle networking cognitive spectrum allocation mechanism proposed by the present invention, the idle spectrum in the wireless network in a certain period of time can be effectively utilized, the total spectrum utilization rate can be provided, and the vehicle networking can be guaranteed to be overloaded or overloaded. (ie, traffic congestion), the priority transmission of traffic safety messages reduces the accident rate, and reduces personal and economic losses. Figure 3 shows the specific implementation process of the cognitive spectrum allocation mechanism for the IoV.

实施例Example

为了验证该机制的正确性和可行性,利用MATLAB仿真工具,对本发明提出的单向直路车联网认知频谱分配机制中的簇间与簇内分配算法进行仿真与分析,假设本发明的仿真环境有1个主用户,3个簇首节点,第i个簇内Ii个普通节点。In order to verify the correctness and feasibility of the mechanism, MATLAB simulation tool is used to simulate and analyze the inter-cluster and intra-cluster allocation algorithms in the cognitive spectrum allocation mechanism of the one-way straight road vehicle networking proposed by the present invention, assuming the simulation environment of the present invention There is one primary user, three cluster head nodes, and I i ordinary nodes in the i-th cluster.

仿真参数:如表4所示。Simulation parameters: as shown in Table 4.

表4仿真参数Table 4 Simulation parameters

Figure GDA0002671526400000161
Figure GDA0002671526400000161

(1)簇间分配(1) Inter-cluster allocation

如图4所示,是空闲信道数为30时主用户与簇首节点在基于距离与拥堵指数的联合等级比例分配算法和平均分配两种分配方案下不同认知小区内簇首节点获得的频谱数量与实际需求对比。由图4可知采用基于距离与拥堵指数的联合等级比例分配算法,不同优先级的簇首节点获得频谱数不同,一定范围内认知小区越拥堵,簇首节点获得的频谱数越多,这符合交通拥堵的小区频谱需求量大的条件,同时保证频谱由于距离远而浪费的现象。此外,采用基于距离与拥堵指数的联合等级比例分配算法分配的信道与实际信道需求相差不大,充分利用了频谱资源;而平均分配方案下各小区获得信道是相同的,各小区分配的信道与实际需求都相差很大,造成了资源的浪费。As shown in Figure 4, when the number of idle channels is 30, the frequency spectrum obtained by the primary user and the cluster head node in different cognitive cells under the two allocation schemes of the joint level proportional allocation algorithm based on distance and congestion index and the average allocation scheme The quantity is compared with the actual demand. It can be seen from Figure 4 that the joint level proportional allocation algorithm based on distance and congestion index is adopted, and the number of spectrums obtained by cluster head nodes with different priorities is different. The condition of the large demand for spectrum in the traffic-congested cell, while ensuring the phenomenon that the spectrum is wasted due to the long distance. In addition, the channels allocated by the joint-level proportional allocation algorithm based on distance and congestion index are not much different from the actual channel requirements, making full use of spectrum resources; while under the average allocation scheme, the channels obtained by each cell are the same, and the channels allocated by each cell are the same as the actual channel requirements. The actual demand is very different, resulting in a waste of resources.

(2)簇内分配(2) In-cluster allocation

本阶段仿真验证基于消息优先级的竞价拍卖频谱分配算法,此阶段引入平均效益指标APro和公平性指标Fair来评价簇内基于消息优先级的竞价拍卖频谱分配算法,APro即将簇首空闲频谱全部分配完后获取的总效益与总簇内认知节点的个数之比,APro越大代表该认知小区获取的系统效益越大;Fair表示簇内各认知节点分配到频谱信道时的公平性,Fair的取值范围(0,1),其值越接近1公平性越好。平均效益指标APro和公平性指标Fair的定义如下:This stage simulates and verifies the bidding and auction spectrum allocation algorithm based on message priority. In this stage, the average benefit index APro and fairness index Fair are introduced to evaluate the bidding and auction spectrum allocation algorithm based on message priority in the cluster. APro will allocate all the idle spectrum at the cluster head. The ratio of the total benefit obtained after completion to the total number of cognitive nodes in the cluster. The larger APro, the greater the system benefit obtained by the cognitive cell; Fair indicates the fairness when each cognitive node in the cluster is allocated to the spectrum channel , the value range of Fair (0,1), the closer the value is to 1, the better the fairness. The average benefit index APro and the fairness index Fair are defined as follows:

Figure GDA0002671526400000171
Figure GDA0002671526400000171

式中APro为系统平均效益;I为簇内认知用户的个数;bij表示是否将信道j分配给用户i,若bij=1表示信道j分配给用户i;Bij为你认知用户所获取的频谱效用函数;In the formula, APro is the average benefit of the system; I is the number of cognitive users in the cluster; b ij represents whether to assign channel j to user i, if b ij =1, it means that channel j is assigned to user i; B ij is your cognitive The spectral utility function obtained by the user;

Figure GDA0002671526400000172
Figure GDA0002671526400000172

式中Fair为公平性指标;βi为认知用户i传输数据的类型;bij表示是否将信道j分配给用户i,若bij=1表示信道j分配给用户i;Bij为你认知用户所获取的频谱效用函数。In the formula, Fair is the fairness index; β i is the type of data transmitted by the cognitive user i; b ij represents whether the channel j is allocated to the user i, if b ij =1, the channel j is allocated to the user i; Know the spectral utility function obtained by the user.

为了验证簇内提出的算法的而有效性,仿真对比了不同补贴门限值下基于消息优先级的竞价拍卖频谱分配算法,以及快速拍卖分配算法。In order to verify the effectiveness of the algorithm proposed in the cluster, the simulation and comparison of the bidding auction spectrum allocation algorithm based on message priority and the fast auction allocation algorithm are carried out under different subsidy thresholds.

如图5所示是空闲信道数取不同值,基于消息优先级的竞价拍卖的频谱分配算法和快速拍卖分配算法分配后认知小区的平均效益。由图可知,随着空闲信道数的增加,认知小区内的平均效益也在增加,但基于消息优先级的竞价拍卖的车联网认知频谱分配算法在三种补贴门限下的平均效益均大于快速拍卖分配算法。补贴门限取值不同,认知小区内的获取平均效益不同,其中门限值取3时,平均效益均大于补贴门限值取0和5;补贴门限值过低如a=0,此时过多的信息等级低的用户分配到频谱从而降低了认知小区的平均效益,补贴门限过高如a=5时,很多用户分配不到信道,信道利用率低,近而降低了认知小区的平均效益。As shown in Figure 5, the number of idle channels takes different values, the spectrum allocation algorithm of the bidding auction based on message priority and the fast auction allocation algorithm allocate the average benefit of cognitive cells. It can be seen from the figure that with the increase of the number of idle channels, the average benefit in the cognitive cell also increases, but the average benefit of the IoV cognitive spectrum allocation algorithm based on the bidding auction based on message priority is greater than that under the three subsidy thresholds. Fast auction allocation algorithm. The subsidy threshold is different, and the average benefit obtained in the cognitive cell is different. When the threshold is 3, the average benefit is greater than the subsidy threshold, which is 0 and 5; if the subsidy threshold is too low, such as a=0, at this time Too many users with low information level are allocated to the spectrum, which reduces the average benefit of the cognitive cell. When the subsidy threshold is too high, such as a=5, many users cannot be allocated channels, and the channel utilization rate is low, which reduces the cognitive cell. average benefit.

如图6所示是空闲信道数取不同值时,基于消息优先级的竞价拍卖的频谱分配算法和快速拍卖分配算法的公平性对比。有图可知,空闲信道数取不同值,快速拍卖算法的公平指标Fair=1,因为快速拍卖算法以公平为分配指标,保证各个认知用户之间的效益相同,但这种分配算法认知小区的总效益和平均效益均低;基于消息优先级的竞价拍卖频谱分配算法的公平指标Fair随着空闲信道数改变而改变,同时补贴门限不同,公平指标Fair也不同,当补贴门限值a=0或5时,基于消息优先级的竞价拍卖频谱分配算法的公平指标Fair均比较低这主要由于对于分配到信道的效益低的用户过多或过少,导致分配的不均衡,而当补贴门限值a=0或5时,基于消息优先级的竞价拍卖频谱分配算法的公平指标Fair值在1附近波动,各认知用户基本均衡。Figure 6 shows the fairness comparison between the spectrum allocation algorithm of the bidding auction based on message priority and the fast auction allocation algorithm when the number of idle channels takes different values. It can be seen from the figure that the number of idle channels takes different values, and the fairness index of the fast auction algorithm is Fair = 1, because the fast auction algorithm uses fairness as the allocation index to ensure the same benefits among each cognitive user, but this allocation algorithm cognitive cell The total benefit and average benefit are both low; the fairness index Fair of the bidding auction spectrum allocation algorithm based on message priority changes with the change of the number of idle channels, and the subsidy threshold is different, the fairness index Fair is also different, when the subsidy threshold a = When it is 0 or 5, the fairness index Fair of the bidding and auction spectrum allocation algorithm based on message priority is relatively low. When the limit a=0 or 5, the fairness index Fair value of the bidding and auction spectrum allocation algorithm based on message priority fluctuates around 1, and the cognitive users are basically balanced.

Claims (2)

1. A unidirectional straight-way internet of vehicles cognitive spectrum allocation method based on a clustering structure is characterized by comprising the following steps:
step 1, judging the network load state according to the total channel capacity which can be provided by the current network and the minimum speed requirement of various services, and defining the network load state into three types: light load, heavy load, and overload;
the calculation formula of the network load state is as follows:
Figure FDA0002689337710000011
NLS is network load state;
Figure FDA0002689337710000012
the minimum rate requirement of the current network security service is met;
Figure FDA0002689337710000013
the minimum rate requirement of the current network non-safety service is met; rtotalTotal channel capacity available for the current network;
the value ranges corresponding to the load states of the networks are shown in table 1:
TABLE 1 network load status
Figure FDA0002689337710000014
Step 2, when the network load state reaches the heavy load or the overload in the step 1, starting a cognitive spectrum mechanism, firstly, performing inter-cluster spectrum allocation by adopting a joint grade proportion allocation algorithm based on distance and congestion indexes, and allocating an idle spectrum provided by a main user by utilizing the proportion relation between the grade of each cognitive cell and the sum of the total grades of all cognitive cells;
the specific steps of the inter-cluster spectrum allocation by adopting a joint grade proportion allocation algorithm based on the distance and the congestion index are as follows:
step 2.1, cognitive cell division and cluster head selection
When the network load state reaches the heavy load or the overload in the step 1, starting a cognitive spectrum mechanism, firstly, selecting a vehicle closest to the central position of each cognitive cell as a cluster head, and reporting the required channel number to the cluster head node by the cognitive node in each cell after the cluster head node is determined;
step 2.2, determination of priority
The multi-cognitive cell adopts a joint grade proportion distribution algorithm based on distance and congestion index, so that the distance Dpc between each cluster head node and the master user needs to be acquirediAnd congestion coefficient TPI of each cognitive cell or road sectioniThe calculation formula of the priority of the cognitive cell is as follows:
Tci=[a*TPIi+b*Dpci] (2)
tc in the formulaiThe priority of the ith cognitive cell; TPIiThe congestion coefficient of the ith cognitive cell is the congestion coefficient of the ith cognitive cell; dpciThe distance between the ith cluster head node and the master user is obtained; a. b is a constant, a represents the influence of the congestion state of the cell on the priority, b represents the influence of the distance between the cluster head node and the master user on the priority, and the priority value of each cognitive cell is shown in table 2:
table 2 cognitive cell priority
Constant a Constant b Cognitive cell TPIi Distance Dpc between cluster head and master useri(km) Cognitive cell priority Tci 0.8 0.2 8.2 6 8 0.8 0.2 4.5 5 5 0.8 0.2 2.4 4 3 0.5 0.5 8.2 6 7 0.5 0.5 4.5 5 5 0.5 0.5 2.4 4 3 0.3 0.7 8.2 6 7 0.3 0.7 4.5 5 5 0.3 0.7 2.4 4 4
Step 2.3, Spectrum Allocation
The frequency spectrum W of each cluster head divided from the main user by adopting a grade proportion distribution algorithmiComprises the following steps:
Figure FDA0002689337710000021
where W provides shared idle channel for primary userTotal number; tciThe priority of the ith cognitive cell;
Figure FDA0002689337710000031
is the sum of the priorities of the cognitive cells;
step 3, then, a bidding auction frequency spectrum allocation algorithm based on message priority is adopted to perform intra-cluster frequency spectrum allocation of each cluster head after allocation in step 2, and a priority coefficient of the message is introduced into a bidding function according to the priority of the message transmitted by the user to realize optimization of the frequency spectrum allocation;
the specific steps of using the bidding auction spectrum allocation algorithm based on the message priority to allocate the intra-cluster spectrum are as follows:
step 3.1, the cluster head node publishes the idle channel vector P ═ (P)1,P2,…,Pj) And the base value vector d ═ of the channel (d ═ d)1,d2,…,dj);
Wherein the base price d of each idle channel given by the cluster head nodejComprises the following steps:
dj=A+αj (4)
wherein A is the channel rental cost; alpha is alphajThe severity of the auction for channel j in the auction;
step 3.2, the cognitive user perceives the idle channel and provides a channel estimation vector vi={vi1,vi2,…,vij};
The cognitive user's valuation function for the channel is:
vij=βiγ(Bij) (5)
in the formula vijRepresenting the evaluation of the cognitive user i on the channel j; beta is aiTransmitting a message priority coefficient for a cognitive user i; gamma (B)ij) Obtaining a bid function after rounding a spectrum utility function obtained by using a channel for a cognitive user; the bid function γ (B)ij) Is a spectrum utility function B obtained by a cognitive userijObtained by rounding conversion, BijComprises the following steps:
Figure FDA0002689337710000032
wherein W is the channel bandwidth in Hz; s is signal power; n is noise power;
message priority coefficient betaiReflecting the importance of the message, the more important the message isiThe larger the value is, the range of the value is 0<βiBeta less than or equal to 1, cognitive user transmits different types of informationiThe value correspondence of (a) is shown in table 3:
TABLE 3 message types and betaiValue relationship of
Figure FDA0002689337710000041
Step 3.3, calculating the difference v between the channel valuation and the base valueij-djObtaining a difference matrix D;
step 3.4, sorting each row of the difference matrix D, namely the same channel estimation and base price difference according to the size;
and 3.5, allocating the channel to the cognitive user with the maximum difference value between the channel estimation value and the base value:
the channel allocation matrix M reflects the situation that each cognitive user is allocated to a channel, and M ═ bij|bij∈{0,1}},bijIndicating whether channel j is assigned to user i, if bij1 means that channel j is allocated to user i, otherwise bij0; to prevent interference, each channel can only be allocated to one cognitive user, and two cognitive users cannot share one channel, namely sigmaibij≤1,∑jbij≤1;
Step 3.6, the cognitive users distributed to the channels quit bidding, the users not distributed to the channels continue to evaluate, and the step 3.3 is returned to;
the new valuation of the cognitive user is as follows:
vij′=vij+G (7)
in the formula vij' is cognitionNew valuation of channel j by user i; v. ofijInitial valuation of channel j for cognitive user i; g is a subsidy function, and the concrete subsidy conditions of the subsidy function G are as follows:
Figure FDA0002689337710000051
in the formula, delta alphaiThe frequency of continuous undistributed frequency spectrums in frequency spectrum allocation is given to the cognitive user i; g is a subsidy factor; a is a subsidy threshold, which is a constant; wherein, only when the frequency of the cognitive user i not continuously dividing into the frequency spectrum in the frequency spectrum allocation exceeds the subsidy threshold value, namely delta alphaiWhen the user is more than or equal to a, the cognitive user i can obtain subsidies;
and 3.7, judging whether the channel allocation is finished or not until the maximum value of the difference between the evaluation value and the base value of each channel is less than or equal to 0, and finishing the allocation.
2. The method for allocating cognitive spectrum in one-way direct-drive internet of vehicles according to claim 1, wherein the subsidized threshold value a in step 3.6 is 3.
CN201910739704.3A 2019-08-12 2019-08-12 A Cognitive Spectrum Allocation Method for Unidirectional Straight-Road Vehicle Networking Based on Clustering Structure Active CN110601778B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910739704.3A CN110601778B (en) 2019-08-12 2019-08-12 A Cognitive Spectrum Allocation Method for Unidirectional Straight-Road Vehicle Networking Based on Clustering Structure

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910739704.3A CN110601778B (en) 2019-08-12 2019-08-12 A Cognitive Spectrum Allocation Method for Unidirectional Straight-Road Vehicle Networking Based on Clustering Structure

Publications (2)

Publication Number Publication Date
CN110601778A CN110601778A (en) 2019-12-20
CN110601778B true CN110601778B (en) 2020-12-18

Family

ID=68854056

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910739704.3A Active CN110601778B (en) 2019-08-12 2019-08-12 A Cognitive Spectrum Allocation Method for Unidirectional Straight-Road Vehicle Networking Based on Clustering Structure

Country Status (1)

Country Link
CN (1) CN110601778B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112367152A (en) * 2020-10-29 2021-02-12 国网甘肃省电力公司信息通信公司 Power wireless private network resource allocation method based on service priority

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103402265A (en) * 2013-08-08 2013-11-20 上海师范大学 Spectrum allocation method based on fuzzy logic and communication priority
CN108551676A (en) * 2018-05-10 2018-09-18 河南工业大学 A kind of cognition car networking frequency spectrum distributing method based on immune optimization
CN109041013A (en) * 2018-09-28 2018-12-18 河南科技大学 Car networking MAC protocol and its implementation based on cognitive radio technology

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9226160B2 (en) * 2012-12-17 2015-12-29 Intel Corporation Radio spectrum trading
US9491661B2 (en) * 2012-12-17 2016-11-08 Intel Corporation Cloud spectrum management system
US10848355B2 (en) * 2014-06-03 2020-11-24 Valorbec Societe En Commandite Methods and systems for cognitive radio spectrum monitoring
US10659528B2 (en) * 2016-09-23 2020-05-19 Board Of Trustees Of The University Of Arkansas Cloud enabled cognitive radio adhoc vehicular networking with security aware resource management and internet of vehicles applications
CN106550369A (en) * 2016-11-10 2017-03-29 桂林电子科技大学 A kind of spectrum auction method of the two-layer heterogeneous network comprising cell

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103402265A (en) * 2013-08-08 2013-11-20 上海师范大学 Spectrum allocation method based on fuzzy logic and communication priority
CN108551676A (en) * 2018-05-10 2018-09-18 河南工业大学 A kind of cognition car networking frequency spectrum distributing method based on immune optimization
CN109041013A (en) * 2018-09-28 2018-12-18 河南科技大学 Car networking MAC protocol and its implementation based on cognitive radio technology

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于均衡价格的认知无线网络频谱分配算法;谢健骊 等;《铁道学报》;20140131;第36卷(第1期);全文 *

Also Published As

Publication number Publication date
CN110601778A (en) 2019-12-20

Similar Documents

Publication Publication Date Title
CN103501543A (en) Time division multiple access-based resource scheduling scheme for Internet of vehicles
CN106023641A (en) Parking space reservation and allocation method and system based on dynamic optimization
CN115190489B (en) Deep reinforcement learning-based cognitive wireless network dynamic spectrum access method
CN103428824A (en) Method and device for selecting network under multi-network environment and mobile terminal
Hui et al. Digital twins enabled on-demand matching for multi-task federated learning in HetVNets
CN102186176A (en) Cognitive radio spectrum sharing method based on supply-demand balance
CN110557211B (en) A cognitive spectrum allocation method for Internet of Vehicles at intersections based on clustering structure
CN103857027B (en) Power distribution method in satellite communication system
CN103929819A (en) A Cognitive Radio Network from User Joint Pricing and Resource Allocation Method
CN101854634A (en) A Market-Based Spectrum Allocation Method in Clustered Ad Hoc Networks
CN118301626B (en) Multi-objective optimized road side unit networking deployment method in intelligent traffic system
CN101478773B (en) MANET routing protocol synthetic evaluation method based on credibility
CN110601778B (en) A Cognitive Spectrum Allocation Method for Unidirectional Straight-Road Vehicle Networking Based on Clustering Structure
Li et al. Vehicular edge cloud computing: Depressurize the intelligent vehicles onboard computational power
Qi et al. Matching-based hybrid service trading for task assignment over dynamic mobile crowdsensing networks
Kou et al. Study of a routing algorithm of Internet of vehicles based on selfishness
CN115600876A (en) Power distribution network resource allocation method, device and equipment based on multi-dimensional indexes
CN103813292A (en) Spectrum trading pricing strategy based on Logistic regression method credit prediction
Sohaib et al. Intelligent energy efficient resource allocation for URLLC services in IoV networks
Ribeiro et al. A shapley value-based strategy for resource allocation in vehicular clouds
Amer et al. Hybrid game approach‐based channel congestion control for the Internet of Vehicles
Zhao et al. A multi-channel cooperative demand-aware media access control scheme in vehicular ad-hoc network
CN102468890B (en) Multi-user cooperation channel selection method in cognitive wireless network
CN113705902B (en) Traffic hub passenger transport organization evaluation method based on crowd management
Verma et al. A novel hybrid centralised decentralised framework for electric vehicles coordination

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

Effective date of registration: 20250916

Address after: 430070 Hubei Province, Wuhan City, Hongshan District, Zhuodaoquan No. 259

Patentee after: Yuan Guanghong

Country or region after: China

Address before: 710048 Shaanxi province Xi'an Beilin District Jinhua Road No. 5

Patentee before: XI'AN University OF TECHNOLOGY

Country or region before: China