KR100810900B1 - Dynamic Limited Reuse Scheduler - Google Patents

Abstract

The present invention relates to a system and method that facilitates dynamic scheduling of a set of frequencies by a user device to reduce intercell interference by evaluating overall scheduling metrics for each user device in a wireless communication area. The overall scheduling metric can be evaluated by determining an equity metric for each user device, an overall channel peak desire metric for each user device, and a channel delay desire metric for each user device in the wireless communication area. The overall scheduling metric may be a function of the fair metric and one or more of the overall channel peak desire metric and the channel delay desire metric. A set of frequencies may be provided to the user device with the best overall scheduling metric score for a given round of dynamic scheduling.

Description

Dynamic Limited Reuse Scheduler {DYNAMIC RESTRICTIVE REUSE SCHEDULER}

This application is incorporated by reference in U.S.C. 35, US Provisional Application No. 60 / 678,258, entitled “Dynamic ASBR Scheduler,” filed June 9, 2004, incorporated herein by reference. Claim priority under §119 (e).

The present invention relates to wireless communications, and more particularly to scheduling resource allocation to a user device in a wireless network environment.

Wireless networking systems have become a powerful means of making most people communicate around the world. Wireless communication devices are becoming smaller and more powerful to meet user needs and to enhance portability and convenience. The increase in processing power in portable devices such as cellular phones has increased the demand for wireless network transmission systems. Such systems are typically not as easily updated as the cellular devices that communicate over them. As the performance of mobile devices expands, it may be difficult to maintain old wireless network systems in a manner that aids in completely new and advanced wireless device performance.

In particular, frequency division based techniques typically divide the spectrum into individual channels by splitting the spectrum into uniform chunks of bandwidth, for example, the division of frequency bands allocated for wireless cellular telephony. Can be divided into 30 channels, each of which can carry a voice conversation or digital data as a digital service. Each channel can be assigned to one terminal user at a time. One commonly used variant is an orthogonal frequency division technique that effectively partitions the overall system bandwidth into multiple orthogonal subbands. Such subbands may be referred to as tones, carriers, subcarriers, bins, and frequency channels. Each subband is associated with a subcarrier that can be modulated with data. With time division based techniques, the band is divided into time slices or time slots in succession. Each user of the channel is provided with a time slice to send and receive information in a round robin fashion. For example, at a given time t, the user accesses the channel for a short burst. Access is then switched to other users provided with a short burst of time to send and receive information. The cycle of "shift" continues, and as a result, each user is provided with multiple transmit and receive bursts.

Code division based techniques typically transmit data over a number of frequencies available in the region at a given time. In general, data is digitized and spread through the available bandwidth, where multiple users can be overlaid on the channel and each user can be assigned a unique sequence code. Users can transmit on the same wideband chunk of the spectrum, with each user's signal spread over the entire bandwidth by each unique spreading code. Such techniques may be provided for sharing, where more than one user may transmit and receive simultaneously. This sharing can be achieved through spread spectrum digital modulation in which the user's bit stream is encoded and spread over a very wide channel in a pseudo-random manner. The receiver is designed to recognize the unique sequence code involved for the collection of bits for a particular user and to cancel randomization in a coherent manner.

Conventional wireless communication networks (e.g., using frequency, time, and code division techniques) include one or more base stations that provide coverage areas and one or more mobile devices (e.g. Wireless) terminal. A typical base station may simultaneously transmit multiple data streams for broadcast, multicast, and / or unicast services, which is a stream of data that may be an independent receiving concern for the mobile terminal. The mobile terminal in the coverage area of the base station may be involved in receiving one, one or more or all data streams carried by the composite stream. Likewise, a mobile terminal can transmit data to a base station or other mobile terminal. Such communication between the base station and the mobile terminal may be degraded due to channel changes and / or interference power changes. For example, the foregoing changes can affect base station scheduling, power control and / or rate prediction for one or more mobile terminals.

Constrained reuse is a technique designed to reduce intercell (or intersector) interference in a wireless communication system. Constrained reuse is a global planning scheme that takes into account channel and interference measured by users of a wireless network. Constrained reuse attempts to reuse orthogonal resources (such as frequency, time, code, beam, spatial dimension, etc.) for a selected user based on the associated channel quality. Conventional static constrained reuse algorithms are not flexible and cannot accommodate data traffic bursts or data traffic of varying fairness, resulting in a less robust user communication experience.

In view of the foregoing, there is a need in the art for a system and / or method for improving orthogonal resource allocation and wireless communication for a user in a wireless network environment.

The following provides a simplified summary of one or more embodiments for a basic understanding of the embodiments. This summary is not an extensive overview of all expected embodiments, and is not intended to identify key or critical elements of all embodiments or to describe the spirit of any or all embodiments. This is to provide certain concepts of one or more embodiments in a simplified form in preparation for the more detailed description that is presented later.

In accordance with one or more embodiments and corresponding descriptions, various features are described in connection with providing a packet-based dynamic limited reuse scheduler in a wireless network environment. According to one aspect, a method of dynamically scheduling a set of frequencies for reuse by a user device to reduce intercell interference includes determining a fair metric for each user device in a wireless communication area, wherein each user device is determined. Determining an overall channel peak desire metric based on channel quality via a plurality of orthogonal resource sets for the plurality of orthogonal resource sets, and determining an overall scheduling metric for each user device, wherein the overall scheduling metric includes a fair metric and a channel peak. It is a function of the desire metric. According to a related feature, a channel delay desire metric based on channel quality across a plurality of orthogonal resource sets may be determined for each user device, and the overall scheduling metric may be in addition to or in place of the overall channel peak desire metric. Can be used. The user device with the best overall scheduling metric score is provided with a portion of the corresponding orthogonal resource set, and the method may be repeated until the requested resource is allocated to all user devices or all orthogonal resource sets are allocated.

In this document, the frequency set will be used as an embodiment of an orthogonal resource set to describe a dynamic confinement reuse algorithm. However, the various features described are directly applicable to other embodiments of orthogonal resources such as time slots, carriers, codes, spatial dimension zones, frequency / time interlaces, and beamforming beams.

According to another feature, a system that facilitates dynamic finite reuse frequency scheduling in a wireless network environment includes a finite reuse scheduling component that determines a global scheduling metric for each user device in the radio network environment, a full channel for each user device. A peak component that determines the peak desire metric, and a delay component that determines the channel delay desire metric for each user device. The dynamic limited reuse scheduling component can determine the fair metric for each user device using the same class of service technology, appropriate fair technology, etc., which is the winning user device for which a frequency set can be provided for a given round of frequency set assignments. It may be multiplied by one or more of the overall channel peak desire metric and the channel delay desire metric to identify. The system may additionally include an alignment component that excludes the winning user device from successive assignment iterations to ensure that all user devices receive the frequency assignment. Alternatively, the alignment component may include the winning user device in successive assignment iterations to allow the user device to obtain multiple frequency set assignments.

