Method and system for controlling congestion in a private train network - Patents.com

By aggregating and predicting congestion information, the application server optimizes DCC decisions in private train networks, addressing suboptimal resource utilization and improving system efficiency in 5G NR V2X sidelink mode 2.

JP2024543240AActive Publication Date: 2024-11-19MITSUBISHI ELECTRIC R&D CENTRE EUROPE BV
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
JP2024553927
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2022-03-17
Filing Date
2022-07-15
Publication Date
2024-11-19
Estimated Expiration
2042-07-15

AI Technical Summary

Technical Problem

Current distributed congestion control (DCC) methods in private train networks, based on 5G NR V2X sidelink mode 2, are suboptimal as they prioritize individual RSU performance over overall system efficiency, leading to uneven resource utilization and reduced system performance due to bursty communication patterns and varying train densities.

Method used

An application server aggregates congestion control information from multiple RSUs, predicts future congestion status, and provides auxiliary information to optimize DCC decisions, ensuring coordinated resource allocation across the network.

Benefits of technology

Improves overall system performance by optimizing resource utilization and reducing congestion through centralized prediction and dynamic adjustment of transmission parameters, ensuring fair and efficient use of shared sidelink resources.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024543240000001_ABST
    Figure 2024543240000001_ABST
Patent Text Reader

Abstract

The present invention provides a method for controlling congestion in a private train network, the private train network comprising a plurality of roadside units deployed along a railway track and each connected to an application server, each of the plurality of roadside units configured to establish sidelink communication with at least one train based on a wireless network and configured to make independent distributed congestion control decisions, the communication sharing a common sidelink resource pool. The method includes: aggregating congestion control information from a subset of the plurality of roadside units and rail application information by an application server; predicting a congestion status of each of the subset of the plurality of roadside units by the application server based on the aggregated congestion control information and the rail application information; calculating and providing assistance information by the application server to the subset of the plurality of roadside units based on the predicted congestion status; and performing distributed congestion control by the subset of the plurality of roadside units based on the assistance information. The present invention improves congestion control in a private train network.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to a method and system for controlling congestion in a network, in particular for controlling congestion in a private train network. [Background technology]

[0002] In the next generation railway communication system, various railway-specific applications are conceived, and train-to-infrastructure (T2I) links and train-to-train (T2T) links are used for packet transmission for these applications. For T2I and T2T communication, various radio access technologies such as Wi-Fi™, Long Term Evolution (LTE)™, 5G and satellite are used. Among these technologies, 5G NR V2X-based sidelink communication technology is likely to be one of the very promising candidates for T2I and T2T communication, since it can provide fairly good performance in distributed communication scenarios.

[0003] In distributed scenarios such as 5G NR sidelink communication in Mode 2, a very important issue is congestion control. Congestion control is a mechanism that regulates the input of data packets to the network and manages shared resources in an efficient and fair manner to avoid congestion collapse. In 5G NR V2X Mode 2, a distributed congestion control (DCC) scheme can be applied. The standard does not define a specific congestion control algorithm, but rather defines related metrics and possible countermeasures to reduce channel congestion. These metrics are the Channel Busy Ratio (CBR) and the Channel Occupancy Ratio (CR), which are called Sidelink (SL) CBR and SL CR in Rel. 16. The CBR is the perspective of a particular TX UE with respect to the subchannels that are occupied in a resource pool in a time window. A subchannel is considered occupied if its measured RSSI is above a (pre)configured threshold. The CR is the perspective of a particular TX UE with respect to the subchannels that this TX UE utilizes or selects in a time window. By definition, the CR reflects, for each TX UE, the amount of resources that this UE has occupied in the shared resource pool. The TX UE uses the measured SL CBR and SL CR to identify whether it needs to change its transmission parameters to reduce the channel load. This is done using a (pre-)configured look-up table that contains up to 16 CBR ranges. Each range is bounded by a maximum SL CR that the TX UE must not exceed (CR limit ) is linked to CR limit increases as the CBR range decreases. 3GPP (trademark) specifies the CR for each CBR range. limit This standard establishes that the value of is a function of the priority of the transport block (TB) and the absolute rate of the TX UE. limit It specifies that the transmission parameters must be changed at each (re)transmission to evaluate whether the received signal exceeds the threshold.

[0004] The TX UEs can monitor the evolution of their CR and the CBR of the shared resource and take actions to limit their contribution to the occupancy of the shared resource, thus limiting congestion in a distributed manner.

[0005] Such a system in the field of next-generation railway communication networks is shown in Figure 1. It includes roadside units (RSUs) deployed in a private train network, and the communication between the RSUs and trains is based on NR V2X sidelink mode 2. In this mode, it is assumed that all T2I communications share a common sidelink resource pool. For communication data packets to be sent from the RSUs to the target trains, each of the RSUs is responsible for congestion control using DCC mechanisms. In addition, private train networks are typically deployed and managed by railway operators with the aim of providing dedicated railway applications. For this reason, there is typically an application server that provides each RSU with higher layer information about the railway application. This application server is a central node that is connected to each of the RSUs as shown in Figure 1.

[0006] As mentioned above, in the current technology, the railway communication from RSUs to trains in the above mentioned private train network is based on NR V2X sidelink mode 2 as shown in Figure 1, and the congestion control is based on DCC implemented at each RSU. Furthermore, it is assumed that the RSUs in the scenario share the same sidelink resource pool. Hence, in the DCC scheme, congestion in the sidelink resource pool is controlled in a distributed manner.

[0007] However, on the other hand, from the perspective of a private train network, DCC may not be optimal since it seeks to limit the impact of congestion on each RSU in the shared resource pool. Fairness is achieved by restricting the maximum CR that each RSU should not exceed (CR limit) from the system-wide perspective. On the other hand, such DCC mechanism is suboptimal because in the railway communication scenario, the communication is not evenly distributed in both time and space. T2I communication takes place only when there is a moving train within the range of the RSU. Therefore, the connection and service traffic of T2I communication can be bursty, i.e., there can be a very large amount of traffic in a short period of time, and idle at the rest of the time. Furthermore, in the railway communication scenario, unlike the V2X case, the number of trains is relatively small. Therefore, one RSU may be in a nearly congested situation with a very high CR, while another RSU may be completely idle and have no trains to communicate with. In this case, a DCC scheme that independently controls the individual CR behavior limits the overall system performance. Summary of the Invention

[0008] The present invention is directed to addressing these problems in the art and improving overall system performance.

[0009] In this regard, according to one aspect of the present invention, there is provided a method for controlling congestion in a private train network, the private train network comprising a plurality of Road Side Units (RSUs) deployed along a railway track, each connected to an application server. Each of the plurality of Road Side Units (RSUs) is configured to establish sidelink communication with at least one train based on a wireless network, for example based on sidelink communication using a PC5 interface in NR V2X mode 2, and configured to make independent Distributed Congestion Control (DCC) decisions. The communications share a common sidelink resource pool. The method includes: aggregating, by an application server, congestion control information from a subset of a plurality of road side units (RSUs) and rail application information in the application server; predicting, by an application server, a congestion status of each of a subset of a plurality of road side units (RSUs) based on the aggregated congestion control information and the railway application information; Calculating and providing, by an application server, assistance information to a subset of a plurality of road side units (RSUs) based on the predicted congestion status; performing distributed congestion control (DCC) by a subset of the plurality of road side units (RSUs) based on the auxiliary information; Includes.

[0010] Different from the conventional solutions, the present invention proposes to creatively use an application server that connects to all RSUs and has all the necessary railway application information in the private train network. In such a configuration, the present invention can improve the congestion control performance in the entire private train network by aggregating congestion control related information from multiple RSUs and taking into account the aggregated congestion control information per RSU and the railway application information in the application server, predicting future congestion control performance, and providing auxiliary information to the RSUs to adjust DCC in multiple RSUs. Thus, the method according to the present invention improves the overall system performance.

[0011] Furthermore, when communication in the wireless network is based on sidelink communication using a PC5 interface in NR V2X mode 2, the congestion control information is a sidelink channel busy ratio (SL CBR) and / or a sidelink channel occupancy ratio (SL CR).

[0012] Advantageously, the predicted congestion status comprises a prediction of a Sidelink Channel Busy Ratio (SL CBR) and / or a Sidelink Channel Occupancy Ratio (SL CR) of a subset of the plurality of Road Side Units (RSUs).

[0013] Optionally, the sidelink channel occupancy is 1000 slots or 1000·2 μThe sidelink channel busy rate is calculated based on a sliding window containing 100 slots or 100·2 μ is calculated based on a sliding window containing slots, where μ is given in the following table: [Table 1] It is a numerological parameter having a value in

[0014] Advantageously, the subset of roadside units (RSUs) is chosen based on their signal power and / or geographical distance. For example, a train may measure the received signal levels from different RSUs and keep only a limited subset (e.g., the two RSUs with the highest received power). Another possibility is that if the RSUs and the train are equipped with GNSS and can obtain positioning information, the train calculates the distance to each RSU and keeps a limited subset of the closest RSUs.

[0015] Advantageously, railway application information is Traffic characteristics of the service flows, such as packet delay budget, packet size, traffic periodicity, guaranteed flow bit rate, maximum flow bit rate, packet error rate and / or priority level, transmitted from the roadside unit (RSU) to at least one train; At least one train position information, such as the instantaneous position and / or instantaneous speed of the train, and / or Location-based channel condition fingerprint database. This is upper layer information including:

[0016] Advantageously, the auxiliary information is Modifying transmission parameters for a subset of roadside units (RSUs); Congestion parameter modification for a subset of multiple road side units (RSUs); Assisted sidelink dual connectivity, and / or Assisted sidelink unicast link management; Regarding.

[0017] Advantageously, prior to the step of aggregating the congestion control information, the method further comprises the steps of: selecting a subset of a plurality of road side units (RSUs); Calculating congestion control information by a subset of a plurality of road side units (RSUs) and reporting the congestion control information to an application server; Further includes.

[0018] Advantageously, the aiding information includes a timestamp, and the road side unit (RSU) ignores the aiding information if the timestamp has expired.

[0019] Advantageously, the method further comprises providing auxiliary information to the at least one train.

[0020] Advantageously, the common sidelink resource pool is a resource pool of sidelink channels in both the time and frequency domain.

[0021] According to another aspect of the invention there is provided a computer program comprising instructions which, when executed by a computer, cause the computer to carry out the method as set out above.

[0022] According to yet another aspect of the present invention, there is provided a system for controlling congestion in a private train network, the private train network comprising a plurality of roadside units deployed along a railroad track, each connected to an application server. Each of the plurality of roadside units is configured to establish communication with at least one train based on a wireless network and configured to make independent distributed congestion control decisions. The communications share a common sidelink resource pool. The system includes: an aggregation unit for aggregating, by an application server, congestion control information from a subset of the plurality of roadside units and railway application information in the application server; a prediction unit for predicting, by an application server, a congestion status of each of a subset of the plurality of roadside units based on the aggregated congestion control information and the railway application information; a computing unit for computing and providing, by the application server, assistance information to a subset of the plurality of roadside units based on a predicted congestion status; Equipped with A system is provided in which a subset of a plurality of road side units (RSUs) is configured to perform distributed congestion control based on the aiding information.

