IMPROVED SPECTRUM UTILIZATION IN A WIRELESS COMMUNICATION NETWORK
20220345911 · 2022-10-27
Assignee
Inventors
Cpc classification
H04W72/21
ELECTRICITY
H04B7/2612
ELECTRICITY
H04B7/15528
ELECTRICITY
International classification
Abstract
The present disclosure relates to first type node (AP.sub.0) in a wireless communication system (1), wherein the first type node (AP.sub.0) is adapted to: —communicate with at least one other first type node (AP.sub.1, AP.sub.2) in the wireless communication system (1) over a corresponding backhaul channel (H.sub.1, H.sub.4), —acquire a prediction for information (X.sub.23) to be requested via at least one of said other first type nodes (AP.sub.2, AP.sub.3), and to —transmit the predicted information (X.sub.23) to one of said other first type nodes (AP.sub.2) for buffer storage and/or relaying.
Claims
1. A first type node in a wireless communication system, the first type node comprising: memory; and processing circuitry coupled to the memory, wherein the first type node is configured to: communicate with at least one other first type node in the wireless communication system over a corresponding backhaul channel; acquire a prediction for information to be requested via at least one of said other first type nodes; and transmit the predicted information to one of said other first type nodes for buffer storage and/or relaying.
2. The first type node of claim 1, wherein the first type node is adapted to communicate with at least two other first type nodes, and the first type node is adapted to transmit the predicted information to a second closest, or more remote, first type node, via a direct backhaul channel, for buffer storage and/or relaying.
3. The first type node of claim 1, wherein at least one of the other first type nodes is adapted to communicate with a corresponding group of second type nodes via a corresponding access channel, each group of second type nodes comprising at least one second type node, where information to be requested via at least one of said other first type nodes corresponds to information to be requested by at least one of said second type nodes.
4. The first type node of claim 1, wherein the communication between the first type nodes is a backhaul communication via at least one corresponding backhaul channel, and where the backhaul communication and the access communication both are performed by means of common equipment at each one of the first type nodes.
5. The first type node of claim 1, wherein the first type node is adapted to perform the prediction or acquire the prediction from at least one of said other first type nodes.
6. (canceled)
7. The first type node of claim 1, wherein the prediction is based on previously requested information.
8-9. (canceled)
10. The first type node of claim 1, wherein the first type node is adapted to determine if requested information already has been transmitted to one of said other first type nodes for buffer storage and/or relaying, the requested information then having been comprised in the predicted information.
11. The first type node of claim 1, wherein the first type node is connected to a core network by means of a fiber connection.
12. A first type node in a wireless communication system, the first type node comprising: memory; and processing circuitry coupled to the memory, wherein the first type node is configured to: communicate with at least one other first type node in the wireless communication system over a corresponding backhaul channel; and receive and buffer and/or relay predicted information from at least one of said other first type nodes, where the predicted information has been predicted to be requested via at least one second type node that is served by a first type node.
13. The first type node of claim 12, wherein the first type node is adapted to: communicate with at least two other first type nodes; and to receive predicted information from a second closest, or more remote, first type node, via a direct backhaul channel, for buffer storage and/or relaying.
14. (canceled)
15. The first type node of claim 12, wherein the first type node is adapted to: serve a corresponding group of second type nodes via a corresponding access channel, each group of second type nodes comprising at least one second type node; receive request for information from at least one of the second type nodes; and determine if the requested information already has been buffered and if that is the case, directly forward the requested information to said second type nodes from the present buffer storage, otherwise request the information from one other first type node.
16. (canceled)
17. A method in a first type node first type node in a wireless communication system, wherein the method comprises: communicating with at least one other first type node in the wireless communication system over a corresponding backhaul channel; acquiring a prediction for information to be requested via at least one of said other first type nodes; and transmitting the predicted information to one of said other first type nodes for buffer storage and/or relaying.
18. The method according to of claim 17, wherein the method comprises: communicating with at least two other first type nodes; and transmitting the predicted information to a second closest, or more remote, first type node, via a direct backhaul channel, for buffer storage and/or relaying.
19. The method of claim 17, wherein at least one of the other first type nodes is used for communicating with a corresponding group of second type nodes via a corresponding access channel, each group of second type nodes comprising at least one second type node, where information to be requested via at least one of said other first type nodes corresponds to information to be requested by at least one of said second type nodes.
20. The method of claim 17, wherein the communication between the first type nodes is a backhaul communication via at least one corresponding backhaul channel, and where the backhaul communication and the access communication both are performed by means of common equipment at each one of the first type nodes.
21. The method of claim 17, wherein the method comprises performing the prediction.
22-25. (canceled)
26. A method in a first type node first type node in a wireless communication system, wherein the method comprises: communicating with at least one other first type node in the wireless communication system over a corresponding backhaul channel; and receiving, buffering and/or relaying predicted information from at least one of said other first type nodes, where the predicted information has been predicted to be requested via at least one of the second type nodes that is served by a first type node.
27. The method of claim 26, wherein the method comprises: communicating with at least two other first type nodes; and receiving the predicted information from a second closest, or more remote, first type node, via a direct backhaul channel, for buffer storage and/or relaying.
28. (canceled)
29. The method of claim 26, wherein the method comprises: serving a corresponding group of second type nodes via a corresponding access channel, each group of second type nodes comprising at least one second type node; receiving request for information from at least one of the second type nodes; and determining if the requested information already has been buffered and if that is the case, directly forwarding the requested information to said second type nodes from the present buffer storage, otherwise requesting the information from one other first type node.
30. (canceled)
31. A wireless communication system comprising an integrated access and backhaul network comprising at least the first type node of claim 1.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
[0041] The present disclosure will now be described more in detail with reference to the appended drawings, where:
[0042]
[0043]
[0044]
[0045]
[0046]
[0047]
DETAILED DESCRIPTION
[0048] Aspects of the present disclosure will now be described more fully hereinafter with reference to the accompanying drawings. The different devices, systems, computer programs and methods disclosed herein can, however, be realized in many different forms and should not be construed as being limited to the aspects set forth herein. Like numbers in the drawings refer to like elements throughout.
[0049] The terminology used herein is for describing aspects of the disclosure only and is not intended to limit the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise.
[0050] Network densification takes advantage of wireless backhaul; due to a relatively high installation cost of fiber links, as well as traffic jams and infrastructure displacements, the relatively small application points (APs) need to be supported by high-rate LOS wireless backhaul links which motivates so-called integrated access and backhaul (IAB) networks.
[0051] With reference to
[0052] Each access point AP.sub.0, AP.sub.1, AP.sub.2 AP.sub.3 is adapted for access communication with a corresponding group of second type nodes U.sub.01, U.sub.02; U.sub.11, U.sub.12; U.sub.21, U.sub.22; U.sub.31, U.sub.32 via a corresponding access channel h.sub.01, h.sub.02; h.sub.11, h.sub.12; h.sub.21, h.sub.22; h.sub.31, h.sub.32, providing wireless access. The second type nodes U.sub.01, U.sub.02; U.sub.11, U.sub.12; U.sub.21, U.sub.22; U.sub.31, U.sub.32 are here in the form of customer-premises equipments (CPE:s), and generally each group of CPE:s U.sub.01, U.sub.02; U.sub.11, U.sub.12; U.sub.21, U.sub.22; U.sub.31, U.sub.32 comprises at least one CPE. The number of CPE:s for each access point AP.sub.0, AP.sub.1, AP.sub.2 AP.sub.3 in
[0053] The backhaul communication and the access communication are both performed by means of common equipment at the access points AP.sub.0, AP.sub.1, AP.sub.2 AP.sub.3. The second access point AP.sub.1, the third access point AP.sub.2 and the fourth access point AP.sub.3 are wirelessly backhauled by the first access point AP.sub.0 connecting to a core network 2 using a fiber connection 5. An access point AP.sub.0 connected to a core network can be referred to as an IAB donor node.
[0054] In IAB networks, uplink (UL) and downlink (DL) transmission do not follow the common definition, as both endpoints of the backhaul links are access points. However, for simplicity, we refer to data transmission towards (resp. from) the first access point AP.sub.0 as UL (resp. DL) transmission. The present disclosure is applicable for DL transmission from the first access point AP.sub.0 to the other nodes.
[0055] Different scheduling protocols can be considered, and in the following example a time slot 6 is divided into transmit (Tx) and receive (Rx) sub-slots TX.sub.1, RX.sub.1 for the first access point AP.sub.0, and in each one there is both backhaul and access connections. Considering
[0056] As the number of hops/CPEs per hop increases, the AP:s need to transfer an aggregated data of multiple CPE:s accumulated from the previous hops. As a result, the AP-AP backhaul links are heavily loaded, which may lead to high decoding complexity/delay and buffering cost for the AP:s as well as large end-to-end transmission delay/low end-to-end throughput for the CPE:s. This becomes more and more pronounced the closer an AP is to an access point AP.sub.0 that is connected to a core network 2.
[0057] More in detail, in a genera case, for each time slot, the first access point AP.sub.0 needs to send 2 Nm signals for both its m CPEs, m DL and m UL signals, in access and the DL/UL backhaul signals for (N−1)m CPEs of the other access points AP.sub.1, AP.sub.2, AP.sub.3. Then, access point i>0 needs to transfer 2(2 Nm−im) signals in total, both access and backhaul, DL and UL. As a result, the second access point, AP.sub.1 is the busiest node being active during the whole time slot, while the other access points AP.sub.2, AP.sub.3 may be off in some periods and wait for the previous hops to finish their data transmission.
[0058] This is because: [0059] Part of the spectrum is underutilized because different access points need to wait until the data transmission of the more loaded access points are finished, and [0060] The high load of the second access point AP.sub.1 and other highly loaded nodes leads to large scheduling delay for all CPE:s.
[0061] On the other hand, IAB networks are mostly designed for, e.g., fixed wireless access (FWA) networks, with stationary CPE:s for which the required signals of the CPE:s can be predicted with high accuracy.
[0062] According to the present disclosure, with reference to
[0063] This means that the first access point AP.sub.0 is adapted to acquire a prediction for information x.sub.23 to be requested by the CPE:s U.sub.21, U.sub.22, where this predicted information x.sub.23 is to be relayed to the CPE:s U.sub.21, U.sub.22 via the third access point AP.sub.2.
[0064] According to some aspects, apart from the first access point AP.sub.0, there are at least two other access points AP.sub.1, AP.sub.2, and the first access point AP.sub.0 is adapted to transmit the predicted information x.sub.23 to an at least second closest first type node AP.sub.2, via the direct backhaul channel H.sub.4, for buffer storage and/or relaying.
[0065] In the following, the flow of information in
[0066] Furthermore, in accordance with the present disclosure, the first access point AP.sub.0 has acquired a prediction for information x.sub.23 to be requested by the CPE:s U.sub.21, U.sub.22 that are served by the third access point AP.sub.2. The first access point AP.sub.0 can therefore take advantage of a first time period A in the transmit sub-slot TX.sub.1, when the first access point AP.sub.0 and the third access point AP.sub.2 are idle, to transmit this predicted information x.sub.23 to the third access point AP.sub.2 where the predicted information x.sub.23 is stored in a buffer. This transmission takes place via the direct backhaul channel H.sub.4 between the first access point AP.sub.0 and the third access point AP.sub.2.
[0067] Since the predicted information x.sub.23 has been transmitted to the third access point AP.sub.2 based on a prediction, it is not a fact that this information will be requested by the CPE:s U.sub.21, U.sub.22 that are served by the third access point AP.sub.2. If this does not happen within a certain time period, and/or if other substitute information is transmitted, the predicted information x.sub.23 is deleted from the buffer. On the other hand, should the predicted information x.sub.23 be requested by the CPE:s U.sub.21, U.sub.22 that are served by the third access point AP.sub.2, the buffered predicted information x.sub.23 can be immediately relayed to the CPE:s U.sub.21, U.sub.22.
[0068] In the receive sub-slot RX.sub.1, the first access point AP.sub.0 is receiving information x.sub.2, x.sub.4 from its served CPE:s U.sub.01, U.sub.02, and information x.sub.18 from the second access point AP.sub.1. The second access point AP.sub.1 transmits information x.sub.20 to the third access point AP.sub.2, the information x.sub.18 to the first access point AP.sub.0 and information x.sub.5, x.sub.7 to its served CPE:s U.sub.11, U.sub.12. The third access point AP.sub.2 receives the information x.sub.20 from the second access point AP.sub.1, information x.sub.22 from the fourth access point AP.sub.3 and information x.sub.10, x.sub.12 from its served CPE:s U.sub.21, U.sub.22. The fourth access point AP.sub.3 transmits the information x.sub.22 to the third access point AP.sub.2, and information x.sub.14, x.sub.16 to its served CPE:s U.sub.31, U.sub.32.
[0069] Furthermore, in accordance with the present disclosure, the third access point AP.sub.2 can take advantage of a second time period B in the receive sub-slot RX.sub.1, when the first access point AP.sub.0 and the third access point AP.sub.2 are idle, to transmit information x.sub.24 to the first access point AP.sub.0 via the direct backhaul channel H.sub.4 between the first access point AP.sub.0 and the third access point AP.sub.2. This information x.sub.24 can for example comprise information that requested data from the CPE:s U.sub.21, U.sub.22 that are served by the third access point AP.sub.2 already has been received.
[0070] There are two different alternatives for an access point that is adapted for direct backhaul communication with an access point AP.sub.0 that is connected to a core network 2 using a fiber connection 5, in this example the third access point AP.sub.2. Either the third access point AP.sub.2 is adapted for encryption and decryption of the received information x.sub.23 or not. In the following, the third access point AP.sub.2 is assumed to be adapted for encryption and decryption, and the case where the third access point AP.sub.2 is not adapted for encryption will be discussed afterwards where some important the differences will be illuminated.
[0071] According to some aspects, the first access point AP.sub.0 uses an artificial intelligence-based, algorithm and the previous/current signal requests of the CPE:s to predict the next signals that may be requested by CPE:s U.sub.21, U.sub.22; U.sub.31, U.sub.32 that are served by an access point that is not closest to the first access point AP.sub.0, here the third access point AP.sub.2 and the fourth access point AP.sub.3, and directly provide information x.sub.23 which, with high probability, will be requested. As an example, if a CPE U.sub.21, U.sub.22 that is served by the third access point AP.sub.2 is watching episode k of a TV series such as “Game of Thrones”, with high probability the next file that it requests is episode k+1 of “Game of Thrones”. Then the first access point AP.sub.0 uses a normally idle time period such as the first time period A in
[0072] As mentioned above, according to some aspects, the third access point AP.sub.2 is assumed to be adapted for encryption and decryption, and is thus adapted to decrypt and buffer the signals carrying information that are received in normally idle time periods. Then, receiving a signal request from one or more of the CPE:s U.sub.ij, j=1, . . . , m, i=2, 3, i.e. the CPE:s which are served by the third access point AP.sub.2 and the fourth access point AP.sub.3, the third access point AP.sub.2 is adapted to run a search algorithm to find out if the requested information is in its buffered dataset or if it should receive it from the first access point AP.sub.0 through backhauling.
[0073] If the requested information has not been previously buffered by the third access point AP.sub.2, the normal backhaul path from the first access point AP.sub.0 to the second access point AP.sub.1 and finally to the third access point AP.sub.2 via the corresponding channels H.sub.1, H.sub.2 is followed. If the requested information has been previously buffered by the third access point AP.sub.2, the third access point AP.sub.2 is adapted to inform the first access point AP.sub.0 and the second access point AP.sub.1 and to serve the considered CPE or CPE:s directly. Also, the resource allocation of all nodes and their timing are adapted based on the buffering status of the third access point AP.sub.2 correspondingly.
[0074] This means that the third access point AP.sub.2 encrypts and forwards the signal to the considered CPE, possibly via the fourth access point AP.sub.3 if the request is made from any one of the CPE:s U.sub.31, U.sub.32 that are served by fourth access point AP.sub.3 without any need for backhauling from the first access point AP.sub.0. For instance the third access point AP.sub.2 may use a third time period C and/or a fourth time period D in
[0075] Depending on if the requested information has been previously buffered by the third access point AP.sub.2 or not, the first access point AP.sub.0 and the second access point AP.sub.1 are adapted to update their scheduling methods correspondingly. Moreover, the first access point AP.sub.0 adapts its transmission parameters, e.g., data rate, power and beamforming, depending on the quality of the channel to the receiving application point in different time slots.
[0076] In this way, the load of the second access point AP.sub.1 is reduced, and consequently the scheduling delay is reduced as well because part of the data is transferred through backhauling in the idle time periods A. Moreover, the spectrum utilization is improved by using the idle time periods A, which leads to lower end-to-end transmission delay and higher throughput for the CPE:s U.sub.21, U.sub.22; U.sub.31, U.sub.32 that are served by the third access point AP.sub.2 and the fourth access point AP.sub.3.
[0077] As discussed previously, encryption/decryption ability is not necessary for the third access point AP.sub.2. Above, examples have been presented where the third access point AP.sub.2 has been assumed to be able to encrypt/decrypt information received from the first access point AP.sub.0 as well as the information requests of the CPE:s. According to some aspects, the third access point AP.sub.2 is adapted to buffer information received in idle time periods A with no decryption. Also, without decryption functionality, the third access point AP.sub.2 is adapted to forward the information requests of the served CPE:s U.sub.21, U.sub.22, U.sub.31, U.sub.32 to the first access point AP.sub.0. Then the first access point AP.sub.0 decrypts the information request of the CPE:s U.sub.21, U.sub.22; U.sub.31, U.sub.32 and runs search algorithm to find out if it has already sent the requested information to the third access point AP.sub.2. If the information already has been sent the third access point AP.sub.2, the first access point AP.sub.0 is adapted to inform the third access point AP.sub.2 about the codewords that should be forwarded to the requesting CPE:s U.sub.21, U.sub.22, U.sub.31, U.sub.32. This means that here, the search algorithm is run at the first access point AP.sub.0 instead of at the third access point AP.sub.2, and there is no need for message/information encryption/decryption at the third access point AP.sub.2.
[0078] Furthermore, according to some aspects, the third access point AP.sub.2, or any suitable AP or AP:s can be adapted to predict the next signals that may be requested by CPE:s U.sub.21, U.sub.22, U.sub.31, U.sub.32 that are served by an access point that is not closest to the first access point AP.sub.0. This functionality can be implemented instead of, or as a complement to, the first access point AP.sub.0 being adapted to perform such a prediction. In all cases, in order to be able to transmit the predicted information to an AP for buffer storage and/or relaying, the first access point AP.sub.0 is adapted to acquire the prediction, irrespective of the first access point AP.sub.0 generates the prediction, or if it is generated elsewhere. It is even conceivable that the prediction is generated at a remote node 8 or server 9 that can be realized in the cloud.
[0079] With reference to
[0080] According to some aspects, this applies to a case where aspects the present disclosure can be more or less implemented at an IAB donor node such as the first access point AP.sub.0.
[0081] According to some aspects, the method comprises communicating S11 with at least two other first type nodes AP.sub.1, AP.sub.2, and transmitting S31 the predicted information x.sub.23 to a second closest, or more remote, first type node AP.sub.2, via a direct backhaul channel H.sub.4, for buffer storage and/or relaying.
[0082] According to some aspects, at least one of the other first type nodes AP.sub.1, AP.sub.2, AP.sub.3 is used for communicating with a corresponding group of second type nodes U.sub.11, U.sub.12, U.sub.21, U.sub.22, U.sub.31, U.sub.32 via a corresponding access channel h.sub.11, h.sub.12, h.sub.21, h.sub.22, h.sub.31, h.sub.32, each group of second type nodes U.sub.11, U.sub.12, U.sub.21, U.sub.22, U.sub.31, U.sub.32 comprising at least one second type node U.sub.11, U.sub.12, U.sub.21, U.sub.22, U.sub.31, U.sub.32, where information x.sub.23 to be requested via at least one of said other first type nodes AP.sub.2, AP.sub.3 corresponds to information to be requested by at least one of said second type nodes Uzi, U.sub.22, U.sub.31, U.sub.32.
[0083] According to some aspects, the communication between the first type nodes AP.sub.0, AP.sub.1, AP.sub.2, AP.sub.3 is a backhaul communication via at least one corresponding backhaul channel H.sub.1, Hz, H.sub.3, H.sub.4, and where the backhaul communication and the access communication both are performed by means of common equipment at each one of the first type nodes AP.sub.0, AP.sub.1, AP.sub.2, AP.sub.3.
[0084] According to some aspects, the method comprises performing S21 the prediction.
[0085] According to some aspects, the method comprises acquiring S22 the prediction from at least one of said other first type nodes AP.sub.2, AP.sub.3.
[0086] According to some aspects, the prediction is based on previously requested information.
[0087] According to some aspects, the previously requested information mostly comprises video information.
[0088] According to some aspects, the method comprises determining S4 if requested information already has been transmitted to one of said other first type nodes AP.sub.2 for buffer storage and/or relaying, the requested information then having been comprised in the predicted information x.sub.23.
[0089] With reference to
[0090] According to some aspects, this applies to a case where aspects of the present disclosure can be more or less implemented at a first type node, for example the third access point AP.sub.2 or the fourth access point AP.sub.3 in the examples above. Such a first type node is not a donor node, such as the first access point AP.sub.0.
[0091] According to some aspects, the method comprises communicating T11 with at least two other first type nodes AP.sub.0, AP.sub.1, and receiving T21 the predicted information x.sub.23 from a second closest, or more remote, first type node AP.sub.0, via a direct backhaul channel H.sub.4, for buffer storage and/or relaying.
[0092] According to some aspects, the method comprises relaying T3 received predicted information x.sub.23 to be stored and buffered at another first type node AP.sub.3, where said second type node U.sub.31, U.sub.32 is served by said another first type node AP.sub.3.
[0093] According to some aspects, the method comprises serving T4 a corresponding group of second type nodes U.sub.21, U.sub.22; U.sub.31, U.sub.32 via a corresponding access channel h.sub.21, h.sub.22; h.sub.31, h.sub.32, each group of second type nodes U.sub.21, U.sub.22; U.sub.31, U.sub.32 comprising at least one second type node U.sub.21, U.sub.22; U.sub.31, U.sub.32). The method further comprises receiving T5 request for information from at least one of the second type nodes U.sub.21, U.sub.22; U.sub.31, U.sub.32; and determining T6 if the requested information already has been buffered. If that is the case, the method comprises directly forwarding T7 the requested information to said second type nodes U.sub.21, U.sub.22; U.sub.31, U.sub.32 from the present buffer storage, otherwise requesting T8 the information from one other first type node AP.sub.0; AP.sub.2.
[0094] According to some aspects, the method comprises performing T9 the prediction, and requesting T10 the predicted information from another first type node AP.sub.0; AP.sub.2.
[0095] As shown in
[0096] According to some aspects, the first type node is the first access point AP.sub.0 in the examples above.
[0097] According to some aspects, the first type node AP.sub.0 is adapted to communicate with at least two other first type nodes AP.sub.1, AP.sub.2, and the first type node AP.sub.0 is adapted to transmit the predicted information x.sub.23 to a second closest, or more remote, first type node AP.sub.2, via a direct backhaul channel H.sub.4, for buffer storage and/or relaying.
[0098] According to some aspects, the processor unit 3 is adapted to perform the prediction or to acquire the prediction from at least one of said other first type nodes AP.sub.2, AP.sub.3.
[0099] According to some aspects, the processor unit 3 is adapted to determine if requested information already has been transmitted to one of said other first type nodes AP.sub.2 for buffer storage and/or relaying, the requested information then having been comprised in the predicted information x.sub.23.
[0100] As shown in
[0101] According to some aspects, the first type node is the third access point AP.sub.2 in the examples above. Such a first type node is not a donor node, such as the first access point AP.sub.0.
[0102] According to some aspects, the processor unit 4 is adapted to control communication with at least two other first type nodes AP.sub.0, AP.sub.1, and to control reception of predicted information x.sub.23 from a second closest, or more remote, first type node AP.sub.0, via a direct backhaul channel H.sub.4, for buffer storage and/or relaying.
[0103] According to some aspects, the processor unit 4 is adapted to control relaying of the received predicted information x.sub.23 to be stored and buffered at another first type node AP.sub.3, where said second type node U.sub.31, U.sub.32 is served by said another first type node AP.sub.3.
[0104] According to some aspects, the first type node AP.sub.2; AP.sub.3 is adapted to serve a corresponding group of second type nodes U.sub.21, U.sub.22; U.sub.31, U.sub.32 via a corresponding access channel h.sub.21, h.sub.22; h.sub.31, h.sub.32, each group of second type nodes U.sub.21, U.sub.22; U.sub.31, U.sub.32 comprising at least one second type node U.sub.21, U.sub.22; U.sub.31, U.sub.32. According to some further aspects, the processor unit 4 is adapted to control reception of request for information from at least one of the second type nodes U.sub.21, U.sub.22; U.sub.31, U.sub.32, and to determine if the requested information already has been buffered and if that is the case, directly forward the requested information to said second type nodes U.sub.21, U.sub.22; U.sub.31, U.sub.32 from the present buffer storage, otherwise request the information from one other first type node AP.sub.0; AP.sub.2.
[0105] According to some aspects, the processor unit 4 is adapted to perform the prediction, and to request the predicted information from another first type node AP.sub.0; AP.sub.2.
[0106] The present disclosure is not limited to the above, but may vary freely within the scope of the appended claims. For example, in the examples discussed above, the first access point AP.sub.0 connects to the third access point AP.sub.2 directly to provide it with the signals of the served CPE:s U.sub.21, U.sub.22; U.sub.31, U.sub.32 of both the third access point AP.sub.2 and the fourth access point AP.sub.3. However, according to some aspects, the first access point AP.sub.0 is adapted to directly transmit predicted information to any access point that is not closest to the first access point AP.sub.0, for example directly to the fourth access point AP.sub.3 in a fifth time period E for direct backhauling of the fourth access point AP.sub.3.
[0107] In the examples discussed above, a time slot 6 is divided into sub-slots TX.sub.1, RX.sub.1, each one having access and backhaul connections. In another approach, a time slot is divided into access and backhaul sub-slots where each one has DL and UL transmission. Generally, the present disclosure is applicable for different schemes of time allocation.
[0108] The efficiency of the present disclosure depends on if an efficient algorithm can be used to predict the required signals of the CPE:s as well as the efficiency of the search algorithm. However, because an IAB network mostly is designed for FWA networks with stationary CPE:s, such algorithms can be effectively developed and applied for the cases with, e.g., video streams and social media. According to some aspects, the prediction is based on previously requested information, and according to some further aspects, the previously requested information mostly comprises video information.
[0109] According to some aspects, the efficiency of the present disclosure depends on the amount of interference added to the access links between the second access point AP.sub.1 and its served CPE:s U.sub.11, U.sub.12 by means of the direct transmission from, for example, the first access point AP.sub.0 to the third access point AP.sub.2. However, because the AP:s normally are equipped with many antennas and advanced beamforming methods, and also because the direct communication via the direct channel H.sub.4 does not need to have high rate and, consequently, possibly relatively low transmission power, the interference to the access links between the second access point AP.sub.1 and its served CPE:s U.sub.11, U.sub.12 will be negligible. This is especially because an IAB network normally is used for stationary networks where the channel measurements and parameter settings can be done before the data transmission.
[0110] According to some aspects, examples of important parts of the present disclosure are: [0111] 1) Utilizing idle time periods A of the time slots 6 for offline backhauling which improves the end-to-end transmission delay and throughput of the IAB network 7. [0112] 2) Developing prediction and search algorithms in the IAB donor node and/or other IAB nodes or access points. [0113] 3) Adapting the data transmission, the buffering as well as the encryption/decryption schemes of the access points. [0114] 4) Developing signaling methods between access points to convey information regarding whether a message comprising information already has been buffered by offline backhauling or not. [0115] 5) Adapting the scheduling and timing based on this signaling. The present disclosure address the main problems of IAB networks which are the large end-to-end transmission delay of the last hops.
[0116] A direct channel H.sub.4 that bypasses one or more CPE:s can be set up where possible, possibly by the CPE:s involved adapting transmission parameters, e.g., data rate, power and beamforming, depending on the quality of the direct channel.
[0117] According to some aspects, the first access point AP.sub.0 is adapted to communicate with at least two other access points AP.sub.1, AP.sub.2, and the first type node AP.sub.0 is adapted to transmit the predicted information x.sub.23 to a second closest, or more remote, first type node, such as the third access point AP.sub.2 via a direct backhaul channel, for buffer storage and/or relaying. This means that at least one access point such as the second access point AP.sub.1 is bypassed by means of one or more direct backhaul channels.
[0118] According to some aspects, the present disclosure can easily extended to the cases with arbitrary number of hops, different relaying approaches or star-like network configuration.
[0119] According to some aspects, in the present context, the term information corresponds to a data signal or a data message. According to some aspects, in the present context, the terms relay and relaying correspond to the terms forward and forwarding.
[0120] The present disclosure has been described for an uncomplicated case with relatively few hops, although the present disclosure can be applied to the cases with arbitrary number of hops and CPE:s. Any CPE or CPE:s can be adapted to encrypt/decrypt information received from the first access point AP.sub.0 or any suitable IAB donor node, as well as information requests of the CPE:s. this means that aspects of the present disclosure can be more or less implemented at an IAB donor node such as the first access point AP.sub.0 as well as at any other suitable AP or AP:s in the wireless communication system 1.
[0121] In the examples, the third access point AP.sub.2 has been adapted to communicate directly with the first access point AP.sub.0 via the direct backhaul channel H.sub.4, but not the fourth access point AP.sub.3 that has to depend on relaying via the third access point AP.sub.2 for both uplink and downlink. According to some aspects, there can be several (not shown) intermediate access points between the third access point AP.sub.2 and the fourth access point AP.sub.3. According to some aspects, the fourth access point AP.sub.3 and possibly one or more other (not shown) access points can also be adapted to communicate directly with the first access point AP.sub.0 via corresponding direct backhaul channels.
[0122] According to some aspects, an access points that is adapted to communicate directly with the first access point AP.sub.0 via a direct backhaul channel, such as the third access point AP.sub.2, can both buffer predicted information intended for its own served CPE:s and relay other predicted information intended for CPE:s that are served by other AP:s for storage and buffering at those AP:s.
[0123] According to some aspects, the wireless communication system 1 comprises one or more IAB networks 7.
[0124] Generally, the present disclosure relates to a first type node AP.sub.0 in a wireless communication system 1, wherein the first type node AP.sub.0 is adapted to communicate with at least one other first type node AP.sub.1, AP.sub.2 in the wireless communication system 1 over a corresponding backhaul channel H.sub.1, H.sub.4. The first type node AP.sub.0 is further adapted to acquire a prediction for information x.sub.23 to be requested via at least one of said other first type nodes AP.sub.2, AP.sub.3, and to transmit the predicted information x.sub.23 to one of said other first type nodes AP.sub.2 for buffer storage and/or relaying.
[0125] According to some aspects, this applies to a case where aspects the present disclosure can be more or less implemented at an IAB donor node such as the first access point AP.sub.0.
[0126] According to some aspects, the first type node AP.sub.0 is adapted to communicate with at least two other first type nodes AP.sub.1, AP.sub.2, and the first type node AP.sub.0 is adapted to transmit the predicted information x.sub.23 to a second closest, or more remote, first type node AP.sub.2, via a direct backhaul channel H.sub.4, for buffer storage and/or relaying.
[0127] According to some aspects, at least one of the other first type nodes AP.sub.1, AP.sub.2, AP.sub.3 is adapted to communicate with a corresponding group of second type nodes U.sub.11, U.sub.12, U.sub.21, U.sub.22, U.sub.31, U.sub.32 via a corresponding access channel h.sub.11, h.sub.12, h.sub.21, h.sub.22, h.sub.31, h.sub.32. Each group of second type nodes U.sub.11, U.sub.12, U.sub.21, U.sub.22, U.sub.31, U.sub.32 comprises at least one second type node U.sub.11, U.sub.12, U.sub.21, U.sub.22, U.sub.31, U.sub.32, where information x.sub.23 to be requested via at least one of said other first type nodes AP.sub.2, AP.sub.3 corresponds to information to be requested by at least one of said second type nodes U.sub.21, U.sub.22, U.sub.31, U.sub.32.
[0128] This mean that one or more CPE:s makes requests for information, and the one or more requests for information are relayed via one or more AP:s. Information that is requested via an AP is requested by at least one CPE.
[0129] According to some aspects, the communication between the first type nodes AP.sub.0, AP.sub.1, AP.sub.2, AP.sub.3 is a backhaul communication via at least one corresponding backhaul channel H.sub.1, H.sub.2, H.sub.3, H.sub.4, and the backhaul communication and the access communication both are performed by means of common equipment at each one of the first type nodes AP.sub.0, AP.sub.1, AP.sub.2, AP.sub.3.
[0130] According to some aspects, the first type node AP.sub.0 is adapted to perform the prediction. According to some aspects, the prediction can be performed at any other access point on the IAB network, at a remote node 8 or at a server 9 that can be realized in the cloud. Such a remote node 8 or server 9 should be enabled to perform encryption/decryption.
[0131] According to some aspects, the first type node AP.sub.0 is adapted to acquire the prediction from at least one of said other first type nodes AP.sub.2, AP.sub.3. In this case, each first type node AP.sub.2, AP.sub.3 that is able to perform the prediction, has encryption/decryption ability.
[0132] According to some aspects, the transmitted predicted information x.sub.23 is relayed from one other first type node AP.sub.2 to another first type node AP.sub.3. In this case, the transmitted predicted information x.sub.23 can have been buffered at the other first type node AP.sub.2 before being relayed to said another first type node AP.sub.3, where the transmitted predicted information x.sub.23 also can be buffered.
[0133] According to some aspects, the first type node AP.sub.0 is adapted to determine if requested information already has been transmitted to one of said other first type nodes AP.sub.2 for buffer storage and/or relaying, the requested information then having been comprised in the predicted information x.sub.23.
[0134] According to some aspects, the first type node AP.sub.0 is connected to a core network 2 using a fiber connection 5.
[0135] Generally, the present disclosure also relates to a first type node AP.sub.2; AP.sub.3 in a wireless communication system 1, wherein the first type node AP.sub.2; AP.sub.3 is adapted to: [0136] communicate with at least one other first type node AP.sub.0, AP.sub.1, AP.sub.3; AP.sub.2 in the wireless communication system 1 over a corresponding backhaul channel H.sub.2, H.sub.3, H.sub.4, and to [0137] receive and buffer and/or relay predicted information x.sub.23 from at least one of said other first type nodes AP.sub.0; AP.sub.2, where the predicted information has been predicted to be requested via at least one second type node U.sub.21, U.sub.22; U.sub.31, U.sub.32 that is served by a first type node AP.sub.2; AP.sub.3.
[0138] According to some aspects, this applies to a case where aspects of the present disclosure can be more or less implemented at a first type node, for example the third access point AP.sub.2 or the fourth access point AP.sub.3 in the examples above. Such a first type node is not a donor node, such as the first access point AP.sub.0.
[0139] According to some aspects, the first type node AP.sub.2 is adapted to: [0140] communicate with at least two other first type nodes AP.sub.0, AP.sub.1, and [0141] to receive predicted information x.sub.23 from a second closest, or more remote, first type node AP.sub.0, via a direct backhaul channel H.sub.4, for buffer storage and/or relaying.
[0142] According to some aspects, the first type node AP.sub.2 is adapted to relay the received predicted information x.sub.23 to be stored and buffered at another first type node AP.sub.3, where said second type node U.sub.31, U.sub.32 is served by said another first type node AP.sub.3.
[0143] According to some aspects, the first type node AP.sub.2; AP.sub.3 is adapted to: [0144] serve a corresponding group of second type nodes U.sub.21, U.sub.22; U.sub.31, U.sub.32 via a corresponding access channel h.sub.21, h.sub.22; h.sub.31, h.sub.32, each group of second type nodes U.sub.21, U.sub.22; U.sub.31, U.sub.32 comprising at least one second type node U.sub.21, U.sub.22; U.sub.31, U.sub.32, [0145] receive request for information from at least one of the second type nodes U.sub.21, U.sub.22; U.sub.31, U.sub.32, and to [0146] determine if the requested information already has been buffered and if that is the case, directly forward the requested information to said second type nodes U.sub.21, U.sub.22; U.sub.31, U.sub.32 from the present buffer storage, otherwise request the information from one other first type node AP.sub.0; AP.sub.2.
[0147] According to some aspects, the first type node AP.sub.2; AP.sub.3 is adapted to perform the prediction, and to request the predicted information from another first type node AP.sub.0; AP.sub.2.
[0148] The present disclosure also relates to a wireless communication system 1 comprising an integrated access and backhaul, IAB, network 7 which in turn comprises at least the first type node AP.sub.0 that is a donor node and a first type node AP.sub.2, AP.sub.3 that is a not donor node.