According to yet another aspect, an apparatus that facilitates scheduling frequency assignment for a user device in a wireless communication environment comprises means for determining a fair metric for each user device in the communication environment, an overall channel peak desire for each user device. Means for determining a metric, and means for determining a channel delay desire metric for each device, and means for determining an overall scheduling metric score for each device, wherein the scheduling metric score includes the overall channel peak desire metric and channel. It is a function of one or both of the delay desire metrics and the equity metric. The overall scheduling metric scores for the individual user devices can be compared and the user device with the best score can be provided with a set of frequencies.

Another feature is a computer that determines an equity metric for each user device in a wireless network environment, determines an overall channel peak desire metric for each user device, and determines a channel delay desire metric for each user device. A computer readable medium having stored executable instructions. Additionally, the computer readable medium may include instructions for determining a scheduling metric score based on a preceding metric that may be used to determine a winning user device from which a set of frequencies may be provided.

Another feature relates to a microprocessor executing instructions for dynamic frequency set scheduling in a wireless communication network area, wherein the command is a fair metric, an overall channel peak desire metric, and a channel for each of a plurality of user devices in the network area. Assigning each of the delay desire metrics; Determining an overall scheduling metric for each user device based on the fair metric and at least one of an overall channel peak desire metric and a channel delay desire metric; And providing a set of frequencies to the user device having the best overall scheduling metric with respect to other user devices in the network area.

In order to achieve the aforementioned related objects, one or more embodiments comprise the features hereinafter fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain features of the one or more embodiments. However, these features are part of the various ways in which the principles of various embodiments are used, and the described embodiments are described with the intention of including these features.

1 is a block diagram to help understand constrained reuse and associated resource allocation.

2 is an example of a system that facilitates dynamic network resource allocation using limited reuse in accordance with one or more embodiments.

3 is an example of a system that facilitates packet based scheduling of a set of frequencies using a dynamic limited reuse scheduling technique.

4 is an example of a system that facilitates dynamic limited reuse scheduling of a frequency reuse set based on channel desires and channel delays, in accordance with various features described.

5 is an example of a system that facilitates dynamically adjusting power consumption for transmission to user equipment with significantly strong channel conditions, in accordance with various features.

6 is an example of a system that facilitates provision of multiple reuse frequencies to a user.

7 is an example of a system that facilitates dynamic packet based limited reuse scheduling of a communication frequency reuse set without requiring slow allocation to the static frequency reuse set.

8 is an example of a system that facilitates the assignment of a frequency reuse set to a user device based on the assignment of a channel desire metric for the user device.

9 is a diagram illustrating a method of providing dynamic frequency reuse set allocation from a wireless network to a user device in accordance with various embodiments.

10 is a diagram illustrating a method of dynamically scheduling a frequency reuse set and mitigating resource waste, according to various embodiments.

11 is a diagram illustrating a method for dynamically allocating a frequency reuse set to a user device in a wireless communication environment while allowing the user device to acquire a plurality of frequency sets.

12 is an example of a wireless network environment that may be implemented in connection with various systems and methods.

Various embodiments are described with reference to the drawings, wherein like reference numerals are used to indicate like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more embodiments. However, such an embodiment may be practiced without the specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing one or more embodiments.

As used in this application, “component”, “system” and the like are intended to refer to computer-related entities, other hardware, combinations of hardware and software, software, or running software. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, a thread of executable execution, a program, and / or a computer. One or more components may exist within a thread of process and / or execution, and the components may be localized on one computer and / or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. A component may communicate via local and / or remote processes, such as in accordance with a signal having one or more data packets (e.g., data from one component may be present in local and distributed systems, and / or by signals). Instead it interacts with other components across a network, such as the Internet, with other systems).

Moreover, various embodiments are described in the context of subscriber stations. A subscriber station can also be called a system, subscriber unit, mobile station, mobile, remote station, access point, base station, remote terminal, access terminal, user terminal, user agent or user facility. The subscriber station may be a cellular phone, a wireless telephone, a Session Initiation Protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a portable device with wireless connectivity, or another processing device connected to a wireless modem. have.

Moreover, the various features and features described may be implemented as an article of manufacture using a method, apparatus, or standard programming and / or engineering technique. The term "article of manufacture" as used includes a computer program accessible from any computer readable device, carrier or media. For example, computer readable media include magnetic storage devices (eg, hard disks, floppy disks, magnetic strips ...), optical disks (eg, compact discs (CDs), digital versatile discs (DVDs)). ...), Smart cards, and flash memory devices (eg, cards, disks, key drives ...).

Referring now to the drawings, FIG. 1 shows a block diagram 100 that will aid in understanding limited reuse and associated resource allocation. The feature of limited reuse relates to the intelligent deployment of frequencies for reuse by selected users based on the channel quality of the user. In the context of a CDMA system, an "active set" may be defined for each user for handoff purposes. Sectors of the user's active set typically contribute to the interference of the user's reception on the forward link FL, while sector transmissions are interfered by the user's transmission on the reverse link RL. By preventing interference from various sectors of the user's active set, reduced interference to FL and RL can be achieved. Simulation and analysis showed that the frequency reuse allocation algorithm based on the user's active set resulted in a 3.5 dB signal-to-interference and noise ratio (SINR) improvement with 25% bandwidth partial loading.

The scheduler of the wireless network may be modified to take advantage of SINR improvement through finite reuse, in accordance with various embodiments described. When dealing with voice transmission traffic, voice performance is often limited by the SINR of the worst user in the network. Since the voice user will occupy some narrow portion of the available bandwidth for a relatively long period of time, performance improvement can be achieved by assigning the user a static frequency to improve the user SINR over the duration of the call. However, for data traffic, conventional static constrained reuse algorithms are not flexible enough to accommodate "bursty" data traffic (eg, intermittent traffic, etc.) and / or traffic of variable fairness needs. When a user transmits and receives burst traffic, a typical system requires an exchange to be done between sets of frequencies with different SINRs, available bandwidth, and load provided (eg, from another user on a given reuse set). do. The scheduler can be further complicated when equity standards such as equality of service (EGoS) or proportional equity need to be enhanced for users from different reuse sets.