[0023] Therefore, the present invention relates to a communication infrastructure to train (RSU to train) using sidelink communication (such as PC5 interface) based on wireless communication technology such as 5G NR V2X sidelink communication mode 2. Here, each of the communication entities (RSU or train) manages its communication pairs in a distributed manner. This means that there is no central node such as a base station that manages the communication and resource allocation of all pairs of RSU to train communication. Instead, each pair manages its communication in a distributed and independent manner. Although the communication is managed in a distributed manner, a very important constraint is that the resources these communications utilize are shared resources (sidelink resource pool) between all communication pairs. Each of the nodes makes independent communication decisions and since they are working on shared resources, there is a potential collision problem due to them not being aware of the decisions made by others. In the current technology, a distributed congestion control algorithm is proposed to reduce this effect. In this scheme, there are two parameters that each node measures, namely CR and CBR. Also, there are some pre-configured thresholds for the decision in DCC. This means that each node continuously evaluates its CR and CBR, compares them with thresholds, and decides what to do for congestion control, e.g., drop transmission, drop retransmission, change transmission / retransmission parameters, etc. As mentioned above, traditional DCC methods are not efficient in private train networks. To solve this problem, the present invention proposes a dynamic algorithm to estimate and configure DCC parameters (thresholds, transmission / retransmission parameters, etc.) by the application server, but still in a distributed manner so that the DCC algorithm can work better to improve congestion control in private train networks.

[0024] Other features and advantages of the present invention will become apparent from the following description, taken in conjunction with the accompanying drawings. [Brief description of the drawings]

[0025] [Figure 1]FIG. 1 illustrates a private train network with an application server connected to an RSU. [Diagram 2] 4 is a flow chart illustrating an exemplary method for coordinated distributed congestion control with application server assistance in accordance with the present invention. [Diagram 3] FIG. 1 shows a 1000 slot sliding window for CR calculation. [Figure 4] FIG. 13 is a diagram showing a CR prediction at time t+Δt. [Figure 5A] FIG. 2 illustrates a first example of generation of auxiliary information, where an application server provides auxiliary information for modifying transmission parameters of future services / traffic. [Figure 5B] FIG. 2 illustrates a first example of generation of auxiliary information, where an application server provides auxiliary information for modifying transmission parameters of future services / traffic. [Figure 5C] FIG. 2 illustrates a first example of generation of auxiliary information, where an application server provides auxiliary information for modifying transmission parameters of future services / traffic. [Figure 6A] FIG. 2 illustrates a second example of generating auxiliary information, where the application server provides auxiliary information for modifying congestion parameters of future services / traffic. [Figure 6B] FIG. 2 illustrates a second example of generating auxiliary information, where the application server provides auxiliary information for modifying congestion parameters of future services / traffic. [Figure 6C] FIG. 2 illustrates a second example of generating auxiliary information, where the application server provides auxiliary information for modifying congestion parameters of future services / traffic. [Figure 7A] FIG. 11 illustrates a third example of generation of auxiliary information, in which an application server provides auxiliary information for maintaining a dual connection. [Figure 7B]FIG. 11 illustrates a third example of generation of auxiliary information, in which an application server provides auxiliary information for maintaining a dual connection. [Figure 8A] FIG. 11 illustrates a fourth example of generation of auxiliary information, in which the application server provides the auxiliary information for selecting and establishing a unicast sidelink. [Figure 8B] FIG. 11 illustrates a fourth example of generation of auxiliary information, in which the application server provides the auxiliary information for selecting and establishing a unicast sidelink. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0026] 1 illustrates an exemplary setup of a private train network comprising multiple roadside units (RSUs) deployed along railway tracks T1, T2, T3, each connected to an application server AS. Each of the multiple roadside units (RSUs) is configured to establish sidelink communication with at least one train based on a wireless network and configured to make independent distributed congestion control (DCC) decisions, and the communications share a common sidelink resource pool.

[0027] In this embodiment, communication in the wireless network is based on sidelink communication using a PC5 interface in NR V2X Mode 2, in which all nodes (RSUs, trains) communicate in a distributed manner without the involvement of the base station.

[0028] Furthermore, the application server AS is configured to provide / collect train application data. The application server AS also has higher layer information about train applications, such as application traffic characteristics (payload, periodicity, whether the traffic is bursty, etc.), traffic QoS (priority, packet delay budget, average / peak data rate, packet error rate), instantaneous train position, instantaneous train speed, etc. In the present invention, the application server only aggregates (sends / receives) application data, but is not a node that controls the communication between the application server and the train. It should be noted that the application server AS is therefore not a central node (like a base station) that controls the communication.

[0029] In addition, application servers AS are deployed where train applications reside. Usually, there are basically three categories of train applications: critical, performance and business applications. Examples of critical communication applications are automatic train control, automatic train operation, automatic train protection. Examples of performance communication applications are voice communication for operational purposes, CCTV communication services for surveillance cameras, train connectivity. Examples of business communication applications are on-board WiFi, wireless internet for passengers on the platform.

[0030] Furthermore, the sidelink (channel) resource pool is in both time and frequency domain for D2D (train-to-infrastructure) communication. When a transmitting node (e.g., RSU) wants to communicate with a receiving node (e.g., train), it needs to find a sidelink channel (e.g., resource grid in frequency and time) to be used for communication. The resource pool includes all available sidelink channels. In a NR V2X sidelink mode 2 based communication scheme, since each transmitting node performs transmission in a distributed manner, i.e., without a central node for resource allocation, each transmitting node has to check each sidelink channel (each resource grid) to see if this sidelink channel is available (not occupied) and, if so, select / reserve it for communication. Since each transmitting node does this, a collision occurs if two transmitting nodes happen to get the same sidelink resource. Another phenomenon is that in the absence of congestion control, for example, a transmitter is dumping too many packets at a certain time and almost all sidelink channel resources are taken, which causes high priority packets arriving later to be unable to be transmitted due to lack of available sidelink channels. Yet another example is one transmitting node taking too many resources, leaving very little for other transmitters.

