[go: up one dir, main page]

CN110381470B - A Joint Optimization Method for Access Control Oriented to Quality of Service Guarantee in Railway Internet of Things - Google Patents

A Joint Optimization Method for Access Control Oriented to Quality of Service Guarantee in Railway Internet of Things Download PDF

Info

Publication number
CN110381470B
CN110381470B CN201910669225.9A CN201910669225A CN110381470B CN 110381470 B CN110381470 B CN 110381470B CN 201910669225 A CN201910669225 A CN 201910669225A CN 110381470 B CN110381470 B CN 110381470B
Authority
CN
China
Prior art keywords
spectrum
things
access control
con
joint optimization
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
CN201910669225.9A
Other languages
Chinese (zh)
Other versions
CN110381470A (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.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN201910669225.9A priority Critical patent/CN110381470B/en
Publication of CN110381470A publication Critical patent/CN110381470A/en
Application granted granted Critical
Publication of CN110381470B publication Critical patent/CN110381470B/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
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/02Arrangements for optimising operational condition
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0231Traffic management, e.g. flow control or congestion control based on communication conditions
    • H04W28/0236Traffic management, e.g. flow control or congestion control based on communication conditions radio quality, e.g. interference, losses or delay
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0268Traffic management, e.g. flow control or congestion control using specific QoS parameters for wireless networks, e.g. QoS class identifier [QCI] or guaranteed bit rate [GBR]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/16Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18Negotiating wireless communication parameters
    • H04W28/22Negotiating communication rate
    • 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]
    • H04W4/42Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for mass transport vehicles, e.g. buses, trains or aircraft
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses an access control joint optimization method facing to service quality guarantee in a railway internet of things in the technical field of the internet of things, which comprises the following steps: introducing white space to improve network throughput; introducing a utility function to ensure fairness and stability of users of an access control scheme and improve QoS (quality of service) in access control; the method comprises the steps of providing an Internet of things access control joint optimization model with both rate control and spectrum allocation; the given access control procedure mainly comprises: performing greedy coloring-based spectrum initial allocation; then, according to a distributed rate control algorithm, the stability constraint of the combined optimization model is satisfied; and finally, performing new allocation on the frequency spectrum by using a dynamic frequency spectrum allocation algorithm. After joint optimization is implemented, the access control of the railway Internet of things can be guaranteed with QoS.

Description

一种铁路物联网中面向服务质量保障的接入控制联合优化 方法A Joint Optimization of Access Control Oriented to Quality of Service Guarantee in Railway Internet of Things method

技术领域technical field

本发明涉及一种物联网技术领域的技术方法,具体涉及一种为保障铁路物联网的服务质量引入空白频谱和效用函数后,初始频谱分配与动态频谱分配技术相结合的接入控制联合优化方法。The invention relates to a technical method in the technical field of the Internet of Things, in particular to a joint optimization method for access control that combines initial spectrum allocation and dynamic spectrum allocation technology after introducing a blank spectrum and a utility function to ensure the service quality of the railway Internet of Things .

背景技术Background technique

物联网是物品之间的互联网,是互联网和通信网的延伸和延展应用,它充分利用已有的网络技术、结合传感和射频识别技术,使得物与人、物与物间实现信息交互及无缝链接。利用物联网技术与其他领域进行技术交叉融合是不可避免的发展趋势。引入物联网技术后,铁路行业发生了重大变化。首先,物联网设备的部署可以使铁路运输更具保障性。比如,在铁路轨道周围部署上足够数量的传感器,可以很好地收集轨道状态信息、列车轴温信息等数据,同时驾驶员等重要人员携带无线可穿戴设备以收集身体健康数据,以便对突发状况作出应对措施。再者,列车运营商可以通过物联网设备对列车进行实时地理定位并分析其行驶状态、对车厢内乘客数量和车站等候乘客数进行捕捉并分析,以便保障行车安全和更有效地运营列车。最后,物联网设备可以提供乘客的票务信息、位置、消费情况等,以便列车运营商可以为乘客提供更个性化、优质的服务。但是,随着数量巨多的物联网设备部署于铁路系统中,铁路系统对无线连接更加依赖,这意味着它更容易受到外部干扰、入侵和网络攻击。对于密集的铁路网络来说,随着乘客数量的增加、行驶速度的加快,即使是轻微的中断都会造成严重的后果。故而,安全问题的解决日益重要。物联网中的网络连接由接入层来控制,它可以实现传感器与互联网两者间的联通。这种联通需要网络基础设备的辅助,比如目前的基站、WiFi、卫星网等。所以要使铁路物联网拥有足够的安全保障,就必须保障接入的安全。铁路物联网的网络接入技术中,主要关心物联网或传感网中智能设备“最后一公里”本地接入的问题。其中,相关的无线接入技术有Zigbee、蓝牙、LoRa、SigFox、NB-IoT和LTE-eMTC等。在接入时的信息交换和通信中,时延与吞吐量这对指标占据着重要的位置。但是两者在一定程度上是相矛盾的,通常会为吞吐量的提高而忽略传输质量,为传输质量的提高而导致时延增大。The Internet of Things is the Internet between objects, and it is an extension and extended application of the Internet and communication networks. It makes full use of existing network technologies and combines sensing and radio frequency identification technologies to enable information interaction and communication between objects and people, and between objects and objects. Seamless link. It is an inevitable development trend to use Internet of Things technology to cross-integrate technology with other fields. After the introduction of IoT technology, the railway industry has undergone major changes. First, the deployment of IoT devices can make rail transport more secure. For example, by deploying a sufficient number of sensors around the railway track, data such as track status information and train axle temperature information can be collected well. At the same time, important personnel such as drivers carry wireless wearable devices to collect physical health data, so as to respond to emergencies. situation to take measures. Furthermore, train operators can use IoT devices to geo-locate trains in real time and analyze their running status, capture and analyze the number of passengers in the train and the number of passengers waiting at the station, so as to ensure driving safety and operate trains more efficiently. Finally, IoT devices can provide passengers with ticketing information, location, consumption, etc., so that train operators can provide passengers with more personalized and high-quality services. However, with the huge number of IoT devices deployed in the railway system, the railway system is more dependent on wireless connection, which means it is more vulnerable to external interference, intrusion and cyber attack. With dense rail networks, even minor disruptions can have serious consequences as passenger numbers increase and travel speeds increase. Therefore, the resolution of security issues is increasingly important. The network connection in the Internet of Things is controlled by the access layer, which can realize the communication between the sensor and the Internet. This kind of Unicom requires the assistance of network infrastructure equipment, such as the current base station, WiFi, satellite network, etc. Therefore, in order for the railway Internet of Things to have sufficient security, it is necessary to ensure the security of access. In the network access technology of the railway Internet of Things, the main concern is the "last mile" local access of smart devices in the Internet of Things or sensor networks. Among them, related wireless access technologies include Zigbee, Bluetooth, LoRa, SigFox, NB-IoT and LTE-eMTC. In information exchange and communication during access, the pair of indicators of delay and throughput occupy an important position. However, the two are contradictory to a certain extent, and the transmission quality is usually ignored for the improvement of the throughput, and the delay is increased for the improvement of the transmission quality.

经对现有技术文献的检索发现,方正跃等人的专利《一种窄带物联网系统中的功耗优化方法及终端》中提出了根据不同系统状态来采取不同的低功耗配置,以达到能效优化目的。马礼等人的专利《一种物联网节点接入通道优化选择方法》,在将业务进行分类的基础上,利用马尔可夫模型进行网络接入,不仅满足各终端业务需求,还提高了网络资源利用率。Paramvir Bahl等人的文章“White Space Networking with Wi-Fi likeConnectivity”利用空白频谱实现了无线局域网中系统吞吐量的提高。M.J.Neely等人的“Delay-Based Network Utility Maximization”一文中提出了网络效用优化模型以此来优化时延。但这些工作都是只考虑一种指标,如能耗、时延和吞吐量等,对其进行单一的优化。After searching the existing technical literature, it was found that Fang Zhengyue et al.’s patent "A Power Consumption Optimization Method and Terminal in a Narrowband Internet of Things System" proposes to adopt different low-power configurations according to different system states to achieve Energy efficiency optimization purpose. The patent "A Method for Optimizing the Selection of Access Channels of IoT Nodes" by Ma Li et al. uses the Markov model for network access on the basis of classifying services, which not only meets the business needs of each terminal, but also improves the network resource utilization. The article "White Space Networking with Wi-Fi likeConnectivity" by Paramvir Bahl et al. utilizes white space spectrum to achieve an increase in system throughput in wireless local area networks. In the article "Delay-Based Network Utility Maximization" by M.J.Neely et al., a network utility optimization model is proposed to optimize the delay. However, these works only consider one indicator, such as energy consumption, delay, and throughput, and perform a single optimization on it.

