Method for processing channel allocation for multiple network nodes

Abstract

A method for processing channel allocation in a network node, the method comprising obtaining at least one first channel of a first network node and at least one second channel of a second network node; determining, according to at least one policy, that a first priority order of the first network node is lower than a second priority order of the second network node; after selecting at least one second allocated channel of the second network node, selecting at least one first available channel from the at least one first channel according to the at least one second allocated channel; if the network node successfully selects the at least one first available channel from the at least one first channel, selecting at least one first allocated channel from the at least one first available channel; and allocating the at least one first allocated channel to the first network node.

Description

Technical Field

[0001] The present invention relates to a method for a wireless communication system, and more particularly to a method for processing channel allocation for multiple network nodes.

Background Art

[0002] In a railway transportation system, a large number of network nodes deployed along railway tracks are used for communication between vehicles (such as trains, Mass Rapid Transit (MRT)) and the railway transportation system. The network nodes can operate in the same or different channels. However, the characteristics of the channels change over time, with the positions of the vehicles and the network nodes. In this case, it is difficult to allocate channels to the network nodes to achieve satisfactory performance. Therefore, channel allocation for multiple network nodes is an urgent problem to be solved.

Summary of the Invention

[0003] The present invention provides a method and a related network side for processing channel allocation for multiple network nodes to solve the above problems.

[0004] The present invention discloses a method for processing channel allocation for multiple network nodes in a network side. The method includes obtaining at least one first channel of a first network node and at least one second channel of a second network node; determining, according to at least one policy, that a first priority of the first network node is lower than a second priority of the second network node; after selecting at least one second allocated channel of the second network node, selecting at least one first available channel from the at least one first channel according to the at least one second allocated channel; if the network side successfully selects the at least one first available channel from the at least one first channel, selecting at least one first allocated channel from the at least one first available channel; and allocating the at least one first allocated channel to the first network node.

[0005] The present invention further discloses at least one processor for processing channel allocation for multiple network nodes. The at least one processor includes a first module for enabling the at least one processor to obtain at least one first channel of a first network node and at least one second channel of a second network node; a second module for enabling the at least one processor to determine, according to at least one policy, that a first priority of the first network node is lower than a second priority of the second network node; a third module for enabling the at least one processor to select at least one first available channel from the at least one first channel according to the at least one second allocated channel after selecting the at least one second allocated channel of the second network node; a fourth module for enabling the at least one processor to select at least one first allocated channel from the at least one first available channel if the at least one first available channel is successfully selected from the at least one first channel; and a fifth module for enabling the at least one processor to allocate the at least one first allocated channel to the first network node.

Description of the Drawings

[0006] Figure 1 It is a schematic diagram of a wireless communication system according to Embodiment 1 of the present invention.

[0007] Figure 2 It is a schematic diagram of a communication device according to Embodiment 1 of the present invention.

[0008] Figure 3 It is a flowchart of a process according to Embodiment 1 of the present invention.

[0009] Figure 4 It is a flowchart of a process according to Embodiment 1 of the present invention.

[0010] Figure 5 It is a schematic diagram of channel selection and allocation according to Embodiment 1 of the present invention.

[0011] Figure 6 It is a schematic diagram of channel selection and allocation according to Embodiment 1 of the present invention.

[0012] Figure 7 It is a schematic diagram of channel selection and allocation according to Embodiment 1 of the present invention.

[0013] Figure 8 It is a schematic diagram of channel selection and allocation according to Embodiment 1 of the present invention.

Detailed Description of the Invention

[0014] Figure 1Schematic diagram of wireless communication system 10 according to Embodiment 1 of the present invention. Wireless communication system 10 may be briefly composed of a network side and a plurality of network nodes. The network side may include a network entity for controlling the plurality of network nodes. In one embodiment, wireless communication system 10 may be a cellular network system or a wireless local area network (WLAN) system, such as a system compliant with the IEEE 802.11 standard.

[0015] In Figure 1 it, the network side and the plurality of network nodes only briefly illustrate the architecture of wireless communication system 10. In one embodiment, the plurality of network nodes may form a wireless mesh network. That is to say, multiple network nodes may be interconnected and may operate in the same channel. In one embodiment, the network side may be a universal terrestrial radio access network (UTRAN) including at least one base station (Node-B, NB) in a universal mobile telecommunications system (UMTS). In one embodiment, in a long term evolution (LTE) system, a long term evolution-advanced (LTE-A) system or a subsequent version of the long term evolution-advanced system, the network side may be an evolved universal terrestrial radio access network (E-UTRAN), which may include at least one evolved base station (evolved NB, eNB) and / or at least one relay station. In one embodiment, the network side may be a next generation radio access network (NG-RAN), which includes at least one next generation base station (next generation Node-B, gNB) and / or at least one fifth generation (5G) base station (base station, BS). It should be noted that the network node may be a cell, a base station, a wireless local area network access point (access point, AP), etc.