[0031] As already mentioned, DCC is used for congestion control of NR V2X Mode 2 based sidelink communications. DCC can limit the impact of congestion at each node and provide convergence of congestion levels in the system. However, this is a distributed approach and each node makes independent DCC decisions, so this by itself cannot optimize the overall system performance.

[0032] Based on the above network configuration, the present invention further proposes a private train network with an application server AS that connects to all RSUs and is aware of railway application information (train position, movement prediction...), thus coordinating the DCC in each RSU and providing auxiliary information to each RSU for DCC improvement.

[0033] In particular, the present invention proposes cooperative DCC with application server assistance for private train networks, which includes congestion control information aggregation in the application server, application server congestion prediction for each RSU based on the aggregated congestion control information and railway application information per RSU, and providing assistance information by the application server to the RSUs for improving DCC.

[0034] The detailed steps of an exemplary method for controlling congestion in a private train network according to the present invention are shown in FIG. 2 and described below.

[0035] Optionally, in step S1, a subset of multiple roadside unit RSUs is selected, the subset of RSUs being RSUs that will coordinate their DCC measurements. The condition for choosing the subset of RSUs can be based on, for example, received signal power. For example, a train can measure received signal levels from different RSUs and only keep a limited subset (e.g., two RSUs with the highest received power). Another condition can be geographical distance, and if the RSUs and the train are equipped with GNSS and can obtain positioning information, the train can calculate the distance to each of the RSUs and keep a limited subset of the closest RSUs. Note that the subset of roadside unit RSUs can be predetermined according to the above conditions or other preset rules, so this is not a required step in the present invention.

[0036] In a next step S2, a subset of the multiple roadside units RSUs calculates and reports a sidelink (SL) channel busy ratio CBR and a SL channel occupancy ratio CR.

[0037] In particular, these two metrics SL CBR and SL CR are used for DCC in 5G NR V2X Mode 2 for sidelink communication. In NR V2X, the SL CBR is set to 100 slots (any numerology) or 100·2 slots by (pre)configuration per resource pool. μ is the number of busy (energy > threshold) subchannels in the resource pool in a time window of 10 slots, where μ is the SCS configuration factor. CR is the number of 1000 slots (arbitrary numerology) or 1000·2 slots per resource pool (pre-)configuration. μ is the number of subchannels that the TX UE utilizes or selects in a time window of 10 slots, where μ is the SCS configuration factor. The TX UE uses the measured SL CBR and SL CR to determine whether it has to change its transmission parameters to reduce the channel load. This is done using a (pre-)configured look-up table that contains up to 16 CBR ranges or configured by higher layer parameters (sl-CBR-RangeConfigList, sl-CR-Limit). Each range is bounded by a maximum SL CR that the UE must not exceed (CR limit Using the CBR observed by the TX UE and a lookup table of CBR ranges, the TX UE determines the CR that the TX UE must not exceed. limit We can deduce that if the UE transmits a PSSCH in slot n, then we further ensure the following constraint for any priority value k:

number

[0038] It is up to the UE implementation how to satisfy the above constraints, including dropping transmissions in slot n. A TX UE shall ensure that SL CR is less than or equal to CR limit If the SL CR is exceeded, then the TX UE has to modify its transmission parameters. The objective is to reduce the SL CR and control the channel load created by the TX UE.

[0039] In a next step S3, the application server receives, periodically or on demand, the current SL CR and SL CBR from each of a subset of the multiple road side units RSUs.

[0040] It is noted that the present invention is different from the conventional centralized congestion control schemes in the art, where a central node aggregates the CRs of all nodes in the network and makes congestion control decisions for all nodes.

[0041] On the contrary, in the present invention, only a subset of RSUs, rather than all RSUs, need to send their CRs and CBRs to the application server, which means that the cooperative DCC is local in the sense that the application server only needs to aggregate a few RSUs, which is a subset of all RSUs in the network.

[0042] In addition, in centralized congestion control in the art, it is the central node that controls the channel load, and the central node requests each RSU to report its measured CBR periodically or on demand. The performance of the algorithm depends on the accuracy of the feedback of the CBR report per RSU. This means that the decision made at the central node is more accurate if it is based on the reported CBR per RSU, which well reflects the instantaneous CBR of each RSU. In this case, frequent signaling of CBR reports from each of the RSUs is required, and the backhaul between the RSUs and the central node should be good enough to support such frequent reporting.

[0043] However, in the present invention, we make good use of the limited backhaul between the RSU and the application server. The periodicity of (CBR, CR) reports can be adjusted according to the backhaul constraints, and the application server only coordinates DCC with the reporting RSUs.

[0044] Furthermore, the congestion control according to the present invention is always based on DCC, which means that it is always the individual RSU that makes the DCC decision. The application server simply provides the RSU with RSU aiding information that it considers useful for the corresponding RSU. In the present invention, it is up to the RSU to decide whether to take the aiding information into account for its DCC procedure (explained in the following steps). For example, the RSU can simply ignore the aiding information from the application server if it finds that the aiding information is calculated based on out-of-date reports and is therefore not very relevant to the current situation at the RSU.

[0045] Further, in step S3, in addition to receiving CR and CBR from the subset of RSUs, the application server AS further retrieves train application related information including traffic characteristics of service flows, train location information, and a location-based channel condition fingerprint database.

[0046] Based on the aggregated congestion control information and the railway application information, in a next step S4 the application server AS predicts the congestion status of each of the subsets at a future time point.

[0047] In particular, in this step S4, after considering a particular sidelink unicast link configuration, for the RSUs that apply this configuration, the application server predicts the CR and CBR of the RSUs that apply this configuration.

[0048] For SL CR prediction, as mentioned above, the SL CR calculation is based on a sliding window. For ease of explanation, the CR is calculated using a sliding window of 1000 slots, as shown in FIG.

[0049] When the application server AS receives a CR report from an RSU, it can predict the CR of this RSU at a future time by taking into account the received CR and the railway application information in the application server. Suppose an application receives a CR report from an RSU at time t and wants to predict the CR of this RSU in a slot at time t+Δt. Figure 4 shows the CR prediction in the application server of an RSU at time t+Δt.

[0050] Since CR is calculated using a sliding window, the channel occupancy during [t+Δt-999,t] does not change. To predict CR at time t+Δt, we use i) the channel occupancy during the past time [t-999,t+Δt-999]