Block diagram 100 illustrates a simplified scenario in which communication bandwidth can be allocated to various sectors through which the sectors are separated into seven frequencies U ₀ through U _{6 in} which information can be transmitted and received. In the example of the limited reuse algorithm below, each sector is assigned a value of 0, 1 or 2. The total bandwidth available in the network is divided into seven frequency sets with universal reuse, 1/3 reuse and 2/3 reuse. Each set of reuse frequencies is then labeled with a 3-bit binary mask, where 1 in the i th position indicates being used by the sector of value i. For example, 110 represents a 2/3 frequency reuse set that is used by sectors of values 0 and 1 but not by sectors of value 2. The labels of the frequency set {U ₀ , U ₁ , U ₂ , U ₃ , U ₄ , U ₅ , U ₆ } are given by {111, 110, 101, 011, 100, 010, 001}. However, it should be understood that other labeling arrangements are possible. For example, the value of the 3-bit mask can be used to label the frequency set (eg, where 111 represents frequency set 7 and 001 represents frequency set 1). According to frequency planning, the user can avoid potent interference by using 1/3 or 2/3 reuse frequency sets.

가 특정 윈도우를 통한 사용자 i의 출력이고,

및

는 사용자 I의 순간적인 평균 스펙트럼 효율을 각각 나타내는 것으로 정하자. 공평도 메트릭(

)은 다음과 같이 주어지는데, EGoS 스케줄러의 경우,

비례 공평 스케줄러의 경우,

로 주어진다. 채널 욕구 메트릭은 다음과 같이 주어진다.

In third generation networks, fairness among data users can be enhanced by the scheduler. In a network where the forward link transmission to the user is time multiplexed, the user with the best scheduling metric is typically scheduled for transmission on the scheduling time slot. Scheduling metrics are generally calculated based on fair metric and channel desires to take advantage of multi-user diversity (MUD). E.g,

Is the output of user i through the specified window,

And

Let each denote the instantaneous average spectral efficiency of user I. Fairness metric (

) Is given by: For EGoS Scheduler,

For proportional fair scheduler,

Is given by The channel desire metric is given by

The scheduling metric can be calculated as the output of the metric that combines a function of the fair metric and the channel desire metric. The scheduling metric can be further combined with other QoS related metrics Q _i to make the final scheduling decision. In the present invention, only the fair metric is used to account for the flexibility of the dynamic limited reuse scheduler. In one embodiment, the combining function is given as follows.

In another embodiment, the function is the product of each metric having a predetermined exponent α and β as follows.

In another embodiment, the function is a weighted sum of each metric having a predetermined exponent α and β as follows.

In another embodiment, the function is the maximum of each metric having a predetermined exponent α and β as follows.

2 is an example of a system 200 that facilitates dynamically allocating network resources using finite reuse in accordance with one or more embodiments. The dynamic limited reuse scheduler component 202 is operatively coupled to each of the wireless network 204 user devices 206. The wireless network 204 may include one or more base stations, transceivers, and the like that transmit and receive communication signals from one or more user devices 206. Additionally, the wireless network 204 can provide communication services to the user device 206 in connection with multiple access technologies, combinations thereof, or any other suitable wireless communication protocol, as will be apparent to those skilled in the art. For example, such techniques include code division multiplexing access (CDMA) systems, frequency division multiplexing access (FDMA) systems, time division multiplexing access (TDMA) systems, orthogonal frequency division multiplexing access (OFDMA) systems, interleaved FDMA (IFDMA) systems , Localized FDMA (LFDMA) systems, spatial division multiplexed access (SDMA) systems, pseudo orthogonal multiple access systems, and the like. IFDMA is also called distributed FDMA, and LFDMA is also called narrowband FDMA or classical FDMA. An OFDMA system uses Orthogonal Frequency Division Multiplexing (OFDMA). OFDM, IFDMA, and LFDMA effectively divide the overall system bandwidth into multiple (K) orthogonal frequency subbands. These subbands are also called tones, subcarriers, bins, and the like. Each server band is associated with each subcarrier, which may be modulated with data. OFDM transmits modulation symbols in the frequency domain on all or a subset of the K subbands. IFDMA transmits modulation symbols in the time domain on subbands uniformly distributed across the K subbands. LFDMA transmits modulation symbols in the time domain and typically on adjacent subbands.

The user device 206 may be, for example, a cellular phone, smartphone, PDA, laptop, wireless PC, or any other suitable communication device with which the user can communicate with the wireless network 204. User device 206 may also provide feedback to wireless network 204 to enhance scheduler performance. For FL scheduling, the channel and interference conditions at the user device 206 can be measured by 206 and clearly fed back to 204 and 202. In the case of RL scheduling, the channel conditions of the user equipment and the interference level through different sets of orthogonal resources may be measured directly at 204 based on the pilot transmitted by 206. The RL transmit power of the user device 206 may be clearly fed back to 204 and 202. The dynamic limited reuse scheduler component 202 is a packet based scheduler that can use frequency reuse as a proportional fair standard in addition to EGoS as a scheduling dimension zone and without requiring the use of a static frequency reuse set. The dynamic limited reuse scheduler component 202 can determine the scheduling metric in a manner similar to that described above with respect to FIG. 1 to facilitate allocation of frequency sets to one or more user devices 206. Additionally, the dynamic limited reuse scheduler component 202 can use a dynamic limited reuse algorithm to facilitate the assessment of channel needs. The dynamic limited reuse scheduler component 202 may evaluate the fairness standard to determine F _i as described above, which may be augmented by a desire metric when assigning a frequency reuse set. The two channel desire metrics are defined in connection with various embodiments to enable a finite reuse frequency set selection as described below. For the remainder of this document, one specific embodiment of the dynamic confinement reuse scheduler, wherein the orthogonal resource set is a frequency set, will be described for ease of understanding.

3 is an example of a system 300 that facilitates packet based scheduling of a set of frequencies using a dynamic limited reuse scheduling technique. System 300 includes a dynamic limited reuse scheduler component 302 operatively associated with a wireless network 304 and one or more user devices 306, each of which in turn is operatively associated with one another. The dynamic limited reuse scheduler component 302 includes a channel estimation component 308 that facilitates scheduling connections with the best relevant channel conditions over the set of available frequencies. Additionally, in scenarios where a more desirable frequency set of a given connection is occupied, the channel estimation component 308 facilitates delayed connections for subsequent scheduling to provide collision resolution functionality to the dynamic confinement reuse scheduler component 302. It can be done.

The dynamic limited reuse scheduler component 302 additionally includes a frequency analyzer 310 that can evaluate the total available bandwidth of the wireless network 304. For example, in the case described in connection with FIG. 1, the frequency analyzer 310 may assign a frequency set to sectors for reuse for the exclusion of other frequencies. Such an assignment may be, for example, a universal reuse set, a 2/3 reuse set, a 1/3 reuse set, or the like.

4 illustrates a system that facilitates dynamic limited reuse scheduling of a frequency reuse set based on channel desires and channel delays, in accordance with various features described. System 400 includes a dynamic limited reuse scheduler component 402 operatively associated with each wireless network 404 and one or more user devices 406. The dynamic limited reuse scheduler component 402 is a channel estimation component 408 that facilitates scheduling connections with the best relevant channel conditions through a set of available frequencies, and for allocation of frequencies to sectors and / or user devices in the paging area. A frequency analyzer that determines the appropriate bandwidth division.

여기서,

는 주파수 세트(j)에 대한 사용자(i)의 순간 스펙트럼 효율이며,

는 모든 한정 재사용 주파수 세트에 대한 사용자(i)의 평균 스펙트럼 효율이다. 평균 스펙트럼 효율은 각각의 한정 재사용 주파수 세트

, 또는

의 가중된 평균에 대한 필터링된 스펙트럼 효율

의 수학적 평균으로서 계산될 수 있는데, 여기서

은

의 크기를 나타낸다. The channel assessment component 408 includes a peak component 412 that determines channel peak desires to facilitate scheduling connections, and a delay component 414 that delays the scheduling of connections whose more appropriate sets of frequencies are currently fully scheduled. Include. In a system without finite reuse, the channel peak component is simply a function of the immediate channel condition and the average channel condition. In the limited reuse system, channel peak component 412 and channel delay component 414 take into account different interference levels of the user experience at different frequency sets. For example, the peak component 412 may evaluate the channel peak desire for each frequency set j such that the channel peak desire factor of the user i is given as

here,

Is the instantaneous spectral efficiency of user i with respect to frequency set j,

Is the average spectral efficiency of user i for all finite reuse frequency sets. Average spectral efficiency is each limited reuse frequency set

, or

Filtered spectral efficiency for the weighted average of

Can be calculated as the mathematical mean of

silver

Indicates the size.

으로 주어지는데, 여기서 최대화가 아직 전체적으로 스케줄링되지 않은 비한정 주파수 세트에 대해 실행된다. 예를 들어, 값0의 섹터의 스케줄러는 아직 전체적으로 스케줄링되지 않은 주파수 세트에 대해 계산되고 011, 010, 및 001 세트 중 하나에 대해서는 계산되지 않는 채널 욕구 팩터를 한정할 수 있다. 팩터(T_i)는 사용자의 평균 채널 품질에 상대적인 사용자의 최상의 이용가능한 주파수에 대해 사용자의 즉각적인 채널 욕구를 반영한다. 채널 피크 욕구 팩터(T_i)는 이용가능하게 되도록 세팅된 이용 불가능한 주파수 세트를 대 기하도록 사용자에 대해 잠재적인 이익을 반영하지 않는다. 오히려, 이는 채널 지연 욕구 메트릭에 의해 한정될 수 있다. The overall channel peak desire factor of user i is

Where maximization is performed for an unqualified set of frequencies that are not yet fully scheduled. For example, the scheduler of a sector of value 0 may define a channel desire factor that is calculated for a frequency set that is not yet fully scheduled and not for one of the 011, 010, and 001 sets. Factor (T _i) reflects the instant channel needs of the user for the user's average channel best available frequency of the user relative to the quality. Channel peak desire factor (T _i) do not reflect the potential benefit for a user to wait for an unavailable frequency set to become available settings. Rather, this may be defined by the channel delay desire metric.

어떠한 주파수 세트도 스케줄링되지 않으면,

의 분모는 전체 주파수 세트를 통해 최소 스펙트럼 효율로 대체될 수 있다. 전체 지연 욕구 팩터는 다음과 같이 주어지는데,

여기서, 최대화는 아직 전체적으로 스케줄링되지 않은 비한정 주파수 세트를 통해 실행된다. 따라서, 채널 지연 욕구는 모든 자유 주파수 세트를 통해 최대 순시 스펙트럼 효율과 모든 이용불가능한 주파수 세트를 통해 최대 순시 스펙트럼 효율 사이의 비로서 한정될 수 있다. Delay component 414 may determine a second limited reuse channel desire metric, channel delay desire, which is defined as follows.

If no frequency set is scheduled,

The denominator of can be replaced by the minimum spectral efficiency over the entire set of frequencies. The overall delay desire factor is given by

Here, maximization is performed over a set of unqualified frequencies that are not yet fully scheduled. Thus, the channel delay desire can be defined as the ratio between the maximum instantaneous spectral efficiency across all free frequency sets and the maximum instantaneous spectral efficiency through all unavailable frequency sets.

전술한 바와 같이, 조합 함수는 또한 가중된 합, 최대값 등과 같은 다른 함수일 수도 있다. 각각의 시간 슬롯에 대해, 동적 한정 재사용 스케줄러 컴포넌트(402)는 스케줄링 메트릭을 랭크할 수 있으며 사용자의 우승 주파수 세트에서 가입자의 적절한 수를 상위 사용자에게 할당할 수 있다. 이어 스케줄링된 서브 캐리어는 자유 주파수 세트로부터 제외되고, 메트릭은 아직 스케줄링되지 않은 사용자들에 대해 계산될 수 있다. 이러한 프로세스는 모든 가입자가 할당될 때까지 반복될 수 있다. 스케줄링 메트릭은 최종 스케줄링 결정을 위해 다른 QoS 관련 메트릭(Q_i)과 추가로 조합될 수 있다. 이러한 특징에서, 단지 공평 메트릭이 동적 한정 재사용 스케줄러의 유연성을 설명하기 위해 사용된다. The overall limited reuse scheduling metric used by the dynamic limited reuse scheduler component 402 may be one of the following forms, if an enemy is used to combine the metrics.

As mentioned above, the combination function may also be another function, such as a weighted sum, a maximum value, and the like. For each time slot, the dynamic limited reuse scheduler component 402 can rank the scheduling metric and assign the appropriate number of subscribers to the top user in the user's winning frequency set. The scheduled subcarriers are then excluded from the free frequency set, and the metric can be calculated for users that are not yet scheduled. This process can be repeated until all subscribers have been assigned. The scheduling metric can be further combined with other QoS related metrics Q _i for final scheduling decisions. In this feature, only the fair metric is used to account for the flexibility of the dynamic limited reuse scheduler.

5 is an example of a system that facilitates dynamically adjusting power consumption for transmission to a user device with sufficiently strong channel conditions, in accordance with various features. System 500 includes a dynamic limited reuse scheduler component 502, a wireless network 504, and one or more user devices 506, all of which are operatively associated with each other, as mentioned in the preceding figures. The dynamic limited reuse scheduler component 502 includes a channel estimation component 508 that in turn includes a frequency analyzer 510 and a picker component 512 and a delay component 514. The peak component 512 can be used in conjunction with FIG. 4 to determine the overall scheduling metric S _{i that} can be used by the dynamic limited reuse scheduler component 502 when assigning a set of frequencies to one or more user devices 506. A channel peak desire metric can be determined that can be used in conjunction with the channel delay desire metric as described.