[0016] In one embodiment, the wireless communication system 10 may be operated in a railway transportation system including multiple stations and vehicles (e.g., Mass Rapid Transit (MRT)). That is, the stations may be configured with network nodes to communicate with the vehicles.

[0017] Figure 2 Schematic diagram of a communication device 20 according to an embodiment of the present invention. The communication device 20 may be Figure 1 a network terminal or a network node in, but not limited to, the above. The communication device 20 includes at least one processing circuit 200, at least one storage device 210, and at least one communication interface device 220. The at least one processing circuit 200 may include a microprocessor or an Application-Specific Integrated Circuit (ASIC). The at least one storage device 210 may include any data storage device for storing program code 214, and the at least one processing circuit 200 may read and execute the program code 214 through the at least one storage device 210. For example, the at least one storage device 210 may include a Subscriber Identity Module (SIM), a Read-Only Memory (ROM), a Flash Memory, a Random-Access Memory (RAM), a CD-ROM / DVD-ROM / BD-ROM, a magnetic tape, a hard disk, an optical data storage device, a non-volatile storage device, a non-transitory computer-readable medium (e.g., tangible media), etc., but not limited to these. The at least one communication interface device 220 may include a wireless transceiver, which is used to transmit and receive signals (e.g., data, signals, information, and / or packets) according to the processing result of the at least one processing circuit 200.

[0018] Figure 3 Flowchart of a process 30 according to an embodiment of the present invention. The process 30 may be used in a network terminal to process channel allocation for multiple network nodes. The process 30 may be compiled into program code 214, which includes the following steps:

[0019] Step 300: Start.

[0020] Step 302: Obtain at least one first channel of a first network node and at least one second channel of a second network node.

[0021] Step 304: According to at least one policy, determine that a first priority of the first network node is lower than a second priority of the second network node.

[0022] Step 306: After selecting at least one second allocated channel of the second network node, select at least one first available channel from the at least one first channel according to the at least one second allocated channel.

[0023] Step 308: If the network side successfully selects the at least one first available channel from the at least one first channel, select at least one first allocated channel from the at least one first available channel.

[0024] Step 310: Allocate the at least one first allocated channel to the first network node.

[0025] Step 312: End.

[0026] According to process 30, the network side (such as a network entity, a central server) obtains (such as determines, derives) at least one first (candidate) channel of a first network node (such as an access point, a cell) and at least one second (candidate) channel of a second network node (such as an access point, a cell). According to (such as based on) at least one (priority) policy, the network side determines that the first priority of the first network node is lower than the second priority of the second network node. After selecting at least one second allocated channel of the second network node, according to the at least one second allocated channel, the network side selects at least one first available channel from the at least one first channel. If (such as afterwards) the network side successfully selects at least one first available channel from the at least one first channel, the network side selects at least one first allocated channel from the at least one first available channel. Then, the network side allocates the at least one first allocated channel to the first network node. That is to say, after the allocated channel of the network node with a higher priority is selected, the allocated channel of the network node with a lower priority is selected. In other words, the present invention selects the allocated channels of network nodes in descending order of the priorities of the network nodes. Therefore, the problems of channel selection and allocation / reallocation of multiple network nodes can be solved.

[0027] The implementation manner of process 30 is not limited to the above, and the following embodiments can be applied to implement process 30.

[0028] In one embodiment, after the first network node is powered on (e.g., power is turned on), the network side selects at least one first available channel. In one embodiment, after receiving a message requesting channel allocation / reallocation from the first network node, the network side selects at least one first available channel. In one embodiment, after deciding to perform channel allocation / reallocation for the first network node (e.g., changing the currently allocated channel) according to certain conditions, the network side selects at least one first available channel. For example, the conditions include determining whether the interference received by the network node forms a complete graph, that is, whether every pair of network nodes in the network node interferes with each other. Specifically, when a network node in the complete graph requests channel allocation / reallocation, there may be no channel available for the network node to switch. In the case where the network node is considered important by the update (e.g., by the network side), the network side can also decide (or can be triggered) to perform channel allocation for the remaining network nodes in the complete graph. That is, the updating scope expands from one network node to all network nodes in the complete graph. Conversely, in the case where the network node is considered unimportant by the update (e.g., by the network side), the network side can only report failure without updating the remaining network nodes in the complete graph.