number

number

number

[0051]

number

number

[0052]

number

number

[0053] If the RSU still maintains communication with the train, and if the traffic dedicated to the train is periodic (NR V2X Mode 2 semi-persistent scheduling), it is assumed that the transmission from the RSU to the train during [t, t+Δt] will select and utilize the same number of subchannels as it had during [t-999, t+Δt-999]. In this case,

number

number

[0054] If the RSU still maintains communication with the train and the traffic is aperiodic (NR V2X mode 2 dynamic scheduling), the traffic characteristics can be used to estimate separately the number of subchannels selected or utilized between the RSU and the train during [t-999,t+Δt-999] ([t,t+Δt]), respectively. The previous subchannel occupancy should be subtracted and added to the [t,t+Δt] channel occupancy afterwards. Thus, the impact of the train maintaining communication with the RSU at the future time Δt is calculated.

[0055] If an RSU no longer maintains communication with the train due to radio link failure, i.e., the radio conditions between the RSU and the moving train are below a certain threshold and the link is disconnected (two modes are possible: the application server can anticipate the RLF using the train location and a location-based channel condition fingerprint database, or the application server is notified by the train or the RSU that detects the RLF via the RLF fingerprint), the traffic characteristics can be used to estimate the number of subchannels selected or utilized between the RSU and the train during [t-999,t+Δt-999], which should be subtracted in the channel occupancy in the CR prediction since these do not occur during [t,t+Δt].

[0056] According to the railway application information in the application server AS, if an RSU potentially has a new arriving train to serve during [t, t+Δt], such an event can be predicted using the train location information and the location-based channel condition fingerprint database. The traffic characteristics of the arriving train can be used to estimate the subchannel occupancy of the RSU serving the train, which should be added to the channel occupancy in the CR prediction during [t, t+Δt].

[0057] For SL CBR prediction, since the CBR is calculated as the number of busy (energy > threshold) subchannels in the resource pool within the time window perceived by each RSU, the mobility of each train and the channel resource selection of each sidelink communication in duration [t,t+Δt] both have an impact on the CBR measured at each RSU, thus making CBR prediction somewhat difficult. However, it is still possible to perform such prediction using at least one of the following three methods: 1. Extrapolate the measured CBR at each RSU using the history of periodic reports available at the application server. 2. Since train tracks are scheduled in advance, they are likely to be repeated over time (train traffic timetable), a fingerprint database of each RSU's measured CBR at time can be built in the application server using previous reports. The measured CBR at a future time t+Δt can be estimated by searching for similar situations in the history in the fingerprint database. 3. Assuming that the private train network is an isolated system, i.e., there is no interference from other systems, the application server can use the channel occupancy predictions of all RSUs, the location information of fixed RSUs and the location of each train at time t+Δt, as well as the location-based channel condition fingerprint database, to predict the channel selection and utilization of each RSU at future time t+Δt as described above, and the measured CBR of each RSU can be estimated at the application server.

[0058] Once the application server AS has made CR, CBR predictions for a subset of RSUs, it can use these global views of the entire system to generate assistance information for the RSUs to improve the DCC procedure in step S5. The assistance information can have various forms, some examples are given below.

[0059] {Example of auxiliary information I, sending parameter change assisted by application server} The aiding information can be a suggestion for the RSU to modify its transmission parameters so that the nearly congested RSU can serve the newly arriving train. In a particular embodiment as shown in FIG. 5A-5C, an application server AS coordinates two RSUs, namely RSU1 and RSU2. The application server AS has aggregated CR and CBR information of each RSU at time t and predicts the CR, CBR of RSU1 and RSU2 at time t+Δt. The application has estimated that a moving train will have a radio link failure in RSU1-to-train link at time t+Δt and RSU2 will take over and transmit to the train.

[0060] Based on the CR, CBR prediction of RSU2 at time t+Δt, the application server notes that RSU2 is slightly congested and may not be able to serve future trains if no changes are made to the transmission parameters. Therefore, to enable RSU2 to serve future trains, the application server sends aiding information to RSU2 before time t+Δt and suggests using a higher modulation and coding scheme (MCS) in the current transmission. This leads to a CR reduction at the RSU at time t+Δt when the train arrives. In this way, the RSU can transmit to the train.

[0061] For example, as shown in Fig. 5A, at time T = t, RSU1 communicates with train 1, and RSU2 communicates with train 2 and train 3. RSU1 and RSU2 calculate their own SL CR and SL CBR at time T = t and feed back to the Train App server.

[0062] The train application server AS can predict that at a future time T=t+Δt, train 1 will communicate with RSU 2. This prediction can be based on (1) instantaneous train 1 location information, train speed information, and distance-based RSU selection criteria, or (2) instantaneous train 1 location information, train speed information, a location-based channel condition fingerprint database, and received power-based RSU selection criteria.

[0063] The train application server AS can predict the SL CR and SL CBR at time T=t+Δt for RSU 2. The prediction is based on the traffic characteristics of the communication flows of RSU 2 to trains 1, 2, and 3, the location information of trains 1, 2, and 3, and the location-based channel condition fingerprint database.

