CN111836386B - Microwave equipment networking communication time slot allocation method - Google Patents
Microwave equipment networking communication time slot allocation method Download PDFInfo
- Publication number
- CN111836386B CN111836386B CN202010748365.8A CN202010748365A CN111836386B CN 111836386 B CN111836386 B CN 111836386B CN 202010748365 A CN202010748365 A CN 202010748365A CN 111836386 B CN111836386 B CN 111836386B
- Authority
- CN
- China
- Prior art keywords
- time slot
- resources
- site
- sites
- station
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
Abstract
The invention discloses a microwave equipment networking communication time slot allocation method, and belongs to the technical field of communication. The method comprises the steps of firstly judging the relation between a current online site set E and a waiting online site set F, and then carrying out time slot resource allocation according to conditions. The method can equally distribute all resources, and ensures that sites with the same number in E, F have the same number of time slot resources when re-distributing, thus the communication time slot resources can be fully occupied, and the same sites in the current site and the site waiting for online are ensured not to be interrupted in the time slot distribution process.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method for allocating a communication time slot for networking of microwave devices.
Background
The microwave communication equipment is used as the main wireless transmission equipment of the microwave communication system, mainly completes the point-to-point wireless data transmission of group service, engineering service and network management data, and is structurally compatible with the point-to-multipoint microwave communication equipment. The basic idea of ad hoc network communication is to exchange respective data with each other within a certain communication range and to automatically connect and establish a mobile network.
In the distributed dynamic time slot allocation method in the long-distance TDMA mobile ad hoc network in the prior art, the time is taken as a unit, a local part is taken as a target, a response node is requested to determine the state of a good node in advance before allocation, the response node obtains a time slot allocation result by using a time slot allocation algorithm within a specified time, and a time slot allocation table is updated. The method has the problem of time slot waste to a certain extent, and the maximum utilization of resources cannot be realized.
Disclosure of Invention
In view of the above situation, the present invention provides a method for allocating a microwave device networking communication timeslot, which can reduce timeslot waste, achieve maximum utilization of resources, and does not interfere with the quality of current communication.
The technical problem to be solved by the invention is realized by the following technical scheme:
a microwave equipment networking communication time slot distribution method is characterized by comprising the following steps:
(1) setting the total time slot resource number as M, setting the total station set as N = {1,2,3 … … N }, setting the total station set as 1,2,3 … … N as station numbers, setting N to be less than or equal to M, setting the current online station set as E, setting the waiting online station set as F, setting E, F to belong to N, and allocating time slots for stations in E and F according to an average allocation principle;
(2) judging the relation between the current online site set E and the waiting online site set F, and executing the step (3) if | E | = | F |; if the E < F, executing the step (4); if the value of the absolute value of E is larger than the absolute value of F, the step (5) is executed;
(3) if E = F, i.e. the station in E is exactly the same as the station in F, then no slot re-allocation is needed;
if the E and the F have intersection, namely the site in the E is the same as the site in the F, firstly withdrawing the time slot resource of the site which does not belong to the F in the E, and then averagely distributing the withdrawn time slot resource to the sites which do not belong to the E in the F;
if E does not belong to F at all, namely the station in E is completely different from the station in F, withdrawing the time slot resources of all the stations in E, and reallocating the withdrawn time slot resources to F;
(4) if E ⊂ F, that is, F includes all the sites in E, the time slot numbers of the sites in E and F are respectively calculated according to the average allocation principle, then the time slot allocations of E and F are compared, the time slot resources which are divided in E are withdrawn, and the withdrawn time slot resources are averagely allocated to the sites which do not belong to E in F;
if the intersection exists between the F and the E, respectively calculating the time slot number of each site in the E and the F according to an average allocation principle, then withdrawing the time slot resources of the sites not belonging to the F in the E, withdrawing the time slot resources occupied by the sites belonging to the F in the E, and averagely allocating the withdrawn time slot resources to the sites not belonging to the E in the F;
if the set F and the set E do not have an intersection, namely F and E do not have the same site, withdrawing the time slot resources of all the sites in E, and reallocating the withdrawn time slot resources to F;
(5) if F ⊂ E, that is, E includes all the stations in F, revoking the time slot resources of the stations in the set E-F, and averagely allocating the revoked time slot resources to the stations in F;
if E and F have intersection, namely E includes some sites in F, withdraw E time slot resources of site not belonging to F, then calculate the time slot number of each site in F according to the average allocation principle, and compare E and F the time slot resource allocation situation of the same site, then utilize time slot resources withdrawn to distribute for site in the set E ^ F, then distribute the remaining time slot resources to F not belonging to E on average;
and if the set E does not intersect with the set F, namely the set E does not contain any station in the set F, withdrawing the time slot resources of all the stations in the set E, and reallocating the withdrawn time slot resources to the set F.
The invention adopts the technical scheme to obtain the beneficial effects that:
1. the invention can reduce the time slot waste and realize the maximum utilization of resources.
2. The present invention does not interfere with the quality of the current communication.
Drawings
Fig. 1 is a flowchart of time slot allocation when a current online station is equal to a waiting online station according to an embodiment of the present invention.
Fig. 2 is a flowchart of allocating time slots when a current online site is smaller than a waiting online site in the embodiment of the present invention.
Fig. 3 is a flowchart of time slot allocation when the current online station is larger than the waiting online station according to an embodiment of the present invention.
Detailed Description
The invention is further described with reference to the following figures and detailed description.
A microwave device networking communication time slot allocation method includes the following steps:
the method comprises the following steps that total resources M and a total site set N = {1,2,3 … … N } (N is less than or equal to M), a current online site set E waits for an online site set F, and E, F belongs to N;
the number of the time slots of the station in E is M/| E | or M/(| E | +1), and the number of the time slots of the station in F is M/| F | or M/| F | + 1; that is, the time slot resources are evenly allocated, and if the time slot resources cannot be evenly divided, part of the stations occupy one more time slot resource.
The current online site E and the waiting online site F have three relationships, which are respectively: i E | = | F |, | E | < | F |, | E | > | F |.
As shown in fig. 1, when | E | = | F |, there are three allocation ways;
when E = F, namely the site number of E is completely the same as that of F, the time slot does not need to be reallocated;
when E ≠ F, i.e., E ≠ F = { x | x Î E and x Î F }, where the site number of E is identical to the site number of F, assuming that the same site number set is G, first reclaiming slot resources in E that do not belong to the G site number, and then allocating the resources to sites in F that do not belong to G, E = {1,3,5, 7}, F = {1,3,6,8}, then G = {1, 3}, first withdrawing the slot resources of site numbers 5 and 7 in E, and then allocating the reclaimed slot resources to sites No. 6 and 8;
when E andgatef = F, i.e. the station number of E is completely different from the station number of F, all resources of E station are withdrawn and reallocated to F, E = {1,3,5, 7}, F = {2,4,6,8}, 1,3,5,7 station time slot in E is withdrawn, and 2,4,6,8 allocated to station F equivalently;
as shown in fig. 2, when | E | < | F |, there are three cases;
when E i F, that is, the number of F sites includes the number of all sites in E, where M/| E | ≧ M/| F |, the multiple time slots in E are withdrawn and allocated to the sites in F that do not belong to E, for example, the total number of resources M is 8, the current online site E is {1,2,3}, the wait online site F is {1,2,3,4,5}, the number of time slots in E is M/| E | =8/3=2 … 2, where the number of time slots allocated to sites 1 and 2 in the current online site E is 3, the number of time slots allocated to site 3 is 2, the time slots in F are M/F =8/5=1 … 3, where sites 1,2,3 are allocated 2 time slots, and sites 4,5 are allocated 1 time slot, after the calculation is completed, the current online site E is withdrawn one resource each of site 1 and site 2, and allocated to 4 and 5,3, the number of resources is unchanged, so that the time slot communication of the sites 1,2 and 3 is ensured, 4 and 5 in the online site F are waited to be online successfully, and the resources are utilized to the maximum extent;
when F ≠ E ≠ F, E ≠ F = { x | x Î E and x Î F }, i.e. there is intersection between E and F, assuming that the intersection between E and F is H, at this time, M/| E | ≧ M/| F |, first withdraw the timeslot resources in the set E-H, and secondly withdraw the resources that are occupied more in H, allocate the recovered resources to the stations in the F-H set, e.g. total number of resources M is 8, E = {2,3}, F = {1,2,4}, then H = {2}, number of timeslots in E is M/E =8/2=4, respectively, number of timeslots in F is M | F | =8/3=2 … 2, wherein number of timeslots to be allocated for online station 1,2 should be 3, number of timeslots to be allocated for online station 4 should be 2, after the station is calculated, withdraw 4 resources of current online station 3, withdrawing 1 resource in the site 2, and allocating 1 resource and 4 resources, wherein the site 1 is 3 resources, and the site 4 is 2 resources, so that the time slot communication of the site 2 is ensured, the site F waits for the site 1 and the site 4 to be online successfully, and the utilization of the resources is maximized;
when F ≧ E = F, that is, F and E do not have the same site number, only need to be reallocated, for example, the total number of resources M is 8, the current online site E = {2,3}, F = {1,4, 5}, the time slots in F are M/| F | = { 8/3=2 … 2, after the calculation is completed, site 1 and site 4 allocate 3 resources, and site 5 allocates 2 resources;
as shown in fig. 3, when | E | > | F | is the number of current online stations is greater than the number of waiting online stations, there are three cases;
when F i E, that is, the current station E includes all stations waiting for the online station F, where M/| E | ≦ M/| F |, the station timeslot in the E-F set is withdrawn and is evenly allocated to the stations in F, for example, the total resource number M is 8, the current online station E is {1,2,3}, the waiting online station F is {1,2}, the number of the station timeslots in E is M/| E | =8/3=2 … 2, the number of the station timeslots in F is M/| F | =8/2=4, first withdraw 2 timeslots of the station 3 in E and allocate to the station 1 and the station 2, respectively;
when E and F have an intersection, assuming that the intersection is I, that is, the current site E includes partial sites waiting for the online site F, where M/| E | < M/| F |, first withdrawing the time slot of the site in the E-I set, second calculating the number of allocated resources in the set I, and finally equally allocating the remaining resources to the sites in the F-I set, for example, the total number of resources M is 8, the current online site E is {12,34}, the online site F is {4,5,6}, the number of the time slots of the site in E is M/| E | =8/4=2, the number of the time slots of the site in F is M/| F | =8/3=2 … 2, first withdrawing 6 resources of the sites 1,2,3 in E, calculating the number of the time slots which should be allocated 4,5,6, respectively 3, 2, and allocating one resource to the site 4, the remaining site 5 and site 6 allocate 3 resources and 2 resources, respectively;
when there is no intersection between the sets E and F, that is, the current station E does not include any station waiting for the online station F, and M/| E | ≦ M/| F |, only needs to be allocated according to M/| F |, for example, the total number of resources M is 8, E = {12,34}, F = {5,67}, M/| F | =8/3=2 … 2, the number of time slots that 5 and 6 in F should be allocated is calculated to be 3 and 3, and the number of time slots of station 7 is 2.
The method can equally distribute all resources M, and ensures that sites with the same number in E, F have the same number of time slot resources when M is distributed again. Therefore, the communication time slot resources can be completely occupied, and the communication of the same site in the current site and the site waiting for online is not interrupted in the time slot allocation process.
The method can be used for calculating the total number of the time slots which are required to be added by the source node and each forwarding node of the broadband resource request information according to the broadband resource requirement implemented by the part of the broadband resource request information and the whole network new scheduling period resource requirement information table aiming at each broadband resource request information in one traversal of the cyclic traversal.
Specifically, each time a time slot is reallocated, the online status of each station is taken out respectively; and when the power is on, if no old station exists, setting the number of all stations to be 0 xff. Time slots are not allocated to sites that are not online. And then calculating a time slot allocation table, wherein the time slot number which should be allocated by each online station is mainly calculated, the calculation principle is average allocation, namely, the time slot number of each station is evenly allocated when the division is completed, and the time slot number of the remaining time slot resources is allocated to the first stations of the time slot table. And then, allocating a new time slot number to each online time slot according to the calculated time slot allocation table. And then, receiving the online state of each station, comparing to obtain the maximum online state, respectively taking out the online state of each station, and if all offline queries are carried out, directly returning without calculation. In addition, when the time slot is allocated to the online site, firstly the time slot is allocated to the site which is always online, the time slot number which is originally and less than the number of the currently allocated time slot cannot be changed, and secondly, the rest time slot number is allocated to the newly online site number, so that the time slot waste can be reduced, the maximum utilization of resources is realized, and the quality of the current communication cannot be interfered.
Claims (1)
1. A microwave equipment networking communication time slot distribution method is characterized by comprising the following steps:
(1) setting the total time slot resource number as M, setting the total station set as N = {1,2,3 … … N }, setting 1,2,3 … … N as station numbers, setting N to be less than or equal to M, setting the current online station set as E, waiting that the online station set is F, setting E, F to be N, and allocating time slots for stations in E and F according to an average allocation principle;
(2) judging the relation between the current online site set E and the waiting online site set F, and executing the step (3) if | E | = | F |; if the E < F, executing the step (4); if the | E | > | F |, executing the step (5);
(3) if E = F, i.e. the station in E is exactly the same as the station in F, then no slot re-allocation is needed;
if the E and the F have intersection, namely the site in the E is the same as the site in the F, firstly withdrawing the time slot resources of the sites not belonging to the F in the E, and then averagely allocating the withdrawn time slot resources to the sites not belonging to the E in the F;
if E does not belong to F at all, namely the station in E is completely different from the station in F, withdrawing the time slot resources of all the stations in E, and reallocating the withdrawn time slot resources to F;
(4) if E ⊂ F, that is, F includes all the sites in E, the time slot numbers of the sites in E and F are respectively calculated according to the average allocation principle, then the time slot allocations of E and F are compared, the time slot resources which are divided in E are withdrawn, and the withdrawn time slot resources are averagely allocated to the sites which do not belong to E in F;
if the intersection exists between the F and the E, respectively calculating the time slot number of each site in the E and the F according to an average allocation principle, then withdrawing the time slot resources of the sites not belonging to the F in the E, withdrawing the time slot resources occupied by the sites belonging to the F in the E, and averagely allocating the withdrawn time slot resources to the sites not belonging to the E in the F;
if the set F and the set E do not have an intersection, namely F and E do not have the same site, withdrawing the time slot resources of all the sites in E, and reallocating the withdrawn time slot resources to F;
(5) if F ⊂ E, that is, E includes all the stations in F, revoking the time slot resources of the stations in the set E-F, and averagely allocating the revoked time slot resources to the stations in F;
if E and F have the intersection, namely E includes some sites in F, withdraw E time slot resources of the site not belonging to F, then calculate the time slot number of every site in F according to the principle of average allocation, and compare E and F time slot resource allocation situation of the same site, then utilize time slot resources withdrawn to allocate for site in the set E &' F, then distribute the surplus time slot resources to F not belonging to E averagely;
if there is no intersection between the sets E and F, that is, E does not contain any station in F, the timeslot resources of all stations in E are withdrawn, and the withdrawn timeslot resources are reallocated to F.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010748365.8A CN111836386B (en) | 2020-07-30 | 2020-07-30 | Microwave equipment networking communication time slot allocation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010748365.8A CN111836386B (en) | 2020-07-30 | 2020-07-30 | Microwave equipment networking communication time slot allocation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111836386A CN111836386A (en) | 2020-10-27 |
| CN111836386B true CN111836386B (en) | 2022-06-21 |
Family
ID=72920389
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010748365.8A Active CN111836386B (en) | 2020-07-30 | 2020-07-30 | Microwave equipment networking communication time slot allocation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111836386B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110650481A (en) * | 2019-09-19 | 2020-01-03 | 军事科学院系统工程研究院网络信息研究所 | Joint distribution method for uplink power and time slot of multi-beam MF-TDMA cognitive satellite network |
| CN110891317A (en) * | 2019-10-29 | 2020-03-17 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Method for allocating millimeter wave phased array antenna communication resources on demand |
| CN110933754A (en) * | 2019-10-22 | 2020-03-27 | 四川安迪科技实业有限公司 | Large-scale FDMA satellite network access time slot dynamic adjustment method, device and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109076607B (en) * | 2016-02-29 | 2022-07-15 | 瑞典爱立信有限公司 | Method and apparatus for accessing wireless channel in coexistence scenario |
-
2020
- 2020-07-30 CN CN202010748365.8A patent/CN111836386B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110650481A (en) * | 2019-09-19 | 2020-01-03 | 军事科学院系统工程研究院网络信息研究所 | Joint distribution method for uplink power and time slot of multi-beam MF-TDMA cognitive satellite network |
| CN110933754A (en) * | 2019-10-22 | 2020-03-27 | 四川安迪科技实业有限公司 | Large-scale FDMA satellite network access time slot dynamic adjustment method, device and system |
| CN110891317A (en) * | 2019-10-29 | 2020-03-17 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Method for allocating millimeter wave phased array antenna communication resources on demand |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111836386A (en) | 2020-10-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107071782B (en) | Wireless resource allocation method based on network slice | |
| CN102104874B (en) | Distribution method of network transmission resource and relevant device thereof | |
| CN101472339B (en) | Method for coordinating district interference | |
| CN101291514A (en) | Method and device for resource distribution in wireless communication system | |
| CN103686740B (en) | The method of a kind of customer equipment identification distribution, Apparatus and system | |
| WO2012144721A1 (en) | Radio resource division for compensating ratio changes of other clusters | |
| CN107769840A (en) | The PS service resources active recovery methods of hybrid switching type satellite communication system | |
| CN106162654B (en) | Power LTE network frequency distribution and interference coordination method based on service isolation | |
| CN101212757A (en) | Resource reuse method and device | |
| CN111836386B (en) | Microwave equipment networking communication time slot allocation method | |
| CN101132598B (en) | Wireless resource assignment method and system thereof | |
| CN102387497A (en) | Base station and allocation method of radio network temporary identities | |
| CN113692057A (en) | Network slice resource allocation method and system | |
| CN111194088B (en) | Dynamic time slot allocation method for mobile network based on subnet division | |
| CN111385744B (en) | Dynamic channel access method based on polling | |
| CN103856899A (en) | Set resource scheduling method in cluster communication | |
| CN102843692A (en) | Method and device for sharing multi-carrier power of same RRU by operators | |
| CN102377830A (en) | IP (Internet Protocol) address configuration method | |
| CN111405564B (en) | Method and device for time slot allocation and readable storage medium | |
| CN113891473A (en) | Data channel resource allocation method, satellite, ship station and system | |
| CN111385799A (en) | Time slot allocation method based on dynamic time division multiple access | |
| WO2007138046A1 (en) | Radio resource management method and central controller in mobile radio communication system | |
| CN105657831A (en) | Baseband resource management method and device | |
| JP7447334B1 (en) | Bandwidth portion management method for networks and controllers therefor | |
| WO2007128179A1 (en) | A method and system for the reconfiguration of the public transmission channel |
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 |