[0029] In one embodiment, at least one first channel and at least one second channel are indicated (e.g., updated) by the first network node and the second network node respectively. In one embodiment, at least one first channel and at least one second channel are stored (e.g., by the network side) in a table or a database. In one embodiment, the first network node is interfered with by the second network node. In other words, the distance between the first network node and the second network node is less than the interference distance of the second network node. For example, the signal of the second network node may leak into the communication coverage area of the first network node (e.g., the signal is detected in the communication coverage area). In one embodiment, if the first network node and the second network node operate in a channel, and the distance between the first network node and the second network node is less than the reuse distance of the channel, the first network node is interfered with by the second network node. That is, co-channel interference occurs between the two network nodes. In this case, the interference distance of the second network node operating in the channel is equal to the reuse distance of the channel.

[0030] In one embodiment, at least one policy includes high-interference-first, low-(candidate)channel-first, large-transmission-amount-first, maximize-throughput-first, maximize-network-length-first, or a combination of the above-mentioned policies. In one embodiment, at least one policy is determined (e.g., configured) by the network side. In one embodiment, according to at least one policy, an instruction for determining that a first priority order is lower than a second priority order includes that if (e.g., when) a first interference received by a first network node is less than a second interference received by a second network node, it is determined that the first priority order is lower than the second priority order. In one embodiment, the first interference and the second interference are measured and reported by the first network node and the second network node respectively. In one embodiment, the network side obtains (e.g., measures) the first interference and the second interference.

[0031] In one embodiment, according to at least one policy, an instruction for determining that a first priority order is lower than a second priority order includes that if (e.g., when) a first transmission amount of a first network node is less than a second transmission amount of a second network node, it is determined that the first priority order is lower than the second priority order. In one embodiment, according to at least one policy, an instruction for determining that a first priority order is lower than a second priority order includes that if (e.g., when) a first quantity of at least one first channel is greater than a second quantity of at least one second channel, it is determined that the first priority order is lower than the second priority order.

[0032] In one embodiment, at least one first channel and at least one second channel do not include at least one currently allocated channel of any network node (e.g., the first network node, the second network node). In other words, at least one currently allocated channel is not a candidate channel for any network node (e.g., the first network node, the second network node). In one embodiment, before obtaining at least one first channel and at least one second channel, the network side clears (e.g., deallocates, releases) at least one currently allocated channel of the first network node. In one embodiment, before obtaining at least one first channel and at least one second channel, the network side clears (e.g., deallocates, releases) at least one currently allocated channel of the second network node. That is to say, before selecting a (new) allocated channel for a network node, the currently allocated channel of the network node is cleared.

[0033] In one embodiment, before selecting at least one second allocated channel, the network side selects at least one second available channel from at least one second channel. In one embodiment, if the second priority order (determined) is the highest in the priority order of the network nodes, the network side selects all of the at least one second channel as at least one second available channel. In one embodiment, the network side selects at least one second allocated channel from at least one second available channel. In one embodiment, the network side selects all of the at least one second available channel as at least one second allocated channel.

[0034] In one embodiment, before selecting at least one first available channel, the network side allocates at least one second allocated channel to a second network node. In one embodiment, when allocating at least one first allocated channel to a first network node, the network side allocates at least one second allocated channel to a second network node.

[0035] In one embodiment, the instruction to select at least one first available channel from at least one first channel according to at least one second allocated channel includes selecting at least one first channel that is not at least one second allocated channel. That is, the channel allocated to the network node with a higher priority order (determined) is not available for the network node with a lower priority order. In one embodiment, the instruction to select at least one first available channel from at least one first channel according to at least one second allocated channel includes selecting at least one first channel that is not at least one second allocated channel if the first network node is interfered with by the second network node. In one embodiment, the instruction to select at least one first available channel from at least one first channel according to at least one second allocated channel includes selecting at least one first channel that is not at least one second allocated channel if each reuse distance in at least one reuse distance of at least one second allocated channel is greater than the distance between the first network node and the second network node.

[0036] In one embodiment, the instruction to select at least one first available channel from at least one first channel according to at least one second allocated channel includes selecting all of the at least one first channel if all of the at least one first channels are not the at least one second allocated channel. That is, if all of the at least one first channels and the at least one second allocated channel do not overlap, all of the at least one first channels are available for the first network node. In one embodiment, the instruction to select at least one first available channel from at least one first channel according to at least one second allocated channel includes selecting all of the at least one first channel if the first network node and the second network node do not interfere with each other. In one embodiment, the instruction to select at least one first available channel from at least one first channel according to at least one second allocated channel includes selecting all of the at least one first channel if each reuse distance in at least one reuse distance of the at least one second allocated channel is less than the distance between the first network node and the second network node. In one embodiment, if at least one of the at least one first channels is not the at least one second allocated channel, the network side successfully selects at least one first available channel from the at least one first channel. That is, if the at least one first channel and the at least one second allocated channel partially overlap or do not overlap, the at least one first available channel is not empty.