发明内容Contents of the invention

本发明提供一种铁路物联网中面向服务质量保障的接入控制联合优化方法,应用在具有动态频谱访问能力的铁路物联网接入网中,通过引入效用函数和选取可以保证网络稳定的网络容量区域,在合理充分利用空白频谱的基础上,使得铁路物联网中各接入设备的速率控制和频谱分配两个因素达到优化。The present invention provides a quality-of-service-oriented access control joint optimization method in the railway Internet of Things, which is applied to the access network of the Railway Internet of Things with dynamic spectrum access capabilities, and can ensure stable network capacity by introducing a utility function and selecting On the basis of reasonable and full use of blank spectrum, the two factors of rate control and spectrum allocation of each access device in the railway Internet of Things are optimized.

为达到上述联合优化方法,本发明的技术方案包括:In order to achieve the above-mentioned joint optimization method, the technical solution of the present invention includes:

本发明所述铁路物联网上的接入控制系统主要由三个部分组成:控制器、若干的用户、若干的无线访问点,其中,控制器对所有无线访问点进行监测和控制,且会定期地计算所有无线访问点和用户之间的干扰;所述的访问点可以有多个无线接口,但用户只有一个接口且只可与一个访问点相连;抽象地,用I表示所有访问点的无线接口集,C表示用户集,R表示用户和访问点间的有效传输链路集,N表示所有访问点的无线接口间的干扰图,N(i)表示干扰无线接口i的其他无线接口集合,记i∈N(i)。The access control system on the railway Internet of Things of the present invention is mainly composed of three parts: a controller, a number of users, and a number of wireless access points, wherein the controller monitors and controls all wireless access points, and periodically Calculate the interference between all wireless access points and users; the access point can have multiple wireless interfaces, but the user has only one interface and can only be connected with one access point; abstractly, represent the wireless of all access points with I Interface set, C represents the user set, R represents the effective transmission link set between the user and the access point, N represents the interference graph between the wireless interfaces of all access points, N(i) represents the set of other wireless interfaces that interfere with the wireless interface i, Note i∈N(i).

本发明采用将时间平均分成细小时隙的离散时隙系统,同时采用先入先出FIFO的报文缓冲管理方式;a∈I∪C,即无线访问点和用户都可以作为源节点;b∈C,即用户都可以作为节点;在网络层,放置一个速率控制器,对从传输层进入网络层的报文的速率进行有效控制;从源节点a出发,将报文发送到目的节点b的报文发送速率记为

Figure GDA0004224630770000021
在源节点a处会维护流向目的节点b的报文缓冲队列/>
Figure GDA0004224630770000022
该缓冲队列的报文准入速率为/>
Figure GDA0004224630770000023
此外,假设所有节点间的传输都是独立同分布的;各速率间存在以下相关约束关系:The present invention adopts a discrete time slot system that divides time into small slots on average, and adopts a first-in-first-out FIFO message buffer management mode; a∈I∪C, that is, both wireless access points and users can be used as source nodes; b∈C , that is, all users can be used as nodes; in the network layer, a rate controller is placed to effectively control the rate of packets entering the network layer from the transport layer; starting from the source node a, the packet sent to the destination node b The text sending rate is denoted as
Figure GDA0004224630770000021
At the source node a, a message buffer queue to the destination node b will be maintained />
Figure GDA0004224630770000022
The packet admission rate of this buffer queue is />
Figure GDA0004224630770000023
In addition, it is assumed that the transmissions between all nodes are independent and identically distributed; the following correlation constraints exist between the rates:

Figure GDA0004224630770000024
Figure GDA0004224630770000024

Figure GDA0004224630770000025
Figure GDA0004224630770000025

Figure GDA0004224630770000026
Figure GDA0004224630770000026

其中,ωa,max(t)表示节点a处网络可以达到的最大聚合准入速率,μa,max(t)表示节点a处网络可以达到的最大聚合发送速率。Among them, ω a,max (t) represents the maximum aggregate admission rate that the network at node a can achieve, and μ a,max (t) represents the maximum aggregate transmission rate that the network at node a can achieve.

另外,给出如下

Figure GDA0004224630770000027
和/>
Figure GDA0004224630770000028
的长期时间平均值表达:Additionally, given the following
Figure GDA0004224630770000027
and />
Figure GDA0004224630770000028
The long-term time mean expression of :

Figure GDA0004224630770000031
Figure GDA0004224630770000031

Figure GDA0004224630770000032
Figure GDA0004224630770000032

将源节点a到目的节点b的队列动态更新,表示为:Dynamically update the queue from source node a to destination node b, expressed as:

Figure GDA0004224630770000033
Figure GDA0004224630770000033

Figure GDA0004224630770000034
Figure GDA0004224630770000034

Figure GDA0004224630770000035
Figure GDA0004224630770000035

其中,[·]+表示当·为正数时,直接使用,当·为负数时,使用数值0;Cl(i)表示与无线接口i相连接的用户集;第二个式子表示对于目的为有线网络或与其他访问点相连的用户的报文,访问点不需要进行缓存;第三个式子表示所有传输的目的节点处不需要对相关报文进行缓存。Among them, [ ] + means that when . The access point does not need to cache the packets of users connected to the wired network or other access points; the third formula indicates that the destination nodes of all transmissions do not need to cache the relevant packets.

本发明引入虚拟子网队列,借此对访问点的无线接口负载进行评估;所述虚拟子网队列是一个可以反映出子网负载情况的变量,其值越大,则说明子网负载越重,从而需要更多的频谱资源加大信道容量,最终减小网络的缓冲队列长度、缓解子网的拥塞;The present invention introduces a virtual subnet queue to evaluate the wireless interface load of the access point; the virtual subnet queue is a variable that can reflect the load of the subnet, and the larger the value, the heavier the load of the subnet , so that more spectrum resources are needed to increase the channel capacity, and finally reduce the buffer queue length of the network and alleviate the congestion of the subnet;

将虚拟子网队列的动态更新,表示为:Express the dynamic update of the virtual subnet queue as:

Vi(t+1)=[Vi(t)-μi(t)+ωi(t)]+ V i (t+1)=[V i (t)-μ i (t)+ω i (t)] +

Figure GDA0004224630770000036
Figure GDA0004224630770000036

Figure GDA0004224630770000037
Figure GDA0004224630770000037

μi(t)≤Capai(t)μ i (t)≤Capa i (t)

Figure GDA0004224630770000038
Figure GDA0004224630770000038

其中,Capai(t)表示无线接口i的信道容量,μi(t)表示无线接口i和与之相连的用户间的无线链路的聚合传输速率,ωi(t)表示对应子网中所有节点的聚合准入速率,最后一个式子意为对应子网中所有传输的最大聚合传输速率与无线接口i的信道容量相等。Among them, Capa i (t) represents the channel capacity of wireless interface i, μ i (t) represents the aggregate transmission rate of the wireless link between wireless interface i and the connected users, ω i (t) represents the channel capacity of the corresponding subnet The aggregate admission rate of all nodes, the last formula means that the maximum aggregate transmission rate of all transmissions in the corresponding subnet is equal to the channel capacity of the wireless interface i.

本发明使用对数合成的效用函数,其一般形式为

Figure GDA0004224630770000039
其中ωi是弹性系数,对数形式会减小xi的大小,从而在一定程度上避免大波动的异常出现,具体的,本发明中使用的效用函数形式为:The present invention uses the utility function of logarithmic synthesis, and its general form is
Figure GDA0004224630770000039
Wherein ω i is the elastic coefficient, and the logarithmic form will reduce the size of xi , thereby avoiding the abnormal occurrence of large fluctuations to a certain extent, specifically, the form of the utility function used in the present invention is:

Figure GDA00042246307700000310
Figure GDA00042246307700000310

其中,

Figure GDA00042246307700000311
是弹性系数,/>
Figure GDA00042246307700000312
表示时间平均的虚拟子网队列,/>
Figure GDA00042246307700000313
表示基于子网的时间平均聚合传输速率,τ为平衡/>
Figure GDA00042246307700000314
和/>
Figure GDA00042246307700000315
两者对频谱分配的影响因子。in,
Figure GDA00042246307700000311
is the coefficient of elasticity, />
Figure GDA00042246307700000312
Represents a time-averaged virtual subnet queue, />
Figure GDA00042246307700000313
Indicates the time-average aggregate transmission rate based on subnetwork, τ is the balance />
Figure GDA00042246307700000314
and />
Figure GDA00042246307700000315
The impact factors of the two on spectrum allocation.

本发明选用网络容量区域Π,其由全部能被网络以比例共享方式支持的

Figure GDA0004224630770000041
集合组成,其能在保证网络稳定的基础上使得系统吞吐量最优化;避免使用传统的网络容量区域,是因为在此容量区域内求解出的最终结果会导致网络稳定性被破坏,从而实际使用中的成功率极其低下。The present invention selects the network capacity area Π, which consists of all the networks that can be supported by the network in a proportional sharing manner
Figure GDA0004224630770000041
It is composed of sets, which can optimize the system throughput on the basis of ensuring network stability; avoid using the traditional network capacity area, because the final result obtained in this capacity area will lead to the destruction of network stability, so that the actual use of The success rate is extremely low.

步骤一:建立系统接入控制联合优化模型;Step 1: Establish a joint optimization model for system access control;

设定采用的网络效用函数具有凸、非减和连续相关特性,联合优化模型可描述为:Assuming that the network utility function used has convex, non-decreasing and continuous correlation characteristics, the joint optimization model can be described as:

Figure GDA0004224630770000042
Figure GDA0004224630770000042

Figure GDA0004224630770000043
Figure GDA0004224630770000043

Figure GDA0004224630770000044
Figure GDA0004224630770000044

其中,第一个约束条件可以确保比例公平性,且能使所有节点的长期时间平均准入速率处于网络容量区域Π中,第二个约束条件表明长期时间平均准入速率不能大于长期时间平均发送速率;同时也需明确,访问点无线接口的频谱分配约束着Π的大小;如果使用传统的网络容量区域,最终结果会导致网络稳定性被破坏;故而,使用网络容量区域Π能在保证网络稳定的基础上使得系统吞吐量最优化。Among them, the first constraint condition can ensure proportional fairness, and can make the long-term time average admission rate of all nodes in the network capacity area Π, the second constraint condition indicates that the long-term time average admission rate cannot be greater than the long-term time average transmission rate At the same time, it needs to be clear that the spectrum allocation of the wireless interface of the access point constrains the size of Π; if the traditional network capacity area is used, the final result will lead to the destruction of network stability; therefore, using the network capacity area Π can ensure network stability The system throughput is optimized on the basis of

步骤二:进行系统初始频谱分配;Step 2: Perform initial spectrum allocation for the system;

本发明使用基于贪婪着色的频谱分配算法求得频谱分配的初始解;首先处理输入的数据,将数据构成无向图,利用各节点的度进行升序排列并编号;同时将待采用的颜色也进行编号,按编号从小到大排列;接着,按照相关规则为每个节点着色;根据着色后各节点颜色的不同,对信道进行分类;最后利用着色所耗的颜色数目,对空白频谱进行分配,得到频谱分配解;其中相关规则为:节点和颜色都是根据编号从小到大进行采用,且相邻节点颜色必须不同。The present invention uses a spectrum allocation algorithm based on greedy coloring to obtain the initial solution of the spectrum allocation; firstly, the input data is processed, the data is formed into an undirected graph, and the degree of each node is used to arrange and number them in ascending order; at the same time, the colors to be used are also The numbers are arranged in ascending order; then, each node is colored according to the relevant rules; the channels are classified according to the color of each node after coloring; finally, the blank spectrum is allocated by using the number of colors consumed by coloring, and we get Spectrum allocation solution; the relevant rules are: nodes and colors are used according to the number from small to large, and the colors of adjacent nodes must be different.

步骤三:进行接入控制联合优化;Step 3: Perform joint optimization of access control;

使用基于Lyapunov优化的分布式速率控制算法,使得联合优化模型的稳定性约束得到满足;具体实现由节点网络层的速率控制器和访问点的链路调度器两者组成;前者可以控制网络层中由上层协议注入的报文流的速率,且节点中各传输流的缓冲队列长度决定该速率;后者是根据访问点和与其相连的用户间的缓冲队长差来进行无线链路调度传输,从而使得子网中的缓冲队列整体长度达到最小化。Using the distributed rate control algorithm based on Lyapunov optimization, the stability constraints of the joint optimization model are satisfied; the specific implementation is composed of the rate controller of the node network layer and the link scheduler of the access point; the former can control the network layer. The rate of the message flow injected by the upper layer protocol, and the buffer queue length of each transmission flow in the node determines the rate; the latter is based on the buffer length difference between the access point and the user connected to it to perform wireless link scheduling transmission, so that Minimize the overall length of the buffer queue in the subnet.

(1)、速率控制器:每个时隙中,节点a处对所有传输至b的报文的准入速率进行控制,其优化问题描述如下:(1) Rate controller: In each time slot, node a controls the admission rate of all messages transmitted to b, and its optimization problem is described as follows:

Figure GDA0004224630770000051
Figure GDA0004224630770000051

Figure GDA0004224630770000052
Figure GDA0004224630770000052

Figure GDA0004224630770000053
Figure GDA0004224630770000053

其中,为对吞吐量和时延的侧重优化进行平衡,引入γ平衡参数;设定效用函数具有凸、非减和连续等特性,故而直接进行一阶求导便可得到此优化问题的最优解;Among them, in order to balance the emphasis on optimization of throughput and delay, the γ balance parameter is introduced; the utility function is set to be convex, non-decreasing and continuous, so the optimal untie;

(2)、链路调度器:每个时隙中,访问点会观察子网中所有传输的缓冲队列长度,由(2), link scheduler: in each time slot, the access point will observe the buffer queue length of all transmissions in the subnet, determined by

Figure GDA0004224630770000054
Figure GDA0004224630770000054

Figure GDA0004224630770000055
Figure GDA0004224630770000055

可知,访问点和与其相连的用户间的缓冲队长差可直接用传输的缓冲队列长度表示;故而,访问点会优先调度子网中缓冲队长最大的传输链路进行传输,其队长为

Figure GDA0004224630770000056
It can be seen that the buffer length difference between the access point and the users connected to it can be directly expressed by the transmission buffer queue length; therefore, the access point will preferentially schedule the transmission link with the largest buffer length in the subnet for transmission, and its length is
Figure GDA0004224630770000056

步骤四:对用户进行动态接入频谱分配;Step 4: Dynamically access spectrum allocation to users;

使用基于Frank-Wolfe的动态频谱分配算法,根据步骤一中得到的初始频谱分配解Si、步骤三中的分布式速率控制算法中得到的

Figure GDA0004224630770000057
和/>
Figure GDA0004224630770000058
对频谱进行新的分配,最终使得联合优化模型中的网络效用最优化得以实现;将效用函数代入联合优化模型中,得Using the dynamic spectrum allocation algorithm based on Frank-Wolfe, according to the initial spectrum allocation solution S i obtained in step 1 and the distributed rate control algorithm obtained in step 3
Figure GDA0004224630770000057
and />
Figure GDA0004224630770000058
The new allocation of the frequency spectrum finally enables the network utility optimization in the joint optimization model to be realized; substituting the utility function into the joint optimization model, we get

Figure GDA0004224630770000059
Figure GDA0004224630770000059

因为该式已被证明是NP-hardness问题,故为计算该问题,需进行近似求解;先用步骤二中的算法完成信道分配,再用Frank-Wolfe的思想进行求解;可简单描述为:选取初始可行点,即初始信道分配结果p,指定可容许的误差范围ε,令m=0;①进行线性规划,即处理问题:

Figure GDA00042246307700000510
记计算得到的最优解为q(m),并且记d(m)=q(m)-p(m);②判断
Figure GDA00042246307700000511
是否为真?若为真,输出p(m),循环结束;否则,将d(m)作为可行下降方向,进行有效一维搜索,以此确定一维搜索步长;同时为保证结果在可行域内,规定步长α∈[0,1];③接着处理问题:/>
Figure GDA00042246307700000512
通过计算得到最优解,记为αm,令p(m+1)=p(m)m*d(m),且使m=m+1,重复上述过程。Because this formula has been proved to be an NP-hardness problem, an approximate solution is required to calculate the problem; first use the algorithm in step 2 to complete the channel allocation, and then use the Frank-Wolfe idea to solve it; it can be simply described as: select The initial feasible point, that is, the initial channel allocation result p, specifies the allowable error range ε, and sets m=0; ① Carry out linear programming, that is, deal with the problem:
Figure GDA00042246307700000510
Record the calculated optimal solution as q (m) , and record d (m) = q (m) -p (m) ; ② Judgment
Figure GDA00042246307700000511
Is it true? If it is true, output p (m) and the loop ends; otherwise, use d (m) as the feasible descending direction to conduct an effective one-dimensional search to determine the one-dimensional search step size; at the same time, to ensure that the result is within the feasible region, the specified step Long α∈[0,1]; ③ Then deal with the problem: />
Figure GDA00042246307700000512
The optimal solution is obtained by calculation, denoted as α m , let p (m+1) =p (m)m *d (m) , and let m=m+1, repeat the above process.

本发明的有益效果是:本发明创新地将时延和吞吐量两者进行了联合优化;在对吞吐量和时延两者进行合理取舍的基础上,本文在铁路物联网的无线资源分配中引入效用理论,降低了系统复杂度,实现了对铁路物联网接入控制的部分优化;具体的效用函数可以使资源分配方案保证用户的公平性和稳定性,可以提高业务的服务质量(QoS)。The beneficial effects of the present invention are: the present invention innovatively jointly optimizes both the delay and the throughput; The introduction of utility theory reduces the complexity of the system and realizes partial optimization of the access control of the railway Internet of Things; the specific utility function can make the resource allocation scheme ensure the fairness and stability of users, and can improve the quality of service (QoS) of the business .

附图说明Description of drawings

图1是本发明的铁路物联网接入控制系统组成示意图;Fig. 1 is a schematic composition diagram of the railway internet of things access control system of the present invention;

图2是本发明的涉及的效用函数图像;Fig. 2 is the related utility function image of the present invention;

图3是本发明的联合优化接入控制方法流程图;Fig. 3 is a flow chart of the joint optimization access control method of the present invention;

图4是本实施例中的用户间干扰图。Fig. 4 is a diagram of inter-user interference in this embodiment.

具体实施方式Detailed ways

下面对本发明的实施例作详细说明,本实施例在以本发明技术方案为前提下进行实施,给出了详细的实施方式和具体的操作过程,但本发明的保护范围不限于下述的实施例。The embodiments of the present invention are described in detail below. This embodiment is implemented on the premise of the technical solution of the present invention, and detailed implementation methods and specific operating procedures are provided, but the protection scope of the present invention is not limited to the following implementation example.

本发明的技术方案包括:Technical scheme of the present invention comprises:

本发明所述铁路物联网上的接入控制系统主要由三个部分组成:控制器、若干的用户、若干的无线访问点,其中,控制器对所有无线访问点进行监测和控制,且会定期地计算所有无线访问点和用户之间的干扰;所述的访问点可以有多个无线接口,但用户只有一个接口且只可与一个访问点相连;抽象地,用I表示所有访问点的无线接口集,C表示用户集,R表示用户和访问点间的有效传输链路集,N表示所有访问点的无线接口间的干扰图,N(i)表示干扰无线接口i的其他无线接口集合,记i∈N(i)。The access control system on the railway Internet of Things of the present invention is mainly composed of three parts: a controller, a number of users, and a number of wireless access points, wherein the controller monitors and controls all wireless access points, and periodically Calculate the interference between all wireless access points and users; the access point can have multiple wireless interfaces, but the user has only one interface and can only be connected with one access point; abstractly, represent the wireless of all access points with I Interface set, C represents the user set, R represents the effective transmission link set between the user and the access point, N represents the interference graph between the wireless interfaces of all access points, N(i) represents the set of other wireless interfaces that interfere with the wireless interface i, Note i∈N(i).

本发明采用将时间平均分成细小时隙的离散时隙系统,同时采用先入先出FIFO的报文缓冲管理方式;a∈I∪C,即无线访问点和用户都可以作为源节点;b∈C,即用户都可以作为节点;在网络层,放置一个速率控制器,对从传输层进入网络层的报文的速率进行有效控制;从源节点a出发,将报文发送到目的节点b的报文发送速率记为

Figure GDA0004224630770000061
在源节点a处会维护流向目的节点b的报文缓冲队列/>
Figure GDA0004224630770000062
该缓冲队列的报文准入速率为/>
Figure GDA0004224630770000063
此外,假设所有节点间的传输都是独立同分布的;各速率间存在以下相关约束关系:The present invention adopts a discrete time slot system that divides time into small slots on average, and adopts a first-in-first-out FIFO message buffer management mode; a∈I∪C, that is, both wireless access points and users can be used as source nodes; b∈C , that is, all users can be used as nodes; in the network layer, a rate controller is placed to effectively control the rate of packets entering the network layer from the transport layer; starting from the source node a, the packet sent to the destination node b The text sending rate is denoted as
Figure GDA0004224630770000061
At the source node a, a message buffer queue to the destination node b will be maintained />
Figure GDA0004224630770000062
The packet admission rate of this buffer queue is />
Figure GDA0004224630770000063
In addition, it is assumed that the transmissions between all nodes are independent and identically distributed; the following correlation constraints exist between the rates:

Figure GDA0004224630770000064
Figure GDA0004224630770000064

Figure GDA0004224630770000065
Figure GDA0004224630770000065

Figure GDA0004224630770000066
Figure GDA0004224630770000066

其中,ωa,max(t)表示节点a处网络可以达到的最大聚合准入速率,μa,max(t)表示节点a处网络可以达到的最大聚合发送速率。Among them, ω a,max (t) represents the maximum aggregate admission rate that the network at node a can achieve, and μ a,max (t) represents the maximum aggregate transmission rate that the network at node a can achieve.

另外,给出如下

Figure GDA0004224630770000071
和/>
Figure GDA0004224630770000072
的长期时间平均值表达:Additionally, given the following
Figure GDA0004224630770000071
and />
Figure GDA0004224630770000072
The long-term time mean expression of :

Figure GDA0004224630770000073
Figure GDA0004224630770000073

Figure GDA0004224630770000074
Figure GDA0004224630770000074

将源节点a到目的节点b的队列动态更新,表示为:Dynamically update the queue from source node a to destination node b, expressed as:

Figure GDA0004224630770000075
Figure GDA0004224630770000075

Figure GDA0004224630770000076
Figure GDA0004224630770000076

Figure GDA0004224630770000077
Figure GDA0004224630770000077

其中,[·]+表示当·为正数时,直接使用,当·为负数时,使用数值0;Cl(i)表示与无线接口i相连接的用户集;第二个式子表示对于目的为有线网络或与其他访问点相连的用户的报文,访问点不需要进行缓存;第三个式子表示所有传输的目的节点处不需要对相关报文进行缓存。Among them, [ ] + means that when . The access point does not need to cache the packets of users connected to the wired network or other access points; the third formula indicates that the destination nodes of all transmissions do not need to cache the relevant packets.

本发明引入虚拟子网队列,借此对访问点的无线接口负载进行评估;虚拟子网队列是一个可以反映出子网负载情况的变量,其值越大,则说明子网负载越重,从而需要更多的频谱资源加大信道容量,最终减小网络的缓冲队列长度、缓解子网的拥塞;The present invention introduces a virtual subnet queue, thereby evaluating the wireless interface load of the access point; the virtual subnet queue is a variable that can reflect the load of the subnet, and the larger the value, the heavier the load of the subnet, thus More spectrum resources are needed to increase channel capacity, ultimately reducing the buffer queue length of the network and alleviating subnet congestion;

将虚拟子网队列的动态更新,表示为:Express the dynamic update of the virtual subnet queue as:

Vi(t+1)=[Vi(t)-μi(t)+ωi(t)]+ V i (t+1)=[V i (t)-μ i (t)+ω i (t)] +

Figure GDA0004224630770000078
Figure GDA0004224630770000078

Figure GDA0004224630770000079
Figure GDA0004224630770000079

μi(t)≤Capai(t)μ i (t)≤Capa i (t)

Figure GDA00042246307700000710
Figure GDA00042246307700000710

其中,Capai(t)表示无线接口i的信道容量,μi(t)表示无线接口i和与之相连的用户间的无线链路的聚合传输速率,ωi(t)表示对应子网中所有节点的聚合准入速率,最后一个式子意为对应子网中所有传输的最大聚合传输速率与无线接口i的信道容量相等。Among them, Capa i (t) represents the channel capacity of wireless interface i, μ i (t) represents the aggregate transmission rate of the wireless link between wireless interface i and the connected users, ω i (t) represents the channel capacity of the corresponding subnet The aggregate admission rate of all nodes, the last formula means that the maximum aggregate transmission rate of all transmissions in the corresponding subnet is equal to the channel capacity of the wireless interface i.