[0064] Using the predicted SL CR and SL CBR for RSU2 at time T=t+Δt, the Train App server knows that RSU2 cannot serve three trains with the current configuration of communication flows for RSU2 to trains 1, 2, and 3. With such a configuration, the SL CR at T=t+Δt is the CR at RSU2. limit This is simple because it exceeds

[0065] In the next step, as shown in Fig. 5B, at time T = t + t', the train application server AS will send aiding information to the RSUs, for example, proposing that RSU2 use a higher modulation and coding scheme (MCS) in its current transmissions with trains 2 and 3. In this way, if RSU2 applies the proposed configuration, the congestion level at RSU2 will decrease and it will be able to serve all three trains at time T = t + Δt.

[0066] RSU2 accepts and applies the MCS configuration parameters from the Train App server, and the SL CR in RSU2 begins to improve.

[0067] Thus, as shown in FIG. 5C, at time T=t+Δt, apart from the previously existing communications between RSU2 and trains 2 and 3, RSU2 additionally starts communicating with train 1.

[0068] With the current MCS configuration parameters, RSU2 can determine whether it is congestion-free (SL CR at the current time T = t + Δt is equal to the CR limit It is found that it is possible to serve all three trains (not to exceed

[0069] {Example of Auxiliary Information II. Application Server Assisted Congestion Parameter Change} The aiding information can also be a suggestion for the RSU to modify its own congestion parameters, such as sl-CR-Limit, to improve the congestion status of the RSU. In a particular embodiment as shown in Fig. 6, an application server AS coordinates two RSUs. The application server has aggregated CR and CBR information of each RSU at time t, and predicts the CR, CBR of RSU1 and RSU2 at time t+Δt.

[0070] Based on the CR and CBR predictions of RSU1 and RSU2 at time t+Δt, the application server notes that RSU2 is likely to be congested because it will be communicating with many upcoming trains, and RSU1 will be idle without communication. Therefore, to enable RSU2 to serve the upcoming trains, the application server sends auxiliary information to RSU2 before time t+Δt to adjust its congestion parameter CR and CBR, for example, using the higher layer configuration parameter sl-CR-Limit. limit We propose to change the channel number of RSU1 at time t+Δ so that RSU2 can select and use more channels for future trains with limited impact on RSU1 since RSU1 has no (or limited) transmission load at time t+Δ.

[0071] For example, as shown in FIG. 6A, first, limitis configured to be, for example, 0.0008 when CBR>0.8 to achieve a certain fairness between RSU1 and RSU2.

[0072] At time T=t, RSU1 communicates with three trains, namely, train 1, train 2, and train 3. RSU2 is in idle state. RSU1 calculates its own SL CR and SL CBR at time T=t and feeds it back to the train application server AS.

[0073] The train application server AS can predict that RSU2 will communicate with all three trains at a future time T=t+Δt while RSU1 is idle. This prediction can be based on (1) instantaneous train location information, train speed information, and distance-based RSU selection criteria, or (2) instantaneous train location information, train speed information, a location-based channel condition fingerprint database, and received power-based RSU selection criteria.

[0074] The train application server assumes that RSU1 will be idle while RSU2 will be flooded with multiple flows to communicate with multiple trains, so that the initial equal CRs of RSU1 and RSU2 at time T=t are limit It can be seen that the configuration is not optimal for future time T=t+t′. For example, limit The configuration is set as 0.0014, and the CR limit It may be better to set the configuration as 0.0002, which allows the RSU2 to select and utilize more channels for future trains.

[0075] Next, as shown in FIG. 6B , at time T=t+t′, the train application server AS, for example, adjusts the CR of RSU1 and RSU2 using the upper layer parameter SL-CR-Limit at time T=t+Δt. limit , and recommend congestion control parameters to RSU1 and RSU2 to change .

[0076] Therefore, at time T = t + Δt, as shown in FIG. 6C, RSU2 applies the configuration parameters from the train application server AS and can then select and utilize more channels for communication with trains 1, 2, and 3.

[0077] {Example III of auxiliary information, side-link dual connection assisted by the application server} A third exemplary piece of auxiliary information is a proposal for the RSU to establish a unicast link auxiliary to the train and transmit it to the train via this new side-link. In a specific embodiment as shown in FIG. 7, the application server AS coordinates two RSUs. The application server has the aggregated CR and CBR of each RSU at time t and can predict the CR and CBR of RSU1 and RSU2 for all future time points in [t, t + Δt] considering different multiple transmission configurations. In other words, the application server can predict the CR and CBR performance of both RSU1 and RSU at any time t < t' < t + Δt. Using one example of a communication configuration, RSU1 communicates with the train during [t, t'], and in another configuration, RSU2 communicates with the train during [t, t'], or in yet another configuration, both RSU1 and RSU2 communicate with the train during [t, t'].

[0078] Based on the predictions associated with different communication configurations, the application server can recommend a transmission configuration if, for example, communication with the train and the corresponding transmission duration are preferred for RSU1 or RSU2 or a dual connection.

[0079] For example, as shown in FIG. 7A, at time T = t, RSU1 is communicating with train 1, and RSU1 and RSU2 calculate their SL CR and SL CBR at time T = t and will feedback to the train application server AS.

[0080] The train application server AS is at the future time T = tswitch It may be predicted that train 1 will communicate with RSU 2 at . This prediction may be based on (1) instantaneous train 1 location information, train speed information, and distance-based RSU selection criteria, or (2) instantaneous train 1 location information, train speed information, a location-based channel condition fingerprint database, and received power-based RSU selection criteria.

[0081] The train application server AS determines whether the side link between RSU1 and train1 is released and whether the side link between RSU2 and train1 is established. switch If the SL CR and SL CBR evolve during [t, t+Δt] for both RSU1 and RSU2, it can be predicted how the SL CR and SL CBR will evolve during [t, t+Δt] for both RSU1 and RSU2. This prediction is based on the traffic characteristics of the communication flows, the location information, and the location-based channel condition fingerprint database.

[0082] The train application server AS can also predict how the SL CR and SL CBR will evolve during [t, t+Δt] for both RSU1 and RSU2 when dual connections (RSU1 to train1 and RSU2 to train1) occur during the dual connection window [t1, t2]. The prediction is based on the traffic characteristics of the communication flows, the location information, and the location-based channel condition fingerprint database.

[0083] For all possible values ​​of the dual connectivity window [t1, t2] configuration, we consider the cases where there is no dual connectivity (T = t switch t1,t2]) for both RSU1 and RSU2), the train application server AS compares their performances of congestion (i.e., how the SL CR and SL CBR will evolve for both RSU1 and RSU2 when a specific dual connection window [t1,t2] is applied) and selects one optimal configuration for congestion evolution in RSU1 and RSU2, e.g., [t1 * ,t2 * ].