[0037] In one embodiment, if all of the at least one first channels are the at least one second allocated channel, the network side does not successfully select at least one first available channel from the at least one first channel. That is, if all of the at least one first channels are allocated to a network node with a higher priority (such as the second network node), none of the at least one first channels are available for the first network node. In one embodiment, if the network side does not successfully select at least one available channel from the at least one first channel, through a configuration, the network side reports to the first network node that there are no available channels. In one embodiment, if the network side does not successfully select at least one first available channel, the network side records and escalates an event that there are no available channels. In one embodiment, if the network side does not successfully select at least one first available channel, the network side stops (such as pauses) or revokes the channel allocation for the first network node.

[0038] In one embodiment, the priority order of at least one first allocated channel among at least one first available channel is higher than that of the remaining first available channels among at least one first available channel. In one embodiment, at least one first allocated channel has better channel quality. The channel quality is measured according to the signal-to-noise ratio (SNR). In one embodiment, the interference received by at least one first allocated channel is lower than that received by the remaining first available channels among at least one first available channel, or lower than a threshold. In one embodiment, at least one first allocated channel is not allocated to a network node with a higher priority order (such as a second network node).

[0039] In one embodiment, the network side selects all at least one first available channel as at least one first allocated channel. That is, all at least one first available channel is allocated to the first network node.

[0040] Figure 4 This is a flowchart of process 40 in an embodiment of the present invention. Process 40 can be used by a network side to handle channel allocation for multiple network nodes. Process 40 can be compiled into program code 214, which includes the following steps:

[0041] Step 400: Start.

[0042] Step 402: Obtain at least one first channel of a first network node, at least one second channel of a second network node, and at least one third channel of a third network node.

[0043] Step 404: According to at least one policy, determine that the priority order of these network nodes from high to low is a third priority order of the third network node, a second priority order of the second network node, and a first priority order of the first network node.

[0044] Step 406: After selecting at least one third allocated channel of the third network node from the at least one third channel, select at least one second available channel from the at least one second channel according to the at least one third allocated channel.

[0045] Step 408: If the network side successfully selects the at least one second available channel from the at least one second channel, select at least one second allocated channel from the at least one second available channel.

[0046] Step 410: After selecting the at least one second allocated channel, select at least one first available channel from the at least one first channel according to the at least one second allocated channel and the at least one third allocated channel.

[0047] Step 412: If the network side successfully selects the at least one first available channel from the at least one first channel, select at least one first allocated channel from the at least one first available channel.

[0048] Step 414: Allocate the at least one first allocated channel to the first network node.

[0049] Step 416: End.

[0050] According to process 40, the network side (such as a network entity, a central server) obtains (such as determines, infers) at least one first (candidate) channel of a first network node (such as an access point, a cellular phone), at least one second (candidate) channel of a second network node (such as an access point, a cellular phone), and at least one third (candidate) channel of a third network node (such as an access point, a cellular phone). According to (such as based on) at least one (priority order) policy, the network side determines that the priority order of the network nodes from high to low is the third priority order of the third network node, the second priority order of the second network node, and the first priority order of the first network node. After selecting at least one third allocated channel of the third network node from at least one third channel, according to the at least one third allocated channel, the network side selects at least one second available channel from at least one second channel. If (such as afterwards) the network side successfully selects at least one second available channel from at least one second channel, the network side selects at least one second allocated channel from at least one second available channel. After selecting at least one second allocated channel, according to the at least one second allocated channel and the at least one third allocated channel, the network side selects at least one first available channel from at least one first channel. If (such as afterwards) the network side successfully selects at least one first available channel from at least one first channel, the network side selects at least one first allocated channel from at least one first available channel. Then, the network side allocates the at least one first allocated channel to the first network node. That is to say, after the allocated channels of the network nodes with higher priority orders are selected, the allocated channels of the network nodes with lower priority orders are selected. In other words, the present invention selects the allocated channels of the network nodes in descending order of the priority orders of the network nodes. Therefore, the problems of channel selection and allocation / reallocation of multiple network nodes can be solved.

[0051] The implementation manner of process 40 is not limited to the above. The statements and embodiments for process 30 can be applied to process 40, which will not be elaborated here.

[0052] Figure 5 It is a schematic diagram of channel selection and allocation according to an embodiment of the present invention. As Figure 5As shown, the railway transportation system includes network entities (such as a central server) and three access points AP1 to AP3. The access points AP1 to AP3 are respectively deployed at three stations ST1 to ST3. The network entity and the access points AP1 to AP3 are respectively used to represent the network side and network nodes to simplify the description of the above embodiments. The network entity is connected to the access points AP1 to AP3 (not shown in Figure 5 ), and processes the resource (such as channel) allocation for the access points AP1 to AP3. The two-way arrows between the access points represent the interference between the access points. That is, the access points AP1 to AP2 interfere with each other, but the access points AP1 and AP3 do not interfere with each other.