本发明使用对数合成的效用函数,其一般形式为

Figure GDA00042246307700000711
其中ωi是弹性系数,对数形式会减小xi的大小,从而在一定程度上避免大波动的异常出现,具体的,本发明中使用的效用函数形式为:The present invention uses the utility function of logarithmic synthesis, and its general form is
Figure GDA00042246307700000711
Wherein ωi is the elastic coefficient, and the logarithmic form will reduce the size of xi , thereby avoiding the abnormal occurrence of large fluctuations to a certain extent, specifically, the utility function form used in the present invention is:

Figure GDA00042246307700000712
Figure GDA00042246307700000712

其中,

Figure GDA0004224630770000081
是弹性系数,/>
Figure GDA0004224630770000082
表示时间平均的虚拟子网队列,/>
Figure GDA0004224630770000083
表示基于子网的时间平均聚合传输速率,τ为平衡/>
Figure GDA0004224630770000084
和/>
Figure GDA0004224630770000085
两者对频谱分配的影响因子。in,
Figure GDA0004224630770000081
is the coefficient of elasticity, />
Figure GDA0004224630770000082
Represents a time-averaged virtual subnet queue, />
Figure GDA0004224630770000083
Indicates the time-average aggregate transmission rate based on subnetwork, τ is the balance />
Figure GDA0004224630770000084
and />
Figure GDA0004224630770000085
The impact factors of the two on spectrum allocation.

本发明选用网络容量区域Π,其由全部能被网络以比例共享方式支持的

Figure GDA0004224630770000086
集合组成,它能在保证网络稳定的基础上使得系统吞吐量最优化;避免使用传统的网络容量区域,是因为在此容量区域内求解出的最终结果会导致网络稳定性被破坏,从而实际使用中的成功率极其低下。The present invention selects the network capacity area Π, which consists of all the networks that can be supported by the network in a proportional sharing manner
Figure GDA0004224630770000086
It is composed of a set, which can optimize the system throughput on the basis of ensuring network stability; avoid using the traditional network capacity area, because the final result obtained in this capacity area will lead to the destruction of network stability, so that the actual use of The success rate is extremely low.

步骤一:建立系统接入控制联合优化模型;Step 1: Establish a joint optimization model for system access control;

设定采用的网络效用函数具有凸、非减和连续等特性,联合优化模型可描述为:The network utility function used is assumed to have convex, non-decreasing and continuous characteristics, and the joint optimization model can be described as:

Figure GDA0004224630770000087
Figure GDA0004224630770000087

Figure GDA0004224630770000088
Figure GDA0004224630770000088

Figure GDA0004224630770000089
Figure GDA0004224630770000089

其中,第一个约束条件可以确保比例公平性,且能使所有节点的长期时间平均准入速率处于网络容量区域Π中,第二个约束条件表明长期时间平均准入速率不能大于长期时间平均发送速率;同时也需明确,访问点无线接口的频谱分配约束着Π的大小;如果使用传统的网络容量区域,最终结果会导致网络稳定性被破坏;故而,使用网络容量区域Π能在保证网络稳定的基础上使得系统吞吐量最优化。Among them, the first constraint condition can ensure proportional fairness, and can make the long-term time average admission rate of all nodes in the network capacity area Π, the second constraint condition indicates that the long-term time average admission rate cannot be greater than the long-term time average transmission rate At the same time, it needs to be clear that the spectrum allocation of the wireless interface of the access point constrains the size of Π; if the traditional network capacity area is used, the final result will lead to the destruction of network stability; therefore, using the network capacity area Π can ensure network stability The system throughput is optimized on the basis of

步骤二:进行系统初始频谱分配;Step 2: Perform initial spectrum allocation for the system;

本发明使用基于贪婪着色的频谱分配算法求得频谱分配的初始解;首先处理输入的数据,将数据构成无向图,利用各节点的度进行升序排列并编号;同时将待采用的颜色也进行编号,按编号从小到大排列;接着,按照规则为每个节点着色;根据着色后各节点颜色的不同,对信道进行分类;最后利用着色所耗的颜色数目,对空白频谱进行分配,得到频谱分配解;其中规则为:节点和颜色都是根据编号从小到大进行采用,且相邻节点颜色必须不同。The present invention uses a spectrum allocation algorithm based on greedy coloring to obtain the initial solution of the spectrum allocation; firstly, the input data is processed, the data is formed into an undirected graph, and the degree of each node is used to arrange and number them in ascending order; at the same time, the colors to be used are also Numbering, arranged according to the number from small to large; then, color each node according to the rules; classify the channels according to the color of each node after coloring; finally use the number of colors consumed by coloring to allocate the blank spectrum to obtain the spectrum Allocation solution; the rule is: nodes and colors are used according to the number from small to large, and the colors of adjacent nodes must be different.

步骤三:进行接入控制联合优化;Step 3: Perform joint optimization of access control;

使用基于Lyapunov优化的分布式速率控制算法,使得联合优化模型的稳定性约束得到满足;具体实现由节点网络层的速率控制器和访问点的链路调度器两者组成;前者可以控制网络层中由上层协议注入的报文流的速率,且节点中各传输流的缓冲队列长度决定该速率;后者是根据访问点和与其相连的用户间的缓冲队长差来进行无线链路调度传输,从而使得子网中的缓冲队列整体长度达到最小化。Using the distributed rate control algorithm based on Lyapunov optimization, the stability constraints of the joint optimization model are satisfied; the specific implementation is composed of the rate controller of the node network layer and the link scheduler of the access point; the former can control the network layer. The rate of the message flow injected by the upper layer protocol, and the buffer queue length of each transmission flow in the node determines the rate; the latter is based on the buffer length difference between the access point and the user connected to it to perform wireless link scheduling transmission, so that Minimize the overall length of the buffer queue in the subnet.

(1)、速率控制器:每个时隙中,节点a处对所有传输至b的报文的准入速率进行控制,其优化问题描述如下:(1) Rate controller: In each time slot, node a controls the admission rate of all messages transmitted to b, and its optimization problem is described as follows:

Figure GDA0004224630770000091
Figure GDA0004224630770000091

Figure GDA0004224630770000092
Figure GDA0004224630770000092

Figure GDA0004224630770000093
Figure GDA0004224630770000093

其中,为对吞吐量和时延的侧重优化进行平衡,引入γ平衡参数;设定效用函数具有凸、非减和连续等特性,故而直接进行一阶求导便可得到此优化问题的最优解;Among them, in order to balance the emphasis on optimization of throughput and delay, the γ balance parameter is introduced; the utility function is set to be convex, non-decreasing and continuous, so the optimal untie;

(2)、链路调度器:每个时隙中,访问点会观察子网中所有传输的缓冲队列长度,由(2), link scheduler: in each time slot, the access point will observe the buffer queue length of all transmissions in the subnet, determined by

Figure GDA0004224630770000094
Figure GDA0004224630770000094

Figure GDA0004224630770000095
Figure GDA0004224630770000095

可知,访问点和与其相连的用户间的缓冲队长差可直接用传输的缓冲队列长度表示;故而,访问点会优先调度子网中缓冲队长最大的传输链路进行传输,其队长为

Figure GDA0004224630770000096
It can be seen that the buffer length difference between the access point and the users connected to it can be directly expressed by the transmission buffer queue length; therefore, the access point will preferentially schedule the transmission link with the largest buffer length in the subnet for transmission, and its length is
Figure GDA0004224630770000096

步骤四:对用户进行动态接入频谱分配;Step 4: Dynamically access spectrum allocation to users;

使用基于Frank-Wolfe的动态频谱分配算法,根据步骤一中得到的初始频谱分配解Si、步骤三中的分布式速率控制算法中得到的

Figure GDA0004224630770000097
和/>
Figure GDA0004224630770000098
对频谱进行新的分配,最终使得联合优化模型中的网络效用最优化得以实现;将效用函数代入联合优化模型中,得Using the dynamic spectrum allocation algorithm based on Frank-Wolfe, according to the initial spectrum allocation solution S i obtained in step 1 and the distributed rate control algorithm obtained in step 3
Figure GDA0004224630770000097
and />
Figure GDA0004224630770000098
The new allocation of the frequency spectrum finally enables the network utility optimization in the joint optimization model to be realized; substituting the utility function into the joint optimization model, we get