The dynamic limited reuse scheduler component 502 further includes a low power component 506 that facilitates power conservation based at least in part on channel quality associated with one or more user devices 506. Constrained reuse can introduce bandwidth partial loading due to a limited set in each sector. For example, in block diagram 100 of FIG. 1, sets 011, 010, and 001 are not used in sectors with values of zero. The low power component 516 of the dynamic constrained reuse scheduler 502 may transmit with reduced power on a limited set of ports to the user device 506 with good channel conditions. In this way, bandwidth partial loading penalties can be avoided. To enable universal reuse, equations (9) and (11) can be computed for all unscheduled frequency sets without finite reuse sector value restrictions. In addition, the spectral efficiency of the limited frequency set may take into account the lowered transmit power.

6 is an example of a system 600 that facilitates providing a user with multiple sets of reuse frequencies. System 600 includes a dynamic limited reuse scheduler 602 having a channel assessment component 608, a frequency analyzer 610, and a low power component 616, which is a wireless network 604 and one or more user devices 606. To operate). Channel assessment component 608 includes a delay component 614 that evaluates a channel delay desire metric for each individual user device and a peak component that determines a channel peak desire metric for each user device 606, wherein The metrics are then used by the limited reuse scheduler 602 to determine the winning user device. The winning user device may then be assigned a corresponding reuse frequency set.

The dynamic limited reuse scheduler 602 further includes an alignment component 618 that facilitates mitigating various constraints and providing multiple reuse frequency set assignments with respect to limited reuse scheduling. The alignment component 618 may ensure that the user device 606 assigned the reuse frequency set in the preceding round of channel desire assessment is not excluded from future iterations of providing the frequency set. For example, when using a static limited reuse scheduler protocol, a user device assigned / provided a reuse frequency set based on a high overall channel desire score (e.g., a function of channel peak desire and delay desire metrics) is assigned to the user device. Since the reuse frequency set is successfully allocated, it is typically excluded from future iterations of frequency allocation. By mitigating this exclusion limitation, a given user device 606 may be provided with multiple sets of frequencies. The final channel assignment for user device 606 may be a combination of all subscribers to which user device 606 has been assigned over a plurality of frequency sets. Moreover, multiple frequency set assignments increase the peak rate for this user, which in turn mitigates the delay associated with communication transmission.

7 illustrates a system 700 that facilitates dynamic packet based limited reuse scheduling of a communication frequency reuse set without requiring assignment of a connection to a static frequency reuse set. The system 700 includes many similar to the systems and / or components described in connection with the preceding figures, including a dynamic limited reuse scheduler 702 operatively coupled to the wireless network 704 and one or more user devices 706. Contains components of. The dynamic limited reuse scheduler component 702 is a channel estimation component that determines the overall channel desire as a function of the channel picker desire metric determined by the peak component 712 and the channel delay desire metric determined by the delay component 714 on a user device basis. 708. Additionally, the dynamic limited reuse scheduler component 702 may be configured with a high quality connection, a frequency analyzer 710 that evaluates the total available bandwidth in the wireless network 704 and / or its area, as described in connection with the preceding figures. A low power component 716 that facilitates low power transmission to a user having an alignment, and an alignment component 718 that facilitates allocation of multiple reuse frequencies sets.

The system 700 is operatively coupled to the dynamic confinement reuse scheduler component 702 and includes information related to channel desire algorithms, metrics, available frequency sets, user device frequency assignments, and the like, and dynamics of frequency reuse sets to one or more users. Memory 720 for storing other suitable information relating to providing limited reuse scheduling. Processor 722 may be operatively coupled to dynamic confinement reuse scheduler component 702 (and / or memory 720) to facilitate analysis of information related to fair standards, desire metrics, frequency reuse, and the like. The processor 722 is a processor dedicated to analyzing and / or generating information received by the dynamic limited reuse scheduler component 702, a processor controlling one or more components of the system 700, and / or a dynamic limited reuse scheduler component. It may be a processor that analyzes and generates the information received by 702 and controls one or more components of the system 700.

Memory 720 additionally stores protocols associated with generating frequency assignments, metrics, and the like, allowing system 700 to utilize stored protocols and / or algorithms to achieve dynamic finite reuse frequency hopping as described. Can be. It should be understood that the described data storage (eg, memory) component can be either volatile memory or nonvolatile memory, and can include both volatile and nonvolatile memory. For purposes of illustration, nonvolatile memory may include, but is not limited to, read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM), or flash memory. It doesn't work. Volatile memory can include random access memory (RAM), which acts as external cache memory. For illustrative purposes, the RAM includes synchronous RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), and direct Rambus RAM. Available in many forms, such as (DRRAM). The memory 720 of the systems and methods may include, but is not limited to, any other suitable type of memory.

8 is an example of a system 800 that facilitates assigning a frequency reuse set to a user device based on a channel desire assessment metric for the user device. System 800 includes a dynamic limited reuse scheduler 802 operatively coupled to a wireless network 804 and one or more user schedulers 806. The dynamic limited reuse scheduler 802 evaluates the total amount of bandwidth available, and the channel estimation component 808, which facilitates determining various metrics with respect to frequency set allocation, and as described with reference to FIG. It is similar to the scheduler 702 in that it includes a frequency analyzer that generates a plurality of frequency reuse subsets, between the user device 806 and base tower transmissions in the sector of one or more wireless networks 806. It may be assigned to various user devices 806 to mitigate interference. Additionally, the dynamic limited reuse scheduler 802 signals the one or more user devices 806 with low power when determining that one or more user devices 806 have sufficiently strong channel quality (eg, sufficient resources). A low power component that can transmit, and an alignment component that can optionally include a user device 806 that is already assigned one or more sets of frequency reuses in a set of users that still require an assignment that allows the user to acquire multiple sets of frequencies. 818, which may facilitate increasing the peak transmission rate for the user while mitigating channel delay. Channel assessment component 808 includes a peak component 812 that evaluates a channel peak desire metric for each user device 806, and a delay component 814 that evaluates a channel delay desire metric to determine if the channel connection has been delayed. The metric of one or both of these may be used in connection with the fair metric derived by the limited reuse scheduler 802 to identify the winning user device to which the frequency reuse set may be assigned.