[0053] The access points AP1 to AP2 can request to change the channel (such as the currently allocated channel). The access points AP1 to AP2 can respectively update the candidate channels of the access points AP1 to AP2 periodically. The candidate channels are stored in a table by the network entity. The network entity obtains the candidate channels of the access point AP1 as channels CH1 to CH3 and the candidate channels of the access point AP2 as channels CH1 and CH3 from the table. In this embodiment, the access point AP2 has a higher priority, and the access point AP1 has a lower priority.

[0054] Since the channels CH1 and CH3 are available for the access point AP2, the network entity selects the channels CH1 and CH3 from the candidate channels of the access point AP2. In an embodiment, the channel CH3 has better channel quality or less interference. Therefore, the network entity allocates the channel CH3 to the access point AP2.

[0055] After selecting the channel CH3 to be allocated to the access point AP2, the network entity starts to select the available channels of the access point AP1 from the candidate channels of the access point AP1. Since the channel CH3 is the allocated channel of the access point AP2 and is not available for the access point AP1, the network entity selects the channels CH1 to CH2 for the access point AP1. In an embodiment, the channel CH2 has better channel quality or less interference. Therefore, the network entity allocates the channel CH2 to the access point AP1.

[0056] According to the above, the network entity selects the allocated channels of the access points AP1 to AP2 in descending order of the priorities of the access points AP1 to AP2. Therefore, the access points AP1 to AP2 can communicate with vehicles (such as trains) (not shown in Figure 5 ) with better performance.

[0057] Figure 6 It is a schematic diagram of channel selection and allocation according to an embodiment of the present invention. As Figure 6As shown, the railway transportation system includes network entities (such as a central server) and five access points AP1 to AP5. The access points AP1 to AP5 are respectively deployed at five stations ST1 to ST5. The network entity and the access points AP1 to AP5 are respectively used to represent the network side and network nodes to simplify the description of the above embodiments. The network entity is connected to (not shown in Figure 6 the) access points AP1 to AP5 and processes the allocation of resources (such as channels) for the access points AP1 to AP5. The two-way arrows between the access points represent the interference between the access points. That is, the access point AP3 is interfered by three access points AP2, AP4, and AP5. The access point AP1 is interfered by one access point AP2.

[0058] The access points AP1 to AP3 can request to change the channel (such as the currently allocated channel). The access points AP1 to AP3 can respectively update the candidate channels of the access points AP1 to AP3 periodically. The candidate channels are stored in a table by the network entity. The network entity obtains the candidate channels of the access point AP1 as channels CH2 to CH3 from the table, the candidate channels of the access point AP2 as channels CH1 to CH2, and the candidate channels of the access point AP3 as channels CH1, CH3. In this embodiment, the priority order of the access points AP1 to AP3 from high to low is the third priority order of the access point AP3, the second priority order of the access point AP2, and the first priority order of the access point AP1.

[0059] Since channels CH1, CH3 can be used for the access point AP3, the network entity selects channels CH1, CH3 from the candidate channels of the access point AP3. In one embodiment, the channel CH3 has better channel quality or is less interfered. Therefore, the network entity allocates the channel CH3 to the access point AP3.

[0060] After selecting the channel CH3 to be allocated to the access point AP3, the network entity starts to select the available channels of the access point AP2 from the candidate channels of the access point AP2. Since channels CH1 to CH2 can be used for the access point AP2, the network entity selects channels CH1 to CH2. In one embodiment, the channel CH2 has better channel quality or is less interfered. Therefore, the network entity allocates the channel CH2 to the access point AP2.

[0061] After selecting the channels CH2 to CH3 to be respectively allocated to the access points AP2 to AP3, the network entity starts to select the available channels of the access point AP1 from the candidate channels of the access point AP1.

[0062] Since access points AP1 and AP3 do not interfere with each other, access points AP1 and AP3 can use the same channel, i.e., channel CH3. Since channel CH2 is the channel allocated to access point AP2 and is not available for access point AP1, the network entity selects channel CH3 as the available channel for access point AP1. Then, the network entity allocates channel CH3 to access point AP1.

[0063] As described above, the network entity selects the channels allocated to access points AP1 to AP3 in descending order of the priority order of access points AP1 to AP3. Therefore, access points AP1 to AP3 can communicate with a vehicle (e.g., a train) (not shown in Figure 6 ) with better performance.

[0064] Figure 7 It is a schematic diagram of channel selection and allocation according to an embodiment of the present invention. As Figure 7 shown, the railway transportation system includes a network entity (e.g., a central server) and four access points AP1 to AP4. Access points AP1 to AP4 are respectively deployed at four stations ST1 to ST4. The network entity and access points AP1 to AP4 are respectively used to represent the network side and network nodes to simplify the description of the above embodiment. The network entity is connected to access points AP1 to AP4 (not shown in Figure 7 ) and processes the allocation of resources (e.g., channels) for access points AP1 to AP4. The two-way arrows between access points represent the interference between access points. That is, the interference received by access points forms a 4-node complete graph.