Figure GDA0004224630770000099
Figure GDA0004224630770000099

因为该式已被证明是NP-hardness问题,故为计算该问题,需进行近似求解;先用步骤二中的算法完成信道分配,再用Frank-Wolfe的思想进行求解;可简单描述为:选取初始可行点,即初始信道分配结果p,指定可容许的误差范围ε,令m=0;①进行线性规划,即处理问题:

Figure GDA00042246307700000910
记计算得到的最优解为q(m),并且记d(m)=q(m)-p(m);②判断
Figure GDA00042246307700000911
是否为真?若为真,输出p(m),循环结束;否则,将d(m)作为可行下降方向,进行有效一维搜索,以此确定一维搜索步长;同时为保证结果在可行域内,规定步长α∈[0,1];③接着处理问题:/>
Figure GDA0004224630770000101
通过计算得到最优解,记为αm,令p(m+1)=p(m)m*d(m),且使m=m+1,重复上述过程。Because this formula has been proved to be an NP-hardness problem, an approximate solution is required to calculate the problem; first use the algorithm in step 2 to complete the channel allocation, and then use the Frank-Wolfe idea to solve it; it can be simply described as: select The initial feasible point, that is, the initial channel allocation result p, specifies the allowable error range ε, and sets m=0; ① Carry out linear programming, that is, deal with the problem:
Figure GDA00042246307700000910
Record the calculated optimal solution as q (m) , and record d (m) = q (m) -p (m) ; ② Judgment
Figure GDA00042246307700000911
Is it true? If it is true, output p (m) and the loop ends; otherwise, use d (m) as the feasible descending direction to conduct an effective one-dimensional search to determine the one-dimensional search step size; at the same time, to ensure that the result is within the feasible region, the specified step Long α∈[0,1]; ③ Then deal with the problem: />
Figure GDA0004224630770000101
The optimal solution is obtained by calculation, denoted as α m , let p (m+1) =p (m)m *d (m) , and let m=m+1, repeat the above process.

本实施例中给出的铁路物联网接入控制系统组成假设为:控制器1个,无线访问点共3个,16个用户;16个用户间的干扰关系,如图4所示;记一个频谱分配解为S={<loweri(t),upperi(t)>}i∈I,其中无线接口i在时间t处使用的信道上下界为upperi(t)和loweri(t);在引入空白频谱后,记WH(flower,fupper,WS)为整个空白频谱,WS为频谱总宽度,空白频谱的上下界为fupper和flower;仿真中,取1×n维的向量加上高斯白噪声,作为空白频谱WH。The composition of the railway Internet of Things access control system given in this embodiment is assumed to be: 1 controller, 3 wireless access points in total, and 16 users; the interference relationship between the 16 users is shown in Figure 4; note one The spectrum allocation solution is S={<lower i (t), upper i (t)>} i∈I , where the upper and lower bounds of the channel used by wireless interface i at time t are upper i (t) and lower i (t) ; After introducing the blank spectrum, record WH(f lower ,f upper ,WS) as the entire blank spectrum, WS as the total width of the spectrum, and the upper and lower bounds of the blank spectrum are f upper and f lower ; in the simulation, 1×n-dimensional Vector plus Gaussian white noise, as blank spectrum WH.

本实施例通过以下步骤实现:This embodiment is realized through the following steps:

步骤一:进行初始频谱分配:Step 1: Make initial spectrum allocation:

本实施例使用基于贪婪着色的频谱分配算法求得频谱分配的初始解;首先处理输入的数据,将数据构成无向图,记节点数为n;取1×n维的零矩阵作为各节点所用颜色的起始值CM;所用颜色总数为CON,初始值取为0;然后,基于度进行升序排列,结果记为D;遍历所有节点,i,j=1,2,...,n;找到数据邻接矩阵W(i,j)中相连邻点的颜色值,选一个最小且不同的颜色值,赋给CM(j);若颜色不够,则CON=CON+1;根据CM对所有节点进行相应着色。最后,将空白频谱WH平均地放进CON个信道中:pi=WS/CON,i=1,2,...,CON,得到WH中的信道i处频谱分配解为

Figure GDA0004224630770000102
This embodiment uses the spectrum allocation algorithm based on greedy coloring to obtain the initial solution of the spectrum allocation; firstly, the input data is processed, the data is formed into an undirected graph, and the number of nodes is n; a 1×n-dimensional zero matrix is used as each node The initial value of the color is CM; the total number of colors used is CON, and the initial value is 0; then, it is arranged in ascending order based on the degree, and the result is recorded as D; traverse all nodes, i,j=1,2,...,n; Find the color value of the connected adjacent points in the data adjacency matrix W(i,j), choose a minimum and different color value, and assign it to CM(j); if the color is not enough, then CON=CON+1; according to CM for all nodes Color accordingly. Finally, the blank spectrum WH is evenly put into the channels CON: p i =WS/CON, i=1,2,...,CON, and the spectrum allocation solution at channel i in WH is obtained as
Figure GDA0004224630770000102

进行网络仿真后,原来1至16的用户重新排序为:D=[4 12 13 14 1 3 5 11 16 26 7 8 9 15 10];随后可得四个用户分类,先后用蓝、绿、黄和黑四种颜色标记;节点(用户)1、3、4、6、12、13、14、16为蓝色;节点(用户)2、5、7、11为绿色;节点(用户)8、9、15为黄色;节点(用户)10为黑色;即信道可初始分配为4部分;据此,空白频谱初始分配解为:S=[4 4 44];其中,Si为信道i处频谱分配解,i表示上述S的第i列。After network simulation, the original 1 to 16 users are reordered as: D=[4 12 13 14 1 3 5 11 16 26 7 8 9 15 10]; then four user categories can be obtained, successively using blue, green, yellow and black; nodes (users) 1, 3, 4, 6, 12, 13, 14, and 16 are blue; nodes (users) 2, 5, 7, and 11 are green; nodes (users) 8, 9 and 15 are yellow; node (user) 10 is black; that is, the channel can be initially allocated into 4 parts; accordingly, the initial allocation solution of the blank spectrum is: S=[4 4 44]; wherein, S i is the spectrum at channel i Assignment solution, i represents the i-th column of the above S.

步骤二:进行接入控制联合优化:Step 2: Perform joint optimization of access control:

使用分布式速率控制算法,使得联合优化模型的稳定性约束得到满足;使用网络仿真后可得如下速率:The distributed rate control algorithm is used to satisfy the stability constraints of the joint optimization model; the following rate can be obtained after using the network simulation:

无线接口i和与之相连的用户间的无线链路的聚合传输速率如表1所示:The aggregate transmission rate of the wireless link between the wireless interface i and the connected users is shown in Table 1:

表1无线接口i和相连用户间的无线链路的聚合传输速率:Table 1 Aggregated transmission rate of wireless link between wireless interface i and connected users:

Figure GDA0004224630770000103
Figure GDA0004224630770000103

Figure GDA0004224630770000111
Figure GDA0004224630770000111

子网中所有节点的聚合准入速率如表2所示:The aggregate admission rate of all nodes in the subnet is shown in Table 2:

表2子网中所有节点的聚合准入速率:Table 2 Aggregate admission rate of all nodes in the subnet:

Figure GDA0004224630770000112
Figure GDA0004224630770000112

步骤三:对频谱进行动态分配;Step 3: Dynamically allocate spectrum;

使用的分配算法基于Frank-Wolfe思想;The allocation algorithm used is based on the Frank-Wolfe idea;

根据步骤二得到的

Figure GDA0004224630770000113
和/>
Figure GDA0004224630770000114
对频谱进行新的分配。将效用函数带入
Figure GDA0004224630770000115
中,可得/>
Figure GDA0004224630770000116
因为该式已被证明是NP-hardness问题,故为计算该问题,需进行近似求解;According to the second step
Figure GDA0004224630770000113
and />
Figure GDA0004224630770000114
Make new allocations to the spectrum. Bring the utility function into
Figure GDA0004224630770000115
in, available />
Figure GDA0004224630770000116
Because this formula has been proved to be an NP-hardness problem, an approximate solution is required to calculate this problem;

先用步骤一中的算法完成信道分配,再用Frank-Wolfe的思想进行求解。首先取步骤一中的输出颜色数CON,令m=1,fk=1,指定可容许的误差范围ε=10-5;循环以下过程进行线性规划,处理问题:

Figure GDA0004224630770000117
记计算得到的最优解为q(m),并且记d(m)=q(m)-p(m);随后,判断条件/>
Figure GDA0004224630770000121
是否为真?若为真,输出p(m),循环结束;否则,将d(m)作为可行下降方向,进行有效一维搜索,以此确定一维搜索步长。为保证结果在可行域内,规定步长α∈[0,1];接着处理问题:/>
Figure GDA0004224630770000122
通过计算得到最优解,记为αm,令p(m+1)=p(m)m*d(m),且m=m+1,重复上述过程;First use the algorithm in step 1 to complete the channel allocation, and then use Frank-Wolfe's idea to solve it. First take the output color number CON in step 1, set m=1, fk=1, specify the allowable error range ε= 10-5 ; loop the following process to carry out linear programming to solve the problem:
Figure GDA0004224630770000117
Record the calculated optimal solution as q (m) , and record d (m) = q (m) -p (m) ; subsequently, judge the condition
Figure GDA0004224630770000121
Is it true? If it is true, output p (m) and the loop ends; otherwise, use d (m) as the feasible descending direction to perform an effective one-dimensional search, so as to determine the one-dimensional search step size. In order to ensure that the result is within the feasible region, the step size α∈[0,1] is stipulated; then deal with the problem: />
Figure GDA0004224630770000122
Obtain the optimal solution through calculation, denoted as α m , let p (m+1) = p (m) + α m *d (m) , and m=m+1, repeat the above process;

其中,f:Rn→R1为可微函数,p(m)表示在p上的第m次迭代点,ε是任意小的(理论上而言),可根据实际情况设定,αm是p(m)的最优步长;本实施例中可微函数为

Figure GDA0004224630770000123
设定因子τ=1,选用pi=WS/CON,i=1,2,...,CON作为初始点。使用网络仿真后可得如下动态分配解:S=(10-3×)[0.1545 0.1545 0.1545 0.1545]。Among them, f:R n →R 1 is a differentiable function, p (m) represents the mth iteration point on p, ε is arbitrarily small (in theory), and can be set according to the actual situation, α m is the optimal step size of p (m) ; in the present embodiment, the differentiable function is
Figure GDA0004224630770000123
The factor τ=1 is set, and p i =WS/CON, i=1, 2, . . . , CON are selected as initial points. After using the network simulation, the following dynamic allocation solution can be obtained: S = (10 -3 ×) [0.1545 0.1545 0.1545 0.1545].

本实施例采用的优化模型综合考虑时延和吞吐量两者关系,根据速率动态分配频率,实现吞吐量和时延的联合优化。The optimization model adopted in this embodiment comprehensively considers the relationship between delay and throughput, dynamically allocates frequencies according to the rate, and realizes joint optimization of throughput and delay.

本发明创新地将时延和吞吐量两者进行了联合优化。在对吞吐量和时延两者进行合理取舍的基础上,本文在铁路物联网的无线资源分配中引入效用理论,降低了系统复杂度,实现了对铁路物联网接入控制的部分优化。具体的效用函数可以使资源分配方案保证用户的公平性和稳定性,可以提高业务的服务质量(QoS)。The present invention innovatively jointly optimizes delay and throughput. On the basis of a reasonable trade-off between throughput and delay, this paper introduces the utility theory in the wireless resource allocation of the railway Internet of Things, which reduces the complexity of the system and realizes partial optimization of the access control of the railway Internet of Things. The specific utility function can ensure the fairness and stability of users in the resource allocation scheme, and can improve the service quality (QoS) of the business.

Claims (1)

1.一种铁路物联网中面向服务质量保障的接入控制联合优化方法,其特征在于:通过引入效用函数和选取保证网络稳定的网络容量区域,在充分合理地利用空白频谱的基础上,对速率控制和频谱分配两者进行统一分析,借助初始频谱分配、虚拟子网队列和传输速率进行动态频谱分配,给出一种联合优化模型,以此达到铁路物联网接入控制中时延和吞吐量的联合优化,从而满足其服务质量保障的需求;1. A joint optimization method for access control for quality of service guarantee in the railway Internet of Things, characterized in that: by introducing a utility function and selecting a stable network capacity area to ensure network stability, on the basis of fully and reasonably utilizing blank spectrum, Unified analysis of rate control and spectrum allocation, dynamic spectrum allocation with the help of initial spectrum allocation, virtual subnetwork queues and transmission rates, and a joint optimization model is given to achieve delay and throughput in railway Internet of Things access control The joint optimization of quantity, so as to meet the demand of its service quality assurance; 其中,所述联合优化模型的目标函数是:Wherein, the objective function of the joint optimization model is:
Figure FDA0004216538880000011
Figure FDA0004216538880000011
其中,I表示所有访问点的无线接口集,C表示用户集,WS表示空白频谱的总宽度,CON表示初始分配后信道分类的数目,
Figure FDA0004216538880000012
表示时间平均的虚拟子网队列,/>
Figure FDA0004216538880000013
表示基于子网的时间平均聚合传输速率,τ表示平衡/>
Figure FDA0004216538880000014
和/>
Figure FDA0004216538880000015
两者对频谱分配的影响因子,Si表示信道i处初始频谱分配解,μi(t)表示无线接口i和与之相连的用户间的无线链路的聚合传输速率;a表示源节点,b表示目的节点,Cl(i)表示与无线接口i相连接的用户集;
where I represents the set of wireless interfaces of all access points, C represents the set of users, WS represents the total width of white space spectrum, CON represents the number of channel classes after the initial allocation,
Figure FDA0004216538880000012
Represents a time-averaged virtual subnet queue, />
Figure FDA0004216538880000013
Indicates the time-averaged aggregate transmission rate based on subnetwork, and τ indicates the balance />
Figure FDA0004216538880000014
and />
Figure FDA0004216538880000015
The influence factors of the two on spectrum allocation, S i represents the initial spectrum allocation solution at channel i, μ i (t) represents the aggregate transmission rate of the wireless link between wireless interface i and the user connected to it; a represents the source node, b represents the destination node, and Cl(i) represents the user set connected to the wireless interface i;
其处理过程包括以下步骤:Its processing includes the following steps: 步骤一:对频谱进行初始分配:其中首先处理输入的数据,将数据构成无向图,记节点数为n;取1×n维的零矩阵作为各节点所用颜色的起始值CM;所用颜色总数为CON,初始值取为0;然后,基于度进行升序排列,结果记为D,遍历所有节点,i,j=1,2,...,n,找到数据邻接矩阵W(i,j)中相连邻点的颜色值,选一个最小的且不同的颜色值,赋给CM(j);若颜色不够,则CON=CON+1,根据CM对所有节点进行相应着色;最后,将空白频谱WH平均地放进CON个信道中:pi=WS/CON,i=1,2,...,CON,得到WH中的信道i处频谱分配解为
Figure FDA0004216538880000016
Step 1: Initially allocate the spectrum: first process the input data, form the data into an undirected graph, and record the number of nodes as n; take a 1×n-dimensional zero matrix as the initial value CM of the color used by each node; the used color The total number is CON, and the initial value is 0; then, it is arranged in ascending order based on the degree, and the result is recorded as D, and all nodes are traversed, i,j=1,2,...,n, and the data adjacency matrix W(i,j ), select a minimum and different color value, and assign it to CM(j); if the color is not enough, then CON=CON+1, and color all nodes according to CM; finally, the blank The spectrum WH is evenly put into the channels of CON: p i =WS/CON, i=1,2,...,CON, and the spectrum allocation solution at channel i in WH is obtained as
Figure FDA0004216538880000016
步骤二:接着使用分布式速率控制算法,使得联合优化模型的稳定性约束得到满足;算法由节点网络层的速率控制器和访问点的链路调度器两者组成,Step 2: Then use the distributed rate control algorithm to satisfy the stability constraints of the joint optimization model; the algorithm is composed of the rate controller at the node network layer and the link scheduler at the access point, 所述速率控制器用以控制网络层中由上层协议注入的报文流的速率,且节点中各传输流的缓冲队列长度决定该速率;所述链路调度器根据访问点和与其相连的用户间的缓冲队长差进行无线链路调度传输,从而使得子网中的缓冲队列整体长度达到最小化;然后,根据上述得到的:
Figure FDA0004216538880000021
和/>
Figure FDA0004216538880000022
对频谱进行新的分配;/>
Figure FDA0004216538880000023
此为代入具体效用函数后的优化模型,因该式已被证明是NP-hardness问题,故为计算该问题,需进行近似求解;首先取前面的输出颜色数CON,令m=1,fk=1,指定可容许的误差范围ε=10-5;当fk=1时,循环着进行线性规划,即处理问题:/>
Figure FDA0004216538880000024
计算得到的最优解为q(m),并且记d(m)=q(m)-p(m)随后,判断条件/>
Figure FDA0004216538880000025
是否为真;若为真,令fk=0,输出p(m),循环结束;否则,将d(m)作为可行下降方向,进行有效一维搜索,以此确定一维搜索步长;为保证结果在可行域内,规定步长α∈[0,1];接着处理:/>
Figure FDA0004216538880000026
得到最优解,记为αm,令p(m+1)=p(m)m*d(m),且m=m+1,重复上述过程,其中,f:Rn→R1为可微函数,p(m)表示在p上的第m次迭代点,ε是任意小的,可根据实际情况设定,αm是p(m)的最优步长,设可微函数为
Figure FDA0004216538880000027
设定因子τ=1,选用pi=WS/CON,i=1,2,...,CON作为初始点;
The rate controller is used to control the rate of the message stream injected by the upper layer protocol in the network layer, and the buffer queue length of each transmission stream in the node determines the rate; The buffer length difference of the wireless link is scheduled for transmission, so that the overall length of the buffer queue in the subnet is minimized; then, according to the above:
Figure FDA0004216538880000021
and />
Figure FDA0004216538880000022
Make new allocations to the spectrum; />
Figure FDA0004216538880000023
This is an optimization model after substituting a specific utility function. Since this formula has been proven to be an NP-hardness problem, an approximate solution is required to calculate this problem; firstly, take the previous output color number CON, and set m=1, fk= 1. Specify the allowable error range ε=10 -5 ; when fk=1, perform linear programming in a loop, that is, deal with the problem: />
Figure FDA0004216538880000024
The calculated optimal solution is q (m) , and record d (m) = q (m) -p (m) Then, the judgment condition />
Figure FDA0004216538880000025
Is it true; if it is true, let fk=0, output p (m) , and the loop ends; otherwise, take d (m) as the feasible descending direction, and carry out an effective one-dimensional search, so as to determine the one-dimensional search step size; Ensure that the result is within the feasible region, specify the step size α∈[0,1]; then process: />
Figure FDA0004216538880000026
Obtain the optimal solution, denoted as α m , let p (m+1) =p (m)m *d (m) , and m=m+1, repeat the above process, where, f:R n →R 1 is a differentiable function, p (m) represents the mth iteration point on p, ε is arbitrarily small and can be set according to the actual situation, α m is the optimal step size of p (m) , and differentiable The function is
Figure FDA0004216538880000027
Set the factor τ=1, select p i =WS/CON, i=1,2,...,CON as the initial point;
所述的铁路物联网中面向服务质量保障的接入控制联合优化方法所述的效用函数具体形式为:
Figure FDA0004216538880000028
The specific form of the utility function described in the joint optimization method for access control oriented to service quality assurance in the railway Internet of Things is:
Figure FDA0004216538880000028
CN201910669225.9A 2019-07-24 2019-07-24 A Joint Optimization Method for Access Control Oriented to Quality of Service Guarantee in Railway Internet of Things Active CN110381470B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910669225.9A CN110381470B (en) 2019-07-24 2019-07-24 A Joint Optimization Method for Access Control Oriented to Quality of Service Guarantee in Railway Internet of Things

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910669225.9A CN110381470B (en) 2019-07-24 2019-07-24 A Joint Optimization Method for Access Control Oriented to Quality of Service Guarantee in Railway Internet of Things