System 800 may additionally include memory 820 and processor 822 as described above with respect to FIG. Moreover, the AI component 824 may be operatively associated with the dynamic limited reuse scheduler component 802, with channel connection quality, inclusion / exclusion of the winning user device 806 from consecutive allocation rounds, and channel delay desired. (Eg, due to lack of available frequency reuse sets, etc.). As used, “inference” or “inference” typically refers to a process or putative state that is inferred for a system, environment, and / or user from a set of observations as obtained through events and / or data. Inference can be used to define a specific context or action, or can generate a probability distribution over a state, for example. Estimation may be the calculation of probability distributions through the state of interest based on probability-that is, consideration of data and events. Estimation may also refer to techniques used to construct higher level events from events and / or data. This estimation determines the composition of a new event or action from a set of observed events and / or stored event data, whether the event is closely correlated to a temporary proximity, and whether the event and data are from one or several events and data sources. Cause.

In accordance with an example, the AI component 824 may estimate an appropriate frequency reuse set assignment based at least in part on, for example, the set of available frequencies, the total number of user devices 806, the channel desire metrics, the user device resource environment, and the like. have. According to this example, it may be determined that the user device 806 has sufficient transmission resource allocation, such as bandwidth, to justify the exclusion of the user device from resource allocation despite the high metric score for the user device 806 and the like. The AI component 824 in conjunction with the processor 814 and / or the memory 812 can estimate such user equipment to be excluded from the current round of frequency allocation. In this case, the AI component 824 may facilitate resource allocation in the best possible way, such as facilitating bandwidth allocation and reuse and mitigating transmission costs. The foregoing examples are illustrative in nature and are not intended to limit the concept of estimation by the AI component 824 or the AI component 824 making such estimation.

9-11, a method of generating an auxiliary system resource allocation is described. For example, the method may relate to packet based dynamic limited reuse scheduling in an OFDM environment, an OFDMA environment, a CDMA environment, a TDMA environment, or any other suitable wireless environment. For simplicity of explanation, the method has been described as a series of acts, but according to one or more embodiments, certain acts may occur in a different order and / or concurrently with other acts described. For example, those skilled in the art should understand that a methodology may alternatively be represented as a series of interrelated states or events, such as in a state block diagram. Moreover, not all illustrated acts may be required to implement a methodology in accordance with one or more embodiments.

9 illustrates a method 900 for providing dynamic frequency reuse set assignment to a user device in a wireless network, in accordance with various embodiments. In step 902, a channel peak desire metric (T _i) may be determined for each user device in the set of all user devices in a network region, or a subset. For example, the peak desire metric for each user device can be derived using equations (8) and (9) described in connection with FIG. In step 904, the channel delay desire metric D _i may also be evaluated for each user device in connection with equations 10 and 11, as described in connection with FIG. 4. Once this metric is evaluated for all user devices in the set, at step 906, by using the equation (12), to one or both metrics are associated with Figure 1 to determine all the channels need the metric (S _i) As described, it is multiplied by the fair metric F _i for the user device. Once all the channel desire metrics are derived for each user device in the set, the winning user device (eg, the user device with the highest S _i value) can be identified at step 908.

In step 910, for each time slot, the winning user device may be assigned an appropriate number of subcarriers in the winning frequency set of the user device. Then, in step 912, the scheduled subcarriers can be excluded from the free frequency set, and the method 900 can return to step 902, where the metric is recalculated for the user equipment that has not yet been scheduled. Can be. The method 900 may be repeated until all subcarriers have been allocated. In this way, the method 900 can easily provide packet-based dynamic confinement reuse scheduling of a frequency set without requiring allocation of a connection to a static frequency reuse set.

10 illustrates a method 1000 for dynamically scheduling frequency reuse set allocations and mitigating resource waste, in accordance with various embodiments. In step 1002, the overall scheduling metric S _i may be evaluated for each user device in the set of user devices communicating over the wireless network. Metric (S _i) is 1 to 4 and equation (1) may be a function of several metrics, as described in connection with (12). At step 1004, the winning user device may be identified for each round of metric evaluation. The appropriate number of subcarriers in the winning frequency set of the user device is determined in step 1006. At step 1008, the winning user device may be excluded (eg removed from the list of user devices) to ensure that the other user device receives the frequency assignment during a future iteration of the method 1000. The method returns to step 1002 to further repeat until a series of frequencies and / or subcarriers have been assigned to all user devices in the set.

In step 1010, the channel condition may be evaluated, and if the condition is met, the transmission to the user device with good channel condition in step 1012 is limited to a limited set of ports to mitigate bandwidth partial loading due to the limited set. Can be implemented using low power. To enable universal reuse, equations (4-7) and (9) can be evaluated for all unscheduled frequency sets without the limiting reuse value limitation described in connection with FIG. In this way, the method 1000 may facilitate reducing power consumption to mitigate transmission costs.

11 illustrates a method for dynamic allocation of a frequency reuse set from a wireless communication device to a user device while allowing the user device to acquire multiple frequency sets. In step 1102, a channel peak desire metric (T _i) may be determined for each user device in a set of user devices in the network area or the sub-set. The channel peak desire metric for each user device can be derived using equations (8) and (9) described above with respect to FIG. In step 1104, the channel delay desire metric D _i may be evaluated for each user device in connection with equations 10 and 11 also described with reference to FIG. 4. Once this metric is evaluated for all user devices in the set, one or both metrics can use the equation 12 in step 1106 to formulate the overall channel desire metric S _i , as described in connection with FIG. 1. To determine, it can be multiplied by the fair metric F _i for the user device. Once the overall channel desire metric is derived for each user device in the set, the winning user device (eg, the user device with the best S _i value) can be identified at step 1108.

In step 1110, for each time slot, the winning user device may be assigned an appropriate number of subcarriers in the winning frequency set of the user device. In order to allow the user device to acquire more than a plurality of frequency sets, in step 1112, the winning user device may be included in the remaining list of unscheduled user devices. Thus, if the frequency set assignment in step 1110 is not sufficient to allow the winning device to have the best overall scheduling metric score in potentially consecutive scheduling rounds, the user device may be authorized to obtain a continuous frequency set assignment. The method 1100 may then return to step 1102 for further iteration of dynamic scheduling. The user device final channel assignment may be a combination of all subcarriers obtained by the user device over multiple frequency set assignment rounds, which may facilitate increasing the peak rate of communication for the user device while mitigating delay.

12 illustrates an example of a wireless communication system 1200. The wireless communication system 1200 shows one base station and one terminal for simplicity. It should be understood, however, that the system may include one or more base stations and / or one or more terminals, and additional base stations and / or terminals may be substantially similar or different from the base stations and terminals described below. In addition, the base station and / or the terminal may use the described system (FIGS. 1-8) and / or method (FIGS. 9-11) to facilitate wireless communication therebetween.