[0084] [t1 * ,t2 * , between them, as shown in FIG. 7B, the train application server AS transmits auxiliary information to RSU1 and RSU2, and triggers the establishment of a sidelink dual connection between RSU1 - Train 1 and RSU2 - Train 2.

[0085] {Example IV of auxiliary information, sidelink unicast link management and congestion balancing assisted by the application server} The fourth exemplary auxiliary information is a recommendation to the RSU indicating that it should establish a unicast link with the train and perform sidelink communication, or a recommendation to the train indicating that it is better to establish the next sidelink with a specific RSU. In a specific embodiment as shown in FIGS. 8A and 8B, the application server coordinates three RSUs. The application server has the aggregated CR and CBR information of each RSU at time t, and predicts the CR and CBR of RSU1, RSU2, and RSU3 at time t+Δt. A train receiving packets from RUS1 will have a wireless link failure at time t<t RLF <t+Δt and potentially receive communication from either RSU2 or RSU3 after the link failure. Using the predicted CR and CBR at RSU2 and RSU3 for time t+Δt, the application server can infer which of RSU2 and RSU3 should be selected for communication with the train. Before the train exits the range of RSU1, this auxiliary information can be transmitted to the train via RSU1 and the train can be informed to establish a unicast link with RSU3. Auxiliary information to initiate the establishment of a unicast link with the train can also be addressed to RSU3.

[0086] For example, as shown in FIGS. 8A and 8B, RSU1, RSU2, and RSU3 calculate their SL CR and SL CBR at time T=t and will feedback to the train application server AS.

[0087] For any given configuration π of unicast sidelink management, e.g., RSU1 is in [t,t a ] and RSU3 communicates with train 1 during [t a ,t b ] and RSU2 communicates with train 1 during [t b For a configuration communicating with train 1 during [t, t+Δt], the train application server can predict how the SL CR and SL CBR will evolve during [t, t+Δt] for all RSU1, RSU2 and RSU3 that apply the above-mentioned configuration π. The prediction is based on the traffic characteristics of the communication flows, the location information and the location-based channel condition fingerprint database.

[0088] As shown in Fig. 8B, the train application server AS can use a utility function f to select and establish unicast sidelinks between the RSUs and the train. One example of a utility function at the application server is the following congestion balancing metric, which minimizes the maximum channel occupancy at all RSUs:

number

[0089] Another example congestion balancing metric that minimizes the overall channel occupancy for all coordinated RSUs is:

number

[0090] The illustrative examples and scenarios described above can be extended to more complicated cases where multiple RSUs and multiple trains are presented. In this particular embodiment, the application server has aggregated CR and CBR information for each RSU at time t, and knows that there are unicast link failures and new unicast link establishments during [t,t+Δt] due to train mobility, and the application can predict the CR, CBR of each RSU at time t+tΔ given the specific new unicast link establishment configuration. Then, the application server calculates the utility function

number

number

number

[0091] Thus, in a next step S6, the calculated auxiliary information is provided by the application server AS to the RSU or train in question.

[0092] Then, in step S7, the subset of RSUs performs DCC using the aiding information. In addition, if the timestamp indicates that the aiding information is out of date, the RSUs will again calculate and report the CR, CBR, and the previous steps will be repeated. Alternatively, the previous steps can be repeated based on an external trigger, such as train mobility, or periodic updates.

[0093] In view of the above, the present invention proposes a method for predicting distributed congestion control (DCC) performance and providing auxiliary information to improve overall system performance.

[0094] In addition, the present invention also proposes a system for controlling congestion in a private train network, the private train network comprising a plurality of roadside units RSUs deployed along a railway track, each connected to an application server, each of the plurality of roadside units RSUs configured to establish communication with at least one train based on a wireless network and configured to make independent DCC decisions, and the communication shares a common sidelink resource pool. The system includes: an aggregation unit for aggregating congestion control information from a subset of the plurality of roadside units (RSUs) and railway application information from an application server; A prediction unit for predicting, by an application server, a congestion status of each of a subset of the plurality of road side units (RSUs) based on the aggregated congestion control information and the railway application information; A calculation unit for calculating and providing assistance information to a subset of the plurality of road side units (RSUs) by an application server based on a predicted congestion status; Equipped with A subset of the multiple road side units RSUs is configured to perform DCC based on the aiding information.

[0095] In particular, the following characteristics are configured in this system according to the invention: Multiple roadside units (RSUs) perform distributed congestion control (DCC) based on this information. The application server periodically receives CR and CBR information from a subset of the roadside units (RSUs), which make their own DCC decisions. The application server predicts the CR, CBR of each node by anticipating potential mobility and sidelink association strategies using periodic CR and CBR information from a subset of roadside units, traffic characteristics of service flows transmitted from RSUs to trains, location and traffic / service information of each node, and a location-based channel condition fingerprint database. According to the application server's predictions, the application server provides auxiliary information to each of the subset of roadside units so that the DCC can be optimized by taking into account the global insight from the application server. Each of the subsets of roadside units will receive the aiding information and make the final DCC decision.

[0096] Also, as will be appreciated by those skilled in the art, the above described examples according to the present invention can be implemented in many ways, such as program instructions for execution by a processor, software modules, microcode, a computer program product on a computer readable medium, logic circuits, application specific integrated circuits, firmware, etc. Embodiments of the present invention can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment containing both hardware and software elements. In a preferred embodiment, the present invention is implemented in software, which includes but is not limited to firmware, resident software, microcode, etc.

[0097] Furthermore, embodiments of the present invention may take the form of a computer program product accessible from a computer usable or computer readable recording medium providing program code for use by or in connection with a computer, processing device, or any instruction execution system. As used herein, a computer usable or computer readable recording medium may be any apparatus that can contain, store, communicate, or deliver a program for use by or in connection with an instruction execution system, apparatus, or device. The medium may be an electronic, magnetic, optical, or semiconductor system (or apparatus or device). Examples of computer readable recording media include, but are not limited to, semiconductor or solid state memory, magnetic tape, removable computer diskettes, RAM, read only memory (ROM), rigid magnetic disks, optical disks, and the like. Current examples of optical disks include compact disk read only memory (CD-ROM), compact disk read / write (CD-R / W), and DVD.

[0098] The embodiments described herein above are illustrative of the present invention. Various modifications can be made to the embodiments without departing from the scope of the present invention which arises from the appended claims.

Claims

1. 1. A method for controlling congestion in a private train network, the private train network comprising a plurality of roadside units deployed along a railway track, each roadside unit being connected to an application server, each roadside unit being configured to establish sidelink communication with at least one train based on a wireless network and configured to make independent distributed congestion control decisions, the sidelink communications sharing a common sidelink resource pool, the method comprising: aggregating, by the application server, congestion control information from the subset of the plurality of roadside units and rail application information in the application server; predicting, by the application server, a congestion status of each of the subset of the plurality of roadside units based on the aggregated congestion control information and railway application information; calculating and providing, by the application server, assistance information to a subset of the plurality of roadside units based on a predicted congestion status; performing, by a subset of the plurality of roadside units, a distributed congestion control based on the aiding information; A method comprising:

2. The method of claim 1 , wherein communication in the wireless network is based on sidelink communication using a PC5 interface in NR V2X mode 2.

3. 3. The method of claim 2, wherein the congestion control information is a sidelink channel busy rate and / or a sidelink channel occupancy rate.

4. The sidelink channel occupancy is 1000 slots or 1000.2 μ the sidelink channel busy ratio is calculated based on a sliding window including 100 slots or 100.2 μ is calculated based on a sliding window containing slots, where μ is given in the following table: 【Table 1】 The method of claim 3, wherein the parameter is a numerological parameter having a value in

5. The method of claim 1 , wherein the subset of roadside units is selected based on their signal power and / or geographical distance.

6. The railway application information includes: traffic characteristics of service flows transmitted from the roadside unit to the at least one train; position information of the at least one train; and / or A location-based channel condition fingerprint database; The method of claim 1 , wherein the higher layer information includes:

7. The method of claim 6 , wherein the traffic characteristics include a packet delay budget, a packet size, a traffic periodicity, a guaranteed flow bit rate, a maximum flow bit rate, a packet error rate and / or a priority level.

8. The method of claim 6 , wherein the position information comprises an instantaneous position and / or an instantaneous velocity of the at least one train.

9. The method of claim 2 , wherein the predicted congestion status comprises a prediction of a sidelink channel busy rate and / or a sidelink channel occupancy rate for a subset of the plurality of roadside units.

10. The auxiliary information is modifying transmission parameters for a subset of the plurality of roadside units; modifying congestion parameters for a subset of the plurality of roadside units; Assisted sidelink dual connectivity, and / or Assisted sidelink unicast link management; The method of claim 1 ,

11. Prior to aggregating the congestion control information, the method further comprises: selecting a subset of the plurality of roadside units; calculating the congestion control information by a subset of the plurality of roadside units and reporting the congestion control information to the application server; The method of any one of claims 1 to 10, further comprising:

12. The method according to any one of claims 1 to 11, wherein the auxiliary information comprises a timestamp, and the roadside unit ignores the auxiliary information if the timestamp has expired.

13. The method according to any one of claims 1 to 12, further comprising providing said auxiliary information to said at least one train.

14. The method according to any one of claims 1 to 13, wherein the common sidelink resource pool is a resource pool of sidelink channels in both the time and frequency domain.

15. A computer program comprising instructions which, when executed by a computer, cause the computer to carry out the method of claim 1.

16. A system for controlling congestion in a private train network, the private train network comprising a plurality of roadside units deployed along a railway track, each roadside unit being connected to an application server, each roadside unit being configured to establish communication with at least one train based on a wireless network and configured to make independent distributed congestion control decisions, the communication sharing a common sidelink resource pool, the system comprising: an aggregation unit for aggregating, by the application server, congestion control information from a subset of the plurality of roadside units and railway application information in the application server; a prediction unit for predicting, by the application server, a congestion status of each of the subset of the plurality of roadside units based on the aggregated congestion control information and railway application information; a computing unit for computing and providing, by the application server, assistance information to a subset of the plurality of roadside units based on a predicted congestion status; Equipped with a subset of the plurality of roadside units configured to perform distributed congestion control based on the aiding information.

Citation Information

Patent Citations

  • Methods for disseminating geolocation information for network infrastructure devices

    JP2009543481A

  • Learning model generating method, estimation device, and radio train control system

    JP2021087082A

  • Devices and methods for managing communication in a v2x communication network

    US20200344643A1

  • Method and apparatus for allocating resources through cooperation between terminals in v2x system

    WO2021167427A1