Publications (2)

Publication Number Publication Date
CN110381470A CN110381470A (en) 2019-10-25
CN110381470B true CN110381470B (en) 2023-06-20

Family

ID=68255263

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910669225.9A Active CN110381470B (en) 2019-07-24 2019-07-24 A Joint Optimization Method for Access Control Oriented to Quality of Service Guarantee in Railway Internet of Things

Country Status (1)

Country Link
CN (1) CN110381470B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111278033B (en) * 2020-01-21 2022-10-18 北京工业大学 Method for intelligent scanning and dynamic optimal configuration of transmission rate of LoRa communication network
CN112468449B (en) * 2020-11-06 2022-11-01 中国电子科技集团公司电子科学研究院 Method for optimizing and configuring backtracking security controlled network access channel resources
CN114741191B (en) * 2022-03-30 2024-09-06 西安电子科技大学 A multi-resource allocation method for computationally intensive task correlation

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012137029A1 (en) * 2011-04-08 2012-10-11 Alcatel Lucent Qos aware multi radio access point for operation in tv whitespaces
CN104581965B (en) * 2015-01-08 2018-09-04 中国人民解放军理工大学 Frequency spectrum distributing method based on user's distribution and time delay
CN108540246B (en) * 2018-01-09 2021-03-30 重庆邮电大学 A Resource Allocation Method Based on Cognitive Radio
CN109005593B (en) * 2018-08-03 2023-04-07 上海理工大学 Method and equipment for optimizing spectrum allocation
CN109462426B (en) * 2018-11-20 2021-05-18 南京邮电大学 Beamforming and power allocation method for service quality assurance of high-speed rail cars
CN109640330A (en) * 2019-01-29 2019-04-16 电子科技大学 Spectrum management system, blank frequency spectrum cognitive method and blank frequency spectrum distribution method

Also Published As

Publication number Publication date
CN110381470A (en) 2019-10-25

Similar Documents

Publication Publication Date Title
Ye et al. Dynamic radio resource slicing for a two-tier heterogeneous wireless network
Feng et al. Joint C-V2X based offloading and resource allocation in multi-tier vehicular edge computing system
CN110381470B (en) A Joint Optimization Method for Access Control Oriented to Quality of Service Guarantee in Railway Internet of Things
CN102098684B (en) System and method for cross-layer resource allocation in cognitive wireless network
CN104837205B (en) A Downlink Radio Resource Allocation Algorithm for Vehicle-Road Communication
CN104301933B (en) A method for calculating bandwidth and allocating bandwidth in wireless ad hoc network
CN101801000A (en) Secondary user access method for maximization of capacity of dynamic spectrum sharing system
CN101827396A (en) Multi-net cooperative transmission resource distribution system in heterogeneous wireless environment and method
CN114079977B (en) A 5G and TSN fusion network flow scheduling framework and resource allocation method
CN107040948A (en) A kind of CSMA/CA optimization methods based on priority
CN101431811B (en) Cross-Layer System for Guaranteeing QoS in WiMAX and Its Joint QoS Control Method
CN109982434B (en) Wireless resource scheduling integrated intelligent control system and method and wireless communication system
CN104869651B (en) OFDMA network downstream link circuit resource distribution methods based on QoE
CN101626575B (en) Method, device and system for performing frequency planning in wireless Mesh returning network
CN101808324B (en) MAC layer architecture design of wireless Mesh network
CN112367712B (en) Power wireless private network uplink resource scheduling method based on path loss
CN112261667B (en) A FIWI network media access control system and method based on edge computing
CN102752757B (en) Method for optimizing frequency spectrum allocation according to minimal waste criterion in frequency spectrum aggregation process
CN100431362C (en) Method for packet service scheduling in mobile communication system
Wang et al. Machine learning enables radio resource allocation in the downlink of ultra-low latency vehicular networks
CN112492689A (en) Resource preemption method, device, equipment and computer readable storage medium
CN104066122B (en) A kind of honeycomb and the congestion control and transmission dispatching method in D2D hybrid networks
CN115955436A (en) Reliable routing and scheduling method for time-sensitive network
Soni et al. The finest superframe interval and gts provision scheme (fsgps) for time-sensitive ieee 802.15. 4 applications
CN104486766B (en) Spectrum aggregating resource allocation methods based on cognitive radio technology

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
CB02 Change of applicant information

Address after: Room 201, building 2, phase II, No.1 Kechuang Road, Yaohua street, Qixia District, Nanjing City, Jiangsu Province

Applicant after: NANJING University OF POSTS AND TELECOMMUNICATIONS

Address before: 210012 No. 19 Ningshuang Road, Yuhuatai District, Nanjing City, Jiangsu Province

Applicant before: NANJING University OF POSTS AND TELECOMMUNICATIONS

CB02 Change of applicant information
GR01 Patent grant
GR01 Patent grant