WO2015064963A1 - Scheduling method and apparatus for access point in wlan - Google Patents
Scheduling method and apparatus for access point in wlan Download PDFInfo
- Publication number
- WO2015064963A1 WO2015064963A1 PCT/KR2014/010046 KR2014010046W WO2015064963A1 WO 2015064963 A1 WO2015064963 A1 WO 2015064963A1 KR 2014010046 W KR2014010046 W KR 2014010046W WO 2015064963 A1 WO2015064963 A1 WO 2015064963A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- time
- transmission time
- terminal
- transmission
- terminals
- 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.)
- Ceased
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
-
- 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/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
- H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/10—Small scale networks; Flat hierarchical networks
- H04W84/12—WLAN [Wireless Local Area Networks]
Definitions
- the present invention relates to data transmission in a wireless local area network (WLAN) environment, and more particularly, to a technique for allocating transmission resources while ensuring a minimum throughput at an access point.
- WLAN wireless local area network
- WLAN Wireless Local Area Network
- resources can be allocated to each UE fairly based on the length of transmission data. This is called throughput fairness.
- throughput fairness there are various data rates in WLAN, and there is a difference in time for transmitting data of the same size for each data rate.
- the fairness of resource allocation to each terminal based on the transmission time is called airtime fairness.
- FIG. 1 is a graph illustrating a relationship between a data transmission rate (Throughput) and an actual transmission time (Airtime) according to data transmission from an access point to a terminal.
- Thoughput a data transmission rate
- Airtime an actual transmission time according to data transmission from an access point to a terminal.
- the higher the data throughput the smaller the actual transmission time required for data transmission.
- the lower the data throughput the lower the actual transmission time required for the data transmission. Will increase.
- the transmission length of data is equalized to a plurality of terminals, and thus, a lot of radio resources are allocated during data transmission of a terminal having a low transmission rate.
- a terminal having a low transmission rate causes a relatively low allocation of radio resources to a terminal having a high transmission rate, and thus receives an unfair radio resource compared to the performance of the terminal.
- the airtime fairness is equally allocated to the radio resources according to the transmission rate of the terminal by allocating radio resources based on the time of data transmission, but the terminal having a low transmission rate can guarantee the minimum transmission rate due to the relatively long transmission time. It becomes impossible.
- the problem to be solved by the present invention is to provide a minimum transmission rate for data transmission to a low transmission rate (Station), and to allocate the resources to other terminals for the remaining radio resources in the WLAN of the access point A scheduling method and apparatus.
- the scheduling method of an access point in a wireless local area network (WLAN), the actual transmission time and the minimum transmission according to the data transmission to the terminal selected by the transmission rank Calculating a basic transmission time that guarantees speed; And setting schedule index information indicating a data transmission rank with respect to the other terminals with respect to other terminals according to the calculated comparison result of the actual transmission time and the basic transmission time.
- WLAN wireless local area network
- the scheduling apparatus of an access point in a wireless local area network (WLAN), the actual transmission time and the minimum transmission according to the data transmission to the terminal selected by the transmission rank A transmission time calculating unit for calculating a basic transmission time for guaranteeing a speed; And a scheduling setting unit configured to set schedule index information for determining a data transmission rank of the terminal with respect to other terminals according to the calculated comparison result of the actual transmission time and the basic transmission time.
- WLAN wireless local area network
- the present invention there is an effect of providing a minimum transmission speed to the terminal with a low transmission rate in the airtime fairness.
- FIG. 1 is a graph illustrating a relationship between a data transmission rate (Throughput) and an actual transmission time (Airtime) according to data transmission from an access point to a terminal.
- FIG. 2 is a reference diagram illustrating a network system for explaining scheduling of an access point in a WLAN according to the present invention.
- FIG. 3 is a flowchart for explaining a scheduling method according to the present invention.
- FIG. 4 is a graph illustrating a relationship between a data transmission rate (throughput) and an actual transmission time (Airtime) according to data transmission to a terminal when the scheduling method of an access point according to the present invention.
- FIG. 5 is a flowchart of an embodiment for explaining a scheduling method of an access point in a WLAN according to the present invention.
- FIG. 6 is a flowchart of an exemplary embodiment for explaining a process of setting schedule index information illustrated in FIG. 5.
- FIG. 7 is a block diagram of an embodiment for explaining an apparatus for scheduling an access point in a WLAN according to the present invention.
- FIG. 8 is a block diagram of an exemplary embodiment for describing the scheduling setting unit illustrated in FIG. 7.
- Embodiments of the present invention to be described below are for evenly allocating transmission resources while guaranteeing a minimum throughput at an access point.
- the network 10 to which the present invention is applied may include at least one access point 10 and at least one terminal 1 30 and at least one terminal 2 40, which may be connected to the access point 10. It includes a network accessible to the terminal n (50).
- the network 10 transmits and receives data to and from the access point 20, terminal 1 (30), terminal 2 (40) to terminal n (50), and exchanges data with a corresponding destination through a router (not shown).
- the access point 20 is connected to the network 10 and wirelessly communicates with the terminal 1 (30), the terminal 2 (40) to the terminal n (50) existing within a certain distance, and provides data provided from the network. And transmits the data received from the terminal 1 (30), the terminal 2 (40) to the terminal n (50), and receives the data received from the terminal 1 (30) and the terminal 2 (40) to the terminal n (50). Send to your destination via
- the access point 20 may include an antenna (not shown), a receiver (not shown), a transmitter (not shown), a demodulator (not shown), a modulator (not shown), a network interface module (not shown), a scheduler, It may include components such as a memory (not shown) and a processor (not shown).
- Signals transmitted from the terminal 1 (30), the terminal 2 (40) to the terminal n (50) are received through an antenna, the receiver includes radio frequency to baseband conversion, amplification, analog to digital conversion, filtering, etc. Perform various processes.
- the signal received at the receiver is demodulated in a demodulator in accordance with one or more communication designs or standards.
- the demodulator performs rate reception, equalization, combining, deinterleaving, decoding, and various other functions required by the received signal format.
- the demodulated signal is transmitted to the network 10 through the network interface module.
- data transmitted from the network 10 is received through the network interface module, and the received data is modulated by a modulator and provided to the transmitter.
- the transmitter formats the received data according to a wireless system standard and transmits the received data to the antenna, and the antenna wirelessly transmits the formatted data to the terminal 1 (30), the terminal 2 (40) to the terminal n (50).
- the scheduler generates a transmission schedule index corresponding to a sequence for data transmission, according to a scheduling algorithm, for data to be transmitted to the terminal 1 (30), the terminal 2 (40) to the terminal n (50).
- Data is sequentially transmitted to each of the terminal 1 (30), the terminal 2 (40) to the terminal n (50) according to the schedule index. Details of the scheduler will be described later.
- the memory stores various information for wired / wireless transmission of data, and in particular, stores schedule index information related to the present invention.
- the processor controls the overall operation of each of the components of the access point 10 described above.
- the terminal 1 (30), the terminal 2 (40) to the terminal n (50) is a terminal capable of wirelessly performing short-range communication with the access point 20 existing within a certain distance.
- a smartphone a tablet personal computer, a mobile phone, a video phone, an e-book reader, a desktop personal computer, a laptop PC personal computer, netbook computer, personal digital assistant (PDA), portable multimedia player (PMP), MP3 player, mobile medical device, electronic bracelet, electronic necklace, electronic accessory, camera, Wearable devices, electronic clocks, wrist watches, smart white appliances (e.g.
- refrigerators air conditioners, cleaners, artificial intelligence robots, TVs, digital video disk players) , Audio, ovens, microwave ovens, washing machines, air purifiers, electronic photo frames, etc., various medical devices (e.g. magnetic resonance angiography (MRA), magnetic resonance imaging (MRI), computed tomography (CT), cameras, ultrasounds, etc.) Navigation device, GPS reception (global positioning system receiver), event data recorder (EDR), flight data recorder (FDR), set-top box, TV box (e.g.
- MRA magnetic resonance angiography
- MRI magnetic resonance imaging
- CT computed tomography
- FDR flight data recorder
- TV box e.g.
- FIG. 3 is a flowchart illustrating a scheduling method of an access point according to the present invention.
- An AP means an access point
- an STA means a terminal
- an SQ means an STA transmission service queue
- an ASQ is an active service queue
- GMT Guaranteed Minimum Throughput, which means the minimum transmission speed
- Schedule Index means the index of each STA that the scheduler refers to when selecting the SQ
- T Airtime means the actual transmission time of data to be transmitted
- T BaseAirtime is It means the basic transmission time to guarantee the minimum transmission speed of data to be transmitted.
- a service time (T Airtime ) at the time of data transmission for one selected terminal STA is calculated (step S100).
- the actual transmission time T Airtime is calculated using the current transmission rate of the STA selected by the scheduler and the length of data to be transmitted. Equation 1 below is an equation for calculating the actual transmission time (T Airtime ).
- T (k) Airtime means the actual transmission time for any one terminal k of the terminal 1 (30), the terminal 2 (40) to the terminal n (50), Length (k) is transmitted to the terminal k It means the length of data, PHY Rate (k) means the current transmission rate for the data to be transmitted to the terminal k.
- a base time (T BaseAirtime ) for calculating a minimum transmission speed (Throughput) during data transmission is calculated (step S102).
- T BaseAirtime a base time for calculating a minimum transmission speed (Throughput) during data transmission.
- T (k) BaseAirtime means a base transmission time for any one terminal k of the terminal 1 (30), the terminal 2 (40) to the terminal n (50), Min GTP is the terminal 1 (30) ), Means a minimum throughput for data transmission to the terminal 2 (40) to the terminal n (50), and TP (k) refers to the current transmission rate for the data transmission to the terminal k.
- step S104 the time value of the actual transmission time (T (k) Airtime ) and the base transmission time (Base time: T (k) BaseAirtime ) are compared (step S104).
- the Schedule Index is set to the base time: T (k ( Air ). ) Increase by BaseAirtime (step S106). If the size of the actual service time T (k) Airtime is larger than the base time T (k) BaseAirtime , the minimum transmission rate for data transmission to the STA cannot be guaranteed. Meanwhile, the schedule index is information for determining a data transmission rank for the terminal 1 (30), the terminal 2 (40) to the terminal n (50) that receives data from the access point 10.
- the schedule index may be set to a base transmission time (Base time: T (k) BaseAirtime so that the data transmission rank for the terminal k may have priority over other terminals. Increase only by). Equation 3 below is a formula for adding a Schedule Index.
- SI (k) + means a schedule index to which a basic transmission time for the terminal k of the terminal 1 (30), the terminal 2 (40) to the terminal n (50) is added.
- the difference value between the actual transmission time and the basic transmission time is added to the short time sum value (step S108).
- the difference between the actual transmission time and the basic transmission time for the terminal k corresponds to the insufficient transmission time for which the minimum transmission speed is not guaranteed when transmitting data to the terminal k. Equation 4 below is a formula for calculating the difference between the actual transmission time and the basic transmission time.
- T (k) Insufficient means a difference between the actual transmission time and the basic transmission time for the terminal k. Therefore, T (k) Insufficient means insufficient transmission time due to the inability to guarantee the minimum transmission speed in data transmission to the terminal k.
- the shortage time addition value for the terminal k is added to the shortage time summation value, and the shortage time summation value corresponds to all of the terminal 1 30, the terminal 2 40, and the terminal n (where the access point 20 transmits data). 50) is the sum of the insufficient transmission times of the terminals having insufficient transmission time according to the data transmission. Equation 5 below is an equation for calculating the sum of the short time.
- T (Sum) Insufficient is the sum of insufficient time, and T (1) Insufficient , T (2) Insufficient , .., T (K) Insufficient is the difference between the actual transmission time and the default transmission time. As a shortage of the actual transmission time, it means a short time for data transmission for each corresponding terminal.
- the terminal k is added to the terminal number value N (Sum) Insufficient for the terminals having insufficient transmission time (step S110).
- the terminal whose actual size of service time is greater than the size of base time corresponds to a terminal that does not guarantee the minimum transmission rate, and all terminals to which the access point 20 transmits data.
- the terminal k is added to the number of terminals that are not guaranteed the minimum transmission rate according to the data transmission.
- step S104 if the size of the actual service time (service time) is not greater than the size of the base time (Base time), increase the Schedule Index by the actual transmission time (step S112). Equation 6 below is a formula for adding a Schedule Index.
- SI (k) + means a schedule index to which the actual transmission time for the terminal k of the terminal 1 (30), the terminal 2 (40) to the terminal n (50) is added.
- a distribution allocation time is added to the Schedule Index so that time is additionally allocated to the terminal having the insufficient transmission time (step S114).
- the distribution allocation time is equally distributed to the terminals having insufficient transmission time when there are terminals having insufficient transmission time according to data transmission among the other terminals except the terminal k whose transmission speed is faster than the minimum transmission speed. It means time for. Equation 7 below is an equation for calculating the distribution allocation time.
- T (k) distribution means a distribution allocation time for allocating to other terminals whose transmission rate is not high in the terminal k whose transmission rate is faster than the minimum transmission rate
- N (Sum) asq is the access point 20.
- the transmission rate means the total number of terminals satisfying the minimum transmission rate.
- the transmission rank for the terminal k faster than the minimum transmission rate is pushed back as much as the distribution allocation time added to the Schedule Index. For example, UEs that do not satisfy the minimum transmission rate may be given priority in the data transmission order by the allocation allocation time.
- FIG. 4 is a graph illustrating a relationship between a data transmission rate (throughput) and an actual transmission time (Airtime) according to data transmission to a terminal when the scheduling method of an access point according to the present invention.
- the UE has a low transmission rate (Low) than the minimum guaranteed transmission rate (Throughput) by scheduling the transmission priority to the priority, thereby the effect that the data is transmitted to satisfy the minimum guaranteed transmission rate Get
- the transmission rate is reduced within the limit that satisfies the minimum guaranteed transmission rate.
- FIG. 5 is a flowchart of an embodiment for explaining a scheduling method of an access point in a WLAN according to the present invention.
- a basic transmission time is guaranteed according to the data transmission to the terminal selected by the transmission rank and a basic transmission time that guarantees a minimum transmission speed (step S200).
- the terminal 2 (40) to the terminal n (50) is determined according to a preset transmission priority
- the data transmission for the selected terminal k is performed. Calculate the actual transfer time and the default transfer time.
- the actual transmission time for the terminal k is calculated by using Equation 1 described above.
- the basic transmission time is calculated using the current transmission rate for the terminal k, the length of data to be transmitted, and a transmission rate that guarantees a minimum throughput.
- the basic transmission time for the terminal k is calculated by using Equation 2 described above.
- schedule index information indicating the data transmission order for the corresponding terminal with respect to the other terminals is set (S202).
- the schedule index information corresponds to a time value for determining the data transmission rank of the terminal. The smaller the time value, the higher the data transmission rank to the corresponding terminal.
- FIG. 6 is a flowchart of an exemplary embodiment for explaining a process of setting schedule index information illustrated in FIG. 5.
- a value of the actual transmission time and the basic transmission time calculated in step S200 are compared (S300).
- the basic transmission time is added to the time value of the schedule index information and set (S302).
- the actual transmission time for data transmission for the terminal k is greater than the value of the basic transmission time means that more time is required than the time normally required for transmitting data to the terminal k. Therefore, it means that the minimum transmission speed for data transmission to the terminal k is not guaranteed, and when transmitting data to the terminal k, more data transmission time should be allocated than other terminals.
- the schedule index information is information for determining a rank for transmitting data to each terminal, the schedule index information for the terminal k has a minimum time value in order to give priority to the other terminals.
- the schedule index information is set by adding only the basic transfer time.
- the schedule index information for the terminal k is set by adding a basic transmission time to the schedule index information by using Equation 3 described above.
- the difference between the actual transmission time and the basic transmission time is regarded as insufficient transmission time for which the minimum transmission speed is not guaranteed when transmitting data to the corresponding terminal, and insufficient transmission time due to data transmission among other terminals.
- the difference value is added to an insufficient time sum value obtained by adding the insufficient transmission times of the UEs (S304).
- the difference between the actual transmission time and the basic transmission time for the terminal k means insufficient transmission time for which the minimum transmission speed is not guaranteed during data transmission.
- the difference between the actual transmission time and the basic transmission time for the terminal k is calculated by using Equation 4 described above.
- the difference value calculated using Equation 4 is added to the sum of the insufficient time as the insufficient transmission time for the terminal k.
- the shortage time sum value represents the insufficient transmission time of the terminals having insufficient transmission time according to data transmission among the terminal 1 (30), the terminal 2 (40) to the terminal n (50) to which the access point 20 transmits data. It is the sum. Therefore, as described above, the insufficient transmission time for the terminal k is summed with the insufficient transmission time of the other terminals by using Equation 5 to calculate an insufficient time sum value (T (Sum) Insufficient ).
- the terminal is regarded as a terminal that does not guarantee the minimum transmission speed, and the corresponding terminal is added to the number of terminals for terminals having insufficient transmission time according to data transmission among other terminals.
- a terminal whose actual transmission time is larger than the value of the basic transmission time corresponds to a terminal that is not guaranteed the minimum transmission speed.
- the terminal k is a terminal that is not guaranteed to the minimum transmission speed, among all the terminal 1 (30), the terminal 2 (40) to the terminal n (50) that the access point 20 transmits data
- the terminal k is added to the number of terminals that are not guaranteed the minimum transmission rate according to the data transmission.
- step S300 if the actual transmission time is not greater than the value of the basic transmission time, the actual transmission time is added to the time value of the schedule index information, and for the terminals having insufficient transmission time according to data transmission among other terminals
- the distribution allocating time for allocating in an easy manner is added to the time value of the schedule index information (step S306).
- the fact that the actual transmission time for data transmission for the terminal k is not greater than the value of the default transmission time means that it takes less time than other terminals to transmit data to the terminal k. Therefore, it means that the minimum transmission speed for data transmission to the terminal k is already secured. Therefore, the extra time of the transmission time allocated for the terminal k can be allocated as a time for data transmission to other terminals.
- the schedule index information is information for determining the rank for transmitting data to each terminal, the schedule index information for the terminal k may be lowered than the other terminals. To this end, the actual transmission time is added to the schedule index information for the terminal k, while the allocation allocation time for allocating to other terminals having insufficient transmission time is added to the schedule index information.
- the schedule index information for the terminal k is added by the distribution allocation time allocated to the other terminals, the ranking for data transmission is slowed down compared to the other terminals.
- the schedule index information for the terminal k is calculated and set using Equation 8 described above. As confirmed by Equation 8, by adding the calculated distribution allocation time to the time value of the schedule index information, the transmission rank for the terminal k faster than the minimum transmission speed is pushed back by the sum of the allocation allocation time, On the contrary, the terminal that does not satisfy the minimum transmission rate, the data transmission priority is prioritized by the above allocation allocation time.
- FIG. 7 is a block diagram illustrating an example of an apparatus for scheduling an access point in a WLAN according to the present invention, and includes a transmission time calculating unit 300 and a scheduling setting unit 310.
- the scheduling apparatus of the access point is a component corresponding to a scheduler (not shown) among the components of the access point 20 of FIG. 2 described above.
- the transmission time calculating unit 300 calculates a basic transmission time guaranteeing an actual transmission time and a minimum transmission speed according to the data transmission to the terminal selected by the transmission rank.
- the transmission time calculator 300 selects The actual transmission time according to the data transmission for the terminal k is calculated by using Equation 1 described above.
- the transmission time calculation unit 300 calculates the basic transmission time using the above-described equation (2) based on the current transmission rate for the terminal k, the length of the data to be transmitted and the transmission rate to ensure the minimum throughput. .
- the transmission time calculator 300 transmits the calculated actual transmission time and the basic transmission time to the scheduling setting unit 310.
- the scheduling setting unit 310 sets schedule index information for determining a data transmission rank of a corresponding terminal with respect to other terminals according to a comparison result between the actual transmission time and the basic transmission time calculated by the transmission time calculating unit 300. .
- FIG. 8 is a block diagram of an exemplary embodiment for explaining the scheduling setting unit 310 shown in FIG. 7 and includes a time comparison module 400 and a schedule setting module 410.
- the time comparison module 400 compares the values of the actual transmission time and the basic transmission time, and transmits the comparison result signal to the schedule setting module 410.
- the time comparison module 400 outputs a comparison signal as to whether the actual transmission time is greater than the value of the basic transmission time.
- the schedule setting module 410 sets the schedule index information by adding the basic transmission time to the time value of the schedule index information. do.
- the schedule setting module 410 in order for the schedule index information for the terminal k to have priority over other terminals.
- the schedule setting module 410 sets the schedule index information for the terminal k by adding a basic transmission time by using Equation 3 described above.
- the schedule setting module 410 stores the set schedule index information in a predetermined memory (not shown).
- the predetermined memory may be a storage space provided in the schedule setting module 410 or may correspond to a memory space which is one of the components of the above-described access point 20.
- the schedule setting module 410 is at least as much as the difference between the actual transmission time and the basic transmission time at the time of data transmission to the terminal k
- the difference is added to the shortage time summation value, which is considered to be a lacking transmission time for which the transmission rate is not guaranteed, and is the sum of the insufficient transmission times of other terminals having the insufficient transmission time according to the data transmission.
- the schedule setting module 410 calculates the difference between the actual transmission time and the basic transmission time for the terminal k by using Equation 4 described above. Then, the difference value calculated using Equation 4 is added to the shortage time summation value as the insufficient transmission time for the terminal k.
- the shortage time summation sums the insufficient transmission time of the terminals having insufficient transmission time according to the data transmission.
- the schedule setting module 410 calculates the sum of the insufficient time by adding the insufficient transmission time for the terminal k with the insufficient transmission time of the other terminals using Equation 5 described above.
- the schedule setting module 410 is regarded as a terminal that does not guarantee the minimum transmission speed for the terminal k, the data transmission The terminal k is added to the number of terminals for the terminals having insufficient transmission time.
- the schedule setting module 410 upon receiving a comparison signal from the time comparison module 400 that the actual transmission time is not greater than the value of the basic transmission time, the schedule setting module 410 adds the actual transmission time to the time value of the schedule index information, and the other terminal. Among them, a distribution allocation time for subdividing and allocating terminals having insufficient transmission time according to data transmission is added to a time value of schedule index information.
- the schedule setting module 410 sets the schedule index information for the terminal k to be slowed down compared to other terminals. To this end, the schedule setting module 410 adds the actual transmission time to the schedule index information for the terminal k, and adds a distribution allocation time for allocating to other terminals having insufficient transmission time to the schedule index information.
- the schedule setting module 410 calculates and sets schedule index information for the terminal k by using Equation 8 described above.
- the schedule setting module 410 stores the set schedule index information in a predetermined memory (not shown) as described above.
- a terminal having a transmission rate lower than the minimum guaranteed transmission rate may be scheduled to have priority over other terminals, thereby satisfying the minimum guaranteed transmission rate, and at the same time, the minimum guaranteed transmission.
- the transmission priority is scheduled to be relatively subordinated by the above distribution allocation time, thereby transmitting data within a limit that satisfies the minimum guaranteed transmission rate.
- Operations according to an embodiment of the present invention may be implemented by a single control unit.
- program instructions for performing various computer-implemented operations may be recorded on a computer-readable medium.
- the computer-determinable medium may include program instructions, data files, data structures, and the like, alone or in combination.
- the program instructions may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those skilled in the art.
- Examples of computer readable recording media include magnetic media such as hard disks, floppy disks and magnetic tape, optical recording media such as CD-ROMs or DVDs, magnetic-optical media such as floppy disks and ROMs.
- Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like.
- a computer readable recording medium storing the computer program is also included in the present invention. Therefore, the scope of the present invention should not be limited to the described embodiments, but should be determined not only by the claims below but also by the equivalents of the claims.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
๋ณธ ๋ฐ๋ช ์ WLAN(Wireless Local Area Network)ํ๊ฒฝ์์์ ๋ฐ์ดํฐ ์ ์ก์ ๊ดํ ๊ฒ์ผ๋ก, ํนํ, ์ก์ธ์ค ํฌ์ธํธ(Access Point)์์์ ์ต์ํ์ ์ ์ก์๋(Throughput)๋ฅผ ๋ณด์ฅํ๋ฉด์ ์ ์ก ์์์ ๋ฐฐ๋ถํ๋ ๊ฒ์ ๊ดํ ๊ธฐ์ ์ด๋ค.The present invention relates to data transmission in a wireless local area network (WLAN) environment, and more particularly, to a technique for allocating transmission resources while ensuring a minimum throughput at an access point.
IEEE802.11 WLAN(Wireless Local Area Network: ์ดํ, WLAN) ํ๊ฒฝ์์๋ ์ก์ธ์ค ํฌ์ธํธ๋ฅผ ํตํด ์๋น์ค๋ฅผ ์ ๊ณต๋ฐ๋ ๋ค์์ ๋จ๋ง๋ค์ด ์กด์ฌํ ์ ์๋ค. ์ด์ ๋ค์์ ๋จ๋ง๋ค์๊ฒ ๊ณตํํ๊ฒ ์์์ ๋ถ๋ฐฐํ๋ ๊ฒ์ด ์ค์ํ๋ค. ํน์ ๋จ๋ง์ ์ํด์, ๋ค๋ฅธ ๋จ๋ง์ด ์์์ ์ฌ์ฉํ๋๋ฐ ์ํฅ์ ๋ฐ๋ ๊ฒ์ ๊ณตํ์ฑ์ ์๋ฐฐ๋๋ ์์ ๋ถ๋ฐฐ ์ ์ฑ ์ด๋ค.In an IEEE 802.11 Wireless Local Area Network (WLAN) environment, there may be a plurality of terminals provided with services through an access point. Therefore, it is important to distribute resources evenly to a plurality of terminals. By a specific terminal, it is a resource distribution policy that is not fair to be affected by other terminals using resources.
์ด๋ฌํ ์์๋ถ๋ฐฐ์ ์ฑ ์ ๊ตฌํํ๊ธฐ ์ํ Fair queuing ์๊ณ ๋ฆฌ์ฆ์ ์ฌ๋ฌ ๊ฐ์ง๊ฐ ์กด์ฌํ๋๋ฐ ์ด ๊ฐ์ด๋ฐ Throughput Fairness์ Airtime Fairness๊ฐ ๋ํ์ ์ด๋ค.There are a number of fair queuing algorithms for implementing such resource distribution policies. Among them, throughput fairness and airtime fairness are representative.
WLAN์์๋ ์ ์ก ๋ฐ์ดํฐ์ ๊ธธ์ด๋ฅผ ๊ธฐ์ค์ผ๋ก ๊ฐ๊ฐ์ ๋จ๋ง์๊ฒ ์์์ ๊ณตํํ๊ฒ ํ ๋นํ ์ ์๋๋ฐ ์ด๋ฅผ Throughput Fairness๋ผ ํ๋ค. ๋๋ถ์ดWLAN์์๋ ์ฌ๋ฌ ๊ฐ์ง ์ ์ก๋ฅ ์ด ์กด์ฌํ๊ณ ๊ฐ๊ฐ์ ์ ์ก๋ฅ ๋ณ๋ก ๊ฐ์ ํฌ๊ธฐ์ ๋ฐ์ดํฐ๋ฅผ ์ ์กํ๋ ์๊ฐ์ ์ฐจ์ด๊ฐ ์๋ค. ์ ์ก์๊ฐ์ ๊ธฐ์ค์ผ๋ก ๊ฐ๊ฐ์ ๋จ๋ง์๊ฒ ์์ํ ๋น์ ๊ณตํํ๊ฒ ํ๋ ๊ฒ์Airtime fairness๋ผ ํ๋ค.In the WLAN, resources can be allocated to each UE fairly based on the length of transmission data. This is called throughput fairness. In addition, there are various data rates in WLAN, and there is a difference in time for transmitting data of the same size for each data rate. The fairness of resource allocation to each terminal based on the transmission time is called airtime fairness.
๋ 1์ ์ก์ธ์คํฌ์ธํธ์์ ๋จ๋ง๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ฐ์ดํฐ ์ ์ก์๋(Throughput)์ ์ค์ ์ ์ก์๊ฐ(Airtime)๊ณผ์ ๊ด๊ณ๋ฅผ ๋์ํ ๊ทธ๋ํ์ด๋ค. ๋ 1์ ๋์๋ ๋ฐ์ ๊ฐ์ด, ๋ฐ์ดํฐ ์ ์ก์๋(Throughput)๊ฐ ๋์์๋ก ๋ฐ์ดํฐ๋ฅผ ์ ์กํ๋๋ฐ ์๊ตฌ๋๋ ์ค์ ์ ์ก์๊ฐ์ด ์ค์ด๋ค๊ฒ ๋๋ฉฐ, ๋ฐ๋๋ก ๋ฐ์ดํฐ ์ ์ก์๋(Throughput)๊ฐ ๋ฎ์์ง์๋ก ๋ฐ์ดํฐ๋ฅผ ์ ์กํ๋๋ฐ ์๊ตฌ๋๋ ์ค์ ์ ์ก์๊ฐ์ด ์ฆ๊ฐํ๊ฒ ๋๋ค. FIG. 1 is a graph illustrating a relationship between a data transmission rate (Throughput) and an actual transmission time (Airtime) according to data transmission from an access point to a terminal. As shown in FIG. 1, the higher the data throughput, the smaller the actual transmission time required for data transmission. On the contrary, the lower the data throughput, the lower the actual transmission time required for the data transmission. Will increase.
๋ฐ๋ผ์, Throughput fairness์ ๊ฒฝ์ฐ๋ ๋ค์์ ๋จ๋ง๋ค์๊ฒ ๋ฐ์ดํฐ์ ์ ์ก ๊ธธ์ด๋ฅผ ๊ฐ๊ฒ ํ๋ ๊ฒ์ผ๋ก์จ, ์ ์ก๋ฅ ์ด ๋ฎ์ ๋จ๋ง์ ๋ฐ์ดํฐ ์ ์ก ์ ๋ง์ ๋ฌด์ ์์์ ํ ๋น ๋ฐ๊ฒ ๋๋ค. ์ด์ ์ ์ก๋ฅ ์ด ๋ฎ์ ๋จ๋ง๋ก ์ธํด ์ ์ก๋ฅ ์ด ๋์ ๋จ๋ง์๊ฒ ๋ฌด์ ์์์ด ์๋์ ์ผ๋ก ์ ๊ฒ ํ ๋นํ๊ฒ ๋์ด ๋จ๋ง์ ์ฑ๋ฅ์ ๋นํด ๋ถ๋นํ ๋ฌด์ ์์์ ํ ๋น๋ฐ๊ฒ ๋๊ณ ๊ฒฐ๊ตญ ์ ์ก๋ฅ ์ด ๋จ์ด์ง๋ค. ํํธ, Airtime Fairness๋ ๋ฐ์ดํฐ ์ ์ก์ ์๊ฐ์ ๊ธฐ์ค์ผ๋ก ๋ฌด์ ์์์ ํ ๋นํจ์ผ๋ก ์ธํด์ ๋จ๋ง์ ์ ์ก๋ฅ ์ ๋ฐ๋ผ ๋ฌด์ ์์์ ๊ณตํํ๊ฒ ํ ๋น ๋ฐ๊ฒ ๋์ง๋ง, ์ ์ก๋ฅ ์ด ๋ฎ์ ๋จ๋ง์ ์๋์ ์ผ๋ก ๊ธด ์ ์ก์๊ฐ์ผ๋ก ์ธํ์ฌ ์ต์ํ์ ์ ์ก๋ฅ ์ ๋ณด์ฅํ ์ ์๊ฒ ๋๋ค. Accordingly, in the case of throughput fairness, the transmission length of data is equalized to a plurality of terminals, and thus, a lot of radio resources are allocated during data transmission of a terminal having a low transmission rate. As a result, a terminal having a low transmission rate causes a relatively low allocation of radio resources to a terminal having a high transmission rate, and thus receives an unfair radio resource compared to the performance of the terminal. On the other hand, the airtime fairness is equally allocated to the radio resources according to the transmission rate of the terminal by allocating radio resources based on the time of data transmission, but the terminal having a low transmission rate can guarantee the minimum transmission rate due to the relatively long transmission time. It becomes impossible.
๋ณธ ๋ฐ๋ช ์ด ํด๊ฒฐํ๊ณ ์ ํ๋ ๊ณผ์ ๋ ์ ์ก๋ฅ ์ด ๋ฎ์ ๋จ๋ง(Station)๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ๋ํ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ถ์ฌํ๋๋ก ํ๊ณ , ๋๋จธ์ง ๋ฌด์ ์์์ ๋ํด์๋ ๋ค๋ฅธ ๋จ๋ง๋ค์๊ฒ ๊ณตํํ๊ฒ ์์์ ํ ๋นํ๋๋ก ํ๋ WLAN์์ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง ๋ฐฉ๋ฒ ๋ฐ ์ฅ์น์ ๊ดํ ๊ฒ์ด๋ค.The problem to be solved by the present invention is to provide a minimum transmission rate for data transmission to a low transmission rate (Station), and to allocate the resources to other terminals for the remaining radio resources in the WLAN of the access point A scheduling method and apparatus.
์๊ธฐ์ ๊ณผ์ ๋ฅผ ํด๊ฒฐํ๊ธฐ ์ํ ๋ณธ ๋ฐ๋ช ์ ์ผ ์ค์์์ ๋ฐ๋ฅด๋ฉด, WLAN (Wireless Local Area Network) ์์ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง ๋ฐฉ๋ฒ์, ์ ์ก์์์ ์ํด ์ ํ๋ ๋จ๋ง๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ์ค์ ์ ์ก์๊ฐ ๋ฐ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅํ๋ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐ์ถํ๋ ๊ณผ์ ; ๋ฐ ์ฐ์ถ๋ ์๊ธฐ ์ค์ ์ ์ก์๊ฐ๊ณผ ์๊ธฐ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๋น๊ต ๊ฒฐ๊ณผ์ ๋ฐ๋ผ, ๋ค๋ฅธ ๋จ๋ง๋ค๊ณผ ๊ด๋ จํ ์๊ธฐ ๋จ๋ง์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์์๋ฅผ ๋ํ๋ด๋ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์ค์ ํ๋ ๊ณผ์ ์ ํฌํจํ๋ค. According to an embodiment of the present invention for solving the above problems, the scheduling method of an access point in a wireless local area network (WLAN), the actual transmission time and the minimum transmission according to the data transmission to the terminal selected by the transmission rank Calculating a basic transmission time that guarantees speed; And setting schedule index information indicating a data transmission rank with respect to the other terminals with respect to other terminals according to the calculated comparison result of the actual transmission time and the basic transmission time.
์๊ธฐ์ ๊ณผ์ ๋ฅผ ํด๊ฒฐํ๊ธฐ ์ํ ๋ณธ ๋ฐ๋ช ์ ๋ค๋ฅธ ์ค์์์ ๋ฐ๋ฅด๋ฉด, WLAN (Wireless Local Area Network) ์์ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง ์ฅ์น๋, ์ ์ก์์์ ์ํด ์ ํ๋ ๋จ๋ง๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ์ค์ ์ ์ก์๊ฐ ๋ฐ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅํ๋ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐ์ถํ๋ ์ ์ก์๊ฐ ์ฐ์ถ๋ถ; ๋ฐ ์ฐ์ถ๋ ์๊ธฐ ์ค์ ์ ์ก์๊ฐ๊ณผ ์๊ธฐ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๋น๊ต ๊ฒฐ๊ณผ์ ๋ฐ๋ผ, ๋ค๋ฅธ ๋จ๋ง๋ค๊ณผ ๊ด๋ จํ ์๊ธฐ ๋จ๋ง์ ๋ฐ์ดํฐ ์ ์ก์์๋ฅผ ๊ฒฐ์ ํ๋ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์ค์ ํ๋ ์ค์ผ์ค๋ง ์ค์ ๋ถ๋ฅผ ํฌํจํ๋ค.According to another embodiment of the present invention for solving the above problems, the scheduling apparatus of an access point in a wireless local area network (WLAN), the actual transmission time and the minimum transmission according to the data transmission to the terminal selected by the transmission rank A transmission time calculating unit for calculating a basic transmission time for guaranteeing a speed; And a scheduling setting unit configured to set schedule index information for determining a data transmission rank of the terminal with respect to other terminals according to the calculated comparison result of the actual transmission time and the basic transmission time.
๋ณธ ๋ฐ๋ช ์ ๋ฐ๋ฅด๋ฉด, Airtime fairness์์ ์ ์ก๋ฅ ์ด ๋ฎ์ ๋จ๋ง์๊ฒ ์ต์ํ์ ์ ์ก์๋๋ฅผ ์ ๊ณตํ๋ ํจ๊ณผ๊ฐ ์๋ค. ๋ํ, ๋๋จธ์ง ๋ฌด์ ์์์ ๋ํด์๋ ๊ณตํํ๊ฒ ๋ค๋ฅธ ๋จ๋ง๋ค์๊ฒ ์ ์ก ๊ธฐํ๋ฅผ ๋ถ์ฌํจ์ผ๋ก์จ, ์ ์ก๋ฅ ์ด ๋ฎ์ ๋จ๋ง๋ก ์ธํด ๋ค๋ฅธ ๋จ๋ง๋ก์ ์ ์ก ์๊ฐ์ด ์ง์ฐ๋๋ ๊ฒ์ ๋ฐฉ์งํ ์ ์๋ค. According to the present invention, there is an effect of providing a minimum transmission speed to the terminal with a low transmission rate in the airtime fairness. In addition, it is possible to prevent the delay of the transmission time to the other terminal due to the terminal having a low transmission rate by providing a transmission opportunity to other terminals to the other radio resources fairly.
๋ณธ ๋ฐ๋ช ๋ฐ ๊ทธ์ ํจ๊ณผ์ ๋ํ ๋ณด๋ค ์๋ฒฝํ ์ดํด๋ฅผ ์ํด, ์ฒจ๋ถ๋๋ ๋๋ฉด๋ค์ ์ฐธ์กฐํ์ฌ ํ๊ธฐ์ ์ค๋ช ๋ค์ด ์ด๋ฃจ์ด์ง ๊ฒ์ด๊ณ , ์ฌ๊ธฐ์ ๋์ผํ ์ฐธ์กฐ ๋ถํธ๋ค์ ๋์ผํ ๋ถ๋ถ๋ค์ ๋ํ๋ธ๋ค. For a more complete understanding of the present invention and its effects, the following description will be made with reference to the accompanying drawings, wherein like reference numerals denote like parts.
๋ 1์ ์ก์ธ์คํฌ์ธํธ์์ ๋จ๋ง๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ฐ์ดํฐ ์ ์ก์๋(Throughput)์ ์ค์ ์ ์ก์๊ฐ(Airtime)๊ณผ์ ๊ด๊ณ๋ฅผ ๋์ํ ๊ทธ๋ํ์ด๋ค.FIG. 1 is a graph illustrating a relationship between a data transmission rate (Throughput) and an actual transmission time (Airtime) according to data transmission from an access point to a terminal.
๋ 2๋ ๋ณธ ๋ฐ๋ช ์ ๋ฐ๋ฅธ WLAN์์ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง์ ์ค๋ช ํ๊ธฐ ์ํ ๋คํธ์ํฌ ์์คํ ์ ์์ํ ์ฐธ์กฐ๋์ด๋ค.2 is a reference diagram illustrating a network system for explaining scheduling of an access point in a WLAN according to the present invention.
๋ 3์ ๋ณธ ๋ฐ๋ช ๊ณผ ๊ด๋ จํ ์ค์ผ์ค๋ง ๋ฐฉ๋ฒ์ ์ค๋ช ํ๊ธฐ ์ํ ํ๋ก์ฐจํธ์ด๋ค.3 is a flowchart for explaining a scheduling method according to the present invention.
๋ 4๋ ๋ณธ ๋ฐ๋ช ์ ๋ฐ๋ฅธ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง ๋ฐฉ์์ ์ํ ๊ฒฝ์ฐ์, ๋จ๋ง๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ฐ์ดํฐ ์ ์ก์๋(Throughput)์ ์ค์ ์ ์ก์๊ฐ(Airtime)๊ณผ์ ๊ด๊ณ๋ฅผ ๋์ํ ๊ทธ๋ํ์ด๋ค.4 is a graph illustrating a relationship between a data transmission rate (throughput) and an actual transmission time (Airtime) according to data transmission to a terminal when the scheduling method of an access point according to the present invention.
๋ 5๋ ๋ณธ ๋ฐ๋ช ์ ๋ฐ๋ฅธ WLAN์์ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง ๋ฐฉ๋ฒ์ ์ค๋ช ํ๊ธฐ ์ํ ์ผ ์ค์์์ ํ๋ก์ฐจํธ์ด๋ค.5 is a flowchart of an embodiment for explaining a scheduling method of an access point in a WLAN according to the present invention.
๋ 6์ ๋ 5์ ๋์๋ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์ค์ ํ๋ ๊ณผ์ ์ ์ค๋ช ํ๊ธฐ ์ํ ์ผ ์ค์์์ ํ๋ก์ฐจํธ์ด๋ค.FIG. 6 is a flowchart of an exemplary embodiment for explaining a process of setting schedule index information illustrated in FIG. 5.
๋ 7์ ๋ณธ ๋ฐ๋ช ์ ๋ฐ๋ฅธ WLAN์์ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง ์ฅ์น๋ฅผ ์ค๋ช ํ๊ธฐ ์ํ ์ผ ์ค์์์ ๋ธ๋ก๋์ด๋ค.7 is a block diagram of an embodiment for explaining an apparatus for scheduling an access point in a WLAN according to the present invention.
๋ 8์ ๋ 7์ ๋์๋ ์ค์ผ์ค๋ง ์ค์ ๋ถ๋ฅผ ์ค๋ช ํ๊ธฐ ์ํ ์ผ ์ค์์์ ๋ธ๋ก๋์ด๋ค.FIG. 8 is a block diagram of an exemplary embodiment for describing the scheduling setting unit illustrated in FIG. 7.
๋ณธ ํนํ ๋ช ์ธ์์์ ๋ณธ ๋ฐ๋ช ์ ์๋ฆฌ๋ค์ ์ค๋ช ํ๊ธฐ ์ํด ์ฌ์ฉ๋๋ ๋ 1 ๋ด์ง ๋ 8์ ๋จ์ง ์์๋ฅผ ์ํ ๊ฒ์ธ ๋ฐ, ๋ฐ๋ช ์ ๋ฒ์๋ฅผ ์ ํํ๋ ์ด๋ ํ ๊ฒ์ผ๋ก๋ ํด์๋์๋ ์๋๋๋ค. ๋นํด ๋ถ์ผ์์ ํต์์ ์ง์์ ๊ฐ์ง ์๋ ๋ณธ ๋ฐ๋ช ์ ์๋ฆฌ๋ค์ด ์ ์ ํ๊ฒ ๋ฐฐ์น๋ ์์์ ๋ฌด์ ํต์ ์์คํ ์์๋ ๊ตฌํ๋ ์ ์์์ ์ดํดํ ๊ฒ์ด๋ค. 1 to 8 used in the present patent specification to explain the principles of the present invention are for illustration only and should not be construed as limiting the scope of the invention. Those skilled in the art will understand that the principles of the present invention may be implemented in any wireless communication system in which it is appropriately arranged.
ํ๊ธฐ์์ ์ค๋ช ๋ ๋ณธ ๋ฐ๋ช ์ ์ค์์๋ค์ ์ก์ธ์ค ํฌ์ธํธ(Access Point)์์์ ์ต์ํ์ ์ ์ก์๋(Throughput)๋ฅผ ๋ณด์ฅํ๋ฉด์ ์ ์ก ์์์ ๊ณตํํ๊ฒ ๋ฐฐ๋ถํ๊ธฐ ์ํ ๊ฒ์ด๋ค.Embodiments of the present invention to be described below are for evenly allocating transmission resources while guaranteeing a minimum throughput at an access point.
๋ 2๋ ๋ณธ ๋ฐ๋ช
์ ๋ฐ๋ฅธ WLAN์์ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง์ ์ค๋ช
ํ๊ธฐ ์ํ ๋คํธ์ํฌ ์์คํ
์ ์์ํ ์ฐธ์กฐ๋๋ก์, ๋คํธ์ํฌ(10), ์ก์ธ์คํฌ์ธํธ(20) ๋ฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)์ ํฌํจํ๋ค. ๋ 2๋ฅผ ์ฐธ์กฐํ๋ฉด, ๋ณธ ๋ฐ๋ช
์ด ์ ์ฉ๋๋ ๋คํธ์ํฌ(10)๋ ํ ๊ฐ ์ด์์ ์ก์ธ์ค ํฌ์ธํธ(10)์, ์ก์ธ์ค ํฌ์ธํธ(10)์ ์ฐ๊ฒฐ๋ ์ ์๋ ํ ๊ฐ ์ด์์ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)๊ณผ ์ ์ ๊ฐ๋ฅํ ๋ง์ ํฌํจํ๋ค. ์ฌ๊ธฐ์ ๋คํธ์ํฌ(10)๋ ์ก์ธ์คํฌ์ธํธ(20) ๋ฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)์ ๋ฐ์ดํฐ๋ฅผ ์ก์์ ํ๋ฉฐ, ๋ผ์ฐํฐ(๋ฏธ๋์)๋ฅผ ํตํด ํด๋น ๋ชฉ์ ์ง์ ๋ฐ์ดํฐ๋ฅผ ๊ตํํ๋ ๋ง๊ตฌ์กฐ๋ฅผ ๊ฐ๋ ๊ด์ญ ๋คํธ์ํฌ๋ฅผ ํฌํจํ๋ ๊ฒ์ผ๋ก, ์ธํฐ๋ท๋ง ๋๋ ์ด๋ํต์ ๋ง์ ์์ํ ์ ์๋ค.2 is a reference diagram illustrating a network system for explaining scheduling of an access point in a WLAN according to the present invention, and includes a
์ก์ธ์ค ํฌ์ธํธ(20)๋ ๋คํธ์ํฌ(10)์ ์ฐ๊ฒฐ๋์ด ์์ผ๋ฉฐ, ์ผ์ ๊ฑฐ๋ฆฌ ๋ด์ ์กด์ฌํ๋ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)๊ณผ ๋ฌด์ ์ผ๋ก ํต์ ํ์ฌ, ๋คํธ์ํฌ์์ ์ ๊ณต๋๋ ๋ฐ์ดํฐ๋ฅผ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)๋ก ์ ์กํ๊ณ , ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)๋ก๋ถํฐ ์์ ๋๋ ๋ฐ์ดํฐ๋ฅผ ๋คํธ์ํฌ(10)๋ฅผ ํตํด ํด๋น ๋ชฉ์ ์ง๋ก ์ ์กํ๋ค. The
์ด๋ฅผ ์ํด, ์ก์ธ์ค ํฌ์ธํธ(20)๋, ์ํ
๋(๋ฏธ๋์), ์์ ๊ธฐ(๋ฏธ๋์), ์ก์ ๊ธฐ(๋ฏธ๋์), ๋ณต์กฐ๊ธฐ(๋ฏธ๋์), ๋ณ์กฐ๊ธฐ(๋ฏธ๋์), ๋คํธ์ํฌ ์ธํฐํ์ด์ค๋ชจ๋(๋ฏธ๋์), ์ค์ผ์ค๋ฌ, ๋ฉ๋ชจ๋ฆฌ(๋ฏธ๋์), ํ๋ก์ธ์(๋ฏธ๋์) ๋ฑ์ ๊ตฌ์ฑ์์๋ฅผ ๊ตฌ๋นํ๋ค.To this end, the
์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)๋ก๋ถํฐ ์ ์ก๋ ์ ํธ๋ ์ํ
๋๋ฅผ ํตํด ์์ ๋๋ฉฐ, ์์ ๊ธฐ๋ ๋ฌด์ ์ฃผํ์ ๋ ๋ฒ ์ด์ค๋ฐด๋ ๋ณํ, ์ฆํญ, ์๋ ๋ก๊ทธ ๋ ๋์งํธ ๋ณํ, ํํฐ๋ง ๋ฑ์ ํฌํจํ๋ ๋ค์ํ ์ฒ๋ฆฌ๋ค์ ์ํํ๋ค. ์์ ๊ธฐ์์ ์์ ํ ์ ํธ๋ ํ๋ ์ด์์ ํต์ ์ค๊ณ ๋๋ ํ์ค์ ๋ฐ๋ผ ๋ณต์กฐ๊ธฐ์์ ๋ณต์กฐ๋๋ค. ๋ณต์กฐ๊ธฐ๋ ๋ ์ดํธ ์์ , ๋ฑํ, ๊ฒฐํฉ, ๋์ธํฐ๋ฆฌ๋น, ๋์ฝ๋ฉ, ๋ฐ ์์ ๋ ์ ํธ ํฌ๋งท์ ์ํด ์๊ตฌ๋๋ ๋ค์ํ ๋ค๋ฅธ ๊ธฐ๋ฅ๋ค์ ์ํํ๋ค. ๋ณต์กฐ๊ธฐ์์ ๋ณต์กฐ๋ ์ ํธ๋ฅผ ๋คํธ์ํฌ ์ธํฐํ์ด์ค๋ชจ๋์ ํตํด ๋คํธ์ํฌ(10)๋ก ์ ์ก๋๋ค. Signals transmitted from the terminal 1 (30), the terminal 2 (40) to the terminal n (50) are received through an antenna, the receiver includes radio frequency to baseband conversion, amplification, analog to digital conversion, filtering, etc. Perform various processes. The signal received at the receiver is demodulated in a demodulator in accordance with one or more communication designs or standards. The demodulator performs rate reception, equalization, combining, deinterleaving, decoding, and various other functions required by the received signal format. The demodulated signal is transmitted to the
ํํธ, ๋คํธ์ํฌ(10)๋ก๋ถํฐ ์ ์ก๋ ๋ฐ์ดํฐ๋ ๋คํธ์ํฌ ์ธํฐํ์ด์ค๋ชจ๋์ ํตํด ์์ ๋๋ฉฐ, ์์ ๋ ๋ฐ์ดํฐ๋ ๋ฐ์ดํฐ๋ ๋ณ์กฐ๊ธฐ์ ์ํด ๋ณ์กฐ๋์ด ์ก์ ๊ธฐ๋ก ์ ๊ณต๋๋ค. ์ก์ ๊ธฐ๋ ์์ ๋ ๋ฐ์ดํฐ์ ๋ํด ๋ฌด์ ์์คํ
ํ์ค์ ๋ฐ๋ผ ํฌ๋งทํ
ํ ํ, ์ํ
๋๋ก ์ ์กํ๋ฉฐ, ์ํ
๋๋ ํฌ๋งทํ
๋ ๋ฐ์ดํฐ๋ฅผ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)๋ก ๋ฌด์ ์ ์กํ๋ค. ์ด๋, ์ค์ผ์ค๋ฌ๋ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)๋ก ์ ์กํ ๋ฐ์ดํฐ์ ๋ํด ๋ํด, ์ค์ผ์ค๋ง ์๊ณ ๋ฆฌ์ฆ์ ๋ฐ๋ผ, ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์๋ฒ์ ํด๋นํ๋ ์ ์ก ์ค์ผ์ค ์ธ๋ฑ์ค๋ฅผ ์์ฑํ๋ฉฐ, ์ ์ก ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ฐ๋ผ ๊ฐ๊ฐ์ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)๋ก ๋ฐ์ดํฐ๊ฐ ์์ฐจ์ ์ผ๋ก ์ ์ก๋๋ค. ์ค์ผ์ค๋ฌ์ ๋ํ ์์ธํ ๋ด์ฉ์ ํ์ ํ๋ค.Meanwhile, data transmitted from the
๋ฉ๋ชจ๋ฆฌ๋ ๋ฐ์ดํฐ์ ์ /๋ฌด์ ์ ์ก์ ์ํ ๋ค์ํ ์ ๋ณด๋ฅผ ์ ์ฅํ๊ณ ์์ผ๋ฉฐ, ํนํ, ๋ณธ ๋ฐ๋ช ๊ณผ ๊ด๋ จํ ์ค์ผ์ค ์ธ๋ฑ์ค ์ ๋ณด๋ฅผ ์ ์ฅํ๊ณ ์๋ค. The memory stores various information for wired / wireless transmission of data, and in particular, stores schedule index information related to the present invention.
ํ๋ก์ธ์๋ ์ ์ ํ ์ก์ธ์ค ํฌ์ธํธ(10)์ ๊ฐ ๊ตฌ์ฑ์์๋ค์ ๋ํ ์ ๋ฐ์ ์ธ ๋์์ ์ ์ดํ๋ค.The processor controls the overall operation of each of the components of the
์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)์ ์ผ์ ๊ฑฐ๋ฆฌ ๋ด์ ์กด์ฌํ๋ ์ก์ธ์ค ํฌ์ธํธ(20)์ ๋ฌด์ ์ผ๋ก ๊ทผ๊ฑฐ๋ฆฌ ํต์ ์ ์ํํ ์ ์๋ ๋จ๋ง์ด๋ค. ์๋ฅผ ๋ค๋ฉด, ์ค๋งํธ ํฐ(smartphone), ํ๋ธ๋ฆฟ PC(tablet personal computer), ์ด๋์ ํ๊ธฐ(mobile phone), ํ์์ ํ๊ธฐ, ์ ์๋ถ ๋ฆฌ๋๊ธฐ(e-book reader), ๋ฐ์คํฌํ PC(desktop personal computer), ๋ฉํ PC(laptop personal computer), ๋ท๋ถ ์ปดํจํฐ(netbook computer), PDA(personal digital assistant), PMP(portable multimedia player), MP3 ํ๋ ์ด์ด, ๋ชจ๋ฐ์ผ ์๋ฃ๊ธฐ๊ธฐ, ์ ์ ํ์ฐ, ์ ์ ๋ชฉ๊ฑธ์ด, ์ ์ ์ฑ์ธ์๋ฆฌ(appcessory), ์นด๋ฉ๋ผ(camera), ์จ์ด๋ฌ๋ธ ์ฅ์น(wearable device), ์ ์ ์๊ณ(electronic clock), ์๋ชฉ ์๊ณ(wrist watch), ์ค๋งํธ ๊ฐ์ (smart white appliance)(์: ๋์ฅ๊ณ , ์์ด์ปจ, ์ฒญ์๊ธฐ, ์ธ๊ณต ์ง๋ฅ ๋ก๋ด, TV, DVD(digital video disk) ํ๋ ์ด์ด, ์ค๋์ค, ์ค๋ธ, ์ ์๋ ์ธ์ง, ์ธํ๊ธฐ, ๊ณต๊ธฐ ์ฒญ์ ๊ธฐ, ์ ์ ์ก์ ๋ฑ), ๊ฐ์ข
์๋ฃ๊ธฐ๊ธฐ(์: MRA(magnetic resonance angiography), MRI(magnetic resonance imaging), CT(computed tomography), ์ดฌ์๊ธฐ, ์ด์ํ๊ธฐ ๋ฑ), ๋ค๋น๊ฒ์ด์
(navigation) ์ฅ์น, GPS ์์ ๊ธฐ(global positioning system receiver), EDR(event data recorder), FDR(flight data recorder), ์
ํฑ ๋ฐ์ค(set-top box), TV ๋ฐ์ค(์๋ฅผ ๋ค๋ฉด, ์ผ์ฑ HomeSyncTM, ์ ํTVTM, ๋๋ ๊ตฌ๊ธ TVTM), ์ ์ ์ฌ์ , ์๋์ฐจ ์ธํฌํ
์ธ๋จผํธ(infotainment) ์ฅ์น, ์ ๋ฐ์ฉ ์ ์ ์ฅ๋น(electronic equipment for ship, ์๋ฅผ ๋ค๋ฉด, ์ ๋ฐ์ฉ ํญ๋ฒ ์ฅ์น, ์์ด๋ก ์ฝคํ์ค ๋ฑ), ํญ๊ณต ์ ์๊ธฐ๊ธฐ(avionics), ๋ณด์ ๊ธฐ๊ธฐ, ์ ์ ์๋ณต, ์ ์ ํค, ์บ ์ฝ๋(camcorder), ๊ฒ์ ์ฝ์(game consoles), HMD(head-mounted display), ํํํ์์ฅ์น(flat panel display device), ์ ์ ์จ๋ฒ, ํต์ ๊ธฐ๋ฅ์ ํฌํจํ ๊ฐ๊ตฌ(furniture) ๋๋ ๊ฑด๋ฌผ/๊ตฌ์กฐ๋ฌผ์ ์ผ๋ถ, ์ ์ ๋ณด๋(electronic board), ์ ์ ์ฌ์ธ ์
๋ ฅ์ฅ์น(electronic signature receiving device) ๋๋ ํ๋ก์ ํฐ(projector) ๋ฑ์ ๋ค์ํ ์ฅ์น๋ค ์ค ํ๋ ๋๋ ๊ทธ ์ด์์ ์กฐํฉ์ผ ์ ์๋ค. ๋ณธ ๋ฐ๋ช
์ ์ผ ์ค์์์ ๋ฐ๋ฅธ ๋จ๋ง๋ค์ ์ ์ ํ ๊ธฐ๊ธฐ๋ค์ ํ์ ๋์ง ์๋๋ค.The terminal 1 (30), the terminal 2 (40) to the terminal n (50) is a terminal capable of wirelessly performing short-range communication with the
๋ 3์ ๋ณธ ๋ฐ๋ช ๊ณผ ๊ด๋ จํ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง๋ฐฉ๋ฒ์ ์ค๋ช ํ๊ธฐ ์ํ ํ๋ก์ฐจํธ์ด๋ค.3 is a flowchart illustrating a scheduling method of an access point according to the present invention.
๋ณธ ๋ฐ๋ช ์์ WLAN์์ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง์ ๊ณผํ ๊ธฐ์ ๋ด์ฉ์ ์ค๋ช ํ๊ธฐ ์ํ ์ฉ์ด๋ฅผ ๋ค์๊ณผ ๊ฐ์ด ์ ์ํ๋ค. AP๋ ์ก์ธ์คํฌ์ธํธ(Access Point)๋ฅผ ์๋ฏธํ๊ณ , STA๋ ๋จ๋ง์ ์๋ฏธํ๊ณ , SQ๋ STA ์ ์ก Service Queue๋ฅผ ์๋ฏธํ๊ณ , ASQ๋ Active Service Queue๋ก์, AP์์ ์ ์กํ ๋ฐ์ดํฐ๊ฐ ์กด์ฌํ๋ STA์ Queue๋ฅผ ์๋ฏธํ๊ณ , GMT๋ Guaranteed Minimum Throughput๋ก์, ์ต์ํ์ ์ ์ก์๋๋ฅผ ์๋ฏธํ๊ณ , Schedule Index๋ ์ค์ผ์ค๋ฌ๊ฐ SQ๋ฅผ ์ ํํ ๋ ์ฐธ์กฐํ๋ ๊ฐ STA์ ์ธ๋ฑ์ค๋ฅผ ์๋ฏธํ๊ณ , TAirtime์ ์ ์กํ ๋ฐ์ดํฐ์ ์ค์ ์ ์ก์๊ฐ์ ์๋ฏธํ๊ณ , TBaseAirtime ์ ์ ์กํ ๋ฐ์ดํฐ์ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅํ๊ธฐ ์ํ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์๋ฏธํ๋ค.In the present invention, terms for describing the technical contents related to scheduling of an access point in a WLAN are defined as follows. An AP means an access point, an STA means a terminal, an SQ means an STA transmission service queue, an ASQ is an active service queue, and means a queue of an STA in which data to be transmitted from the AP exists. GMT is Guaranteed Minimum Throughput, which means the minimum transmission speed, Schedule Index means the index of each STA that the scheduler refers to when selecting the SQ, T Airtime means the actual transmission time of data to be transmitted, and T BaseAirtime is It means the basic transmission time to guarantee the minimum transmission speed of data to be transmitted.
๋จผ์ , ์ ํ๋ ์ด๋ ํ๋์ ๋จ๋ง(STA)์ ๋ํ ๋ฐ์ดํฐ ์ ์ก ์์ service time(TAirtime)์ ๊ณ์ฐํ๋ค(S100 ๋จ๊ณ). ์ค์ผ์ค๋ฌ์ ์ํด ์ ํ๋ STA์ ํ์ฌ์ ์ ์ก๋ฅ ๊ณผ ์ ์กํ ๋ฐ์ดํฐ์ ๊ธธ์ด๋ฅผ ์ด์ฉํ์ฌ ์ค์ ์ ์ก์๊ฐ(TAirtime)์ ๊ณ์ฐํ๋ค. ๋ค์์ ์ํ์ 1์ ์ค์ ์ ์ก์๊ฐ(TAirtime)์ ์ฐ์ถํ๊ธฐ ์ํ ์์์ด๋ค.First, a service time (T Airtime ) at the time of data transmission for one selected terminal STA is calculated (step S100). The actual transmission time T Airtime is calculated using the current transmission rate of the STA selected by the scheduler and the length of data to be transmitted. Equation 1 below is an equation for calculating the actual transmission time (T Airtime ).
์ํ์ 1
์ฌ๊ธฐ์, T(k)Airtime๋ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50) ์ค ์ด๋ ํ๋์ ๋จ๋ง k์ ๋ํ ์ค์ ์ ์ก์๊ฐ์ ์๋ฏธํ๊ณ , Length(k)๋ ๋จ๋ง k๋ก ์ ์กํ ๋ฐ์ดํฐ์ ๊ธธ์ด๋ฅผ ์๋ฏธํ๊ณ , PHY Rate(k)๋ ๋จ๋ง k๋ก ์ ์กํ ๋ฐ์ดํฐ์ ๋ํ ํ์ฌ์ ์ ์ก๋ฅ ์ ์๋ฏธํ๋ค. Here, T (k) Airtime means the actual transmission time for any one terminal k of the terminal 1 (30), the terminal 2 (40) to the terminal n (50), Length (k) is transmitted to the terminal k It means the length of data, PHY Rate (k) means the current transmission rate for the data to be transmitted to the terminal k.
S100 ๋จ๊ณ ํ์, ๋ฐ์ดํฐ ์ ์ก ์์ ์ต์ํ์ ์ ์ก์๋(Throughput)๋ฅผ ๋ณด์ฅํ๊ธฐ ์ํ Base time(TBaseAirtime)๋ฅผ ๊ณ์ฐํ๋ค(S102 ๋จ๊ณ). ํ์ฌ์ ์ ์ก์๋์ ์ ์กํ ๋ฐ์ดํฐ์ ๊ธธ์ด ๋ฐ ์ต์ํ์ Throughput์ ๋ณด์ฅํ๋ ์ ์ก์๋๋ฅผ ์ด์ฉํ์ฌ ๊ธฐ๋ณธ ์ ์ก์๊ฐ(TBaseAirtime)์ ๊ณ์ฐํ๋ค. ๋ค์์ ์ํ์ 2๋ ๊ธฐ๋ณธ ์ ์ก์๊ฐ(TBaseAirtime)์ ์ฐ์ถํ๊ธฐ ์ํ ์์์ด๋ค.After step S100, a base time (T BaseAirtime ) for calculating a minimum transmission speed (Throughput) during data transmission is calculated (step S102). Calculate the T BaseAirtime using the current transmission rate, the length of the data to be transmitted, and the transmission rate that guarantees minimal throughput. Equation 2 below is a formula for calculating the base transmission time (T BaseAirtime ).
์ํ์ 2
์ฌ๊ธฐ์, T(k)BaseAirtime๋ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)์ค ์ด๋ ํ๋์ ๋จ๋ง k์ ๋ํ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์๋ฏธํ๊ณ , MinGTP๋ ๋จ๋ง ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ๋ํ ์ต์ํ์ ์ ์ก์๋(Throughput)๋ฅผ ์๋ฏธํ๊ณ , TP(k)๋ ๋จ๋ง k๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ๋ํ ํ์ฌ ์ ์ก์๋๋ฅผ ์๋ฏธํ๋ค.Here, T (k) BaseAirtime means a base transmission time for any one terminal k of the terminal 1 (30), the terminal 2 (40) to the terminal n (50), Min GTP is the terminal 1 (30) ), Means a minimum throughput for data transmission to the terminal 2 (40) to the terminal n (50), and TP (k) refers to the current transmission rate for the data transmission to the terminal k.
S102 ๋จ๊ณ ํ์, ์ค์ ์ ์ก์๊ฐ(service time: T(k)Airtime)๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ(Base time : T(k)BaseAirtime)์ ์๊ฐ๊ฐ์ ๋น๊ตํ๋ค(S104 ๋จ๊ณ). After step S102, the time value of the actual transmission time (T (k) Airtime ) and the base transmission time (Base time: T (k) BaseAirtime ) are compared (step S104).
๋ง์ผ, ์ค์ ์ ์ก์๊ฐ(service time: T(k)Airtime)์ ํฌ๊ธฐ๊ฐ ๊ธฐ๋ณธ ์ ์ก์๊ฐ(Base time: T(k)BaseAirtime)์ ํฌ๊ธฐ๋ณด๋ค ํฌ๋ค๋ฉด, Schedule Index๋ฅผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ(Base time: T(k)BaseAirtime)๋งํผ ์ฆ๊ฐ์ํจ๋ค(S106 ๋จ๊ณ). ์ค์ ์ ์ก์๊ฐ(service time: T(k)Airtime)์ ํฌ๊ธฐ๊ฐ ๊ธฐ๋ณธ ์ ์ก์๊ฐ(Base time: T(k)BaseAirtime)๋ณด๋ค ํฌ๋ค๋ฉด, STA๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ ์ ์๋ค. ํํธ, Schedule Index๋ ์ก์ธ์คํฌ์ธํธ(10)๋ก๋ถํฐ ๋ฐ์ดํฐ๋ฅผ ์์ ํ๋ ๋จ๋ง ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50)์ ๋ํ ๋ฐ์ดํฐ ์ ์ก ์์๋ฅผ ๊ฒฐ์ ํ๊ธฐ ์ํ ์ ๋ณด์ด๋ค. ๋ฐ๋ผ์, ๋จ๋ง k๋ก์ ๋ฐ์ดํฐ ์ ์ก ์์ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ ์ ์๋ค๋ฉด, ๋จ๋ง k์ ๋ํ ๋ฐ์ดํฐ ์ ์ก ์์๊ฐ ๋ค๋ฅธ ๋จ๋ง๋ค๋ณด๋ค ์ฐ์ ํ ์ ์๋๋ก Schedule Index๋ฅผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ(Base time: T(k)BaseAirtime)๋งํผ๋ง ์ฆ๊ฐ์ํจ๋ค. ๋ค์์ ์ํ์ 3์ Schedule Index๋ฅผ ๊ฐ์ฐํ๊ธฐ ์ํ ์์์ด๋ค.If the size of the actual service time (T (k) Airtime ) is greater than the size of the base time (T (k) BaseAirtime ), the Schedule Index is set to the base time: T (k ( Air ). ) Increase by BaseAirtime (step S106). If the size of the actual service time T (k) Airtime is larger than the base time T (k) BaseAirtime , the minimum transmission rate for data transmission to the STA cannot be guaranteed. Meanwhile, the schedule index is information for determining a data transmission rank for the terminal 1 (30), the terminal 2 (40) to the terminal n (50) that receives data from the
์ํ์ 3
์ฌ๊ธฐ์, SI(k)+๋ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50) ์ค ๋จ๋ง k์ ๋ํ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ด ๊ฐ์ฐ๋ Schedule Index๋ฅผ ์๋ฏธํ๋ค.Here, SI (k) + means a schedule index to which a basic transmission time for the terminal k of the terminal 1 (30), the terminal 2 (40) to the terminal n (50) is added.
S106 ๋จ๊ณ ํ์, ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐจ์ด๊ฐ์ ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ์ ๊ฐ์ฐํ๋ค(S108 ๋จ๊ณ). ๋จ๋ง k์ ๋ํ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐจ์ด๊ฐ์ ๋จ๋ง k๋ก์ ๋ฐ์ดํฐ ์ ์ก ์์ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ง ๋ชปํ๋ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ํด๋นํ๋ค. ๋ค์์ ์ํ์ 4๋ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐจ์ด๊ฐ์ ์ฐ์ถํ๊ธฐ ์ํ ์์์ด๋ค.After the step S106, the difference value between the actual transmission time and the basic transmission time is added to the short time sum value (step S108). The difference between the actual transmission time and the basic transmission time for the terminal k corresponds to the insufficient transmission time for which the minimum transmission speed is not guaranteed when transmitting data to the terminal k. Equation 4 below is a formula for calculating the difference between the actual transmission time and the basic transmission time.
์ํ์ 4
์ฌ๊ธฐ์, T(k)Insufficient๋ ๋จ๋ง k์ ๋ํ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐจ์ด๊ฐ์ ์๋ฏธํ๋ค. ๋ฐ๋ผ์, T(k)Insufficient๋ ๋จ๋ง k๋ก ๋ฐ์ดํฐ ์ ์ก์ ํ๋๋ฐ ์์ด์ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ง ๋ชปํจ์ผ๋ก ์ธํด ๋ถ์กฑํ ์ ์ก์๊ฐ์ ์๋ฏธํ๋ค. Here, T (k) Insufficient means a difference between the actual transmission time and the basic transmission time for the terminal k. Therefore, T (k) Insufficient means insufficient transmission time due to the inability to guarantee the minimum transmission speed in data transmission to the terminal k.
์ด๋ฌํ, ๋จ๋ง k์ ๋ํ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ์ ๊ฐ์ฐํ๋๋ฐ, ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ์ ์ก์ธ์ค ํฌ์ธํธ(20)๊ฐ ๋ฐ์ดํฐ๋ฅผ ์ ์กํ๋ ๋ชจ๋ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50) ์ค์์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋จ๋ง๋ค์ ์ด๋ฌํ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ํฉ์ฐํ ๊ฐ์ด๋ค. ๋ค์์ ์ํ์ 5๋ ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ์ ์ฐ์ถํ๊ธฐ ์ํ ์์์ด๋ค.The shortage time addition value for the terminal k is added to the shortage time summation value, and the shortage time summation value corresponds to all of the terminal 1 30, the terminal 2 40, and the terminal n (where the
์ํ์ 5
T(Sum)Insufficient๋ ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ์ ํด๋นํ๋ฉฐ, T(1)Insufficient, T(2)Insufficient,..,T(K)Insufficient๋ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐจ์ด๊ฐ ์ฆ, ๊ธฐ๋ณธ ์ ์ก์๊ฐ ๋๋น ์ค์ ์ ์ก์๊ฐ์ ๋ถ์กฑ๋ถ์ผ๋ก, ํด๋นํ๋ ๊ฐ๊ฐ์ ๋จ๋ง๋ค์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์ ๋ํ ๋ถ์กฑ ์๊ฐ์ ์๋ฏธํ๋ค. T (Sum) Insufficient is the sum of insufficient time, and T (1) Insufficient , T (2) Insufficient , .., T (K) Insufficient is the difference between the actual transmission time and the default transmission time. As a shortage of the actual transmission time, it means a short time for data transmission for each corresponding terminal.
S108 ๋จ๊ณ ํ์, ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋จ๋ง๋ค์ ๋ํ ๋จ๋ง ๊ฐฏ์๊ฐ N(Sum)Insufficient์ ๋จ๋ง k๋ฅผ ๊ฐ์ฐํ๋ค(S110 ๋จ๊ณ). ์ค์ ์ ์ก์๊ฐ(service time)์ ํฌ๊ธฐ๊ฐ ๊ธฐ๋ณธ ์ ์ก์๊ฐ(Base time)์ ํฌ๊ธฐ๋ณด๋ค ํฐ ๋จ๋ง์ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ง ๋ชปํ๋ ๋จ๋ง์ ํด๋นํ๋ ๊ฒ์ผ๋ก, ์ก์ธ์ค ํฌ์ธํธ(20)๊ฐ ๋ฐ์ดํฐ๋ฅผ ์ ์กํ๋ ๋ชจ๋ ๋จ๋ง๋ค ์ค์์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ง ๋ชปํ๋ ๋จ๋ง๋ค์ ๊ฐ์์ ๋จ๋ง k๊ฐ ํฌํจ๋๋๋ก ๊ฐ์ฐํ๋ค. After step S108, the terminal k is added to the terminal number value N (Sum) Insufficient for the terminals having insufficient transmission time (step S110). The terminal whose actual size of service time is greater than the size of base time corresponds to a terminal that does not guarantee the minimum transmission rate, and all terminals to which the
ํํธ, S104 ๋จ๊ณ์์, ์ค์ ์ ์ก์๊ฐ(service time)์ ํฌ๊ธฐ๊ฐ ๊ธฐ๋ณธ ์ ์ก์๊ฐ(Base time)์ ํฌ๊ธฐ๋ณด๋ค ํฌ์ง ์๋ค๋ฉด, Schedule Index๋ฅผ ์ค์ ์ ์ก์๊ฐ๋งํผ ์ฆ๊ฐ์ํจ๋ค(S112 ๋จ๊ณ). ๋ค์์ ์ํ์ 6์ Schedule Index๋ฅผ ๊ฐ์ฐํ๊ธฐ ์ํ ์์์ด๋ค.On the other hand, in step S104, if the size of the actual service time (service time) is not greater than the size of the base time (Base time), increase the Schedule Index by the actual transmission time (step S112). Equation 6 below is a formula for adding a Schedule Index.
์ํ์ 6
์ฌ๊ธฐ์, SI(k)+๋ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50) ์ค ๋จ๋ง k์ ๋ํ ์ค์ ์ ์ก์๊ฐ์ด ๊ฐ์ฐ๋ Schedule Index๋ฅผ ์๋ฏธํ๋ค.Here, SI (k) + means a schedule index to which the actual transmission time for the terminal k of the terminal 1 (30), the terminal 2 (40) to the terminal n (50) is added.
S112 ๋จ๊ณ ํ์, ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋จ๋ง์ ๋ํด ์๊ฐ์ด ์ถ๊ฐ์ ์ผ๋ก ํ ๋น๋๋๋ก ํ๊ธฐ ์ํ ๋ถ๋ฐฐ ํ ๋น์๊ฐ์ Schedule Index์ ๊ฐ์ฐํ๋ค(S114 ๋จ๊ณ). ์ฌ๊ธฐ์, ๋ถ๋ฐฐ ํ ๋น์๊ฐ์ ์ ์ก์๋๊ฐ ์ต์ํ์ ์ ์ก์๋๋ณด๋ค ๋น ๋ฅธ ๋จ๋ง k๋ฅผ ์ ์ธํ ๋ค๋ฅธ ๋จ๋ง๋ค ์ค ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋จ๋ง๋ค์ด ์๋ ๊ฒฝ์ฐ์, ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋จ๋ง๋ค์๊ฒ ๊ท ๋ฑํ๊ฒ ๋ถ๋ฐฐํ๊ธฐ ์ํ ์๊ฐ์ ์๋ฏธํ๋ค. ๋ค์์ ์ํ์ 7์ ๋ถ๋ฐฐ ํ ๋น์๊ฐ์ ์ฐ์ถํ๊ธฐ ์ํ ์์์ด๋ค.After step S112, a distribution allocation time is added to the Schedule Index so that time is additionally allocated to the terminal having the insufficient transmission time (step S114). Here, the distribution allocation time is equally distributed to the terminals having insufficient transmission time when there are terminals having insufficient transmission time according to data transmission among the other terminals except the terminal k whose transmission speed is faster than the minimum transmission speed. It means time for. Equation 7 below is an equation for calculating the distribution allocation time.
์ํ์ 7
์ฌ๊ธฐ์, T(k)distribution๋ ์ ์ก์๋๊ฐ ์ต์ํ์ ์ ์ก์๋๋ณด๋ค ๋น ๋ฅธ ๋จ๋ง k์์ ์ ์ก์๋๊ฐ ๋์ง ์์ ๋ค๋ฅธ ๋จ๋ง๋ค์ ํ ๋นํ๊ธฐ ์ํ ๋ถ๋ฐฐ ํ ๋น์๊ฐ์ ์๋ฏธํ๊ณ , N(Sum)asq๋ ์ก์ธ์คํฌ์ธํธ(20)์์ ์ ์กํ ๋ฐ์ดํฐ๊ฐ ์กด์ฌํ๋ ๋จ๋ง๋ค์ ๋ํ ๋จ๋ง ๊ฐฏ์๊ฐ์ ์๋ฏธํ๋ค. ๋ฐ๋ผ์, (N(Sum)asq - N(Sum)Insufficient) ์ด ์๋ฏธํ๋ ๊ฒ์ ์ก์ธ์คํฌ์ธํธ(20)์์ ์ ์กํ ๋ฐ์ดํฐ๊ฐ ์กด์ฌํ๋ ๋จ๋ง๋ค ์ค์์ ๋ฐ์ดํฐ ์ ์ก์๋๊ฐ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ง์กฑํ์ง ๋ชปํ๋ ๋จ๋ง๋ค์ ์ฐจ๊ฐํ ๊ฐ์ด๋ผ๋ ์ ์์, ์ ์ก์๋๊ฐ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ง์กฑํ๋ ๋จ๋ง๋ค์ ๊ฐ์์ ์ดํฉ์ ์๋ฏธํ๋ค.Here, T (k) distribution means a distribution allocation time for allocating to other terminals whose transmission rate is not high in the terminal k whose transmission rate is faster than the minimum transmission rate, and N (Sum) asq is the
์ ์ ํ ์ํ์ 7์์ ์ฐ์ถ๋ ๋ถ๋ฐฐ ํ ๋น์๊ฐ์ Schedule Index์ ์๊ฐ๊ฐ์ ๊ฐ์ฐํจ์ผ๋ก์จ, ์ต์ํ์ ์ ์ก์๋๋ณด๋ค ๋น ๋ฅธ ๋จ๋ง k์ ๋ํ ์ ์ก ์์๋ Schedule Index์ ํฉ์ฐ๋ ๋ถ๋ฐฐ ํ ๋น์๊ฐ๋งํผ ํ์์๋ก ๋ฐ๋ ค๋๊ฒ ๋๋ฉฐ, ๋ฐ๋๋ก, ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ง์กฑํ์ง ๋ชปํ๋ ๋จ๋ง๋ค์ ์๋์ ์ผ๋ก ์๊ธฐ์ ๋ถ๋ฐฐ ํ ๋น์๊ฐ๋งํผ ๋ฐ์ดํฐ ์ ์ก ์์๊ฐ ์ฐ์ ํ ์ ์๋ค. By adding the distribution allocation time calculated in Equation (7) to the time value of the Schedule Index, the transmission rank for the terminal k faster than the minimum transmission rate is pushed back as much as the distribution allocation time added to the Schedule Index. For example, UEs that do not satisfy the minimum transmission rate may be given priority in the data transmission order by the allocation allocation time.
์ ์ ํ S112 ๋จ๊ณ ๋ฐ S114 ๋จ๊ณ๋ฅผ ์ํํ๋ ๊ฒ์ ๋ํด, ํ๋์ ์์์ผ๋ก ํํํ๋ฉด ๋ค์์ ์ํ์ 8๊ณผ ๊ฐ๋ค. For performing the above-described step S112 and S114, it is expressed by the following equation (8).
์ํ์ 8
๋ 4๋ ๋ณธ ๋ฐ๋ช ์ ๋ฐ๋ฅธ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง ๋ฐฉ์์ ์ํ ๊ฒฝ์ฐ์, ๋จ๋ง๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ฐ์ดํฐ ์ ์ก์๋(Throughput)์ ์ค์ ์ ์ก์๊ฐ(Airtime)๊ณผ์ ๊ด๊ณ๋ฅผ ๋์ํ ๊ทธ๋ํ์ด๋ค. ๋ 4์ ๋์๋ ๋ฐ์ ๊ฐ์ด, ์ต์ํ์ ๋ณด์ฅ ์ ์ก์๋(Throughput)๋ณด๋ค ๋ฎ์ ์ ์ก์๋(Low)๋ฅผ ๊ฐ๋ ๋จ๋ง์ ๋ํด์๋ ์ ์ก ์์๊ฐ ์ฐ์ ํ๋๋ก ์ค์ผ์ค๋งํจ์ผ๋ก์จ, ์ต์ํ์ ๋ณด์ฅ ์ ์ก์๋๋ฅผ ๋ง์กฑํ๋๋ก ๋ฐ์ดํฐ๊ฐ ์ ์ก๋๋ ํจ๊ณผ๋ฅผ ์ป๋๋ค. ํํธ, ์ต์ํ์ ๋ณด์ฅ ์ ์ก์๋๋ณด๋ค ๋์ ์ ์ก์๋(Very High)๋ฅผ ๊ฐ๋ ๋จ๋ง์ ๋ํด์๋ ์ ์ก ์์๊ฐ ์๋์ ์ผ๋ก ํ์์๊ฐ ๋๋๋ก ์ค์ผ์ค๋งํจ์ผ๋ก์จ, ์ต์ํ์ ๋ณด์ฅ ์ ์ก์๋๋ฅผ ๋ง์กฑํ๋ ํ๋๋ด์์ ์ ์ก์๋๊ฐ ๊ฐ์ํ๊ฒ ๋๋ค.4 is a graph illustrating a relationship between a data transmission rate (throughput) and an actual transmission time (Airtime) according to data transmission to a terminal when the scheduling method of an access point according to the present invention. As shown in FIG. 4, the UE has a low transmission rate (Low) than the minimum guaranteed transmission rate (Throughput) by scheduling the transmission priority to the priority, thereby the effect that the data is transmitted to satisfy the minimum guaranteed transmission rate Get On the other hand, for a terminal having a higher transmission rate (Very High) than the minimum guaranteed transmission rate by scheduling the transmission order to be relatively low priority, the transmission rate is reduced within the limit that satisfies the minimum guaranteed transmission rate.
๋ 5๋ ๋ณธ ๋ฐ๋ช ์ ๋ฐ๋ฅธ WLAN์์ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง ๋ฐฉ๋ฒ์ ์ค๋ช ํ๊ธฐ ์ํ ์ผ ์ค์์์ ํ๋ก์ฐจํธ์ด๋ค.5 is a flowchart of an embodiment for explaining a scheduling method of an access point in a WLAN according to the present invention.
์ ์ก์์์ ์ํด ์ ํ๋ ๋จ๋ง๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ์ค์ ์ ์ก์๊ฐ ๋ฐ ์ต์ํ์ ์ ์ก์๋(Throughput)์ ๋ณด์ฅํ๋ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐ์ถํ๋ค(S200 ๋จ๊ณ).A basic transmission time is guaranteed according to the data transmission to the terminal selected by the transmission rank and a basic transmission time that guarantees a minimum transmission speed (step S200).
์๋ฅผ ๋ค์ด, ๊ธฐ ์ค์ ๋ ์ ์ก์์์ ๋ฐ๋ผ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50) ์ค ์ด๋ ํ๋์ ๋จ๋ง k๋ก์ ๋ฐ์ดํฐ ์ ์ก์ด ๊ฒฐ์ ๋๋ฉด, ์ ํ๋ ๋จ๋ง k์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์ ๋ํ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐ์ถํ๋ค. ๋จ๋ง k์ ๋ํ ์ค์ ์ ์ก์๊ฐ์ ์ ์ ํ ์ํ์ 1์ ์ด์ฉํ์ฌ ์ฐ์ถํ๋ค. ๋ํ, ๋จ๋ง k์ ๋ํ ํ์ฌ์ ์ ์ก์๋์ ์ ์กํ ๋ฐ์ดํฐ์ ๊ธธ์ด ๋ฐ ์ต์ํ์ Throughput์ ๋ณด์ฅํ๋ ์ ์ก์๋๋ฅผ ์ด์ฉํ์ฌ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ณ์ฐํ๋ค. ๋จ๋ง k์ ๋ํ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ ์ ํ ์ํ์ 2๋ฅผ ์ด์ฉํ์ฌ ์ฐ์ถํ๋ค.For example, when data transmission to one of the terminals k of the terminal 1 (30), the terminal 2 (40) to the terminal n (50) is determined according to a preset transmission priority, the data transmission for the selected terminal k is performed. Calculate the actual transfer time and the default transfer time. The actual transmission time for the terminal k is calculated by using Equation 1 described above. In addition, the basic transmission time is calculated using the current transmission rate for the terminal k, the length of data to be transmitted, and a transmission rate that guarantees a minimum throughput. The basic transmission time for the terminal k is calculated by using Equation 2 described above.
S200 ๋จ๊ณ ํ์, ์ฐ์ถ๋ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๋น๊ต ๊ฒฐ๊ณผ์ ๋ฐ๋ผ, ๋ค๋ฅธ ๋จ๋ง๋ค๊ณผ ๊ด๋ จํ ํด๋น ๋จ๋ง์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์์๋ฅผ ๋ํ๋ด๋ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์ค์ ํ๋ค(S202). ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ ๋จ๋ง์ ๋ฐ์ดํฐ ์ ์ก์์๋ฅผ ๊ฒฐ์ ํ๊ธฐ ์ํ ์๊ฐ๊ฐ์ ํด๋นํ๋ฉฐ, ์๊ฐ๊ฐ์ด ์์์๋ก ํด๋น ๋จ๋ง๋ก์ ๋ฐ์ดํฐ ์ ์ก ์์๊ฐ ์ฐ์ ํ๋ค. After the step S200, according to the calculated comparison result of the actual transmission time and the basic transmission time, schedule index information indicating the data transmission order for the corresponding terminal with respect to the other terminals is set (S202). The schedule index information corresponds to a time value for determining the data transmission rank of the terminal. The smaller the time value, the higher the data transmission rank to the corresponding terminal.
๋ 6์ ๋ 5์ ๋์๋ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์ค์ ํ๋ ๊ณผ์ ์ ์ค๋ช ํ๊ธฐ ์ํ ์ผ ์ค์์์ ํ๋ก์ฐจํธ์ด๋ค.FIG. 6 is a flowchart of an exemplary embodiment for explaining a process of setting schedule index information illustrated in FIG. 5.
๋จผ์ , S200 ๋จ๊ณ์์ ์ฐ์ถ๋ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ์ ๋น๊ตํ๋ค(S300).First, a value of the actual transmission time and the basic transmission time calculated in step S200 are compared (S300).
๋ง์ผ, ์ค์ ์ ์ก์๊ฐ์ด ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ๋ณด๋ค ํฌ๋ค๋ฉด, ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด์ ์๊ฐ๊ฐ์ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ์ฐํ์ฌ ์ค์ ํ๋ค(S302). ์๋ฅผ ๋ค์ด, ๋จ๋ง k์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์ค์ ์ ์ก์๊ฐ์ด ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ๋ณด๋ค ํฌ๋ค๋ ๊ฒ์ ๋จ๋ง k๋ก ๋ฐ์ดํฐ๋ฅผ ์ ์กํ๋๋ฐ ์ผ๋ฐ์ ์ผ๋ก ์์๋๋ ์๊ฐ๋ณด๋ค ๋ ๋ง์ ์๊ฐ์ ํ์๋ก ํ๋ค๋ ๊ฒ์ ์๋ฏธํ๋ค. ๋ฐ๋ผ์, ๋จ๋ง k๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์ต์ํ์ ์ ์ก์๋๊ฐ ๋ณด์ฅ๋ฐ์ง ๋ชปํ๋ค๋ ๊ฒ์ ์๋ฏธํ๋ ๊ฒ์ผ๋ก, ๋จ๋ง k๋ก์ ๋ฐ์ดํฐ ์ ์ก ์์๋ ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋นํด ๋ ๋ง์ ๋ฐ์ดํฐ ์ ์ก์๊ฐ์ด ํ ๋น๋์ด์ผ ํ๋ค. ์ ์ ํ ๋ฐ์ ๊ฐ์ด, ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ ๊ฐ ๋จ๋ง๋ก ๋ฐ์ดํฐ๋ฅผ ์ ์กํ๊ธฐ ์ํ ์์๋ฅผ ๊ฒฐ์ ํ๋ ์ ๋ณด๋ผ๋ ์ ์์, ๋จ๋ง k์ ๋ํ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋นํด ์์๊ฐ ์ฐ์ ํ๋๋ก ํ๊ธฐ ์ํด ์ต์ํ์ ์๊ฐ๊ฐ๋ง์ ๊ฐ์ฐํ๋๋ก ํ๊ธฐ ์ํด, ๊ธฐ๋ณธ ์ ์ก์๊ฐ๋ง์ ๊ฐ์ฐํ์ฌ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์ค์ ํ๋ค. ๋จ๋ง k์ ๋ํ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด์ ์ค์ ์ ์ ์ ํ ์ํ์ 3์ ์ด์ฉํ์ฌ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด์ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ์ฐํ์ฌ ์ค์ ํ๋ค.If the actual transmission time is greater than the value of the basic transmission time, the basic transmission time is added to the time value of the schedule index information and set (S302). For example, the actual transmission time for data transmission for the terminal k is greater than the value of the basic transmission time means that more time is required than the time normally required for transmitting data to the terminal k. Therefore, it means that the minimum transmission speed for data transmission to the terminal k is not guaranteed, and when transmitting data to the terminal k, more data transmission time should be allocated than other terminals. As described above, since the schedule index information is information for determining a rank for transmitting data to each terminal, the schedule index information for the terminal k has a minimum time value in order to give priority to the other terminals. In order to add, the schedule index information is set by adding only the basic transfer time. The schedule index information for the terminal k is set by adding a basic transmission time to the schedule index information by using Equation 3 described above.
S302 ๋จ๊ณ ํ์, ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐจ์ด๊ฐ๋งํผ์ ํด๋น ๋จ๋ง๋ก์ ๋ฐ์ดํฐ ์ ์ก ์์ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ง ๋ชปํ๋ ๋ถ์กฑํ ์ ์ก์๊ฐ์ผ๋ก ๊ฐ์ฃผํ์ฌ, ๋ค๋ฅธ ๋จ๋ง๋ค ์ค ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋จ๋ง๋ค์ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ํฉ์ฐํ ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ์ ์๊ธฐ ์ฐจ์ด๊ฐ์ ๊ฐ์ฐํ๋ค(S304 ๋จ๊ณ). ์๋ฅผ ๋ค์ด, ๋จ๋ง k์ ๋ํ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐจ์ด๊ฐ์ ๋ฐ์ดํฐ ์ ์ก ์์ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ง ๋ชปํ๋ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ์๋ฏธํ๋ค. ๋จ๋ง k์ ๋ํ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐจ์ด๊ฐ์ ์ ์ ํ ์ํ์ 4๋ฅผ ์ด์ฉํ์ฌ ์ฐ์ถํ๋ค. ์ํ์ 4๋ฅผ ์ด์ฉํด ์ฐ์ถ๋ ์ฐจ์ด๊ฐ์ ๋จ๋ง k์ ๋ํ ๋ถ์กฑํ ์ ์ก์๊ฐ์ผ๋ก์ ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ์ ๊ฐ์ฐ๋๋ค. ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ์ ์ก์ธ์ค ํฌ์ธํธ(20)๊ฐ ๋ฐ์ดํฐ๋ฅผ ์ ์กํ๋ ๋ชจ๋ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50) ์ค์์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋จ๋ง๋ค์ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ํฉ์ฐํ ๊ฐ์ด๋ค. ๋ฐ๋ผ์, ์ ์ ํ ๋ฐ์ ๊ฐ์ด, ๋จ๋ง k์ ๋ํ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ์ํ์ 5๋ฅผ ์ด์ฉํ์ฌ ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋ถ์กฑํ ์ ์ก์๊ฐ๊ณผ ํฉ์ฐํ์ฌ ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ(T(Sum)Insufficient)์ ์ฐ์ถํ๋ค.After step S302, the difference between the actual transmission time and the basic transmission time is regarded as insufficient transmission time for which the minimum transmission speed is not guaranteed when transmitting data to the corresponding terminal, and insufficient transmission time due to data transmission among other terminals. The difference value is added to an insufficient time sum value obtained by adding the insufficient transmission times of the UEs (S304). For example, the difference between the actual transmission time and the basic transmission time for the terminal k means insufficient transmission time for which the minimum transmission speed is not guaranteed during data transmission. The difference between the actual transmission time and the basic transmission time for the terminal k is calculated by using Equation 4 described above. The difference value calculated using Equation 4 is added to the sum of the insufficient time as the insufficient transmission time for the terminal k. The shortage time sum value represents the insufficient transmission time of the terminals having insufficient transmission time according to data transmission among the terminal 1 (30), the terminal 2 (40) to the terminal n (50) to which the
๋ํ, S304 ๋จ๊ณ์์, ํด๋น ๋จ๋ง์ ๋ํด ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ง ๋ชปํ๋ ๋จ๋ง๋ก ๊ฐ์ฃผํ์ฌ, ๋ค๋ฅธ ๋จ๋ง๋ค ์ค ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋จ๋ง๋ค์ ๋ํ ๋จ๋ง ๊ฐฏ์๊ฐ์ ํด๋น ๋จ๋ง์ ๊ฐ์ฐํ๋ค. ์ค์ ์ ์ก์๊ฐ์ด ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ๋ณด๋ค ํฐ ๋จ๋ง์ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ง ๋ชปํ๋ ๋จ๋ง์ ํด๋นํ๋ค. ์๋ฅผ ๋ค์ด, ๋จ๋ง k๊ฐ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ง ๋ชปํ๋ ๋จ๋ง์ด๋ผ ํ ๋, ์ก์ธ์ค ํฌ์ธํธ(20)๊ฐ ๋ฐ์ดํฐ๋ฅผ ์ ์กํ๋ ๋ชจ๋ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50) ์ค์์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ง ๋ชปํ๋ ๋จ๋ง๋ค์ ๊ฐฏ์์ ๋จ๋ง k๊ฐ ํฌํจ๋๋๋ก ๊ฐ์ฐํ๋ค. In addition, in step S304, the terminal is regarded as a terminal that does not guarantee the minimum transmission speed, and the corresponding terminal is added to the number of terminals for terminals having insufficient transmission time according to data transmission among other terminals. A terminal whose actual transmission time is larger than the value of the basic transmission time corresponds to a terminal that is not guaranteed the minimum transmission speed. For example, when the terminal k is a terminal that is not guaranteed to the minimum transmission speed, among all the terminal 1 (30), the terminal 2 (40) to the terminal n (50) that the
ํํธ, S300 ๋จ๊ณ์์, ์ค์ ์ ์ก์๊ฐ์ด ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ๋ณด๋ค ํฌ์ง ์๋ค๋ฉด, ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด์ ์๊ฐ๊ฐ์ ์ค์ ์ ์ก์๊ฐ์ ๊ฐ์ฐํ๊ณ , ๋ค๋ฅธ ๋จ๋ง๋ค ์ค ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋จ๋ง๋ค์ ๋ํด ์๋ถํ์ฌ ํ ๋นํ๊ธฐ ์ํ ๋ถ๋ฐฐ ํ ๋น์๊ฐ์ ์ค์ผ์ค ์ธ๋ฑ์ค ์ ๋ณด์ ์๊ฐ๊ฐ์ ๊ฐ์ฐํ๋ค(S306 ๋จ๊ณ).On the other hand, in step S300, if the actual transmission time is not greater than the value of the basic transmission time, the actual transmission time is added to the time value of the schedule index information, and for the terminals having insufficient transmission time according to data transmission among other terminals The distribution allocating time for allocating in an easy manner is added to the time value of the schedule index information (step S306).
์๋ฅผ ๋ค์ด, ๋จ๋ง k์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์ค์ ์ ์ก์๊ฐ์ด ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ๋ณด๋ค ํฌ์ง ์๋ค๋ ๊ฒ์ ๋จ๋ง k๋ก ๋ฐ์ดํฐ๋ฅผ ์ ์กํ๋๋ฐ ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋นํด ์ ์ ์๊ฐ์ด ์์๋๋ค๋ ๊ฒ์ ์๋ฏธํ๋ค. ๋ฐ๋ผ์, ๋จ๋ง k๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์ต์ํ์ ์ ์ก์๋๊ฐ ์ด๋ฏธ ํ๋ณด๋์ด ์๋ค๋ ๊ฒ์ ์๋ฏธํ๋ค. ๋ฐ๋ผ์, ๋จ๋ง k์ ๋ํด ํ ๋น๋๋ ์ ์ก์๊ฐ ์ค์ ์ฌ๋ถ์ ์๊ฐ์ ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์๊ฐ์ผ๋ก ํ ๋นํ ์ ์๋ค. ์ ์ ํ ๋ฐ์ ๊ฐ์ด, ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ ๊ฐ ๋จ๋ง๋ก ๋ฐ์ดํฐ๋ฅผ ์ ์กํ๊ธฐ ์ํ ์์๋ฅผ ๊ฒฐ์ ํ๋ ์ ๋ณด๋ผ๋ ์ ์์, ๋จ๋ง k์ ๋ํ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋นํด ์์๊ฐ ๋ฆ์ถ์ด์ง๋๋ก ํ๋ค. ์ด๋ฅผ ์ํด, ๋จ๋ง k์ ๋ํ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด์ ๋ํด ์ค์ ์ ์ก์๊ฐ์ ๊ฐ์ฐํ๋ ํํธ, ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋ค๋ฅธ ๋จ๋ง๋ค์๊ฒ ํ ๋นํ๊ธฐ ์ํ ๋ถ๋ฐฐ ํ ๋น์๊ฐ์ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด์ ๊ฐ์ฐํ๋ค. ์ด์ ๋ฐ๋ผ, ๋จ๋ง k์ ๋ํ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ ๋ค๋ฅธ ๋จ๋ง๋ค์ ํ ๋น๋๋ ๋ถ๋ฐฐ ํ ๋น์๊ฐ๋งํผ ๊ฐ์ฐ๋จ์ผ๋ก ์ธํด, ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋นํด ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์์๊ฐ ๋ฆ์ถ์ด์ง๊ฒ ๋๋ค. ๋จ๋ง k์ ๋ํ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ ์ ์ ํ ์ํ์ 8์ ์ด์ฉํ์ฌ ์ฐ์ถํ์ฌ ์ค์ ํ๋ค. ์ํ์ 8์์ ํ์ธํ๋ ๋ฐ์ ๊ฐ์ด, ์ฐ์ถ๋ ๋ถ๋ฐฐ ํ ๋น์๊ฐ์ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด์ ์๊ฐ๊ฐ์ ๊ฐ์ฐํจ์ผ๋ก์จ, ์ต์ํ์ ์ ์ก์๋๋ณด๋ค ๋น ๋ฅธ ๋จ๋ง k์ ๋ํ ์ ์ก ์์๋ ํฉ์ฐ๋ ๋ถ๋ฐฐ ํ ๋น์๊ฐ๋งํผ ํ์์๋ก ๋ฐ๋ ค๋๊ฒ ๋๋ฉฐ, ๋ฐ๋๋ก, ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ง์กฑํ์ง ๋ชปํ๋ ๋จ๋ง๋ค์ ์๋์ ์ผ๋ก ์๊ธฐ์ ๋ถ๋ฐฐ ํ ๋น์๊ฐ๋งํผ ๋ฐ์ดํฐ ์ ์ก ์์๊ฐ ์ฐ์ ํ๋ค. For example, the fact that the actual transmission time for data transmission for the terminal k is not greater than the value of the default transmission time means that it takes less time than other terminals to transmit data to the terminal k. Therefore, it means that the minimum transmission speed for data transmission to the terminal k is already secured. Therefore, the extra time of the transmission time allocated for the terminal k can be allocated as a time for data transmission to other terminals. As described above, since the schedule index information is information for determining the rank for transmitting data to each terminal, the schedule index information for the terminal k may be lowered than the other terminals. To this end, the actual transmission time is added to the schedule index information for the terminal k, while the allocation allocation time for allocating to other terminals having insufficient transmission time is added to the schedule index information. Accordingly, since the schedule index information for the terminal k is added by the distribution allocation time allocated to the other terminals, the ranking for data transmission is slowed down compared to the other terminals. The schedule index information for the terminal k is calculated and set using Equation 8 described above. As confirmed by Equation 8, by adding the calculated distribution allocation time to the time value of the schedule index information, the transmission rank for the terminal k faster than the minimum transmission speed is pushed back by the sum of the allocation allocation time, On the contrary, the terminal that does not satisfy the minimum transmission rate, the data transmission priority is prioritized by the above allocation allocation time.
๋ 7์ ๋ณธ ๋ฐ๋ช
์ ๋ฐ๋ฅธ WLAN์์ ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง ์ฅ์น๋ฅผ ์ค๋ช
ํ๊ธฐ ์ํ ์ผ ์ค์์์ ๋ธ๋ก๋๋ก์, ์ ์ก์๊ฐ ์ฐ์ถ๋ถ(300) ๋ฐ ์ค์ผ์ค๋ง ์ค์ ๋ถ(310)๋ฅผ ํฌํจํ๋ค. ์ฌ๊ธฐ์, ์ก์ธ์ค ํฌ์ธํธ์ ์ค์ผ์ค๋ง ์ฅ์น๋ ์ ์ ํ ๋ 2์ ์ก์ธ์ค ํฌ์ธํธ(20)์ ๊ตฌ์ฑ์์ ์ค ์ค์ผ์ค๋ฌ(๋ฏธ๋์)์ ๋์ํ๋ ๊ตฌ์ฑ์์์ด๋ค.FIG. 7 is a block diagram illustrating an example of an apparatus for scheduling an access point in a WLAN according to the present invention, and includes a transmission
์ ์ก์๊ฐ ์ฐ์ถ๋ถ(300)๋ ์ ์ก์์์ ์ํด ์ ํ๋ ๋จ๋ง๋ก์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ์ค์ ์ ์ก์๊ฐ ๋ฐ ์ต์ํ์ ์ ์ก์๋(Throughput)๋ฅผ ๋ณด์ฅํ๋ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐ์ถํ๋ค. The transmission
์๋ฅผ ๋ค์ด, ๊ธฐ ์ค์ ๋ ์ ์ก์์์ ๋ฐ๋ผ ์๊ธฐ ๋จ๋ง 1(30), ๋จ๋ง 2(40) ๋ด์ง ๋จ๋ง n(50) ์ค ์ด๋ ํ๋์ ๋จ๋ง k๋ก์ ๋ฐ์ดํฐ ์ ์ก์ด ๊ฒฐ์ ๋๋ฉด, ์ ์ก์๊ฐ ์ฐ์ถ๋ถ(300)๋ ์ ํ๋ ๋จ๋ง k์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ์ค์ ์ ์ก์๊ฐ์ ์ ์ ํ ์ํ์ 1์ ์ด์ฉํ์ฌ ์ฐ์ถํ๋ค. ๋ํ, ์ ์ก์๊ฐ ์ฐ์ถ๋ถ(300)๋ ๋จ๋ง k์ ๋ํ ํ์ฌ์ ์ ์ก์๋์ ์ ์กํ ๋ฐ์ดํฐ์ ๊ธธ์ด ๋ฐ ์ต์ํ์ Throughput์ ๋ณด์ฅํ๋ ์ ์ก์๋๋ฅผ ๊ทผ๊ฑฐ๋ก ํ์ฌ ์ ์ ํ ์ํ์ 2๋ฅผ ์ด์ฉํ์ฌ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐ์ถํ๋ค. ์ ์ก์๊ฐ ์ฐ์ถ๋ถ(300)๋ ์ฐ์ถ๋ ์ค์ ์ ์ก์๊ฐ ๋ฐ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ค์ผ์ค๋ง ์ค์ ๋ถ(310)๋ก ์ ๋ฌํ๋ค.For example, when data transmission to one of the terminals k of the terminal 1 (30), the terminal 2 (40) to the terminal n (50) is determined according to a preset transmission priority, the
์ค์ผ์ค๋ง ์ค์ ๋ถ(310)๋ ์ ์ก์๊ฐ ์ฐ์ถ๋ถ(300)์์ ์ฐ์ถ๋ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๋น๊ต ๊ฒฐ๊ณผ์ ๋ฐ๋ผ, ๋ค๋ฅธ ๋จ๋ง๋ค๊ณผ ๊ด๋ จํ ํด๋น ๋จ๋ง์ ๋ฐ์ดํฐ ์ ์ก์์๋ฅผ ๊ฒฐ์ ํ๋ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์ค์ ํ๋ค. The
๋ 8์ ๋ 7์ ๋์๋ ์ค์ผ์ค๋ง ์ค์ ๋ถ(310)๋ฅผ ์ค๋ช
ํ๊ธฐ ์ํ ์ผ ์ค์์์ ๋ธ๋ก๋๋ก์, ์๊ฐ ๋น๊ต๋ชจ๋(400) ๋ฐ ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ํฌํจํ๋ค.FIG. 8 is a block diagram of an exemplary embodiment for explaining the
์๊ฐ ๋น๊ต๋ชจ๋(400)์ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ์ ๋น๊ตํ๊ณ , ๋น๊ตํ ๊ฒฐ๊ณผ์ ํธ๋ฅผ ์ค์ผ์ค ์ค์ ๋ชจ๋(410)๋ก ์ ๋ฌํ๋ค. ์๊ฐ ๋น๊ต๋ชจ๋(400)์ ์ค์ ์ ์ก์๊ฐ์ด ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ๋ณด๋ค ํฐ ๊ฒ์ธ์ง ์ฌ๋ถ์ ๋ํ ๋น๊ต ์ ํธ๋ฅผ ์ถ๋ ฅํ๋ค. The
์๊ฐ ๋น๊ต๋ชจ๋(400)๋ก๋ถํฐ ์ค์ ์ ์ก์๊ฐ์ด ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ๋ณด๋ค ํฌ๋ค๋ ๋น๊ต์ ํธ๋ฅผ ์์ ํ๋ฉด, ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด์ ์๊ฐ๊ฐ์ ์๊ธฐ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ์ฐํ์ฌ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์ค์ ํ๋ค. When receiving a comparison signal from the
์๋ฅผ ๋ค์ด, ๋จ๋ง k์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์ค์ ์ ์ก์๊ฐ์ด ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ๋ณด๋ค ํฌ๋ค๋ฉด, ๋จ๋ง k์ ๋ํ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๊ฐ ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋นํด ์์๊ฐ ์ฐ์ ํ๋๋ก ํ๊ธฐ ์ํด, ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด์ ๊ธฐ๋ณธ ์ ์ก์๊ฐ๋ง์ ๊ฐ์ฐํ์ฌ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์ค์ ํ๋ค. ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ๋จ๋ง k์ ๋ํ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์ ์ ํ ์ํ์ 3์ ์ด์ฉํ์ฌ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ์ฐํ์ฌ ์ค์ ํ๋ค. ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ์ค์ ๋ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์์ ์ ๋ฉ๋ชจ๋ฆฌ(๋ฏธ๋์)์ ์ ์ฅํ๋ค. ์ฌ๊ธฐ์, ์์ ์ ๋ฉ๋ชจ๋ฆฌ๋ ์ค์ผ์ค ์ค์ ๋ชจ๋(410) ๋ด์ ๊ตฌ๋น๋ ์ ์ฅ๊ณต๊ฐ์ด ๋ ์๋ ์๊ณ , ์ ์ ํ ์ก์ธ์คํฌ์ธํธ(20)์ ๊ตฌ์ฑ์์ ์ค์ ํ๋์ธ ๋ฉ๋ชจ๋ฆฌ ๊ณต๊ฐ์ ํด๋นํ ์๋ ์๋ค. For example, if the actual transmission time for data transmission for the terminal k is greater than the value of the basic transmission time, the
๋ํ, ๋จ๋ง k์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์ค์ ์ ์ก์๊ฐ์ด ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ๋ณด๋ค ํฌ๋ค๋ฉด, ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐจ์ด๊ฐ๋งํผ์ ๋จ๋ง k๋ก์ ๋ฐ์ดํฐ ์ ์ก ์์ ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ง ๋ชปํ๋ ๋ถ์กฑํ ์ ์ก์๊ฐ์ผ๋ก ๊ฐ์ฃผํ์ฌ, ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ํฉ์ฐํ ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ์ ์๊ธฐ ์ฐจ์ด๊ฐ์ ๊ฐ์ฐํ๋ค. ์ด๋ฅผ ์ํด, ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ๋จ๋ง k์ ๋ํ ์ค์ ์ ์ก์๊ฐ๊ณผ ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ์ฐจ์ด๊ฐ์ ์ ์ ํ ์ํ์ 4๋ฅผ ์ด์ฉํ์ฌ ์ฐ์ถํ๋ค. ๊ทธ ํ, ์ํ์ 4๋ฅผ ์ด์ฉํด ์ฐ์ถ๋ ์ฐจ์ด๊ฐ์ ๋จ๋ง k์ ๋ํ ๋ถ์กฑํ ์ ์ก์๊ฐ์ผ๋ก์ ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ์ ๊ฐ์ฐ๋๋๋ฐ, ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ์ ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋จ๋ง๋ค์ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ํฉ์ฐํ ๊ฐ์ด๋ค. ๋ฐ๋ผ์, ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ๋จ๋ง k์ ๋ํ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ์ ์ ํ ์ํ์ 5๋ฅผ ์ด์ฉํ์ฌ ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋ถ์กฑํ ์ ์ก์๊ฐ๊ณผ ํฉ์ฐํ์ฌ ๋ถ์กฑ์๊ฐ ํฉ์ฐ๊ฐ์ ์ฐ์ถํ๋ค.In addition, if the actual transmission time for data transmission to the terminal k is greater than the value of the basic transmission time, the
๋ํ, ๋จ๋ง k์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์ค์ ์ ์ก์๊ฐ์ด ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ๋ณด๋ค ํฌ๋ค๋ฉด, ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ๋จ๋ง k์ ๋ํด ์ต์ํ์ ์ ์ก์๋๋ฅผ ๋ณด์ฅ๋ฐ์ง ๋ชปํ๋ ๋จ๋ง๋ก ๊ฐ์ฃผํ์ฌ, ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋จ๋ง๋ค์ ๋ํ ๋จ๋ง ๊ฐฏ์๊ฐ์ ๋จ๋ง k๋ฅผ ๊ฐ์ฐํ๋ค. In addition, if the actual transmission time for data transmission to the terminal k is greater than the value of the basic transmission time, the
ํํธ, ์๊ฐ ๋น๊ต๋ชจ๋(400)๋ก๋ถํฐ ์ค์ ์ ์ก์๊ฐ์ด ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ๋ณด๋ค ํฌ์ง ์๋ค๋ ๋น๊ต์ ํธ๋ฅผ ์์ ํ๋ฉด, ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด์ ์๊ฐ๊ฐ์ ์ค์ ์ ์ก์๊ฐ์ ๊ฐ์ฐํ๊ณ , ๋ค๋ฅธ ๋จ๋ง๋ค ์ค ๋ฐ์ดํฐ ์ ์ก์ ๋ฐ๋ฅธ ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋จ๋ง๋ค์ ๋ํด ์๋ถํ์ฌ ํ ๋นํ๊ธฐ ์ํ ๋ถ๋ฐฐ ํ ๋น์๊ฐ์ ์ค์ผ์ค ์ธ๋ฑ์ค ์ ๋ณด์ ์๊ฐ๊ฐ์ ๊ฐ์ฐํ๋ค.On the other hand, upon receiving a comparison signal from the
์๋ฅผ ๋ค์ด, ๋จ๋ง k์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์ค์ ์ ์ก์๊ฐ์ด ๊ธฐ๋ณธ ์ ์ก์๊ฐ์ ๊ฐ๋ณด๋ค ํฌ์ง ์๋ค๋ฉด, ๋จ๋ง k์ ๋ํด ํ ๋น๋๋ ์ ์ก์๊ฐ ์ค์ ์ฌ๋ถ์ ์๊ฐ์ ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋ํ ๋ฐ์ดํฐ ์ ์ก์ ์ํ ์๊ฐ์ผ๋ก ํ ๋นํ ์ ์๋ค. ๋ฐ๋ผ์, ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ๋จ๋ง k์ ๋ํ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๊ฐ ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋นํด ์์๊ฐ ๋ฆ์ถ์ด์ง๋๋ก ์ค์ ํ๋ค. ์ด๋ฅผ ์ํด, ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ๋จ๋ง k์ ๋ํ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด์ ๋ํด ์ค์ ์ ์ก์๊ฐ์ ๊ฐ์ฐํ๋ ํํธ, ๋ถ์กฑํ ์ ์ก์๊ฐ์ ๊ฐ๋ ๋ค๋ฅธ ๋จ๋ง๋ค์๊ฒ ํ ๋นํ๊ธฐ ์ํ ๋ถ๋ฐฐ ํ ๋น์๊ฐ์ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด์ ๊ฐ์ฐํ๋ค. ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ์ ์ ํ ์ํ์ 8์ ์ด์ฉํ์ฌ ๋จ๋ง k์ ๋ํ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์ฐ์ถํ์ฌ ์ค์ ํ๋ค. ์ค์ผ์ค ์ค์ ๋ชจ๋(410)์ ์ค์ ๋ ์ค์ผ์ค ์ธ๋ฑ์ค์ ๋ณด๋ฅผ ์ ์ ํ ๋ฐ์ ๊ฐ์ด ์์ ์ ๋ฉ๋ชจ๋ฆฌ(๋ฏธ๋์)์ ์ ์ฅํ๋ค. For example, if the actual transmission time for data transmission for the terminal k is not greater than the value of the basic transmission time, the extra time of the transmission time allocated for the terminal k is allocated as the time for data transmission for the other terminals. can do. Therefore, the
์ ์ ํ ๋ฐ์ ๊ฐ์ด, ์ต์ํ์ ๋ณด์ฅ ์ ์ก์๋๋ณด๋ค ๋ฎ์ ์ ์ก์๋๋ฅผ ๊ฐ๋ ๋จ๋ง์ ๋ํด์๋ ๋ค๋ฅธ ๋จ๋ง๋ค์ ๋นํด ์ ์ก ์์๊ฐ ์ฐ์ ํ๋๋ก ์ค์ผ์ค๋งํจ์ผ๋ก์จ, ์ต์ํ์ ๋ณด์ฅ ์ ์ก์๋๋ฅผ ๋ง์กฑํ๋๋ก ํ ์ ์์ผ๋ฉฐ, ํํธ, ์ต์ํ์ ๋ณด์ฅ ์ ์ก์๋๋ณด๋ค ๋์ ์ ์ก์๋๋ฅผ ๊ฐ๋ ๋จ๋ง์ ๋ํด์๋ ์๊ธฐ์ ๋ถ๋ฐฐ ํ ๋น์๊ฐ๋งํผ ์ ์ก ์์๊ฐ ์๋์ ์ผ๋ก ํ์์๊ฐ ๋๋๋ก ์ค์ผ์ค๋งํจ์ผ๋ก์จ, ์ต์ํ์ ๋ณด์ฅ ์ ์ก์๋๋ฅผ ๋ง์กฑํ๋ ํ๋ ๋ด์์ ๋ฐ์ดํฐ๋ฅผ ์ ์กํ๋๋ก ํ๋ค.As described above, a terminal having a transmission rate lower than the minimum guaranteed transmission rate may be scheduled to have priority over other terminals, thereby satisfying the minimum guaranteed transmission rate, and at the same time, the minimum guaranteed transmission. For a terminal having a transmission rate higher than the rate, the transmission priority is scheduled to be relatively subordinated by the above distribution allocation time, thereby transmitting data within a limit that satisfies the minimum guaranteed transmission rate.
์ด์๊ณผ ๊ฐ์ด ๋ณธ ๋ฐ๋ช ์ ๋น๋ก ํ์ ๋ ์ค์์์ ๋๋ฉด์ ์ํด ์ค๋ช ๋์์ผ๋ ๋ณธ ๋ฐ๋ช ์ ์๊ธฐ์ ์ค์์์ ํ์ ๋๋ ๊ฒ์ ์๋๋ฉฐ ๋ณธ ๋ฐ๋ช ์ด ์ํ๋ ๋ถ์ผ์์ ํต์์ ์ง์์ ๊ฐ์ง ์๋ผ๋ฉด ์ด๋ฌํ ๊ธฐ์ฌ๋ก๋ถํฐ ๋ค์ํ ์์ ๋ฐ ๋ณํ์ด ๊ฐ๋ฅํ๋ค. As described above, the present invention has been described by way of limited embodiments and drawings, but the present invention is not limited to the above embodiments, and various modifications and variations are possible to those skilled in the art to which the present invention pertains. Do.
๋ณธ ๋ฐ๋ช ์ ์ค์์์ ๋ฐ๋ฅธ ๋์๋ค์ ๋จ์ผ์ ์ ์ด๋ถ์ ์ํด ๊ทธ ๋์์ด ๊ตฌํ๋ ์ ์์ ๊ฒ์ด๋ค. ์ด๋ฌํ ๊ฒฝ์ฐ ๋ค์ํ ์ปดํจํฐ๋ก ๊ตฌํ๋๋ ๋์์ ์ํํ๊ธฐ ์ํ ํ๋ก๊ทธ๋จ ๋ช ๋ น์ด ์ปดํจํฐ ํ๋ ๊ฐ๋ฅ ๋งค์ฒด์ ๊ธฐ๋ก๋ ์ ์๋ค. ์๊ธฐ ์ปดํจํฐ ํ๋จ ๊ฐ๋ฅ ๋งค์ฒด๋ ํ๋ก๊ทธ๋จ ๋ช ๋ น, ๋ฐ์ดํฐ ํ์ผ, ๋ฐ์ดํฐ ๊ตฌ์กฐ ๋ฑ์ ๋จ๋ ์ผ๋ก ๋๋ ์กฐํฉํ์ฌ ํฌํจํ ์ ์๋ค. ์๊ธฐ ํ๋ก๊ทธ๋จ ๋ช ๋ น์ ๋ณธ ๋ฐ๋ช ์ ์ํ์ฌ ํน๋ณํ ์ค๊ณ๋๊ณ ๊ตฌ์ฑ๋ ๊ฒ๋ค์ด๊ฑฐ๋ ๋น์ ์์๊ฒ ๊ณต์ง๋์ด ์ฌ์ฉ ๊ฐ๋ฅํ ๊ฒ์ผ ์๋ ์๋ค. ์ปดํจํฐ ํ๋ ๊ฐ๋ฅ ๊ธฐ๋ก ๋งค์ฒด์ ์์๋ ํ๋ ๋์คํฌ, ํ๋กํผ ๋์คํฌ ๋ฐ ์๊ธฐ ํ ์ดํ์ ๊ฐ์ ์๊ธฐ ๋งค์ฒด, CD-ROM์ด๋ DVD์ ๊ฐ์ ๊ด๊ธฐ๋ก ๋งค์ฒด, ํ๋กญํฐ์ปฌ ๋์คํฌ(floptical disk)์ ๊ฐ์ ์๊ธฐ-๊ด ๋งค์ฒด ๋ฐ ๋กฌ(ROM), ๋จ(RAM), ํ๋์ ๋ฉ๋ชจ๋ฆฌ ๋ฑ๊ณผ ๊ฐ์ ํ๋ก๊ทธ๋จ ๋ช ๋ น์ ์ ์ฅํ๊ณ ์ํํ๋๋ก ํน๋ณํ ๊ตฌ์ฑ๋ ํ๋์จ์ด ์ฅ์น๊ฐ ํฌํจ๋๋ค. ํ๋ก๊ทธ๋จ ๋ช ๋ น์ ์์๋ ์ปดํ์ผ๋ฌ์ ์ํด ๋ง๋ค์ด์ง๋ ๊ฒ๊ณผ ๊ฐ์ ๊ธฐ๊ณ์ด ์ฝ๋๋ฟ๋ง ์๋๋ผ ์ธํฐํ๋ฆฌํฐ ๋ฑ์ ์ฌ์ฉํด์ ์ปดํจํฐ์ ์ํด์ ์คํ๋ ์ ์๋ ๊ณ ๊ธ ์ธ์ด ์ฝ๋๋ฅผ ํฌํจํ๋ค. ๋ณธ ๋ฐ๋ช ์์ ์ค๋ช ๋ ๊ธฐ์ง๊ตญ ๋๋ ๋ฆด๋ ์ด์ ์ ๋ถ ๋๋ ์ผ๋ถ๊ฐ ์ปดํจํฐ ํ๋ก๊ทธ๋จ์ผ๋ก ๊ตฌํ๋ ๊ฒฝ์ฐ ์๊ธฐ ์ปดํจํฐ ํ๋ก๊ทธ๋จ์ ์ ์ฅํ ์ปดํจํฐ ํ๋ ๊ฐ๋ฅ ๊ธฐ๋ก ๋งค์ฒด๋ ๋ณธ ๋ฐ๋ช ์ ํฌํจ๋๋ค. ๊ทธ๋ฌ๋ฏ๋ก ๋ณธ ๋ฐ๋ช ์ ๋ฒ์๋ ์ค๋ช ๋ ์ค์์์ ๊ตญํ๋์ด ์ ํด์ ธ์๋ ์๋๋๋ฉฐ, ํ์ ํ๋ ํนํ์ฒญ๊ตฌ๋ฒ์๋ฟ๋ง ์๋๋ผ ์ด ํนํ์ฒญ๊ตฌ๋ฒ์์ ๊ท ๋ฑํ ๊ฒ๋ค์ ์ํด ์ ํด์ ธ์ผ ํ ๊ฒ์ด๋ค.Operations according to an embodiment of the present invention may be implemented by a single control unit. In this case, program instructions for performing various computer-implemented operations may be recorded on a computer-readable medium. The computer-determinable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those skilled in the art. Examples of computer readable recording media include magnetic media such as hard disks, floppy disks and magnetic tape, optical recording media such as CD-ROMs or DVDs, magnetic-optical media such as floppy disks and ROMs. Hardware devices specifically configured to store and execute program instructions, such as memory, RAM, flash memory, and the like. Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like. When all or part of the base station or relay described in the present invention is implemented as a computer program, a computer readable recording medium storing the computer program is also included in the present invention. Therefore, the scope of the present invention should not be limited to the described embodiments, but should be determined not only by the claims below but also by the equivalents of the claims.
Claims (15)
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR10-2013-0129498 | 2013-10-29 | ||
| KR1020130129498A KR102152308B1 (en) | 2013-10-29 | 2013-10-29 | A method and an apparatus for scheduling of an access point on the Wireless Local Area Network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2015064963A1 true WO2015064963A1 (en) | 2015-05-07 |
Family
ID=53004503
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/KR2014/010046 Ceased WO2015064963A1 (en) | 2013-10-29 | 2014-10-24 | Scheduling method and apparatus for access point in wlan |
Country Status (2)
| Country | Link |
|---|---|
| KR (1) | KR102152308B1 (en) |
| WO (1) | WO2015064963A1 (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180191453A1 (en) * | 2015-07-09 | 2018-07-05 | Kddi Corporation | Transmitting device, receiving device, wireless communication system, wireless communication method, and computer program |
| CN110912744A (en) * | 2019-11-27 | 2020-03-24 | ๆ้ฝ่ฅฟๅ ไบๆ็งๆๆ้ๅ ฌๅธ | Bandwidth allocation method, system, wireless access device and storage medium |
| WO2024250912A1 (en) * | 2023-06-08 | 2024-12-12 | ๅไธบๆๆฏๆ้ๅ ฌๅธ | Resource allocation method and apparatus |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10200509B1 (en) * | 2014-09-16 | 2019-02-05 | Juniper Networks, Inc. | Relative airtime fairness in a wireless network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040100989A1 (en) * | 2002-11-21 | 2004-05-27 | Chiu Victor Y. | Data transmission system and method |
| KR100580833B1 (en) * | 2003-12-22 | 2006-05-16 | ํ๊ตญ์ ์ํต์ ์ฐ๊ตฌ์ | Packet scheduling method for guaranteeing minimum data rate in mobile communication system and recording medium storing program implementing same |
| US20070153755A1 (en) * | 2006-01-02 | 2007-07-05 | Jin-Woo Yang | Wireless local area network (WLAN) and method of transmitting frame in the WLAN |
| WO2011021904A2 (en) * | 2009-08-21 | 2011-02-24 | ํ๊ตญ์ ์ํต์ ์ฐ๊ตฌ์ | Method and apparatus for adjusting signal transmission starting point of terminal in wireless network |
| US20130044658A1 (en) * | 2011-08-16 | 2013-02-21 | Utc Fire & Security Corporation | Beacon synchronization in wifi based systems |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5118344B2 (en) * | 2003-07-24 | 2013-01-16 | ใณใผใใณใฏใฌใใซ ใใฃใชใใใน ใจใฌใฏใใญใใฏใน ใจใ ใดใฃ | Wireless network and method for fairing bandwidth |
| CN101589586B (en) | 2007-01-22 | 2013-01-02 | ็ๅฎถ้ฃๅฉๆตฆ็ตๅญ่กไปฝๆ้ๅ ฌๅธ | Recalculating airtime quota in wlan to use up bandwidth |
| KR100932554B1 (en) * | 2007-10-23 | 2009-12-17 | ํ๊ตญ๊ณผํ๊ธฐ์ ์ | Traffic stream admission control method and apparatus |
| US20130094486A1 (en) | 2011-09-02 | 2013-04-18 | Rutgers, The State University Of New Jersey | Wireless Network Virtualization For Wireless Local Area Networks |
-
2013
- 2013-10-29 KR KR1020130129498A patent/KR102152308B1/en not_active Expired - Fee Related
-
2014
- 2014-10-24 WO PCT/KR2014/010046 patent/WO2015064963A1/en not_active Ceased
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040100989A1 (en) * | 2002-11-21 | 2004-05-27 | Chiu Victor Y. | Data transmission system and method |
| KR100580833B1 (en) * | 2003-12-22 | 2006-05-16 | ํ๊ตญ์ ์ํต์ ์ฐ๊ตฌ์ | Packet scheduling method for guaranteeing minimum data rate in mobile communication system and recording medium storing program implementing same |
| US20070153755A1 (en) * | 2006-01-02 | 2007-07-05 | Jin-Woo Yang | Wireless local area network (WLAN) and method of transmitting frame in the WLAN |
| WO2011021904A2 (en) * | 2009-08-21 | 2011-02-24 | ํ๊ตญ์ ์ํต์ ์ฐ๊ตฌ์ | Method and apparatus for adjusting signal transmission starting point of terminal in wireless network |
| US20130044658A1 (en) * | 2011-08-16 | 2013-02-21 | Utc Fire & Security Corporation | Beacon synchronization in wifi based systems |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180191453A1 (en) * | 2015-07-09 | 2018-07-05 | Kddi Corporation | Transmitting device, receiving device, wireless communication system, wireless communication method, and computer program |
| CN110912744A (en) * | 2019-11-27 | 2020-03-24 | ๆ้ฝ่ฅฟๅ ไบๆ็งๆๆ้ๅ ฌๅธ | Bandwidth allocation method, system, wireless access device and storage medium |
| CN110912744B (en) * | 2019-11-27 | 2022-08-19 | ๆ้ฝ่ฅฟๅ ไบๆ็งๆๆ้ๅ ฌๅธ | Bandwidth allocation method, bandwidth allocation system, wireless access device and storage medium |
| WO2024250912A1 (en) * | 2023-06-08 | 2024-12-12 | ๅไธบๆๆฏๆ้ๅ ฌๅธ | Resource allocation method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| KR20150049232A (en) | 2015-05-08 |
| KR102152308B1 (en) | 2020-10-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111614444B (en) | Hybrid automatic repeat request acknowledgement feedback method and terminal | |
| WO2016039577A1 (en) | Method and device for controlling traffic of electronic device in wireless communication system | |
| WO2020063241A1 (en) | Information transmission method and terminal | |
| CN110149180B (en) | Distribution method of search space channel estimation number and terminal equipment | |
| WO2016209002A1 (en) | Method and apparatus for controlling timing advance | |
| WO2015064963A1 (en) | Scheduling method and apparatus for access point in wlan | |
| US20080175147A1 (en) | Admission control for packet connections | |
| WO2021254211A1 (en) | Electronic device and method for wireless communication, and computer-readable storage medium | |
| WO2022012417A1 (en) | Collision processing method and apparatus | |
| CN114556858A (en) | Frequency domain resource determination method, device and storage medium | |
| CN110149181B (en) | Distribution method of search space channel estimation number and terminal equipment | |
| CN110166191B (en) | Method and device for determining monitoring information of search space | |
| CN113746607B (en) | Control information DCI transmission method and related equipment | |
| CN111130713A (en) | A transmission method, a sending end device, a receiving end device and a network side device | |
| WO2023025137A1 (en) | Information indication method and apparatus, terminal and readable storage medium | |
| EP4171146A1 (en) | Information multiplexing method and apparatus, and user equipment | |
| WO2016105152A1 (en) | Method for operating wireless lan system and device for same | |
| EP4123981B1 (en) | Data transmission method and device, and computer storage medium | |
| CN111817830B (en) | Transmission and reception control method, terminal and network side equipment | |
| WO2025153120A2 (en) | Transmission method, communication device and computer-readable storage medium | |
| CN114258724B (en) | Logical channel multiplexing method and device, communication equipment and storage medium | |
| CN110612685B (en) | Data transmission method and related product | |
| US11304212B2 (en) | Target transmission time based transmit scheduling | |
| WO2018066823A1 (en) | Method and apparatus for scheduling terminal radio resources | |
| KR102646028B1 (en) | Monitoring methods and devices of SS |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 14857879 Country of ref document: EP Kind code of ref document: A1 |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| 122 | Ep: pct application non-entry in european phase |
Ref document number: 14857879 Country of ref document: EP Kind code of ref document: A1 |