Referring to Figure 12, on the downlink of access point 1205, transmit (TX) data processor 1210 receives, formats, codes, interleaves, and modulates (or symbol maps) traffic data and modulates the symbols ("data"). Symbol "). OFDM modulator 1215 receives and processes data symbols and pilot symbols and provides a stream of an OFDM system. OFDM modulator 1220 multiplexes data and pilot symbols on the appropriate subbands, provides a signal value of zero for each unused subband, and N transmit symbols for the N subbands for each OFDM symbol period. Obtain a set of. Each transmit symbol may be a data symbol, a pilot symbol, or a signal value of zero. The pilot symbols may be sent continuously in each OFDM symbol period. Alternatively, the pilot symbol may be time division multiplexing (TDM), frequency division multiplexing (FDM), or code division multiplexing (CDM). OFDM modulator 1220 may transform each set of N transmit symbols into a time domain using an N point IFFT to obtain a “converted” symbol that includes an N time domain chip. OFDM modulator 1220 typically repeats a portion of each transformed symbol to obtain a corresponding OFDM symbol. The repeated portion is known as the cyclic prefix and is used to solve delay spread in the wireless channel.

Transmitter unit (TMTR) 1220 receives a stream of OFDM symbols and converts it into one or more analog signals, and further modulates (eg, amplifies, filters, and frequency upconverts) the analog signal through a wireless channel. Generate a downlink signal suitable for transmission. The downlink signal is then transmitted to the terminal via antenna 1225. At terminal 1230, antenna 1235 receives the downlink signal and provides the received signal to receiver unit (RCVR) 1240. Receiver unit 1240 digitizes the adjusted signal to adjust (eg, filter, amplify, and frequency downconvert) the received signal and obtain a sample. OFDM modulator 1245 removes the cyclic prefix attached to each OFDM symbol, converts each received transformed symbol into a frequency domain using an N point FFT, and N for N subbands for the OFDM symbol period. Obtain the received symbol and provide the received pilot symbol to the processor 1250 for channel estimation. OFDM modulator 1245 receives a frequency response estimate for the downlink from processor 1250, performs data modulation on the received data symbols to obtain a data symbol estimate (which is an estimate of the transmitted data symbol), The data symbol estimate is provided to an RX data processor 1255 which modulates (ie, symbol demaps), deinterleaves, and decodes the data symbol estimate to recover the transmitted traffic data. Processing by OFDM modulator 1245 and RX data processor 1255 is complementary to processing by OFDM modulator 1215 and TX data processor 1210 at access point 1200, respectively.

On the uplink, TX data processor 1260 processes the traffic data and provides data symbols. OFDM modulator 1265 receives the data symbols and multiplexes them with pilot symbols, performs OFDM modulation, and provides a stream of OFDM symbols. Pilot symbols may be transmitted on subbands allocated to the terminal for pilot transmission, and the number of pilot subbands for the uplink may be the same or different from the number of pilot subbands for the downlink. Transmitter unit 1270 then receives and processes the stream of OFDM symbols to generate an uplink signal, which is transmitted by antenna 1235 to the access point.

At an access point 1210, an uplink signal from antenna 1230 is received by antenna 1225 and processed by receiver unit 1275 to obtain a sample. OFDM demodulator 1280 then processes the sample and provides data symbol estimation for the received pilot symbols and the uplink. RX data processor 1285 processes the data symbol estimates to recover the traffic data sent by terminal 1235. Processor 1290 performs channel estimation for each active terminal transmitting on the uplink. Multiple terminals may transmit pilot simultaneously on the uplink on each assigned set of pilot subbands, where the pilot subband sets may be interlaced.

Processors 1290 and 1250 coordinate (eg, control, coordinate, manage, etc.) operation at access point 1210 and terminal 1235, respectively. Each processor 1290 and 1250 may be associated with a memory unit (not shown) that stores program code and data. Processors 1290 and 1250 perform calculations to derive frequency and impulse responses for the uplink and downlink, respectively.

In a multiple access OFDM system (eg, an Orthogonal Frequency Division Multiple Access (OFDMA) system), multiple terminals can transmit simultaneously on the uplink. For such a system, the pilot subbands may be shared among other terminals. Channel estimation techniques may be used when the pilot subbands for each terminal span the entire operating band (possibly except for the band edges). This pilot subband structure would be desirable to obtain frequency diversity for each terminal. The described techniques may be implemented in a variety of ways. For example, such techniques may be implemented in hardware, software, or a combination thereof. For hardware implementations, the processing units used for channel estimation may include one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gates. It may be implemented within an array (FPGA), processor, controller, microcontroller, microprocessor, other electronic unit designed to implement the described functionality or a combination thereof. Using software, it may be implemented through modules (e.g., procedures, functions, etc.) that implement the described functionality. Software code may be executed by the processors 1290 and 1250 and stored in memory.

The foregoing includes examples of one or more embodiments. Of course, although it is not possible to describe all possible combinations and methods of components with the intention of describing the foregoing embodiments, those skilled in the art will understand that many further combinations of various embodiments are possible. The embodiments described in conclusion are intended to embrace all such alterations, improvements and variations within the spirit of the invention. Moreover, to the extent that the term "containing" is used in the description or claims, the above term is used with the same or similar meaning as "comprise" as commonly used in the claims.

Claims (65)