[0065] Access point AP4 can request to change the channel (e.g., the currently allocated channel). In this embodiment, the network entity can also decide to change the channels of access points AP2 to AP4 (e.g., the currently allocated channels) simultaneously. The network entity obtains the candidate channels for access point AP1 as channels CH1, CH3 to CH4, the candidate channels for access point AP2 as channels CH3 to CH4, the candidate channels for access point AP3 as channels CH2 to CH3, and the candidate channels for access point AP4 as channels CH2 and CH4. In this embodiment, the priority order of access points AP1 to AP4 from high to low is the fourth priority order of access point AP4, the third priority order of access point AP3, the second priority order of access point AP2, and the first priority order of access point AP1.

[0066] Since channels CH2 and CH4 are available for access point AP4, the network entity selects channels CH2 and CH4 from the candidate channels of access point AP4. In one embodiment, channel CH4 has better channel quality or is less interfered with. Therefore, the network entity allocates channel CH4 to access point AP4.

[0067] After selecting the channel CH4 to be allocated to the access point AP4, the network entity starts to select an available channel for the access point AP3 from the candidate channels of the access point AP3. Since the channels CH2 to CH3 are available for the access point AP3, the network entity selects the channels CH2 to CH3. In one embodiment, the channel CH3 has better channel quality or is less interfered with. Therefore, the network entity allocates the channel CH3 to the access point AP3.

[0068] After selecting the channel CH3 to be allocated to the access point AP3, the network entity starts to select an available channel for the access point AP2 from the candidate channels of the access point AP2. Since the channels CH3 to CH4 are the channels allocated to the access points AP3 to AP4, the channels CH3 to CH4 are not available for the access point AP2. Therefore, the network entity fails to select an available channel for the access point AP2. The network entity reports to the access point AP2 that there is no available channel.

[0069] After performing the channel allocation for the access point AP2, the network entity starts to select an available channel for the access point AP1 from the candidate channels of the access point AP1. Since the channel CH1 is available for the access point AP1, the network entity selects the channel CH1. Therefore, the network entity allocates the channel CH1 to the access point AP1.

[0070] According to the above, the network entity selects the channels allocated to the access points AP1, AP3 to AP4 in descending order of the priority of the access points AP1, AP3 to AP4. Therefore, the access points AP1, AP3 to AP4 can communicate with a vehicle (such as a train) (not shown in Figure 7 ) with better performance. At the same time, the access point AP2 stops communicating with the vehicle.

[0071] Figure 8 It is a schematic diagram of channel selection and allocation according to an embodiment of the present invention. As Figure 8 shown, the wireless communication system includes a network entity (such as a central server) and five cells Cell1 to Cell5 with similar cellular radii. The network entity and the cells Cell1 to Cell5 are respectively used to represent the network side and the network nodes to simplify the description of the above embodiment. The network entity is connected to the cells Cell1 to Cell5 (not shown in Figure 8 ) and processes the allocation of resources (such as channels) for the cells Cell1 to Cell5.

[0072] The cells Cell1 to Cell3 can request to change the channel (such as the currently allocated channel). The network entity obtains the candidate channels for the cell Cell1 as the channels CH2 to CH3, the candidate channels for the cell Cell2 as the channels CH1 to CH2, and the candidate channels for the cell Cell3 as the channels CH1, CH3.

[0073] In this embodiment, the priority order of Cells Cell1 to Cell3 from high to low is the third priority order of Cell3, the second priority order of Cell2, and the first priority order of Cell1. In addition, the reuse distance of Channel CH2 is almost twice the cell radius, and the reuse distance of Channel CH3 can be assumed to be equal to the cell radius.

[0074] Since Channels CH1 and CH3 can be used for Cell3, the network entity selects Channels CH1 and CH3 from the candidate channels of Cell3. In one embodiment, Channel CH3 has better channel quality or less interference. Therefore, the network entity allocates Channel CH3 to Cell3.

[0075] After selecting Channel CH3 to be allocated to Cell3, the network entity begins to select available channels for Cell2 from the candidate channels of Cell2. Since Channels CH1 to CH2 can be used for Cell2, the network entity selects Channels CH1 to CH2. In one embodiment, Channel CH2 has better channel quality or less interference. Therefore, the network entity allocates Channel CH2 to Cell2.

[0076] After selecting Channels CH2 to CH3 to be allocated to Cells Cell2 to Cell3 respectively, the network entity begins to select available channels for Cell1 from the candidate channels of Cell1. Since Channels CH1 to CH2 can be used for Cell2, the network entity selects Channels CH1 to CH2.

[0077] Since the distance between Cells Cell1 and Cell3 is greater than the reuse distance of Channel CH3, Channel CH3 can be used for Cell1. Correspondingly, the network entity selects Channel CH3 and allocates Channel CH3 to Cell1.

[0078] According to the above, the network entity selects the allocated channels for Cells Cell1 to Cell3 in descending order of the priority order of Cells Cell1 to Cell3. Therefore, Cells Cell1 to Cell3 can communicate with a vehicle (such as a train) (not shown in Figure 8 with better performance.

[0079] It should be noted that although the above-described embodiments are described according to Process 30 to clearly illustrate the operation of the corresponding process. Those skilled in the art can combine, modify, or vary the above-described embodiments according to system requirements and / or design considerations.

[0080] The "determine" described in the above operations may be replaced with operations such as "compute", "calculate", "obtain", "generate", "output", "use", "choose / select", "decide", etc. The "according to" in the above operations may be replaced with "in response to". The "associated with" used in the above description may be replaced with "of" or "corresponding to". The "via" used in the above description may be replaced with "on", "in", or "at".

[0081] Those skilled in the art can combine, modify, or vary the above-described embodiments in accordance with the spirit of the present invention, and are not limited thereto. The foregoing statements, steps, and / or processes (including the proposed steps) can be implemented by a device, which can be hardware, software, firmware (a combination of a hardware device and computer instructions and data, and the computer instructions and data belong to read-only software on the hardware device), an electronic system, or a combination of the above devices, where the device can be the communication device 20.

[0082] The hardware can be an analog circuit, a digital circuit, and / or a hybrid circuit. For example, the hardware can be an application-specific integrated circuit, a field programmable gate array (FPGA), a programmable logic device, coupled hardware components, or a combination of the above hardware. In other embodiments, the hardware can be a general-purpose processor, a microprocessor, a controller, a digital signal processor (DSP), or a combination of the above hardware.

[0083] Software can be a combination of program codes, a combination of instructions, and / or a combination of functions, which is stored in a storage unit, such as a computer-readable medium. For example, the computer-readable medium can be a user identification module, a read-only memory, a flash memory, a random access memory, a CD-ROM / DVD-ROM / BD-ROM, a magnetic tape, a hard disk, an optical data storage device, a non-volatile storage unit, or a combination of the above components. The computer-readable medium (such as the storage unit) can be coupled to at least one processor in a built-in manner (such as a processor integrated with the computer-readable medium) or in an external manner (such as a processor independent of the computer-readable medium). The at least one processor can include one or more modules to execute the software stored in the computer-readable medium. The combination of program codes, the combination of instructions, and / or the combination of functions can enable at least one processor, one or more modules, hardware, and / or an electronic system to execute relevant steps.

[0084] The electronic system can be a system on chip (SoC), a system in package (SiP), a computer on module (CoM), a computer program product, a device, a mobile phone, a laptop computer, a tablet computer, an e-book, a portable computer system, and a communication device 20.

[0085] According to the above, the present invention provides an apparatus and a method for effectively processing channel allocation for multiple network nodes. According to the channels allocated to network nodes with a higher priority order, the channels allocated to network nodes with a lower priority order are selected. Therefore, the problem of channel selection and allocation / reallocation for multiple network nodes is solved.

[0086] The above is only the preferred embodiment of the present invention, and all equivalent changes and modifications made according to the scope of the claims of the present invention shall fall within the scope of the present invention.

[0087]

Symbol Explanation

[0088] 10: Wireless communication system

[0089] 20: Communication device

[0090] 200: At least one processing circuit

[0091] 210: At least one storage device

[0092] 214: Program code

[0093] 220: At least one communication interface device

[0094] 30, 40: Processes

[0095] 300, 302, 304, 306, 308, 310, 312, 400, 402, 404, 406, 408, 410, 412, 414, 416: Steps

[0096] ST1, ST2, ST3, ST4, ST5: Stations

[0097] AP1, AP2, AP3, AP4, AP5: Access points

[0098] CH1, CH2, CH3, CH4: Channels

[0099] Cell1, Cell2, Cell3, Cell4: Cells

Claims

1. A method for processing channel allocation for multiple network nodes in a network side, the method comprising: Obtaining at least one first channel of a first network node and at least one second channel of a second network node; Determining that a first priority order of the first network node is lower than a second priority order of the second network node according to at least one of interference, traffic volume, and the number of channels; After selecting at least one second allocated channel of the second network node, according to the at least one second allocated channel and the interference between the first network node and the second network node, Selecting at least one first available channel from the at least one first channel; If the network side successfully selects the at least one first available channel from the at least one first channel, selecting at least one first allocated channel from the at least one first available channel; and Allocating the at least one first allocated channel to the first network node.

2. The method according to claim 1, wherein the step of determining that the first priority order is lower than the second priority order according to at least one of interference, traffic volume, and the number of channels comprises: Determining that the first priority order is lower than the second priority order if a first interference received by the first network node is less than a second interference received by the second network node.

3. The method according to claim 1, wherein the step of determining that the first priority order is lower than the second priority order according to at least one of interference, traffic volume, and the number of channels comprises: Determining that the first priority order is lower than the second priority order if a first traffic volume of the first network node is less than a second traffic volume of the second network node.

4. The method according to claim 1, wherein the step of determining that the first priority order is lower than the second priority order according to at least one of interference, traffic volume, and the number of channels comprises: Determining that the first priority order is lower than the second priority order if a first number of the at least one first channel is greater than a second number of the at least one second channel.

5. The method according to claim 1, further comprising: Clearing at least one allocated channel of the first network node before obtaining the at least one first channel.

6. The method according to claim 1, wherein the step of selecting the at least one first available channel from the at least one first channel according to the at least one second allocated channel and the interference between the first network node and the second network node comprises: If the first network node is interfered by the second network node, selecting the at least one first channel that is not the at least one second allocated channel.

7. The method according to claim 1, wherein the step of selecting the at least one first available channel from the at least one first channel according to the at least one second allocated channel and the interference between the first network node and the second network node comprises: If all of the at least one first channel is not the at least one second allocated channel, selecting all of the at least one first channel.

8. The method according to claim 1, wherein the step of selecting the at least one first available channel from the at least one first channel according to the at least one second allocated channel and the interference between the first network node and the second network node comprises: If the first network node and the second network node do not interfere with each other, select all of the at least one first channel.

9. The method according to claim 1, further comprising: If the network side fails to select the at least one available channel from the at least one first channel, report to the first network node that there is no available channel through a configuration.

10. The method according to claim 1, wherein at least one priority order of at least one first allocated channel among the at least one first available channels is higher than at least one priority order of the remaining first available channels among the at least one first available channels.

11. A processor for processing channel allocation for multiple network nodes, the processor comprising: A first module for enabling the processor to obtain at least one first channel of a first network node and at least one second channel of a second network node; A second module for enabling the processor to determine that a first priority order of the first network node is lower than a second priority order of the second network node according to at least one of interference, traffic volume, and the number of channels; A third module for enabling the processor to select at least one first available channel from the at least one first channel according to the at least one second allocated channel and the interference between the first network node and the second network node after selecting at least one second allocated channel of the second network node; A fourth module for enabling the processor to select at least one first allocated channel from the at least one first available channel if the at least one first available channel is successfully selected from the at least one first channel; And A fifth module for enabling the processor to allocate the at least one first allocated channel to the first network node.

12. The processor according to claim 11, wherein the step of determining that the first priority order is lower than the second priority order according to at least one of interference, traffic volume, and the number of channels comprises: If a first interference received by the first network node is less than a second interference received by the second network node, determine that the first priority order is lower than the second priority order.

13. The processor according to claim 11, wherein the step of determining that the first priority order is lower than the second priority order according to at least one of interference, traffic volume, and the number of channels comprises: If a first traffic volume of the first network node is less than a second traffic volume of the second network node, determine that the first priority order is lower than the second priority order.

14. The processor according to claim 11, wherein the step of determining that the first priority order is lower than the second priority order according to at least one of interference, traffic volume, and the number of channels comprises: if a first number of the at least one first channel is greater than a second number of the at least one second channel, determine that the first priority order is lower than the second priority order.

15. The processor according to claim 11, further comprising: A sixth module for enabling the processor to clear at least one allocated channel of the first network node before obtaining the at least one first channel.

16. The processor according to claim 11, wherein the step of selecting the at least one first available channel from the at least one first channel according to the at least one second allocated channel and the interference between the first network node and the second network node comprises: If the first network node is interfered with by the second network node, selecting the at least one first channel that is not the at least one second allocated channel.

17. The processor according to claim 11, wherein the step of selecting the at least one first available channel from the at least one first channel according to the at least one second allocated channel and the interference between the first network node and the second network node comprises: If all of the at least one first channel is not the at least one second allocated channel, selecting all of the at least one first channel.

18. The processor according to claim 11, wherein the step of selecting the at least one first available channel from the at least one first channel according to the at least one second allocated channel and the interference between the first network node and the second network node comprises: If the first network node and the second network node do not interfere with each other, selecting all of the at least one first channel.

19. The processor according to claim 11, further comprising: A sixth module, configured to cause the processor to report to the first network node that there is no available channel through a configuration if the at least one first available channel is not successfully selected from the at least one first channel.

20. The processor according to claim 11, wherein at least one priority order of at least one first allocated channel in the at least one first available channel is higher than at least one priority order of the remaining first available channels in the at least one first available channel.

Images