WO2005096558A1 - A method for performing a scheduling algorithm with a minimum resource parameter and method of calculating same - Google Patents
A method for performing a scheduling algorithm with a minimum resource parameter and method of calculating same Download PDFInfo
- Publication number
- WO2005096558A1 WO2005096558A1 PCT/EP2004/003431 EP2004003431W WO2005096558A1 WO 2005096558 A1 WO2005096558 A1 WO 2005096558A1 EP 2004003431 W EP2004003431 W EP 2004003431W WO 2005096558 A1 WO2005096558 A1 WO 2005096558A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- resource parameter
- minimum resource
- scheduling
- communication unit
- minimum
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/26—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/52—Queue scheduling by attributing bandwidth to queues
- H04L47/522—Dynamic queue service slot or variable bandwidth allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
- H04W28/14—Flow control between communication endpoints using intermediate storage
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
- H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/18—Negotiating wireless communication parameters
Definitions
- This invention relates to communication systems. It is particularly applicable to wireless communication system where a scheduling algorithm assigns channel resources to users for transmission and reception of data. More specifically, the present invention relates to a method for performing a scheduling algorithm as set forth in the independent claim 1 and a method of calculating a minimum resource parameter for use in a scheduling algorithm as set forth in independent claim 2.
- the mobile station In a cellular mobile communication system, the mobile station usually transmits and receives information to and from a base station using channel resources such as time slots, frequency bandwidth, code sequence, or combinations thereof. These resources are generally shared among users of the communication system.
- a radio access point In an ad-hoc mobile communication system, a radio access point usually transmits and receives information to and from other radio access points within the same ad- hoc network, using channel resources such as time slots, frequency bandwidth, code sequence, or combinations thereof. These resources are generally shared among users of the communication system.
- channel resources such as time slots, frequency bandwidth, code sequence, or combinations thereof.
- a cellular base station and an ad- hoc master access point share at least part of the responsibilities for managing the resources and users within their area of coverage.
- the role of a radio access point in an ad-hoc network has a lot in common to the role of a mobile device in a cellular wireless system.
- the following description shall be referring to a cellular wireless network. Changes required for application of the present invention to ad-hoc networks are easily derived for those skilled in the art from the description.
- processing data In the context of wireless communication, all operations involved in either transmitting or receiving data are referred to as processing data.
- the mobile device In order to process data, the mobile device has to expend operating and processing power for its equipment. From an economical point of view, the most reasonable expenditure of this power is obtained if in return the mobile receiver processes a lot of data while the power is spent. On the other hand, such power is rather wasted if while expending the power no or little data is processed.
- the allocation of data to a user via the channel resource is usually done by a scheduling algorithm.
- a scheduler At least for downlink, i.e. for the transmission direction from base station to mobile terminal, such a scheduler is usually operating in the base station or other parts of the non-mobile entities within the communication system. Such a scheduler usually evaluates parameters such as service data rate, channel state, but does not take into account an economic factor as described above.
- a scheduler may operate in a central node (e.g. base station in cellular systems, master station in an ad-hoc network) to allocate resources. The result of such central node scheduling may then be transmitted to the mobile entities.
- BS base station
- MT mobile terminals
- a layout of a typical communication system is shown in Fig. 1 , wherein a BS serves several MTs in a service area.
- the air-interface resources are usually defined by a logical channel, where a logical channel corresponds to e.g. one or multiple codes in a CDMA system, one or multiple subcarriers in an OFDM system, one or multiple timeslots in a TDMA system (e.g. GSM), or to combinations of those e.g. in an OCDMA or an MC-CDMA system.
- DCA can be applied to uplink and downlink.
- AMC Adaptive Modulation and Coding
- the data-rate within a scheduling frame for a scheduled MT will be adapted to the instantaneous channel quality of the respective link by changing the modulation and coding scheme dynamically.
- AMC is typically applied jointly with DCA.
- a so-called scheduler decides which resources are assigned to which MT.
- a commonly used approach is to use centralized scheduling, where the scheduler is located in the BS and performs its decision based on the following side information, such as channel quality information of the links to the MTs or offered traffic for specific links e.g. amount of data available for transmission to a specific MT.
- Common objectives of the scheduler are to achieve fairness between users, maximize system throughput and/or fulfill Quality of Service (QoS) requirements (e.g. delay, data-rate, loss rate, jitter) for the services run by the scheduled mobile terminals.
- QoS Quality of Service
- the scheduler works on a packet basis.
- schedulers are well known examples in the area of wireless communications:
- This scheduler allocates equal air-interface resources to all MS independent of the channel conditions thus achieving fair sharing of resources.
- This scheduler chooses the user with the highest possible instantaneous data-rate (carrier-to-interference C/l ratio). It achieves the maximum system throughout but ignores the fairness between users.
- This scheduler maintains an average data-rate transmitted to each user within a defined time window and examines the ratio of the instantaneous to the average channel conditions (or ratio of the instantaneous possible data-rate to the average data-rate) experienced by different users and chooses the user with the maximum ratio.
- This scheduler increases the system throughput with respect to RR scheduling, while maintaining some degree of long-term fairness. More detailed information on the structure and function of a scheduler can be obtained for example from US 2003/0104817 which discloses a method for scheduling multiple users sharing a communication resource, particularly relating to high data rate wireless transmission putting emphasis on QoS considerations.
- a terminal may transmit signals to tell the scheduler what data rate is necessary to satisfy the user or service. Among other parameters, this may involve an average connection (or service) data rate and a maximum allowable delay.
- the scheduling at BS cannot know whether an MT is working efficiently in terms of power consumption for reception of data.
- the object of the present invention is to provide a method of performing a scheduling algorithm which allows a receiver to operate economically with reasonable expenditure of operating and processing power.
- a further object is to provide a method for generating a minimum resource parameter used in a scheduling algorithm which allows efficient scheduling of frames.
- the invention is based on the idea of providing signaling of a minimum resource parameter from a communication unit which can be for example either a mobile terminal or a base station to provide a scheduler with information about power expenditure for processing of data.
- the signaling carries information about a minimum amount of channel resource which should be allocated by a scheduler in a scheduling frame for radio access to the communication unit.
- Radio access is understood as the access of a first communication unit to at least part of the radio resource (e.g. logical channel, physical channel, frequency band, time slot, code, etc.) in order to transmit or receive data from or to a second communication unit or a node (e.g.
- the minimum resource parameter might represent either a minimum number of allocation units or a minimum number of information bits for a user or a service in a scheduling frame.
- the minimum resource parameter represents a minimum ratio of processed information bits to the expended processing and operating power spent for its activity during radio access.
- the minimum resource parameter is periodically signaled from the communiation unit. Alternatively, it may be requested by the scheduler or initiated by the communication unit upon fulfillment of power management conditions, for instance, battery power status or power link budget for communication.
- additional scheduling parameters such as channel conditions, amount of data available for transmission, quality of service, delay, data rate and carrier to interference ratio is considered in the scheduling algorithm.
- the determination of power expended includes considering power units for each bit processed (variable cost) and/or the power units expended for processing of a scheduling frame (fixed cost). In this manner, a very precise determination of the power expended may be obtained.
- Figure 1 illustrates the cellular concept consisting of one base station and six mobile terminals.
- Figure 2 shows an example of a time-division frame structure, where two allocation units form one scheduling frame.
- Figure 3 shows an example of a time/frequency-division frame structure, where ten allocation units form one scheduling frame.
- Figure 4 shows an example of a time/frequency/code-division frame structure, where eighteen allocation units form one scheduling frame.
- Figure 5 illustrates structural details of a receiver and a transmitter adapted to carry out the method according to the invention.
- Figure 6 reveals more details of the transmitter shown in Figure 5.
- Figure 7 illustrates a flow chart for calculating a minimum resource parameter according to an embodiment of the invention.
- Figure 8 illustrates a flow chart to calculate a minimum resource parameter according to another preferred embodiment.
- Figures 2 to 4 illustrate the concept of scheduling a frame based on an arbitrary number of allocation units either in the time domain ( Figure 2) the time-frequency domain ( Figure 3) or the time-frequency-code domain ( Figure 4).
- the scheduling is performed in a scheduler usually comprised in the base station or other parts of the non-mobile entities of the communication system.
- the scheduling is applied to allocation units (e.g. in the time / frequency / code domain) having a quantity of transferable information bits.
- allocation units e.g. in the time / frequency / code domain
- other quantities may be easier to obtain, calculate or estimate, or may be more representative than bit figures.
- Such quantities include, but are not limited to a number of modulation symbols, FEC code blocks or Internet protocol packets.
- a complete frequency band is allocated to a user in order to reduce the amount of signaling which needs to be sent from the base station to the mobile terminal.
- a transmitter is generally denoted with reference numeral 100 and the receiver is denoted with numeral 200.
- the transmitter includes a scheduler 120 which schedules resources (allocation units) in a scheduling frame.
- scheduling parameters either received from the network or the mobile receiver, define a scheduling algorithm to establish communication to serve users by transmitting data packets.
- the receiver 200 includes a power management unit 210 and a calculation unit 220 to calculate a minimum resource parameter as will be described further below in detail.
- the scheduler decides whether the presently available resources allow fulfilling the minimum resource parameter and if so, it schedules allocation units in a scheduling frame for that particular user. If the scheduler, due to a shortage of resources, is not able to fulfill the requested minimum resource parameter, no allocation units are scheduled at all for that particular user. This has the advantage that the resources can be shared among the remaining users. Further, it is ensured that the receiver works economically and reasonable, i.e. expenditure of power for reception of data having less than a minimum amount of information data is avoided.
- Figure 6 shows exemplarily some structural details in block diagram form of a transmitter (e.g. either the base station or mobile station) for carrying out the scheduling algorithm according to the invention.
- a transmitter e.g. either the base station or mobile station
- the transmitter 100 includes the scheduler 120, a control unit 130 and a check and release unit 110. All other conventional structural details of the transmitter have been omitted as far as they have no direct impact of the invention.
- the scheduler 120 together with the control unit 130 implements the scheduling algorithm.
- the check and release unit 4 receives the minimum resource parameter which is generated in the receiver 200 ( Figure 5) in a manner as illustrated in Figures 7 and 8.
- the minimum resource parameter is preferably stored in a buffer memory 150 which is accessed by the control unit 130 and may be updated upon system initialization or upon receiving a corresponding command from the receiver or the network controller of the system.
- the transmitter 100 (as well as the receiver 200) comprises transmission and receiving circuitry 140 for sending and receiving data and control signals using its antenna over the air interface.
- signaling data concerning the minimum resource parameter are transmitted to or received from other communication units of the system.
- the details of the transmission and receiving operation using logical data channels and control channels are known for the person skilled in the art in the field of communications.
- the scheduler may be implemented in the mobile station to perform the scheduling algorithm as described above.
- Figure 7 shows the essential steps for the calculation of a minimum resource parameter according to an embodiment of the invention where the minimum resource parameter is applicable to reception of data.
- the minimum resource parameter is consequently represented by a ratio of received information bits in relation to the power expended for the reception thereof per scheduling frame.
- the number of information bits per scheduling frame is determined in step 310.
- the power units expended for reception of the information bits including the processing and operating power per scheduling frame are determined in step 320.
- the power units may be coarsely divided between those which are expended for reception of one scheduling frame including overhead signaling, active operation of the receiver circuitry, CRC check sum, etc, designated with reference numeral 322.
- These power units are generally denominated as fixed cost, because they show no direct relation to the amount of information received per scheduling frame.
- power units expended for each bit received representing a variable cost factor are also taken into consideration, designated with reference numeral 324.
- the resources allocated to that receiver should exceed a minimum resource threshold p th that is equivalent to a certain ⁇ th threshold value.
- variable power units expended depend mainly on the number of bits processed. However there may be cases where the variable costs depend on other quantities. Such quantities include, but are not limited to a number of processed allocation units, modulation symbols, FEC code blocks or Internet protocol packets.
- Figure 8 describes another embodiment for calculating the minimum number of allocation units for a scheduling frame to exceed a threshold ratio.
- the threshold of nt h of received information bits to expended power for reception per scheduling frame is obtained as given by the network (step 340).
- the power units expended for reception, processing and operating power per scheduling frame need to be determined.
- the minimum number of Pth of allocation units required to exceed threshold nt h is calculated in step 360 according to below given equation (2).
- the exact relation between allocated resources and received information bits will depend on the communication system. Almost always there will be additional signaling of some sort in addition to the transmission of pure information data. Consequently the power unit cost can be divided into fixed costs and variable costs.
- One allocation unit (au) is capable of transmitting 1000 information bits.
- the receiver has to expend 1 power unit (pu) (applicable both to fixed and variable cost).
- Allocated resources are sufficient to transmit sixteen allocation units to a user
- the minimum number of resources allocated in a scheduling frame P a ii oc ⁇ P th should be three or more.
- a threshold value ⁇ th may be given by the communication system design, i.e. is signaled from BS (or network) to the mobile terminal, or is determined autonomously by the mobile terminal e.g. depending on the battery status.
- the signaling by the mobile terminal may be transmitted periodically (e.g. each frame, one per specified time interval, etc.) or upon a special request by the network or base station.
- a further mechanism could be implemented that upon initiation by the mobile terminal, e.g. if the battery capacity falls below a certain level the signaling of a minimum resource parameter is effected.
- an economy class value may be defined representing a range of resources or a number of bits (e.g. class I may represent one to two allocation units, class II may represent three to five allocation units; class A may represent 1 ,000 to 1 ,500 bits, class B may represent 1 ,501 to 3,800 bits; etc.).
- a further possible condition where signaling might become necessary is during setup or establishment of a connection or call between the base station and mobile terminal.
- the above exemplarily calculated or obtained threshold values may be influenced by the actual battery power status of the mobile terminal, the possible power connection to a fixed power line network, the duration of a connection, or the power link budget for communication between the base station and mobile terminal.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
Description
Claims
Priority Applications (8)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
BRPI0418642-7A BRPI0418642A (en) | 2004-03-31 | 2004-03-31 | method for executing a programming algorithm on a programmer of a wireless communication system, method performed on a communication unit of a wireless communication network, mobile terminal and base station of a wireless communication network |
JP2007505387A JP4460603B2 (en) | 2004-03-31 | 2004-03-31 | Method for executing scheduling algorithm with minimum resource parameters and method for calculating the same |
EP04724603.8A EP1738535B1 (en) | 2004-03-31 | 2004-03-31 | A method for performing a scheduling algorithm with a minimum resource parameter and method of calculating same |
PCT/EP2004/003431 WO2005096558A1 (en) | 2004-03-31 | 2004-03-31 | A method for performing a scheduling algorithm with a minimum resource parameter and method of calculating same |
EP10175589A EP2254290B1 (en) | 2004-03-31 | 2004-03-31 | A Method For Performing Scheduling Algorithm with a Minimum Resource Parameter and Method of Calculating Same |
CNA2004800426649A CN1943180A (en) | 2004-03-31 | 2004-03-31 | Method for performing scheduling algorithm with minimum resource parameter and calculation thereof |
KR1020067022765A KR101150651B1 (en) | 2004-03-31 | 2004-03-31 | A method for performing a scheduling algorithm with a minimum resource parameter and method of calculating same |
US10/594,556 US8208446B2 (en) | 2004-03-31 | 2004-03-31 | Method for performing a scheduling algorithm with a minimum resource parameter and method of calculating same |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/EP2004/003431 WO2005096558A1 (en) | 2004-03-31 | 2004-03-31 | A method for performing a scheduling algorithm with a minimum resource parameter and method of calculating same |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2005096558A1 true WO2005096558A1 (en) | 2005-10-13 |
Family
ID=34957561
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2004/003431 WO2005096558A1 (en) | 2004-03-31 | 2004-03-31 | A method for performing a scheduling algorithm with a minimum resource parameter and method of calculating same |
Country Status (7)
Country | Link |
---|---|
US (1) | US8208446B2 (en) |
EP (2) | EP2254290B1 (en) |
JP (1) | JP4460603B2 (en) |
KR (1) | KR101150651B1 (en) |
CN (1) | CN1943180A (en) |
BR (1) | BRPI0418642A (en) |
WO (1) | WO2005096558A1 (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8363607B2 (en) | 2006-09-11 | 2013-01-29 | Qualcomm Incorporated | VOIP group resource management |
CN103179583A (en) * | 2011-12-26 | 2013-06-26 | 中国移动通信集团设计院有限公司 | Network simulation method and device |
CN103957529A (en) * | 2014-04-17 | 2014-07-30 | 北京理工大学 | Learning-based multi-criteria user selection method of amorphous cell |
US9844071B2 (en) | 2009-05-05 | 2017-12-12 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus in a wireless communications system |
Families Citing this family (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2007531428A (en) * | 2004-03-31 | 2007-11-01 | 松下電器産業株式会社 | Method and scheduler for executing a scheduling algorithm with minimal resource parameters |
KR100660054B1 (en) * | 2004-09-01 | 2006-12-20 | 한국전자통신연구원 | Method for Downlink Packet Scheduling using Service Delay Time and Channel State |
KR100943613B1 (en) * | 2005-11-22 | 2010-02-24 | 삼성전자주식회사 | Apparatus and method for uplink scheduling in a communication system |
KR100827371B1 (en) * | 2005-11-30 | 2008-05-07 | 삼성전자주식회사 | Apparatus and method for allocating resource in a communication system |
US7933635B2 (en) * | 2006-03-09 | 2011-04-26 | Lg Electronics Inc. | Adjustment of parameters based upon battery status |
US8917598B2 (en) * | 2007-12-21 | 2014-12-23 | Qualcomm Incorporated | Downlink flow control |
US8699487B2 (en) * | 2008-02-04 | 2014-04-15 | Qualcomm Incorporated | Uplink delay budget feedback |
US8656239B2 (en) * | 2008-02-12 | 2014-02-18 | Qualcomm Incorporated | Control of data transmission based on HARQ in a wireless communication system |
EP2313992A4 (en) * | 2008-08-15 | 2014-09-17 | Unwired Planet Internat Ltd | Relative time division for network coding |
US9125090B2 (en) * | 2009-02-27 | 2015-09-01 | At&T Mobility Ii Llc | Staggered channelization code allocation for multi-carrier networks |
US9591563B2 (en) * | 2009-07-01 | 2017-03-07 | Telefonaktiebolaget Lm Ericsson (Publ) | Power efficient data transmission |
US8488613B2 (en) | 2011-05-05 | 2013-07-16 | Hitachi, Ltd. | Systems and methods for low complexity user scheduling |
JP5673701B2 (en) * | 2013-02-12 | 2015-02-18 | 富士通株式会社 | Base station, communication terminal, base station communication method, communication terminal communication method, communication system |
US10123277B2 (en) | 2016-03-21 | 2018-11-06 | Apple Inc. | Techniques for managing wireless transmission energy budget |
KR101883908B1 (en) * | 2017-11-21 | 2018-08-01 | 주식회사 알씨엔 | A Transmission Method of Resource Allocation Information for minimum resource unit |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2003094565A1 (en) * | 2002-04-29 | 2003-11-13 | D.S.P.C. Technologies Ltd. | Apparatus and method of transmission link quality indicator |
US20040053574A1 (en) * | 2002-09-12 | 2004-03-18 | Lucent Technologies, Inc. | Methods and apparatus for resource management in integrated wireless data and voice communications |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2682494B2 (en) * | 1995-02-24 | 1997-11-26 | 日本電気株式会社 | Multi-access communication system |
JP3629077B2 (en) * | 1995-12-08 | 2005-03-16 | 富士通株式会社 | Wireless communication system, base station for wireless communication system, and intermittent power-on type mobile station |
US6504821B2 (en) * | 1996-06-12 | 2003-01-07 | At&T Corp. | Flexible bandwidth negotiation for the block transfer of data |
US6678252B1 (en) * | 1999-10-28 | 2004-01-13 | Verizon Laboratories Inc. | Method and apparatus for dynamic source routing in ad hoc wireless networks |
US6745044B1 (en) | 2000-09-29 | 2004-06-01 | Qualcomm Incorporated | Method and apparatus for determining available transmit power in a wireless communication system |
US6978144B1 (en) * | 2001-04-19 | 2005-12-20 | Cisco Technology, Inc. | Method and system for managing real-time bandwidth in a wireless network |
US6731947B2 (en) * | 2001-10-23 | 2004-05-04 | Qualcomm Incorporated | Method and apparatus for controlling data rate on a forward channel in a wireless communication system |
US6917812B2 (en) | 2001-12-03 | 2005-07-12 | Telefonaktiebolaget Lm Ericsson (Publ) | Air interface scheduler for wireless communication networks |
US7085595B2 (en) * | 2003-12-16 | 2006-08-01 | Intel Corporation | Power saving in a wireless local area network |
GB2429871A (en) * | 2005-06-30 | 2007-03-07 | Nokia Corp | Method of implementing unscheduled automatic power save delivery (APSD) between a terminal and an access point |
US7450975B2 (en) * | 2005-09-28 | 2008-11-11 | Motorola, Inc. | System and method for improving battery life of a mobile station |
-
2004
- 2004-03-31 US US10/594,556 patent/US8208446B2/en active Active
- 2004-03-31 EP EP10175589A patent/EP2254290B1/en not_active Expired - Lifetime
- 2004-03-31 WO PCT/EP2004/003431 patent/WO2005096558A1/en active Application Filing
- 2004-03-31 KR KR1020067022765A patent/KR101150651B1/en active IP Right Grant
- 2004-03-31 JP JP2007505387A patent/JP4460603B2/en not_active Expired - Lifetime
- 2004-03-31 CN CNA2004800426649A patent/CN1943180A/en active Pending
- 2004-03-31 BR BRPI0418642-7A patent/BRPI0418642A/en not_active IP Right Cessation
- 2004-03-31 EP EP04724603.8A patent/EP1738535B1/en not_active Expired - Lifetime
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2003094565A1 (en) * | 2002-04-29 | 2003-11-13 | D.S.P.C. Technologies Ltd. | Apparatus and method of transmission link quality indicator |
US20040053574A1 (en) * | 2002-09-12 | 2004-03-18 | Lucent Technologies, Inc. | Methods and apparatus for resource management in integrated wireless data and voice communications |
Non-Patent Citations (1)
Title |
---|
PAUL J. M. HAVINGA & GERARD J. M. SMIT: "Energy-efficient TDMA Medium Access Control protocol scheduling", PROCEEDINGS OF THE ASIAN INTERNATIONAL MOBILE COMPUTING CONFERENCE- AMOC 2000, November 2000 (2000-11-01), pages 1 - 9, XP001183867 * |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8363607B2 (en) | 2006-09-11 | 2013-01-29 | Qualcomm Incorporated | VOIP group resource management |
US9844071B2 (en) | 2009-05-05 | 2017-12-12 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus in a wireless communications system |
US10375721B2 (en) | 2009-05-05 | 2019-08-06 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus in a wireless communications system |
US10904911B2 (en) | 2009-05-05 | 2021-01-26 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus in a wireless communications system |
CN103179583A (en) * | 2011-12-26 | 2013-06-26 | 中国移动通信集团设计院有限公司 | Network simulation method and device |
CN103179583B (en) * | 2011-12-26 | 2015-07-29 | 中国移动通信集团设计院有限公司 | A kind of network simulation method and device |
CN103957529A (en) * | 2014-04-17 | 2014-07-30 | 北京理工大学 | Learning-based multi-criteria user selection method of amorphous cell |
CN103957529B (en) * | 2014-04-17 | 2017-08-01 | 北京理工大学 | A kind of multiple criteria user choosing method of the amorphous cell based on study |
Also Published As
Publication number | Publication date |
---|---|
KR101150651B1 (en) | 2012-05-25 |
EP2254290B1 (en) | 2012-10-24 |
JP2007531429A (en) | 2007-11-01 |
CN1943180A (en) | 2007-04-04 |
US8208446B2 (en) | 2012-06-26 |
EP2254290A1 (en) | 2010-11-24 |
KR20070002078A (en) | 2007-01-04 |
EP1738535A1 (en) | 2007-01-03 |
US20080117881A1 (en) | 2008-05-22 |
BRPI0418642A (en) | 2007-05-29 |
EP1738535B1 (en) | 2017-06-28 |
JP4460603B2 (en) | 2010-05-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1738535B1 (en) | A method for performing a scheduling algorithm with a minimum resource parameter and method of calculating same | |
CA2698363C (en) | Method and apparatus for controlling transmissions of a communications system | |
EP2018712B1 (en) | Traffic load dependent power allocation in multi user wireless communication network with proportional fair scheduling in time and frequency domain | |
EP2265043B1 (en) | Receiving device, transmitting device, receiving method, and transmitting method | |
US7653024B2 (en) | Allocating channels in multi-user or multi-service real-time transmissions of wireless packet data | |
US20050117536A1 (en) | System and method for transmitting and receiving resource allocation information in a wireless communication system | |
EP1309120A1 (en) | A method for allocating wireless communication resources | |
KR20050021083A (en) | Method for scheduling assignment of uplink packet transmission | |
US8509839B2 (en) | Transmission apparatus | |
CN1171496C (en) | Method for dynamic allocation of resources in digital radio communication system | |
US7397767B2 (en) | Method of allocating resources in a radiocommunication system and base station for implementing the said method | |
KR20060091158A (en) | Apparatus and method for scheduling of packet data in a wireless communication system | |
KR20060026067A (en) | Scheduling with blind signaling | |
US20040071163A1 (en) | Scheduling method for supplemental channel resource | |
JP4201498B2 (en) | Frequency resource allocation method in communication system | |
EP1738534B1 (en) | A method and scheduler for performing a scheduling algorithm with minimum resource parameter | |
RU2341029C2 (en) | Method of scheduling algorithm with minimum resource parameter and calculation method | |
KR20060133070A (en) | A method and scheduler for performing a scheduling algorithm with minimum resource parameter | |
EP1881717B1 (en) | Allocating channels in multi-user or multi-service real-time transmissions of wireless packet data | |
Chen et al. | A channel state aware uplink bandwidth allocation algorithm for wireless networks | |
Shin et al. | Scheduled Uplink Packet Transmission Schemes for Voice Traffic in OFDMA-Based Wireless Communication Systems |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 200480042664.9 Country of ref document: CN |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
REEP | Request for entry into the european phase |
Ref document number: 2004724603 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2004724603 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2007505387 Country of ref document: JP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020067022765 Country of ref document: KR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2006138215 Country of ref document: RU |
|
WWP | Wipo information: published in national office |
Ref document number: 2004724603 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: PI0418642 Country of ref document: BR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10594556 Country of ref document: US |
|
WWP | Wipo information: published in national office |
Ref document number: 10594556 Country of ref document: US |