A method of dynamically scheduling orthogonal resource sets for reuse by user devices to reduce intercell interference, the method comprising: Determining a fair metric for each user device in the wireless communication area; Determining a channel peak desire metric based on different channel quality through a plurality of orthogonal resource sets for each user device; And Determining an overall scheduling metric for each user device, wherein the overall scheduling metric is an output of a metric combination function of the fair metric and the channel peak desire metric. Scheduling Method. The method of claim 1, Determining a channel delay desire metric for each user device multiplied by the fair metric for the user device to determine the overall scheduling metric. The method of claim 2, The channel delay desire metric is used in addition to the channel peak desire metric. The method of claim 2, Wherein the channel delay desire metric is used in place of the channel peak desire metric. The method of claim 1, Identifying the user device with the best overall scheduling metric score as the winning user device. The method of claim 5, And providing a portion of said orthogonal resource set corresponding to said winning channel metric of said winning user device. The method of claim 6, Providing the orthogonal resource set to the winning user device until all user devices have been assigned or all resources have been allocated, and then repeating the method of claim 1. The method of claim 7, wherein And in each iteration of orthogonal resource set allocation, the winning user device is excluded from successive iterations to cause orthogonal resource sets to be allocated to all user devices. The method of claim 7, wherein And in each iteration of an orthogonal resource set assignment, the winning user device is included in successive iterations to cause the winning user device to obtain a plurality of orthogonal resource set assignments. The method of claim 1, Determining the fair metric for a given user comprises evaluating the fair metric using the same class of service protocol. The method of claim 1, Determining the fair metric for a given user comprises evaluating the fair metric using a proportional fair scheduler protocol. The method of claim 1, And the orthogonal resource set is a frequency set. The method of claim 12, And the orthogonal resource set is at least one of an OFDMA, IFDMA, and LFDMA subcarrier set. The method of claim 1, And the orthogonal resource set is a time slot set. The method of claim 1, And said orthogonal resource set is a set of frequency and time slots. The method of claim 1, And the orthogonal resource set is a code set. The method of claim 1, And the orthogonal resource set is an orthogonal SDMA dimension zone. The method of claim 1, And the orthogonal resource set is a carrier set. The method of claim 1, The metric combining function is at least one of a product, a weighted sum and a maximum function. A system for facilitating dynamic limited reuse orthogonal resource set scheduling in a wireless network environment, A limited reuse scheduling component that determines an overall scheduling metric for each user device in the wireless network environment; A peak component that determines an overall channel peak desire metric for each user device; And A delay component that determines a channel delay desire metric for each user device, A system that facilitates scheduling. The method of claim 20, And the limited reuse scheduling component determines a fair metric for each user device based on at least one of the same class of service protocols and a proportional fair scheduler protocol. The method of claim 21, Wherein the overall scheduling metric is an output of the fair metric and at least one metric combination function of the global channel desire metric and the channel delay desire metric. The method of claim 22, And wherein said metric combination function is a product, weighted sum or maximum function. The method of claim 20, And the limited reuse scheduling component represents a user device having a best scoring overall scheduling metric with respect to all other user devices in the wireless network as a winning user device. The method of claim 24, The limited reuse scheduling component provides an orthogonal resource set to the winning user device, wherein the orthogonal resource set includes one or more subcarriers sufficient to meet the resource needs of the winning user device. System. The method of claim 20, And a low power component that evaluates channel quality for the user device and transmits the signal at low power, wherein the channel quality is sufficiently high. The method of claim 20, And an alignment component that determines whether to exclude the winning user device from contiguous orthogonal resource set allocations. The method of claim 27, And the sorting component excludes the winning user device from subsequent iterations of the orthogonal resource set assignment if all user devices are required to continuously receive the orthogonal resource set assignment. The method of claim 28, And the alignment component includes the winning user device in subsequent iterations of the orthogonal resource set assignment if the device is required to receive a plurality of orthogonal resource set assignments. The method of claim 20, And the orthogonal resource set is a frequency set. The method of claim 30, And the orthogonal resource set is at least one of an OFDMA, IFDMA, and LFDMA subcarrier set. The method of claim 20, And said orthogonal resource set is a set of time slots. The method of claim 20, And the orthogonal resource set is a set of frequency and time slots. The method of claim 20, And the orthogonal resource set is a code set. The method of claim 20, And the orthogonal resource set is an orthogonal SDMA dimension zone. The method of claim 20, And the orthogonal resource set is a carrier set. An apparatus for facilitating scheduling orthogonal resource set allocation for a user device in a wireless communication environment, comprising: Means for determining a fair metric for each user device in the communication environment; Means for determining an overall channel peak desire metric for each user device; Means for determining a channel delay desire metric for each device; And Means for determining an overall scheduling metric score for each device, wherein the scheduling metric score is an output of the metric combination function of the fair metric and one or both of the overall channel peak desire metric and the channel delay desire metric. sign, An apparatus that facilitates scheduling orthogonal resource set allocation. The method of claim 37, And means for identifying a user device having the best overall scheduling metric score in relation to the overall scheduling metric score for all other users in the wireless environment as a winning user device. Device. The method of claim 38, And wherein said winning user device is provided with an orthogonal resource set comprising one or more subcarriers. The method of claim 39, And means for excluding the winning user device from successive rounds of orthogonal resource set assignments to ensure that all user devices are continuously provided with an orthogonal resource set. Device. The method of claim 39, And means for including the winning device in a subsequent round of resource allocation to cause the winning user device to obtain a plurality of orthogonal resource sets. The method of claim 37, And means for determining the fair metric uses the same class of service protocol. The method of claim 37, And said means for determining the fair metric uses a proportional fair protocol. The method of claim 37, And the orthogonal resource set is a frequency set. The method of claim 44, And the orthogonal resource set is an OFDMA, IFDMA, or LFDMA subcarrier set. The method of claim 37, And the orthogonal resource set is a set of time slots. The method of claim 37, And the orthogonal resource set is a set of frequency and time slots. The method of claim 37, And the orthogonal resource set is a code set. The method of claim 37, And the orthogonal resource set is an orthogonal SDMA dimension zone. The method of claim 37, And the orthogonal resource set is a carrier set. The method of claim 37, And wherein said metric combination function is a product, weighted sum, or maximum function. Computer executable instructions for determining a fair metric for each user device in a wireless network environment, determining an overall channel peak desire metric for each user device, and determining a channel delay desire metric for each user device. Stored, Computer readable media. The method of claim 52, wherein And determining an overall scheduling metric score for each user device, wherein the overall scheduling metric score is at least one of the fair metric and the overall peak desire metric and the channel delay desire metric for the user device. Computer readable media, characterized in that the output is a metric combination function. The method of claim 53, And providing a set of orthogonal resources to a user device having the best overall scheduling metric score for all other user devices in the wireless network environment. The method of claim 52, wherein And instructions for excluding the user device provided with the orthogonal resource set from successive iterations of orthogonal resource set assignment. The method of claim 52, wherein And including the user device provided with the orthogonal resource set in subsequent iterations of an orthogonal resource set assignment to cause the user device to obtain a plurality of orthogonal resource sets. The method of claim 52, wherein And the metric combining function is at least one of a product, a weighted sum and a maximum function. A microprocessor executing instructions for scheduling dynamic orthogonal resource sets in a wireless communication network area, the instructions comprising: Evaluating each fair metric, total channel peak desire metric, and channel delay desire metric for each of a plurality of user devices in the network area, Determine an overall scheduling metric score for each user device based on the fair metric and at least one of the overall channel peak desire metric and the channel delay desire metric, and Providing a set of orthogonal resources to the user device having the best overall scheduling metric for the other user device in the network area; Microprocessor. The method of claim 58, And said orthogonal resource set is a frequency set. The method of claim 59, And the orthogonal resource set is an OFDMA, IFDMA, or LFDMA subcarrier set. The method of claim 58, And said orthogonal resource set is a set of time slots. The method of claim 58, And said orthogonal resource set is a set of frequency and time slots. The method of claim 58, And the orthogonal resource set is a code set. The method of claim 58, And the orthogonal resource set is an orthogonal SDMA dimension zone. The method of claim 58, And the orthogonal resource set is a carrier set.

Images