CN114339771A - Multichannel user equalization access method based on preallocation - Google Patents
Multichannel user equalization access method based on preallocation Download PDFInfo
- Publication number
- CN114339771A CN114339771A CN202210001731.2A CN202210001731A CN114339771A CN 114339771 A CN114339771 A CN 114339771A CN 202210001731 A CN202210001731 A CN 202210001731A CN 114339771 A CN114339771 A CN 114339771A
- Authority
- CN
- China
- Prior art keywords
- channel
- user
- node
- user node
- channels
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000012546 transfer Methods 0.000 claims abstract description 8
- 238000005516 engineering process Methods 0.000 claims description 3
- 230000007547 defect Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Time-Division Multiplex Systems (AREA)
Abstract
The invention discloses a multichannel user equalization access method based on preallocation, the thought of the invention is that a central node preallocates channels on the channels according to the number of channels required by each user node and a working channel set, selects a channel to be equalized and a target channel to transfer the channels to the user nodes when the adjustment condition is met, selects the channel with the most total number of the accessed user nodes, transfers the user nodes which are accessed in advance on the channel and meet the channel transfer condition, gradually adjusts the channels with the excessive total number of the user nodes, continuously optimizes the preallocation result, and finally realizes the final access on each channel. The invention has the advantages of high success rate of user access, more balanced user access of each channel and high overall utilization rate of the channel.
Description
Technical Field
The invention belongs to the technical field of communication, and further relates to a multichannel user balanced access method based on pre-allocation in the technical field of star-type wired access networks. The invention can be used for an access network adopting a multi-channel binding technology, and can efficiently distribute accessible channels for users to be accessed to the network.
Background
In a wired access network based on a shared medium, a star topology consisting of one central node and several user nodes is often used. In such a network structure, a multi-channel bonding technique is often used for communication, so that before a user node communicates with a central node, the central node needs to perform channel negotiation with a user according to the number of channels to be accessed by the user node and available channels, so as to allocate an accessed channel to the user node.
In existing access networks using multi-channel bonding technology, a central node generally uses a channel polling allocation method to allocate an access channel to each user node when performing channel negotiation. In this method, the central node needs to poll all channels for the user node to be accessed in sequence until the number of channels needed by the user node to be accessed is met, and each polling needs to judge whether an accessible condition is met, where the condition is whether the user node can operate on the channel and whether the current channel capacity has reached an upper limit. The disadvantages of this approach are two-fold: first, when the number of users and the number of channels are large, the allocation scheme only ensures that the user nodes in the front of the access sequence have higher probability to meet the access condition because of the polling mode, and the user nodes in the back of the access sequence cannot access the network for communication because of no available channel, thereby reducing the user access success rate of the whole system. Secondly, even if channel allocation to all users is completed by adopting the method, the method does not consider the balance of user access on each channel, and the situation that a large amount of congestion is caused on some channels due to excessive access users so as to cause overlarge transmission delay and the situation that the channel utilization rate is low due to small user access number on some channels also occurs in the actual transmission process.
The southeast university proposes a user access method of a base station in the patent document "a user access method of a base station" (application No. CN10310082326.9 application publication No. CN103200649A) applied by the university. The method comprises the following steps of user access: (1) initializing parameters, wherein the parameters comprise a set of active base stations, positions of the active base stations, a minimum rate request of the user and a distance from the user to each active base station; (2) calculating the load of the local cell of the active base station, and calculating the load from the user to each active base station; (3) selecting an active base station, and judging whether the user can access the active base station according to the load from the user to the active base station and the load of the local cell; (4) if the user can be accessed, accessing the user to the selected active base station; otherwise, an active base station is selected for judgment until the user accesses the active base station; (5) and deleting the user from the user set of the dormant base station. The method can be similar to the user access on the channel, and the implementation steps are simple, however, the method still has two defects: first, the method has a certain randomness when selecting an active base station, and therefore, it cannot be guaranteed that a user accesses the current base station optimally, and therefore, the access success rate of all users cannot be guaranteed. Secondly, when the user meets the access condition, the method directly selects to access the current active base station, and does not continuously judge the access condition of other base stations, so that the number of users accessed by each base station is unbalanced, and the utilization rate of network resources is low.
Disclosure of Invention
The invention aims to provide a multi-channel user balanced access method based on pre-allocation aiming at the defects of the prior art, and is used for solving the problems of low success rate of accessing a channel by a user, unbalanced user access of each channel and low overall utilization rate of the channel in the conventional user access method.
The idea of realizing the purpose of the invention is that the central node considers the required channel requirement and the operable channel set of the user node before finally accessing each user node on the channel, and performs channel pre-allocation according to the channel requirement and considers the channel capacity when selecting the channel, thereby satisfying the channel access requirement of each user node from the overall view and solving the problem of low success rate of accessing the channel by the user in the existing user access method. When each user node is allocated with a final access channel, the invention continuously optimizes the pre-allocation result, selects the channel to be equalized and the target channel to perform channel transfer on the user node when the adjustment condition is met, selects the channel with the largest total number of the access user nodes, performs channel transfer on the user node which is pre-accessed on the channel and meets the channel transfer condition, and gradually adjusts the channels with the excessive total number of the user nodes, thereby solving the problems of unbalanced access of each channel user and low overall utilization rate of the channel.
The technical scheme of the invention comprises the following steps:
step 1, a central node judges whether the number of channels required by each user node to be distributed is equal to the number of operable channels, if so, the central node takes the user node as a final distributed user node and then executes step 2, otherwise, the central node takes the user node as a pre-distributed user node and then executes step 3;
step 2, the central node performs final distribution on the final distribution user nodes:
the central node performs final access to the final distribution user node on a workable channel of the final distribution user node;
step 3, the central node pre-allocates the pre-allocated user nodes:
the central node performs pre-access to the pre-distributed user nodes on the operable channels of the pre-distributed user nodes;
step 4, the central node judges whether the total number of the user nodes finally accessed on each channel is larger than the maximum user capacity of the channel, if so, the central node informs all the user nodes which do not finish the distribution to quit the distribution, otherwise, the step 5 is executed;
step 5, the central node judges whether a user node accessed in advance exists on the channel, if so, the step 6 is executed, otherwise, the step 11 is executed;
step 6, selecting a channel to be equalized:
(6a) will satisfy
All channels of the condition constitute a set of alternative channels to be equalized, where max denotes takingMaximum operation, {. denotes a set of optional elements, aiRepresenting the total number of previously accessed user nodes on the ith channel of all accessible channels, biIndicates the total number of user nodes, U, finally accessed on the ith channel of all the accessible channelsmax_iRepresents the maximum user capacity of the ith channel of all the accessible channels;
(6b) judging whether the alternative channel set to be equalized only has one alternative channel to be equalized, if so, taking the channel as a channel to be equalized and then executing the step 7, otherwise, taking the channel with the largest number of user nodes which are accessed in advance in the alternative channel set to be equalized as the channel to be equalized and then executing the step 7;
step 7, selecting a user node to be transferred:
(7a) satisfying min { d ] in pre-allocated user nodes on the channel to be equalizedj-njAll user nodes of the condition form a user node set to be alternatively transferred, wherein min represents minimum value operation, and djRepresenting the number of channels available, n, for the jth pre-assigned user node on the channel to be equalizedjRepresenting the required channel number of the jth pre-distributed user node on the channel to be equalized;
(7b) judging whether the alternative user node set to be transferred has only one alternative user node to be transferred, if so, taking the user node as the user node to be transferred and then executing the step 8, otherwise, selecting one user node from the alternative user node set to be transferred as the user node to be transferred according to an optional strategy and then executing the step 8;
step 8, selecting a target channel:
(8a) the operable channels of the user node to be transferred are not included in the channels to be equalized selected in step 6
The conditional channels constitute a candidate target channel set, wherein akRepresenting the total number of previously accessed user nodes on the kth operable channel of the user node to be transferred, bkIndicating final access on the kth operable channel of the user node to be transferredTotal number of user nodes, Umax_kRepresenting the maximum user capacity of the k operable channel of the user node to be transferred;
(8b) randomly selecting one channel from the candidate target channel set as a target channel;
step 9, accessing the user node to be transferred:
(9a) the central node performs final access to the user node to be transferred on the target channel;
(9b) the user node to be transferred deletes the target channel from the working channel of the user node, and reduces the total number of the required channels by 1;
(9c) judging whether the number of channels required by the user node to be transferred is 0, if so, executing the step 10, otherwise, returning to the step 4;
step 10, the central node deletes the user node to be transferred from the channel accessed in advance, modifies the user node into the final distribution user node and returns to the step 4;
and step 11, all the user nodes communicate with the central node on the finally accessed channel.
Compared with the prior art, the invention has the following advantages:
first, the central node of the present invention pre-allocates all accessible channels according to the number of channels required by the user node and the operable channel set, and simultaneously considers the capacity of the channel when selecting the channel, thereby satisfying the channel access requirement of each user node from the overall view, overcoming the defect of low success rate of accessing the channel by the user in the prior art, and improving the success rate of accessing the required channel by the user node.
Secondly, when each user node is allocated with a final access channel, the invention continuously optimizes the pre-allocation result, selects the channel to be equalized and the target channel to perform channel transfer on the user nodes which are accessed into the channel in advance when the adjustment condition is met, and gradually adjusts the channels with excessive user nodes, thereby overcoming the defects of unbalanced user access of each channel and low overall utilization rate of the channel in the prior art, and improving the overall utilization rate of the channel while realizing the equalized access of the user nodes of each channel.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a diagram of channels required by a user node and channels that can be operated according to an embodiment of the present invention;
fig. 3 is a channel diagram finally accessed by a user node in the embodiment of the present invention.
Detailed Description
The invention is further described with reference to the following figures and examples.
The implementation steps of the present invention are further described with reference to fig. 1.
Step 1, the central node judges whether the number of channels required by each user node to be distributed is equal to the number of operable channels, if so, the central node takes the user node as a final distribution user node and then executes step 2, otherwise, the central node takes the user node as a pre-distribution user node and then executes step 3.
The embodiment of the invention is carried out in a star network with 1 central node, 3 channels and 5 user nodes to be distributed.
The channels required by the user node and the channels available for operation of the present invention are further described with reference to fig. 2.
In the embodiment of the invention, 3 channels are designed, namely a channel 1, a channel 2 and a channel 3, and the maximum user capacity of each channel is 3. In the embodiment of the invention, 5 user nodes to be distributed are designed, which are respectively a user node 1, a user node 2, a user node 3, a user node 4 and a user node 5. Each user node is connected with the operable channel through a dotted line, and the number of channels required by each user node is marked beside the user node. The number of channels required by the user node 1 is 2, and the channels which can work include a channel 1, a channel 2 and a channel 3. The number of channels required by the user node 2 is 1, and the channels which can work include a channel 1, a channel 2 and a channel 3. The number of channels required by the user node 3 is 1, and the operable channel is a channel 2. The number of channels required by the user node 4 is 3, and the channels which can work comprise a channel 1, a channel 2 and a channel 3; the number of channels required by the user node 5 is 2, and the operable channels include channel 1 and channel 2.
In the embodiment of the present invention, the user node 3, the user node 4, and the user node 5 are used as final allocation user nodes, and step 2 is executed. And step 3 is executed by taking the user node 1 and the user node 2 as pre-allocated user nodes.
And 2, the central node performs final distribution on the final distribution user nodes.
The central node performs final access to the final distribution user node on the operable channel of the final distribution user node.
In the embodiment of the invention, the user node 3 is finally accessed on the channel 2. Final access is made to user node 4 on channel 1, channel 2 and channel 3, respectively. Final access is made to user node 5 on channel 1 and channel 2, respectively.
Step 3, the central node pre-allocates the pre-allocated user nodes:
the central node performs pre-access to the pre-allocated user nodes on the operable channels of the pre-allocated user nodes.
In the embodiment of the invention, the user node 1 and the user node 2 are accessed in advance on the channel 1, the channel 2 and the channel 3 respectively.
And 4, the central node judges whether the total number of the user nodes finally accessed on each channel is larger than the maximum user capacity of the channel, if so, the central node informs all the user nodes which do not finish the distribution to quit the distribution, and if not, the step 5 is executed.
In the embodiment of the present invention, when step 4 is executed for the first time, the total number of user nodes finally accessed on channel 1 is 2, which are user node 4 and user node 5 respectively. The total number of the user nodes finally accessed on the channel 2 is 3, and the user nodes are respectively a user node 3, a user node 4 and a user node 5. The total number of the user nodes finally accessed on the channel 3 is 1, and only the user node 4 is accessed. Step 5 is executed because the total number of the user nodes finally accessed on each channel is not more than the maximum user capacity of the channel.
In the embodiment of the present invention, when step 4 is executed for the second time, the total number of user nodes finally accessed on channel 1 is 2, which are user node 4 and user node 5, respectively. The total number of the user nodes finally accessed on the channel 2 is 3, and the user nodes are respectively a user node 3, a user node 4 and a user node 5. The total number of the user nodes finally accessed on the channel 3 is 2, namely the user node 1 and the user node 4. Step 5 is executed because the total number of the user nodes finally accessed on each channel is not more than the maximum user capacity of the channel.
In the embodiment of the present invention, when step 4 is executed for the third time, the total number of user nodes finally accessed on the channel 1 is 3, which are the user node 1, the user node 4, and the user node 5. The total number of the user nodes finally accessed on the channel 2 is 3, and the user nodes are respectively a user node 3, a user node 4 and a user node 5. The total number of the user nodes finally accessed on the channel 3 is 2, and the user nodes are respectively the user node 1 and the user node 4. Step 5 is executed because the total number of the user nodes finally accessed on each channel is not more than the maximum user capacity of the channel.
In the embodiment of the present invention, when step 4 is executed for the fourth time, the total number of user nodes finally accessed on the channel 1 is 3, which are the user node 1, the user node 4, and the user node 5. The total number of the user nodes finally accessed on the channel 2 is 3, and the user nodes are respectively a user node 3, a user node 4 and a user node 5. The total number of the user nodes finally accessed on the channel 3 is 3, and the user nodes are respectively a user node 1, a user node 2 and a user node 4. Step 5 is executed because the total number of the user nodes finally accessed on each channel is not more than the maximum user capacity of the channel.
And 5, the central node judges whether a user node accessed in advance exists on the channel, if so, the step 6 is executed, otherwise, the step 11 is executed.
In the embodiment of the present invention, when step 5 is executed for the first time, two user nodes which are previously accessed are provided on the channel 1, and are respectively the user node 1 and the user node 2. There are two pre-accessed user nodes on the channel 2, which are user node 1 and user node 2 respectively. The channel 3 has two pre-accessed user nodes, which are the user node 1 and the user node respectively. Step 6 is performed because there are also previously accessed user nodes on the channel.
In the embodiment of the present invention, when step 5 is executed for the second time, there are two user nodes pre-accessed on the channel 1, which are the user node 1 and the user node 2 respectively. There are two pre-accessed user nodes on the channel 2, which are user node 1 and user node 2 respectively. Channel 3 has a previously accessed user node as user node 2. Step 6 is performed because there are also previously accessed user nodes on the channel.
In the embodiment of the present invention, when step 5 is executed for the third time, a user node that is accessed in advance on the channel 1 is the user node 2. A pre-accessed user node on the channel 2 is the user node 2. Channel 3 has a previously accessed user node as user node 2. Step 6 is performed because there are also previously accessed user nodes on the channel.
In the embodiment of the present invention, when step 5 is executed for the fourth time, there are 0 user nodes pre-accessed on channel 1, 0 user nodes pre-accessed on channel 2, and 0 user nodes pre-accessed on channel 3, and since there is no user node pre-accessed on all channels, step 11 is executed.
And 6, selecting a channel to be equalized.
Will satisfy
All channels of the condition constitute a set of alternative channels to be equalized.
And judging whether the alternative channel set to be equalized only has one alternative channel to be equalized, if so, taking the channel as a channel to be equalized and then executing the step 7, otherwise, taking the channel with the largest number of user nodes pre-accessed in the alternative channel set to be equalized as the channel to be equalized and then executing the step 7.
In the embodiment of the invention, when the step 6 is executed for the first time, the channel 1 is provided with two user nodes which are accessed in advance and two user nodes which are accessed finally, and the maximum user capacity of the channel 1 is 3, so that the method has the advantages that
There are two pre-accessed user nodes and three final accessed user nodes on channel 2, the maximum user capacity of channel 2 is 3, so
There are two pre-accessed user nodes and 1 final accessed user node on channel 3, the maximum user capacity of channel 3 is 3, so
Thus satisfying
The conditional channel is only the channel 2, and the candidate channel set to be equalized is only one channel 2, so that the step 7 is executed after the channel 2 is taken as the channel to be equalized.
In the embodiment of the present invention, when step 6 is executed for the second time, there are two pre-accessed user nodes and two final-accessed user nodes on channel 1, and the maximum user capacity of channel 1 is 3, so that
There are two pre-accessed user nodes and three final accessed user nodes on channel 2, the maximum user capacity of channel 2 is 3, so
There are one pre-accessed user node and two final accessed user nodes on channel 3, the maximum user capacity of channel 3 is 3, so
Thus satisfying
The conditional channel is only the channel 2, and the candidate channel set to be equalized is only one channel 2, so that the step 7 is executed after the channel 2 is taken as the channel to be equalized.
In the embodiment of the present invention, when step 6 is executed for the third time, there are one pre-accessed user node and three final-accessed user nodes on channel 1, and the maximum user capacity of channel 1 is 3, so that
The channel 2 is provided with a user node accessed in advance and three user nodes accessed finally, the maximum user capacity of the channel 2 is 3, so that
There are one pre-accessed user node and two final accessed user nodes on channel 3, the maximum user capacity of channel 3 is 3, so
Thus satisfying
The conditional channels include channel 1 and channel 2, so the alternative channels to be equalized are concentrated with channel 1 and channel 2, the number of the pre-accessed user nodes on the two channels is 1, and step 7 is executed after channel 1 is selected as the channel to be equalized.
And 7, selecting a user node to be transferred.
Satisfying min { d ] in pre-allocated user nodes on the channel to be equalizedj-njAnd all the user nodes of the condition form a user node set to be converted in an alternative mode.
And judging whether the alternative user node set to be transferred has only one alternative user node to be transferred, if so, taking the user node as the user node to be transferred and then executing the step 8, otherwise, selecting one user node from the alternative user node set to be transferred as the user node to be transferred according to an optional strategy and then executing the step 8.
In the embodiment of the invention, when step 7 is executed for the first time, the pre-allocated user nodes on the channel to be equalized comprise a user node 1 and a user node 2, the number of operable channels of the user node 1 is 3, and the number of required channels is 2, so that d1-n11. The number of channels available to the user node 2 is 3 and the number of channels required is 1, so d2-n22. Thus satisfying min { d }j-njThe user nodes of the condition are only user node 1,only one user node 1 is in the set of the alternative user nodes to be transferred, so step 8 is executed after the user node 1 is taken as the user node to be transferred.
In the embodiment of the invention, when step 7 is executed for the second time, the pre-allocated user nodes on the channel to be equalized comprise a user node 1 and a user node 2, the number of operable channels of the user node 1 is 2, and the number of required channels is 1, so that d1-n11. The number of channels available to the user node 2 is 3 and the number of channels required is 1, so d2-n22. Thus satisfying min { d }j-njThe user node of the condition only has the user node 1, and the alternative user node to be transferred only has one user node 1 in the set, so the step 8 is executed after the user node 1 is taken as the user node to be transferred.
In the embodiment of the invention, when step 7 is executed for the third time, the pre-allocated user node on the channel to be equalized is only the user node 2, so min { d } is satisfiedj-njThe user node of the condition only has the user node 2, and the alternative user node to be transferred only has one user node 2 in the set, so the step 8 is executed after the user node 2 is taken as the user node to be transferred.
Step 8, selecting a target channel.
The operable channels of the user node to be transferred are not included in the channels to be equalized selected in step 6
The channels of the condition constitute the set of candidate target channels.
One channel is randomly selected from the candidate target channel set as a target channel.
In the embodiment of the present invention, when step 8 is executed for the first time, the operable channels of the user node to be transferred are channel 1, channel 2 and channel 3, and the channel to be equalized is channel 2. Wherein, the channel 1 has two user nodes accessed in advance and two user nodes accessed finally, the maximum user capacity of the channel 1 is 3, so
With two preambles on channel 3The accessed user nodes and 1 user node finally accessed, the maximum user capacity of the channel 3 is 3, so
Thus satisfying
And the channel without the channel condition to be equalized is only the channel 3, and the alternative target channel set is only one channel 3, so the channel 3 is taken as the target channel, and the step 9 is executed.
In the embodiment of the present invention, when step 8 is executed for the second time, the channels that can work of the user node to be transferred are channel 1 and channel 2, and the channel to be equalized is channel 2. Thus satisfying
And the channel not including the channel condition to be equalized is only channel 1, and the candidate target channel set is only one channel 1, so that the channel 1 is taken as the target channel, and step 9 is executed.
In the embodiment of the present invention, when step 8 is executed for the third time, the operable channels of the user node to be transferred are channel 1, channel 2, and channel 3, and the channel to be equalized is channel 1. Wherein, the channel 2 is provided with a user node accessed in advance and three user nodes accessed finally, the maximum user capacity of the channel 2 is 3, so that
There are one pre-accessed user node and two final accessed user nodes on channel 3, the maximum user capacity of channel 3 is 3, so
Thus satisfying
And the channel without the channel condition to be equalized is only the channel 3, and the alternative target channel set is only one channel 3, so the channel 3 is taken as the target channel, and the step 9 is executed.
And 9, accessing the user node to be transferred.
And the central node performs final access on the user node to be transferred on the target channel.
The user node to be transferred deletes the target channel from the working channel set of the user node and reduces the total number of the required channels by 1.
And judging whether the number of channels required by the user node to be transferred is 0, if so, executing the step 10, otherwise, returning to the step 4.
In the embodiment of the present invention, when step 9 is executed for the first time, the user node 1 is finally accessed on the channel 3. The channel 3 is deleted from the operable channel set of the user node 1, and the total number of required channels of the user node 1 is subtracted by 1, the number of required channels of the user node 1 becomes 1, and the operable channels include the channel 1 and the channel 2. Since the user node to be transferred is user node 1, the number of channels required by the user node to be transferred is not equal to 0, and the process returns to step 4.
In the embodiment of the present invention, when step 9 is executed for the second time, the user node 1 is finally accessed on the channel 1. The channel 1 is deleted from the set of operable channels of the user node 1, and the total number of required channels of the user node 1 is subtracted by 1, and the number of required channels of the user node 1 becomes 0. Since the user node to be transferred is user node 1, the number of channels required is equal to 0, and step 10 is performed.
In the embodiment of the present invention, when step 9 is executed for the third time, the user node 2 is finally accessed on the channel 3. The channel 3 is deleted from the set of operable channels of the user node 2, and the total number of required channels of the user node 2 is reduced by 1, and the number of required channels of the user node 2 becomes 0. Since the user node to be transferred is user node 2, the number of channels required is equal to 0, and step 10 is performed.
And step 10, the central node deletes the user node to be transferred from the channel accessed in advance, modifies the user node into the final distribution user node and returns to the step 4.
In the embodiment of the present invention, when step 10 is executed for the first time, the central node deletes the user node 1 from the pre-accessed channel 2, modifies the user node 1 into the final allocated user node, and returns to step 4.
In the embodiment of the present invention, when step 10 is executed for the second time, the central node deletes the user node 2 from the channel 1 and the channel 2 that are accessed in advance, modifies the user node 2 into the final allocated user node, and returns to step 4.
And step 11, all the user nodes communicate with the central node on the finally accessed channel.
In the embodiment of the present invention, after the implementation according to the above steps is completed, the channel that each user finally accesses is as shown in fig. 3.
The above is a specific example of the present invention, and is not to be construed as limiting the invention in any way, and all modifications and variations that come within the spirit and scope of the invention are intended to be covered by the invention.
Claims (2)
1. A multi-channel user equalization access method based on pre-allocation is characterized in that in a star network adopting a multi-channel binding technology, a central node pre-allocates channels according to the number of channels required by user nodes and a working channel set, and performs channel allocation transfer on users on the pre-allocated channels; the method comprises the following specific steps:
step 1, a central node judges whether the number of channels required by each user node to be distributed is equal to the number of operable channels, if so, the central node takes the user node as a final distributed user node and then executes step 2, otherwise, the central node takes the user node as a pre-distributed user node and then executes step 3;
step 2, the central node performs final distribution on the final distribution user nodes:
the central node performs final access to the final distribution user node on a workable channel of the final distribution user node;
step 3, the central node pre-allocates the pre-allocated user nodes:
the central node performs pre-access to the pre-distributed user nodes on the operable channels of the pre-distributed user nodes;
step 4, the central node judges whether the total number of the user nodes finally accessed on each channel is larger than the maximum user capacity of the channel, if so, the central node informs all the user nodes which do not finish the distribution to quit the distribution, otherwise, the step 5 is executed;
step 5, the central node judges whether a user node accessed in advance exists on the channel, if so, the step 6 is executed, otherwise, the step 11 is executed;
step 6, selecting a channel to be equalized:
(6a) will satisfy
All channels of the condition form a channel set to be equalized, wherein max represents the operation of taking the maximum value, {. cndot.represents an optional element set, and aiRepresenting the total number of previously accessed user nodes on the ith channel of all accessible channels, biIndicates the total number of user nodes, U, finally accessed on the ith channel of all the accessible channelsmax_iRepresents the maximum user capacity of the ith channel of all the accessible channels;
(6b) judging whether the alternative channel set to be equalized only has one alternative channel to be equalized, if so, taking the channel as a channel to be equalized and then executing the step 7, otherwise, taking the channel with the largest number of user nodes which are accessed in advance in the alternative channel set to be equalized as the channel to be equalized and then executing the step 7;
step 7, selecting a user node to be transferred:
(7a) satisfying min { d ] in pre-allocated user nodes on the channel to be equalizedj-njAll user nodes of the condition form a user node set to be alternatively transferred, wherein min represents minimum value operation, and djRepresenting the number of channels available, n, for the jth pre-assigned user node on the channel to be equalizedjRepresenting the required channel number of the jth pre-distributed user node on the channel to be equalized;
(7b) judging whether the alternative user node set to be transferred has only one alternative user node to be transferred, if so, taking the user node as the user node to be transferred and then executing the step 8, otherwise, selecting one user node from the alternative user node set to be transferred as the user node to be transferred according to an optional strategy and then executing the step 8;
step 8, selecting a target channel:
(8a) the operable channels of the user node to be transferred are not included in the channels to be equalized selected in step 6
The conditional channels constitute a candidate target channel set, wherein akRepresenting the total number of previously accessed user nodes on the kth operable channel of the user node to be transferred, bkIndicating the total number of user nodes, U, finally accessed on the k-th operable channel of the user node to be transferredmax_kRepresenting the maximum user capacity of the k operable channel of the user node to be transferred;
(8b) randomly selecting one channel from the candidate target channel set as a target channel;
step 9, accessing the user node to be transferred:
(9a) the central node performs final access to the user node to be transferred on the target channel;
(9b) the user node to be transferred deletes the target channel from the working channel of the user node, and reduces the total number of the required channels by 1;
(9c) judging whether the number of channels required by the user node to be transferred is 0, if so, executing the step 10, otherwise, returning to the step 4;
step 10, the central node deletes the user node to be transferred from the channel accessed in advance, modifies the user node into the final distribution user node and returns to the step 4;
and step 11, all the user nodes communicate with the central node on the finally accessed channel.
2. The pre-allocation based multi-channel user balanced access method according to claim 1, wherein the selectable policy in step (7b) is to select the user node with the minimum or the maximum number of channels required by the user node to be transferred from the set of alternative user nodes to be transferred.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210001731.2A CN114339771B (en) | 2022-01-04 | 2022-01-04 | Multi-channel user balanced access method based on pre-allocation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210001731.2A CN114339771B (en) | 2022-01-04 | 2022-01-04 | Multi-channel user balanced access method based on pre-allocation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114339771A true CN114339771A (en) | 2022-04-12 |
| CN114339771B CN114339771B (en) | 2024-08-16 |
Family
ID=81023008
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210001731.2A Active CN114339771B (en) | 2022-01-04 | 2022-01-04 | Multi-channel user balanced access method based on pre-allocation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114339771B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103369682A (en) * | 2013-07-14 | 2013-10-23 | 西安电子科技大学 | Channel assignment method for multi-channel network |
| CN105025525A (en) * | 2015-07-22 | 2015-11-04 | 中国科学院计算技术研究所 | Channel load balancing system and method for multi-channel wireless local area network |
| CN110035539A (en) * | 2019-03-14 | 2019-07-19 | 北京邮电大学 | One kind being based on the matched resource optimal distribution method of correlated equilibrium regret value and device |
| US20210367832A1 (en) * | 2014-09-16 | 2021-11-25 | CloudGenix, Inc. | Methods and systems for application and policy based network traffic isolation and data transfer |
-
2022
- 2022-01-04 CN CN202210001731.2A patent/CN114339771B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103369682A (en) * | 2013-07-14 | 2013-10-23 | 西安电子科技大学 | Channel assignment method for multi-channel network |
| US20210367832A1 (en) * | 2014-09-16 | 2021-11-25 | CloudGenix, Inc. | Methods and systems for application and policy based network traffic isolation and data transfer |
| CN105025525A (en) * | 2015-07-22 | 2015-11-04 | 中国科学院计算技术研究所 | Channel load balancing system and method for multi-channel wireless local area network |
| CN110035539A (en) * | 2019-03-14 | 2019-07-19 | 北京邮电大学 | One kind being based on the matched resource optimal distribution method of correlated equilibrium regret value and device |
Non-Patent Citations (2)
| Title |
|---|
| MING LI等: ""Optimal Scheduling for Multi-Radio Multi-Channel Multi-Hop Cognitive Cellular Networks"", 《 IEEE TRANSACTIONS ON MOBILE COMPUTING ( VOLUME: 14, ISSUE: 1, 01 JANUARY 2015)》, 27 March 2014 (2014-03-27) * |
| 栾渊鑫等: ""信道分配与负载均衡相结合的多信道路由协议"", 《哈尔滨商业大学学报(自然科学版)》, 15 October 2015 (2015-10-15) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114339771B (en) | 2024-08-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108391317B (en) | Resource allocation method and system for D2D communication in cellular network | |
| US7944893B2 (en) | Signal transmission method and base station in mobile communication | |
| US20020183039A1 (en) | Adaptive load and coverage management system and method | |
| WO1998029992A9 (en) | Method and system for bandwidth allocation for multimedia services under aggregate traffic conditions | |
| WO1998029992A1 (en) | Method and system for bandwidth allocation for multimedia services under aggregate traffic conditions | |
| CN101119308A (en) | Routing device and method of wireless mobile self-organizing network of dynamic assurance service quality | |
| CN107302801B (en) | QoE-oriented double-layer matching game method in 5G mixed scene | |
| JP2000299687A (en) | Band width allocation managing method for cross point exchange | |
| CN102404838A (en) | Uplink resource allocation method and uplink resource allocation device | |
| CN113891481B (en) | Throughput-oriented cellular network D2D communication dynamic resource allocation method | |
| CN113727394B (en) | Method and device for realizing shared bandwidth | |
| CN101102586B (en) | A resource receiving and control method | |
| CN103595764A (en) | Multi-service QoS safeguard system of super-large scale VSAT system and implementation method thereof | |
| CN110839227B (en) | D2D resource allocation method and device for densely distributed user groups of cellular system | |
| CN114339771A (en) | Multichannel user equalization access method based on preallocation | |
| CN109547979B (en) | Content distribution method combining energy consumption and user fairness under D2D cache network | |
| WO2008085582B1 (en) | A system and method for managing forward channel access using a reverse channel | |
| CN116233007A (en) | Heterogeneous mobile edge computing load balancing oriented hierarchical distributed matching method | |
| EP1832023A1 (en) | A lock-based call admission control method in which non-real-time services share bandwidth | |
| US8259742B2 (en) | Hybrid channel assignment method and router thereof | |
| US6944455B2 (en) | Selective networking method for mobile ad hoc networks | |
| CN106878931A (en) | Full duplex D2D communication resource allocation methods and device | |
| CN113993166B (en) | Heterogeneous D2D network-oriented small base station jitter load balancing avoiding method | |
| CN105323856B (en) | A kind of heterogeneous network data fusion method and device based on radio resource division | |
| JP4768058B2 (en) | Radio channel assignment method and apparatus for executing the method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |