WO2008155624A2 - Procédé et appareil pour planification de transmission dans un réseau maillé - Google Patents

Procédé et appareil pour planification de transmission dans un réseau maillé Download PDF

Info

Publication number
WO2008155624A2
WO2008155624A2 PCT/IB2008/001576 IB2008001576W WO2008155624A2 WO 2008155624 A2 WO2008155624 A2 WO 2008155624A2 IB 2008001576 W IB2008001576 W IB 2008001576W WO 2008155624 A2 WO2008155624 A2 WO 2008155624A2
Authority
WO
WIPO (PCT)
Prior art keywords
nodes
status
scheduling
opportunities
opportunity
Prior art date
Application number
PCT/IB2008/001576
Other languages
English (en)
Other versions
WO2008155624A3 (fr
Inventor
Xin Qi
Original Assignee
Nokia Corporation
Nokia, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nokia Corporation, Nokia, Inc. filed Critical Nokia Corporation
Publication of WO2008155624A2 publication Critical patent/WO2008155624A2/fr
Publication of WO2008155624A3 publication Critical patent/WO2008155624A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • I OfHlZj Radio communication systems such as a wireless data networks (e.g., Third Generation Partnership Project (3GPP) Long Term Evolution (LTE) systems, spread spectrum systems (such as Code Division Multiple Access (CDMA) networks), Time Division Multiple Access (TDMA) networks, WiMAX (Worldwide Interoperability for Microwave Access), etc.), provide users with the convenience of mobility along with a rich set of services and features.
  • 3GPP Third Generation Partnership Project
  • LTE Long Term Evolution
  • CDMA Code Division Multiple Access
  • TDMA Time Division Multiple Access
  • WiMAX Worldwide Interoperability for Microwave Access
  • a method comprises competing, using a channel, with one or more nodes of a meshed network to obtain one of a plurality of transmission opportunities reserved for providing distributed scheduling of transmissions within the meshed network.
  • the method also comprises receiving an assignment of the transmission opportunity based on priority information of the nodes.
  • an apparatus comprises scheduling logic configured to compete, using a channel, with one or more nodes of a meshed network to obtain one of a plurality of transmission opportunities reserved for providing distributed scheduling of transmissions within the meshed network.
  • the scheduling logic is further configured to receive an assignment of the transmission opportunity based on priority information of the nodes.
  • a method comprises prioritizing a plurality of links of a meshed network.
  • the method also comprises selecting the links that are high priority. Further, the method comprises performing a distributed scheduling procedure for the selected high priority links.
  • a system comprises means for prioritizing a plurality of links of a meshed network.
  • the system also comprises means for selecting the links that are high priority.
  • the method further comprises means for performing a distributed scheduling procedure for the selected high priority links.
  • FIGs. IA and IB are diagrams of communication systems capable of providing transmission scheduling, according to various embodiments of the invention.
  • FIG. 2 is a diagram of an exemplary meshed architecture for transmission scheduling, according to an exemplary embodiment
  • WiMAX Worldwide Interoperability for Microwave Access
  • FIGs. 7A-7D are diagrams of communication systems having exemplary long-term evolution (LTE) and E-UTRA (Evolved Universal Terrestrial Radio Access) architectures, in which the system of FIG. IA can operate to provide resource allocation, according to various exemplary embodiments of the invention;
  • LTE long-term evolution
  • E-UTRA Evolved Universal Terrestrial Radio Access
  • FIG. 8 is a diagram of hardware that can be used to implement an embodiment of the invention.
  • FIG. 9 is a diagram of exemplary components of a user terminal configured to operate in the systems of FIGs. 6 and 7, according to an embodiment of the invention.
  • DETAILED DESCRIPTION iOOI 9j An apparatus, method, and software for providing transmission scheduling are disclosed.
  • numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the invention. It is apparent, however, to one skilled in the art that the embodiments of the invention may be practiced without these specific details or with an equivalent arrangement.
  • well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the embodiments of the invention.
  • FIGs. I A and I B are diagrams of communication systems capable of providing transmission scheduling, according to various embodiments of the invention.
  • UEs user equipment
  • a base station 103 which is part of an access network (e.g., 3GPP LTE (or E-UTRAN), WiMAX, etc.).
  • 3GPP LTE or E-UTRAN
  • WiMAX WiMAX
  • the base station 103 is denoted as an enhanced Node B (eNB).
  • eNB enhanced Node B
  • the UE 101 can be any type of mobile stations, such as handsets, terminals, stations, units, devices, multimedia tablets, Internet nodes, communicators, Personal Digital Assistants or any type of interface to the user (such as "wearable" circuitry, etc.).
  • the UE 101 can communicate with the base station 103 wirelessly, or through a wired connection.
  • UE 101a wirelessly connects to the base station 103a
  • the UE lOln can be a wired terminal, which is linked to the base station 103n.
  • the communication system 100 can extend network coverage through the use of one or more relay nodes 105 (one of which is shown).
  • the base station 103a employs a transceiver 107, which transmits information to the UE 101a via one or more antennas 109 for transmitting and receiving electromagnetic signals.
  • the base station 103a may utilize a Multiple Input Multiple Output (MIMO) antenna system 109 for supporting the parallel transmission of independent data streams to achieve high data rates between the UE 101a and base station 103a.
  • MIMO Multiple Input Multiple Output
  • the base station 103 uses OFDM (Orthogonal Frequency Divisional Multiplexing) as a downlink (DL) transmission scheme and a single-carrier transmission (e.g., SC-FDMA (Single Carrier-Frequency Division Multiple Access) with cyclic prefix for the uplink (UL) transmission scheme.
  • SC-FDMA can also be realized using a DFT-S- OFDM principle, which is detailed in 3GGP TR 25.814, entitled "Physical Layer Aspects for Evolved UTRA," v.1.5.0, May 2006 (which is incorporated herein by reference in its entirety).
  • SC-FDMA also referred to as Multi-User-SC-FDMA, allows multiple users to transmit simultaneously on different sub-bands.
  • the base station 103 includes a scheduling logic 1 1 1 to provide a mechanism creating a contention-free multicast schedule between a source node and a group of target nodes.
  • the scheduling logic 1 1 1 may reside in the UE 101.
  • the scheduling logic 1 1 1 provides a contention-based distributed scheduling (DS) mechanism, whereby nodes (e.g., UE 101 , BS 103, relay node 105, etc.) of the system 100 (which is arranged in a meshed topology) compete to obtain reserved contention opportunities, and the "winning" (or successful) nodes are permitted to occupy the reserved transmission opportunities to transmit scheduling messages in a contention-free manner with a high probability, without the need to provide advance announcement of the transmission.
  • the system 100 provides link-by-link distributed scheduling mechanism within the meshed network. Transmission opportunities for the scheduling messages of a specific link are assigned to high priority links, as to minimize signaling disruptions.
  • WiMAX Worldwide Interoperability for Microwave Access
  • RAN radio access network
  • LOS Line Of Sight
  • NLOS near/non LOS
  • the radio access network which comprises the base stations 103 and relay stations 105, communicates with a data network 1 15 (e.g., packet switched network), which has connectivity to a public data network 117 (e.g., the global Internet) and a circuit-switched telephony network 119, such as the Public Switched Telephone Network (PSTN).
  • PSTN Public Switched Telephone Network
  • the communication system of FIG. IB is compliant with IEEE 802.16.
  • the IEEE 802.16 standard provides for fixed wireless broadband Metropolitan Area Networks (MANs), and defines six channel models, from LOS to NLOS, for fixed-wireless systems operating in license-exempt frequencies from 2 GHz to 1 1 GHz.
  • j0026j In an exemplary embodiment, each of the base stations 103 uses a medium access control layer (MAC) to allocate uplink and downlink bandwidth.
  • MAC medium access control layer
  • OFDM Orthogonal Frequency Division Multiplexing
  • IEEE 802.16x defines a MAC (media access control) layer that supports multiple physical layer (PHY) specifications.
  • IEEE 802.16a specifies three PHY options: an OFDM with 256 sub-carriers; OFDMA, with 2048 sub-carriers; and a single carrier option for addressing multipath problems. Additionally, IEEE 802.16a provides for adaptive modulation. For example, IEEE 802.16j specifies a multihop relay network, which can employ one or more relay stations to extend radio coverage.
  • the service areas of the RAN can extend, for instance, from 31 to 50 miles (e.g., using 2-1 1GHz).
  • the RAN can utilize point-to-multipoint or mesh topologies. Under the mobile standard, users can communicate via handsets within about a 50 mile range.
  • the radio access network can support IEEE 802.1 1 hotspots.
  • the communication system of FIG. IB can, according to one embodiment, provide both frequency and time division duplexing (FDD and TDD). It is contemplated that either duplexing scheme can be utilized. With FDD, two channel pairs (one for transmission and one for reception) are used, while TDD employs a single channel for both transmission and reception.
  • FDD frequency and time division duplexing
  • TDD time division duplexing
  • the system 100 is a wireless mesh network (WMN), which supports a contention-based distributed scheduling (DS) mechanism.
  • DS distributed scheduling
  • Traditional DS mechanisms e.g., the coordinated and uncoordinated DS of 802.16, possess a number of drawbacks, one of which involves the long delay of the DS.
  • Both the coordinated and uncoordinated DS employ a three-way handshake, which operates as follows.
  • a request message for the scheduling is transmitted by the transmitting node (requester of the schedule).
  • the suggested opportunities for data transmission are listed in the same message.
  • a grant message for the schedule is then sent back by the receiving node (requestee of the schedule); the grant message contains the selection of data transmission opportunities. Thereafter, a copy of the grant message is transmitted by the transmitting node to confirm the schedule.
  • the nodes e.g., BSs 103 and relay stations 105 and UEs 101
  • the nodes can form a mesh network, as explained in the architecture of FIG. 2.
  • the two DS mechanisms of coordinated and uncoordinated differ in the schedule of the transmission opportunities for the scheduling messages.
  • the scheduling messages are transmitted in control subframes and scheduled in a contention-free manner using the distributed pseudo-random election method.
  • the election algorithm is needed because the scheduling messages also need to be scheduled in a distributed manner.
  • the messages compete for the transmission opportunities in data subframes.
  • a transmission opportunity denotes a time/frequency slot.
  • the "winners" of this competition can use the reserved transmission opportunity to transmit scheduling messages in a contention-free manner with a high probability.
  • priorities of the competing nodes are considered, thereby providing Quality of Service (QoS) differentiation.
  • the system 100 can also provide efficient scheduling by performing link-by-link scheduling.
  • j ( K!?3j Scheduling delay can be problematic with the traditional approaches, e.g., election algorithm for the coordinated DS. Scheduling delay, as used herein, means the delay from the start of the request message to the start of the data transmission.
  • mesh nodes should compute and announce their schedules of the next transmission opportunity for scheduling messages when transmitting the message in the current opportunity.
  • Two observations are made. Firstly, there must be enough interspaces in time between two subsequent transmission opportunities of every node. Otherwise, the transmission opportunities would be occupied excessively by some nodes that send scheduling messages too frequently, which is unfair for other nodes. As a result, the average delay between two scheduling messages of mesh nodes can be rather large.
  • the requester the node transmitting traffic
  • the requestee the receiving node
  • the requestee could not change the already-determined transmission opportunity for the next scheduling message, even if it wants to transmit a scheduling message immediately (e.g. to grant a schedule).
  • the typical scheduling delay is tens to hundreds of transmission opportunities, namely several to tens of frames. If scheduling cannot be successfully performed within the three handshake messages, then additional scheduling messages must be transmitted, resulting in even greater delay.
  • the long scheduling delay has several negative consequences. For example, it may not be possible to fulfill the QoS requirements of many types of traffic flows, e.g., rate-variable real-time traffic. Also, the delay introduces severe obstacles for adaptive transmission, namely because the channel is very likely to change after the delay period. Without efficient channel adaptation, the so-called opportunistic multiuser scheduling cannot be readily used to improve system throughput. Further, reserving for channel resources quickly can be difficult, e.g., in the case of retransmissions when negative acknowledgement (NACK) messages are received by the transmitting node.
  • NACK negative acknowledgement
  • FIG. 2 is a diagram of an exemplary meshed architecture for transmission scheduling, according to an exemplary embodiment.
  • the circles represent mesh nodes (e.g., base stations 103 or user terminals 101) and dashed lines denote physical links between two nodes.
  • nodes A-H belong to a single wireless mesh network (WMN) 200 and uses distributed scheduling.
  • WSN wireless mesh network
  • the nodes can represent base stations 103 or user terminals 101, there is no need to differentiate between mesh base stations and mesh user nodes in this scenario for the purposes of describing the scheduling mechanism.
  • System 200 utilizes distributed scheduling, such as the IEEE 802.16 (which is more fully described in IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems, October 2004; which is incorporated herein by reference in its entirety).
  • distributed scheduling such as the IEEE 802.16 (which is more fully described in IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems, October 2004; which is incorporated herein by reference in its entirety).
  • Each directional physical link has a link identifier (ID), which is assigned by the transmitting node when the link is created between the transmitting node and the receiving node.
  • ID link identifier
  • the transmitting node uses the link ID to address the receiving node.
  • the receiving node knows from the link ID and the transmitting Node ID of a received packet whether this packet targets for itself.
  • Data packet transmission is scheduled over a physical link between a transmitting node and a receiving node, i.e., in a unicast way. Broadcast is used when controlling messages are transmitted.
  • FIGs. 3A-3C are flowcharts of processes for providing transmission scheduling, according to various embodiments of the invention.
  • the processes of FIGs. 3A-3C can be used in an IEEE 802.16 distributed WMN.
  • competition is initiated, when nodes having scheduling information to transmit, vie or compete for reserved contention opportunities, per step 301.
  • the process determines, as in step 303, the priorities (e.g., Quality of Service (QoS) requirements) of the competing nodes, and assigns the transmission opportunities to one or more of the competing nodes based on the prioritization, per step 305.
  • the winning nodes are then permitted to transmit, as in step 307, their scheduling messages using the reserved contention opportunities - this resource ensures that the distributed scheduling is contention-free.
  • QoS Quality of Service
  • the transmission opportunities are categorized into "contention opportunities” and "winners' transmission opportunities.”
  • the contention opportunities are designated for the competition, while the winners' transmission opportunities are provided to those nodes that prevail after the competition. That is, the winning nodes are determined using the contention opportunities.
  • a priority content procedure is performed, as in step 313, to determine the highest priority nodes. After which, a random contention procedure is performed to select the winning nodes from the highest priority nodes, according to one embodiment (step 315).
  • the process of FIG. 3C involves a DS mechanism that is performed on a link-by-link basis.
  • step 321 the process prioritizes the links within the meshed network 200.
  • This prioritization procedure can utilize any number of methodology and criteria, such as link metrics or costs as well as user requirements. Based on this prioritization, the "high" priority links are determined, as in step 323. In step 325, a scheduling handshake procedure is performed over the high priority links.
  • node C has not granted the use of TOl .
  • node E grants the schedule of TOl to node D.
  • Node C grants the schedule of TOl to node B.
  • node D has not confirmed the schedule of TOl, node C does know that node E has granted the schedule of TOl .
  • node D cannot confirm the schedule to node E, because this would result in a contention of data packets at node C at transmission opportunity TOl. Thus, a "scheduling failure" has occurred. Node D can only inform the failure to node E and request for other schedules.
  • node E since node E has already grant TOl to all its neighbors (the grant message is broadcasted), all its neighbors would assume this schedule happens as granted until E itself cancels TOl. Unfortunately, node E may not perform such scheduling in a timely manner. In this case, TOl would be wasted.
  • the handshake over a link can be interrupted or affected by handshakes of other links. To remove the interruption, the handshake should be executed continuously. More exactly, between the transmissions of the three messages of a handshake, there must not be other scheduling messages reaching the two involved mesh nodes.
  • a direct method is to conduct all the scheduling handshakes link-by-link, i.e., the request/grant/confirm messages for the scheduling of any link are transmitted uninterruptedly. However, this method is infeasible, because the scheduling control messages will exhaust the control channel capacity. Considering the WMN 200 of FIG.
  • 3C permits the link with high priority to perform the handshake in a link-by-link manner, wherein the traditional node-by-node approach can be used for the other links (low priority links). Because only certain links are involved, the network resources required are feasible.
  • the priority discrimination could be performed by the competition method explained in FIGs. 3A and 3B. Alternatively, other equivalent methods can also be used to prioritize the links.
  • FIGs. 4A and 4B are flowcharts of a transmission scheduling process involving pairs of transmission opportunities, according to various embodiments of the invention.
  • two new reserved transmission opportunities are defined in the scheduling control subframe, as illustrated in FIG. 5A, "contention opportunities” and “winners' transmission opportunity.”
  • the "contention opportunities” are reserved for the competition.
  • the winners of the competition could transmit scheduling messages in the pre-reserved "winners' transmission opportunity.”
  • the scheduling process in an exemplary embodiment, further defines contention opportunities in terms of pairs: an odd opportunity and an even opportunity (step 401).
  • MS(Md J processing of the odd opportunity is performed, wherein the status of the node is determined, per step 403.
  • all the mesh nodes have one of the two statuses, "alive" (i.e., active) or "dead” (i.e., inactive).
  • the contention opportunities are partitioned into two subsequent opportunities: priority contention opportunities and random ones.
  • priority contention opportunities there are 2xm priority contention opportunities and 2x « random ones in all, where m and n (which are integers) could be configured by the network controller.
  • the supported priority levels are 2 m .
  • step 405 during the priority contention opportunities, the nodes check the priority number bit by bit. Serially and periodically, according to every bit of the priority number, the following procedure happens in a pair of contention opportunities at every node. With respect to the odd opportunity, if the node is "alive" (as determined in step 403), the corresponding bit is checked, per step 405. If the bit is set (e.g., equal to ' 1 '), a busy tone is sent in-band, according to one embodiment (step 407). In addition to a "busy tone,” it is contemplated that any signalling information can be utilized for conveying unavailability of the contention channel.
  • the node checks, per step 425, the same bit as examined in step 405. If the bit is not set to T, the node listens to the channel, as in step 427. If a busy tone is detected (step 429), the node switches the status to "dead," per step 431. However, if the node is determined to be "dead” in step 423, the node forwards what it hears in the previous step. If tmp is ' 1 ' (as determined in step 433), a busy tone is signalled (step 435). If tmp is O', no busy tone signalling is provided.
  • the busy tone heard (or detected) by a mesh node maybe the sum of several busy tones transmitted by several nodes one-hop away from the hearing node.
  • all the "alive" nodes will have the highest priorities among all their two- hop neighbors.
  • these nodes can, in an exemplary embodiment, select random numbers uniformly from the number [0, 2 n -l] to be used in the random competition in the same way as the priority number used in the priority competition. Subsequently, the same procedure can occur cyclically at every mesh node during the 2x « random contention opportunities as those during priority contention opportunities. Finally, after the random competition, the one with the largest random number is the winning node.
  • the winner of the competition is defined to be the only node that survives the competition among all its two-hop neighbors.
  • the process produces winners within a predefined number of contention opportunities with a high probability.
  • the WMN is assumed to be roughly synchronized from a physical (PHY)-layer point of view.
  • the structure of the contention opportunities is shown in FIG. 5 A.
  • nodes A and C are still “alive", and nodes B, D and E have been “dead”. Then, nodes A and C select random numbers from [0, 255]. It is assumed that node A selects 136 ("10001000") and node C selects 205 ("1 1001 101"). Then, after the competition in random opportunities, node C becomes the winner eventually. i 0060 J It is noted that under certain scenarios, "unreal" winners can result from the competition. In the above example, when nodes A and C select the same random number, they both believe that they are winners. In such a case, contention can occur at B when A and C broadcast their scheduling messages in the winners' transmission opportunity. However, this contention possibility can be controlled by choosing the value of n — the larger the value, the smaller the contention possibility. Thus, the value of n can be selected in consideration of the trade-off between contention possibility and resource utilization.
  • the real-time feature of this contention-based DS mechanism can help significantly reduce the scheduling delay.
  • the following example illustrates this capability.
  • a requester sends a request scheduling message to a requestee (for an urgent traffic).
  • the requestee finds that its next transmission opportunity based on the election method is more than ten frames away.
  • the DS mechanism according to certain embodiments, if a node wins the competition, it can immediately send back the grant message to the requester.
  • parameters are defined, as shown in Table 1.
  • the values of the parameters can be set during the WMN configuration or changed by the network controller at any time.
  • FIGs. 5A-5F are diagrams of exemplary frame formats providing reserved transmission opportunities, according to various exemplary embodiments of the invention.
  • each frame 501 includes a control subframe (e.g., scheduling control subframe 503) followed by a data subframe 505.
  • the control subframe 503 includes, for example, transmission opportunities 507, contention opportunities 509, and winners' transmission opportunity 511.
  • the contention opportunity 509 includes priority contention opportunities 513 and random contention opportunities 515. As seen, the contention opportunity 509 provides odd contention opportunities as well as even contention opportunities.
  • a contention opportunity for example, can be a fixed-length of signal chips for transmitting/receiving an in-band busy tone.
  • the in-band busy tone can include "Tx on", “Signal", "Tx off and "Guard Time".
  • the "signal" is a time of single-frequency constant- amplitude energy signals.
  • the scheduling control subframe 503 can include the following information: transmission opportunities for coordinated scheduling 521a, contention opportunities for distributed scheduling (DS) 1 521b, winners' transmission opportunities for DS
  • the scheduling message for the three-way handshake is shown in Table 2. It is modified from the MSH-DSCH message of the 802.16 standard. Because the transmission of this message is not scheduled by the distributed election algorithm, it need not carry the MSH- DSCH Scheduling IE (information element). Therefore, the payload of this modified message will be much smaller than that of the original version. It is noted that in Table 2, all the modifications are in bold.
  • this message can occupy a fixed number of time/frequency slots. Because the payload is smaller than before, the reserved time slots for this new message could be less than those for the original one, which are 7 OFDM symbols in 802.16.
  • the scheduling delay is reduced.
  • the resource reservation can be performed more timely, which is important for many services, e.g. the rate-variable real-time traffic.
  • fast retransmission can be implemented using this DS.
  • Channel adaptation can be supported.
  • the contention possibility can be tuned by changing the value of the parameter m ("Number Random Bit"). Further, priorities are considered, which is useful for QoS differentiation.
  • the scheduling messages are transmitted in a node-by-node manner, i.e., after the requester/requestee has transmitted a request/grant message to the requestee/requester, the node can receive scheduling messages from other nodes before it receives the grant/confirmation message from the requestee/requester.
  • This scheduling mechanism results in some problems, such as a scheduling failure (as earlier explained).
  • scheduling failure does not mean that the link cannot be setup successfully.
  • the two nodes of the link could spend additional messages to finish the scheduling of the data link. This induces even longer scheduling delay than the original three-way handshake, which is not suitable for real-time traffic.
  • "scheduling failure" waste precious network resources.
  • FIG. 3C shows an approach that arranges the transmission of the scheduling messages of the three-way scheduling handshake (described previously) in a link-by-link manner. Namely, the transmission opportunities for the three scheduling messages of a specific link are utilized so that the handshake cannot be interrupted by other nodes' scheduling messages.
  • the winners of the competition are the requesters of high- priority data links.
  • the scheduling control subframe 503 can be formulated to specify a field 531 for transmission opportunities for coordinated scheduling messages as well as a field 533 for link -by-link DS opportunity.
  • the link-by-link DS opportunity 533 is further defined as follows: contention opportunities 533a, a "1 st opportunity” 533b, a "2 nd opportunity” 533c, and a "3 rd opportunity” 533d.
  • the nodes could transmit the request scheduling message in the "1 st opportunity" 533b. Thereafter, the requestee grants the schedule in the "2 nd opportunity" 533c.
  • the requestee confirms the schedule in the "3 rd opportunity" 533d.
  • the contention opportunities 533a immediately before the transmission opportunities for the scheduling messages are the contention opportunities 533a for the competition.
  • the competition method also ensures that the winner can transmit messages in the 1 st and 3 rd reserved opportunities contention-free with a high probability.
  • the set of the three opportunities and the contention opportunities are denoted as a "link-by-link DS opportunity.”
  • the link- by-link DS opportunity is further assigned separately in the data subframe 505 as shown in FIG. 5D: 1 st contention opportunities 541a, a 1 st opportunity 541b, data subframe fragment 1 541c, 2 nd contention opportunities 54 Id, a 2 nd opportunity 54 Ie, data subframe fragment 2 54 I f, and a 3 rd opportunity 541 g, and data subframe fragment 3 541h.
  • the interspaces between the reserved opportunities can be set (e.g., by the network controller) to permit sufficient time for the receiver to decode/code messages.
  • the assignment pattern of the link-by-link DS opportunity in the data subframe 505 is depicted in FIG. 5E as follows: 1 st contention opportunities 551a, a 1 st opportunity 551b, data subframe fragment 1 551c, 2 nd contention opportunities 55 Id, a 2 n opportunity 55 Ie, and data subframe fragment 2 55 If.
  • 1 st contention opportunities 551a 1 st contention opportunities 551a
  • 1 st opportunity 551b data subframe fragment 1 551c
  • 2 nd contention opportunities 55 Id a 2 n opportunity 55 Ie
  • data subframe fragment 2 55 If.
  • only two opportunities are reserved in the data subframe. This is suitable for the case that the node using the 1 st opportunity is the requestee of urgent traffic, i.e., the node has just received an urgent scheduling request.
  • the node may want to grant the schedule immediately without being disturbed by other nodes, its next scheduling transmission opportunity of coordinated DS will happen later.
  • the node decides to
  • the starting slot number of the transmission opportunities increases with the number of the link-by-link DS opportunities. Assuming the network configuration is that there are two link-by-link DS opportunities every frame, the patterns are both 0. As a result, the starting slot number of the l sl transmission opportunity of the 2 nd link-by-link DS opportunity is larger than the number of the 2 nd transmission opportunity of the 1 st link-by-link DS opportunity.
  • Another exemplary frame structure, shown in FIG.
  • 5F includes the following data subframe 505: 1 st contention opportunities for DS 1 561a, a 1 st opportunity for DS 1 561b, data subframe fragment 1 561c, 2 nd contention opportunities for DS 1 56 Id, a 2 nd opportunity for DS 1 56 Ie, data subframe fragment 2 56 If, 1 st contention opportunities for DS 2 56 Ig, a 1 st opportunity for DS 2 561h, data subframe fragment 3 561i, 2 nd contention opportunities for DS 2 56 Ij, a 2 nd opportunity for DS 2 561k, and data subframe fragment 4 5611. It is noted that in this embodiment, the control channel of the protocol is assumed to use TDMA, like 802.16 WMN.
  • the scheduling message for the three-way handshake in link-by-link DS opportunities is shown in Table 4 (it is modified from the MSH-DSCH message of the 802.16 standard). Because this message is not scheduled by the distributed election algorithm, it need not carry the MSH-DSCH Scheduling lE. Therefore, the payload of this modified message is smaller than that of the original version. In Table 4, all the modifications are shown in bold.
  • the message is used in link-by-link DS scheduling, it is permitted that the message carries more than one requests/grants aiming at different mesh nodes, i.e., the multiple MSH-DSCH Request IEs and MSH-DSCH Grant IEs in Table 4.
  • the l sl request IE or 1 st grant IE in the list is the one involved in this link-by-link handshake, and other IEs are just "piggybacked" in the message and aiming at other mesh nodes.
  • the 1 st MSH-DSCH Request IE in the message is the one for the link.
  • Other MSH-DSCH Request IEs and all the MSH-DSCH_Grant_IEs are aiming at other mesh nodes - - which need not be responded in a link-by-link manner.
  • HM)X f I Furthermore, the other end node of the link knows from the 1 st MSH- DSCH Request lE that it is the requestee of this link-by-link DS, and will try to grant the schedule in the 2 nd opportunity of the same link-by-link DS opportunity. From the PHY-layer point of view, this message occupies a fixed number of time/frequency slots. Because the payload is smaller than before, the reserved time slots for this new message should be less than those for the original one, which are seven 256-point OFDM symbols in 802.16.
  • FIGs. 6A and 6B are diagrams of an exemplary WiMAX architecture, in which the system of FIG. IA, according to various exemplary embodiments of the invention.
  • the architecture shown in FIGs. 6A and 6B can support fixed, nomadic, and mobile deployments and be based on an Internet Protocol (IP) service model.
  • IP Internet Protocol
  • Subscriber or mobile stations 601 can communicate with an access service network (ASN) 603, which includes one or more base stations (BS) 605.
  • ASN access service network
  • BS base stations
  • the BS 605 in addition to providing the air interface to the mobile stations 601, possesses such management functions as handoff triggering and tunnel establishment, radio resource management, quality of service (QoS) policy enforcement, traffic classification, DHCP (Dynamic Host Control Protocol) proxy, key management, session management, and multicast group management.
  • QoS quality of service
  • DHCP Dynamic Host Control Protocol
  • the base station 605 has connectivity to an access network 607.
  • the access network 607 utilizes an ASN gateway 609 to access a connectivity service network (CSN) 61 1 over, for example, a data network 613.
  • CSN connectivity service network
  • the network 613 can be a public data network, such as the global Internet.
  • the ASN gateway 609 provides a Layer 2 traffic aggregation point within the ASN 603.
  • the ASN gateway 609 can additionally provide intra-ASN location management and paging, radio resource management and admission control, caching of subscriber profiles and encryption keys, AAA client functionality, establishment and management of mobility tunnel with base stations, QoS and policy enforcement, foreign agent functionality for mobile IP, and routing to the selected CSN 61 1.
  • the CSN 61 1 interfaces with various systems, such as application service provider (ASP) 615, a public switched telephone network (PSTN) 617, and a Third Generation Partnership Project (3GPP) /3GPP2 system 619, and enterprise networks (not shown).
  • ASP application service provider
  • PSTN public switched telephone network
  • 3GPP Third Generation Partnership Project
  • the CSN 61 1 can include the following components: Access, Authorization and Accounting system (AAA) 621 , a mobile IP-Home Agent (MIP-HA) 623, an operation support system (OSS)/business support system (BSS) 625, and a gateway 627.
  • AAA Access, Authorization and Accounting system
  • MIP-HA mobile IP-Home Agent
  • OSS operation support system
  • BSS business support system
  • the AAA system 621 which can be implemented as one or more servers, provide support authentication for the devices, users, and specific services.
  • the CSN 61 1 also provides per user policy management of QoS and security, as well as IP address management, support for roaming between different network service providers (NSPs), location management among ASNs.
  • NSPs network service providers
  • FIG. 6B shows a reference architecture that defines interfaces (i.e., reference points) between functional entities capable of supporting various embodiments of the invention.
  • the WiMAX network reference model defines reference points: Rl , R2, R3, R4, and R5.
  • Rl is defined between the SS/MS 601 and the ASN 603a; this interface, in addition to the air interface, includes protocols in the management plane.
  • R2 is provided between the SS/MS 601 and a CSN (e.g., CSN 61 1a and 61 1b) for authentication, service authorization, IP configuration, and mobility management.
  • the ASN 603a and CSN 61 1a communicate over R3, which supports policy enforcement and mobility management.
  • ⁇ i R4 is defined between ASNs 603a and 603b to support inter-ASN mobility.
  • R5 is defined to support roaming across multiple NSPs (e.g., visited NSP 629a and home NSP 629b).
  • FIGs. 7A-7D are diagrams of communication systems having exemplary long-term evolution (LTE) architectures, in which the user equipment (UE) and the base station of FIG. 1 can operate, according to various exemplary embodiments of the invention.
  • LTE long-term evolution
  • a base station e.g., destination node
  • UE user equipment
  • UE user equipment
  • SC-FDMA Single Carrier Frequency Division Multiple Access
  • both uplink and downlink can utilize WCDMA.
  • uplink utilizes SC-FDMA
  • downlink utilizes OFDMA.
  • jOO'Mj The communication system 700 is compliant with 3GPP LTE, entitled "Long Term Evolution of the 3GPP Radio Technology" (which is incorporated herein by reference in its entirety).
  • UEs user equipment
  • a network equipment such as a base station 103, which is part of an access network (e.g., WiMAX (Worldwide Interoperability for Microwave Access), 3GPP LTE (or E-UTRAN), etc.).
  • WiMAX Worldwide Interoperability for Microwave Access
  • 3GPP LTE or E-UTRAN
  • base station 103 is denoted as an enhanced Node B (eNB).
  • eNB enhanced Node B
  • MME Mobile Management Entity
  • Servers 701 are connected to the eNBs 103 in a full or partial mesh configuration using tunneling over a packet transport network (e.g., Internet Protocol (IP) network) 703.
  • IP Internet Protocol
  • Exemplary functions of the MME/Serving GW 701 include distribution of paging messages to the eNBs 103, termination of U-plane packets for paging reasons, and switching of U-plane for support of UE mobility.
  • the GWs 701 serve as a gateway to external networks, e.g., the Internet or private networks 703, the GWs 701 include an Access, Authorization and Accounting system (AAA) 705 to securely determine the identity and privileges of a user and to track each user's activities.
  • AAA Access, Authorization and Accounting system
  • the MME Serving Gateway 701 is the key control-node for the LTE access-network and is responsible for idle mode UE tracking and paging procedure including retransmissions.
  • the MME 701 is involved in the bearer activation/deactivation process and is responsible for selecting the SGW (Serving Gateway) for a UE at the initial attach and at time of intra-LTE handover involving Core Network (CN) node relocation.
  • SGW Serving Gateway
  • a communication system 702 supports GERAN (GSM/EDGE radio access) 704, and UTRAN 706 based access networks, E-UTRAN 712 and non-3GPP (not shown) based access networks, and is more fully described in TR 23.882, which is incorporated herein by reference in its entirety.
  • GSM/EDGE radio access GSM/EDGE radio access
  • UTRAN 706 based access networks
  • E-UTRAN 712 and non-3GPP (not shown) based access networks and is more fully described in TR 23.882, which is incorporated herein by reference in its entirety.
  • MME 708 control-plane functionality
  • Server 710 Serving Gateway
  • E-UTRAN 712 provides higher bandwidths to enable new services as well as to improve existing ones, separation of MME 708 from Serving Gateway 710 implies that Serving Gateway 710 can be based on a platform optimized for signaling transactions. This scheme enables selection of more cost-effective platforms for, as well as independent scaling of, each of these two elements. Service providers can also select optimized topological locations of Serving Gateways 710 within the network independent of the locations of MMEs 708 in order to reduce optimized bandwidth latencies and avoid concentrated points of failure. i 00981 As seen in FIG. 7B, the E-UTRAN (e.g., eNB) 712 interfaces with UE 101 via LTE- Uu.
  • eNB evolved Node B
  • the E-UTRAN 712 supports LTE air interface and includes functions for radio resource control (RRC) functionality corresponding to the control plane MME 708.
  • RRC radio resource control
  • the E-UTRAN 712 also performs a variety of functions including radio resource management, admission control, scheduling, enforcement of negotiated uplink (UL) QoS (Quality of Service), cell information broadcast, ciphering/deciphering of user, compression/decompression of downlink and uplink user plane packet headers and Packet Data Convergence Protocol (PDCP).
  • RRC radio resource control
  • the MME 708 is involved in the bearer activation/deactivation process and is also responsible for choosing Serving Gateway 710 for the UE 101.
  • MME 708 functions include Non Access Stratum (NAS) signaling and related security.
  • NAS Non Access Stratum
  • MME 708 checks the authorization of the UE 101 to camp on the service provider's Public Land Mobile Network (PLMN) and enforces UE 101 roaming restrictions.
  • PLMN Public Land Mobile Network
  • the MME 708 also provides the control plane function for mobility between LTE and 2G/3G access networks with the S3 interface terminating at the MME 708 from the SGSN (Serving GPRS Support Node) 714.
  • the SGSN 714 is responsible for the delivery of data packets from and to the mobile stations within its geographical service area. Its tasks include packet routing and transfer, mobility management, logical link management, and authentication and charging functions.
  • the S6a interface enables transfer of subscription and authentication data for authenticating/authorizing user access to the evolved system (AAA interface) between MME 708 and HSS (Home Subscriber Server) 716.
  • the SlO interface between MMEs 708 provides MME relocation and MME 708 to MME 708 information transfer.
  • the Serving Gateway 710 is the node that terminates the interface towards the E-UTRAN 712 via Sl-U.
  • the S 1 -U interface provides a per bearer user plane tunneling between the E-UTRAN 712 and Serving Gateway 710. It contains support for path switching during handover between eNBs 103.
  • the S4 interface provides the user plane with related control and mobility support between SGSN 714 and the 3GPP Anchor function of Serving Gateway 710. i ( »0 f 02 i
  • the S 12 is an interface between UTRAN 706 and Serving Gateway 710.
  • Packet Data Network (PDN) Gateway 718 provides connectivity to the UE 101 to external packet data networks by being the point of exit and entry of traffic for the UE 101.
  • the PDN Gateway 718 performs policy enforcement, packet filtering for each user, charging support, lawful interception and packet screening.
  • Another role of the PDN Gateway 718 is to act as the anchor for mobility between 3GPP and non-3GPP technologies such as WiMax and 3GPP2 (CDMA IX and EvDO (Evolution Data Only)).
  • the S7 interface provides transfer of QoS policy and charging rules from PCRF (Policy and Charging Role Function) 720 to Policy and Charging Enforcement Function (PCEF) in the PDN Gateway 718.
  • PCRF Policy and Charging Role Function
  • PCEF Policy and Charging Enforcement Function
  • the SGi interface is the interface between the PDN Gateway and the operator's IP services including packet data network 722.
  • Packet data network 722 may be an operator external public or private packet data network or an intra operator packet data network, e.g., for provision of IMS (IP Multimedia Subsystem) services.
  • Rx+ is the interface between the PCRF and the packet data network 722.
  • the eNB 103 utilizes an E-UTRA (Evolved Universal Terrestrial Radio Access) (user plane, e.g., RLC (Radio Link Control) 715, MAC (Media Access Control) 717, and PHY (Physical) 719, as well as a control plane (e.g., RRC 721)).
  • the eNB 103 also includes the following functions: Inter Cell RRM (Radio Resource Management) 723, Connection Mobility Control 725, RB (Radio Bearer) Control 727, Radio Admission Control 729, eNB Measurement Configuration and Provision 731, and Dynamic Resource Allocation (Scheduler) 733.
  • E-UTRA Evolved Universal Terrestrial Radio Access
  • RLC Radio Link Control
  • MAC Media Access Control
  • PHY Physical
  • the eNB 103 also includes the following functions: Inter Cell RRM (Radio Resource Management) 723, Connection Mobility Control 725, RB (Radio Bearer) Control 727, Radio Admission Control 729, eNB Measurement Configuration and Provision 731,
  • the eNB 103 communicates with the aGW 701 (Access Gateway) via an Sl interface.
  • the aGW 701 includes a User Plane 701a and a Control plane 701b.
  • the control plane 701b provides the following components: SAE (System Architecture Evolution) Bearer Control 735 and MM (Mobile Management) Entity 737.
  • the user plane 701b includes a PDCP (Packet Data Convergence Protocol) 739 and a user plane functions 741. It is noted that the functionality of the aGW 701 can also be provided by a combination of a serving gateway (SGW) and a packet data network (PDN) GW.
  • the aGW 701 can also interface with a packet network, such as the Internet 743.
  • the PDCP Packet Data Convergence Protocol
  • the eNB functions of FIG. 7C are also provided in this architecture.
  • E-UTRAN Evolved Packet Core
  • EPC Evolved Packet Core
  • radio protocol architecture of E-UTRAN is provided for the user plane and the control plane.
  • a more detailed description of the architecture is provided in 3GPP TS 86.300.
  • the eNB 103 interfaces via the Sl to the Serving Gateway 745, which includes a Mobility Anchoring function 747.
  • the MME (Mobility Management Entity) 749 provides SAE (System Architecture Evolution) Bearer Control 751 , Idle State Mobility Handling 753, and NAS (Non-Access Stratum) Security 755.
  • SAE System Architecture Evolution
  • Idle State Mobility Handling 753 Idle State Mobility Handling
  • NAS Non-Access Stratum
  • FIG. 8 illustrates exemplary hardware upon which various embodiments of the invention can be implemented.
  • a computing system 800 includes a bus 801 or other communication mechanism for communicating information and a processor 803 coupled to the bus 801 for processing information.
  • the computing system 800 also includes main memory 805, such as a random access memory (RAM) or other dynamic storage device, coupled to the bus 801 for storing information and instructions to be executed by the processor 803.
  • Main memory 805 can also be used for storing temporary variables or other intermediate information during execution of instructions by the processor 803.
  • the computing system 800 may further include a read only memory (ROM) 807 or other static storage device coupled to the bus 801 for storing static information and instructions for the processor 803.
  • ROM read only memory
  • a storage device 809 such as a magnetic disk or optical disk, is coupled to the bus 801 for persistently storing information and instructions. ! ( K)! 1 1 ]
  • the computing system 800 may be coupled via the bus 801 to a display 81 1 , such as a liquid crystal display, or active matrix display, for displaying information to a user.
  • An input device 813 such as a keyboard including alphanumeric and other keys, may be coupled to the bus 801 for communicating information and command selections to the processor 803.
  • the input device 813 can include a cursor control, such as a mouse, a trackball, or cursor direction keys, for communicating direction information and command selections to the processor 803 and for controlling cursor movement on the display 811.
  • the processes described herein can be provided by the computing system 800 in response to the processor 803 executing an arrangement of instructions contained in main memory 805. Such instructions can be read into main memory 805 from another computer-readable medium, such as the storage device 809. Execution of the arrangement of instructions contained in main memory 805 causes the processor 803 to perform the process steps described herein.
  • processors in a multiprocessing arrangement may also be employed to execute the instructions contained in main memory 805.
  • hard-wired circuitry may be used in place of or in combination with software instructions to implement the embodiment of the invention.
  • reconfigurable hardware such as Field Programmable Gate Arrays (FPGAs) can be used, in which the functionality and connection topology of its logic gates are customizable at run-time, typically by programming memory look up tables.
  • FPGAs Field Programmable Gate Arrays
  • the computing system 800 also includes at least one communication interface 815 coupled to bus 801.
  • the communication interface 815 provides a two-way data communication coupling to a network link (not shown).
  • the communication interface 815 sends and receives electrical, electromagnetic, or optical signals that carry digital data streams representing various types of information.
  • the communication interface 815 can include peripheral interface devices, such as a Universal Serial Bus (USB) interface, a PCMCIA (Personal Computer Memory Card International Association) interface, etc. [ftOI !4
  • the processor 803 may execute the transmitted code while being received and/or store the code in the storage device 809, or other non-volatile storage for later execution. In this manner, the computing system 800 may obtain application code in the form of a carrier wave.
  • Non-volatile media include, for example, optical or magnetic disks, such as the storage device 809.
  • Volatile media include dynamic memory, such as main memory 805.
  • Transmission media include coaxial cables, copper wire and fiber optics, including the wires that comprise the bus 801. Transmission media can also take the form of acoustic, optical, or electromagnetic waves, such as those generated during radio frequency (RF) and infrared (IR) data communications.
  • RF radio frequency
  • IR infrared
  • Computer-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, any other magnetic medium, a CD-ROM, CDRW, DVD, any other optical medium, punch cards, paper tape, optical mark sheets, any other physical medium with patterns of holes or other optically recognizable indicia, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave, or any other medium from which a computer can read.
  • a floppy disk a flexible disk, hard disk, magnetic tape, any other magnetic medium, a CD-ROM, CDRW, DVD, any other optical medium, punch cards, paper tape, optical mark sheets, any other physical medium with patterns of holes or other optically recognizable indicia, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave, or any other medium from which a computer can read.
  • the instructions for carrying out at least part of the invention may initially be borne on a magnetic disk of a remote computer.
  • the remote computer loads the instructions into main memory and sends the instructions over a telephone line using a modem.
  • a modem of a local system receives the data on the telephone line and uses an infrared transmitter to convert the data to an infrared signal and transmit the infrared signal to a portable computing device, such as a personal digital assistant (PDA) or a laptop.
  • PDA personal digital assistant
  • An infrared detector on the portable computing device receives the information and instructions borne by the infrared signal and places the data on a bus.
  • FIG. 9 is a diagram of exemplary components of a user terminal configured to operate in the systems of FIGs. 5 and 6, according to an embodiment of the invention.
  • a user terminal 900 includes an antenna system 901 (which can utilize multiple antennas) to receive and transmit signals.
  • the antenna system 901 is coupled to radio circuitry 903, which includes multiple transmitters 905 and receivers 907.
  • the radio circuitry encompasses all of the Radio Frequency (RF) circuitry as well as base-band processing circuitry.
  • RF Radio Frequency
  • layer- 1 (Ll) and layer-2 (L2) processing are provided by units 909 and 91 1, respectively.
  • layer-3 functions can be provided (not shown).
  • Module 913 executes all Medium Access Control (MAC) layer functions.
  • a timing and calibration module 915 maintains proper timing by interfacing, for example, an external timing reference (not shown).
  • a processor 917 is included. Under this scenario, the user terminal 900 communicates with a computing device 919, which can be a personal computer, work station, a Personal Digital Assistant (PDA), web appliance, cellular phone, etc.
  • PDA Personal Digital Assistant

Abstract

L'invention concerne une technique pour la planification de transmission dans un réseau maillé. Un ou plusieurs noeuds d'un réseau maillé sont en concurrence, sur un canal, afin d'obtenir une opportunité parmi une pluralité d'opportunités de transmission réservées pour la planification distribuée de transmissions dans le réseau maillé. Une attribution de l'opportunité de transmission est reçue en fonction d'informations de priorité des noeuds.
PCT/IB2008/001576 2007-06-18 2008-06-17 Procédé et appareil pour planification de transmission dans un réseau maillé WO2008155624A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US94464807P 2007-06-18 2007-06-18
US60/944,648 2007-06-18

Publications (2)

Publication Number Publication Date
WO2008155624A2 true WO2008155624A2 (fr) 2008-12-24
WO2008155624A3 WO2008155624A3 (fr) 2009-02-19

Family

ID=40010597

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2008/001576 WO2008155624A2 (fr) 2007-06-18 2008-06-17 Procédé et appareil pour planification de transmission dans un réseau maillé

Country Status (1)

Country Link
WO (1) WO2008155624A2 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101707808A (zh) * 2009-11-30 2010-05-12 中兴通讯股份有限公司 一种长期演进系统中调度的方法和装置
CN101539872B (zh) * 2009-04-23 2012-07-04 深圳先进技术研究院 超级计算机的自适应调度系统及方法
WO2013147656A1 (fr) * 2012-03-28 2013-10-03 Telefonaktiebolaget L M Ericsson (Publ) Procédé et appareil concernant la gestion de congestion
US8879528B2 (en) 2010-12-17 2014-11-04 Thales Method for allocating resources, in a mobile and meshed communications network, with limitation of the inter-cluster interference, system and network implementing the method
WO2015031466A1 (fr) * 2013-08-28 2015-03-05 Qualcomm Incorporated Procédés et appareil pour une liaison montante multiutilisateur

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040002341A1 (en) * 2002-07-01 2004-01-01 Tao Chen Scheduling of data transmission for terminals with variable scheduling delays
US20040028018A1 (en) * 2002-01-10 2004-02-12 Harris Corporation, Corporation Of The State Of Delaware Wireless communication system with enhanced time slot allocation and interference avoidance/mitigation features and related methods

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040028018A1 (en) * 2002-01-10 2004-02-12 Harris Corporation, Corporation Of The State Of Delaware Wireless communication system with enhanced time slot allocation and interference avoidance/mitigation features and related methods
US20040002341A1 (en) * 2002-07-01 2004-01-01 Tao Chen Scheduling of data transmission for terminals with variable scheduling delays

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
MIN CAO ET AL: "Analysis of IEEE 802.16 Mesh Mode Scheduler Performance" IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 6, no. 4, 1 April 2007 (2007-04-01), pages 1455-1464, XP011177137 ISSN: 1536-1276 *
NICO BAYER ET AL: "Improving the Performance of the Distributed Scheduler in IEEE 802.16 Mesh Networks" VEHICULAR TECHNOLOGY CONFERENCE, 2007. VTC2007-SPRING. IEEE 65TH, IEEE, PI, 1 April 2007 (2007-04-01), pages 1193-1197, XP031092818 ISBN: 978-1-4244-0266-3 *
PABLO SOLDATI ET AL: "WLC22-6: Distributed Optimization of End-to-End Rates and Radio Resources in WiMax Single-Carrier Networks" GLOBAL TELECOMMUNICATIONS CONFERENCE, 2006. GLOBECOM '06. IEEE, IEEE, PI, 1 November 2006 (2006-11-01), pages 1-6, XP031075746 *

Cited By (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101539872B (zh) * 2009-04-23 2012-07-04 深圳先进技术研究院 超级计算机的自适应调度系统及方法
WO2011063684A1 (fr) * 2009-11-30 2011-06-03 中兴通讯股份有限公司 Procédé et dispositif d'expédition dans des systèmes à évolution à long terme
CN101707808A (zh) * 2009-11-30 2010-05-12 中兴通讯股份有限公司 一种长期演进系统中调度的方法和装置
US8879528B2 (en) 2010-12-17 2014-11-04 Thales Method for allocating resources, in a mobile and meshed communications network, with limitation of the inter-cluster interference, system and network implementing the method
US9538419B2 (en) 2012-03-28 2017-01-03 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus relating to congestion control
WO2013147656A1 (fr) * 2012-03-28 2013-10-03 Telefonaktiebolaget L M Ericsson (Publ) Procédé et appareil concernant la gestion de congestion
US9699086B2 (en) 2013-08-28 2017-07-04 Qualcomm Incorporated Methods and apparatus for multi-user uplink
KR101819622B1 (ko) 2013-08-28 2018-02-28 퀄컴 인코포레이티드 멀티-사용자 업링크에 대한 방법들 및 장치
US9467379B2 (en) 2013-08-28 2016-10-11 Qualcomm Incorporated Methods and apparatus for multiple user uplink
KR101743154B1 (ko) * 2013-08-28 2017-06-02 퀄컴 인코포레이티드 다수의 사용자 업링크에 대한 방법들 및 장치
WO2015031466A1 (fr) * 2013-08-28 2015-03-05 Qualcomm Incorporated Procédés et appareil pour une liaison montante multiutilisateur
US9800501B2 (en) 2013-08-28 2017-10-24 Qualcomm Incorporated Methods and apparatus for multiple user uplink
US9860174B2 (en) 2013-08-28 2018-01-02 Qualcomm Incorporated Methods and apparatus for acknowledgment of multi-user uplink wireless transmissions
JP2016535531A (ja) * 2013-08-28 2016-11-10 クゥアルコム・インコーポレイテッドＱｕａｌｃｏｍｍ Ｉｎｃｏｒｐｏｒａｔｅｄ 多ユーザアップリンクのための方法および装置
US9923822B2 (en) 2013-08-28 2018-03-20 Qualcomm Incorporated Methods and apparatus for multiple user uplink
US10212086B2 (en) 2013-08-28 2019-02-19 Qualcomm Incorporated Methods and apparatus for target transmission duration in multiple user uplink
US10218621B2 (en) 2013-08-28 2019-02-26 Qualcomm Incorporated Methods and apparatus for multiple user uplink
US10469387B2 (en) 2013-08-28 2019-11-05 Qualcomm Incorporated Methods and apparatus for acknowledgment of multi-user uplink wireless transmissions
US10516614B2 (en) 2013-08-28 2019-12-24 Qualcomm Incorporated Methods and apparatus for multiple user uplink
US10554557B2 (en) 2013-08-28 2020-02-04 Qualcomm Incorporated Methods and apparatus for acknowledgment of multi-user uplink wireless transmissions
US10601715B2 (en) 2013-08-28 2020-03-24 Qualcomm Incorporated Methods and apparatus for multiple user uplink

Also Published As

Publication number Publication date
WO2008155624A3 (fr) 2009-02-19

Similar Documents

Publication Publication Date Title
US10855401B2 (en) Method for determining retransmission numbers of sidelink data in wireless communication system and a device therefor
US10536967B2 (en) Method for selecting of sidelink grant for a D2D UE in a D2D communication system and device therefor
JP6669853B2 (ja) Ｄ２ｄ通信システムにおいてバッファ状態報告を行う方法及びその装置
US11147096B2 (en) Method for transmitting and receiving signals in a wireless communication system and a device therefor
JP6317492B2 (ja) 無線通信システムでアップリンク資源を割り当てるための方法及びこのための装置
US10433333B2 (en) Method for configuring uplink grants over multiple subframes in a wireless communication system and a device therefor
US10912108B2 (en) Method for performing sidelink transmission prioritized over the uplink transmission in wireless communication system and a device therefor
US11140612B2 (en) Method and UE for triggering sidelink resource reselection
JP6554551B2 (ja) 無免許スペクトルで動作する少なくとも一つのＳＣｅｌｌを有する搬送波集成における論理チャネル優先順位決定を行う方法及びその端末
JP6422992B2 (ja) 無線通信システムにおけるバッファ状態報告の優先順位を決める方法及び装置
US10313065B2 (en) Method for transmitting a MAC PDU on SL-DCH in a D2D communication system and device therefor
US20170048903A1 (en) Method for performing a logical channel prioritization in a d2d communication system and device therefor
CN107592984B (zh) 在无线通信系统中根据基于竞争的调度请求执行副链路传输的方法和设备
TW202234935A (zh) 用於側行鏈路的通道佔用時間（ｃｏｔ）共享
US20100220643A1 (en) Method and Apparatus for Providing Distributed Scheduling
KR101932472B1 (ko) 무선통신 시스템에서 harq 전송을 수행하는 방법 및 그 장치
JP6709800B2 (ja) 無免許スペクトルで動作する少なくとも一つのＳＣｅｌｌを有する搬送波集成における論理チャネル優先順位決定を行う方法及びその端末
US20090109916A1 (en) Method and apparatus for providing a shared reservation acknowledgement channel
WO2008155624A2 (fr) Procédé et appareil pour planification de transmission dans un réseau maillé
US20160242174A1 (en) SYSTEMS AND METHODS FOR COEXISTENCE OF MBMS AND VoIP SERVICES
US10667286B2 (en) Method for selecting prose destinations or SL grants in a D2D communication system and device therefor
CN116941323A (zh) 边链路非连续接收命令的触发方法、装置和系统
US10952121B2 (en) Method and apparatus for selecting a relay user equipment
WO2024029423A1 (fr) Système de communication

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08762902

Country of ref document: EP

Kind code of ref document: A2

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08762902

Country of ref document: EP

Kind code of ref document: A2