WO2008004059A2 - Qos request and information distribution for wireless relay networks - Google Patents

Qos request and information distribution for wireless relay networks Download PDF

Info

Publication number
WO2008004059A2
WO2008004059A2 PCT/IB2007/001776 IB2007001776W WO2008004059A2 WO 2008004059 A2 WO2008004059 A2 WO 2008004059A2 IB 2007001776 W IB2007001776 W IB 2007001776W WO 2008004059 A2 WO2008004059 A2 WO 2008004059A2
Authority
WO
WIPO (PCT)
Prior art keywords
flow
admission control
qos
relay
station
Prior art date
Application number
PCT/IB2007/001776
Other languages
French (fr)
Other versions
WO2008004059A3 (en
Inventor
Haihong Zheng
Yousuf Saifullah
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
Priority to EP07766593A priority Critical patent/EP2039076A4/en
Priority to JP2009517468A priority patent/JP4972163B2/en
Priority to KR1020087031787A priority patent/KR101107902B1/en
Priority to AU2007270867A priority patent/AU2007270867B2/en
Priority to BRPI0715586A priority patent/BRPI0715586A8/en
Publication of WO2008004059A2 publication Critical patent/WO2008004059A2/en
Publication of WO2008004059A3 publication Critical patent/WO2008004059A3/en
Priority to IL195927A priority patent/IL195927A0/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/16Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/302Route determination based on requested QoS
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/78Architectures of resource allocation
    • H04L47/788Autonomous allocation of resources
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/80Actions related to the user profile or the type of traffic
    • H04L47/805QOS or priority aware
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/82Miscellaneous aspects
    • H04L47/822Collecting or measuring resource availability data
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/82Miscellaneous aspects
    • H04L47/824Applicable to portable or mobile terminals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling

Definitions

  • QoS Quality of Service
  • QoS may refer to many different concepts, QoS may, for example, include providing different levels or qualities of service for different types of traffic. QoS may also allow for network resources to be allocated or reserved for certain traffic flows to meet service requirements or QoS requirements for the flow. A number of different parameters may be used to identify a requested QoS or flow requirements, such as, for example, maximum delay or latency, maximum jitter, minimum data rate or bandwidth, or other QoS related parameters. QoS may allow nodes in a wireless network to allocate or prioritize network resources for higher priority traffic flows. However, as wireless networks become more complicated, it becomes increasingly more challenging to provide for QoS for different flows across a network.
  • wireless networks such as wireless relay networks
  • QoS quality of service
  • a method or technique may include receiving a quality of service (QoS) request for a flow from a mobile station via one or more relay stations in a wireless relay network, receiving an admission control indication for the flow from one or more relay stations in the network along a path, and making an admission control decision for the flow based at least in part upon the admission control indication(s) from the one or more relay stations.
  • QoS quality of service
  • a technique or method may include receiving a QoS-related message at a relay station in a wireless relay network.
  • the QoS-related message may include one or more QoS parameters for a flow.
  • the method or technique may also include retrieving, at the relay station, the QoS parameters from the QoS-related message to use the QoS parameters subsequently for an admission control decision and/or scheduling for the flow.
  • a technique or method may include receiving, via one or more relay stations along a path, a QoS request for a flow from a mobile station in a wireless network, sending an admission control request for the flow to the one or more relay stations along the path, receiving an admission control response for the flow from the one or more relay stations in the network, and making an admission control decision for the flow based at least in part upon the admission control response(s) from the one or more relay stations.
  • a technique or method may include receiving at a base station, via one or more relay stations along a path, a QoS request for a flow from a mobile station in a wireless relay network.
  • the technique or method may also include performing, by the base station, overall admission control for the flow including performing admission control for the flow for the one or more relay stations along the path, and sending, from the base station, an admitted flow indication for the flow to the one or more relay stations along the path.
  • a technique or method may include receiving, at a relay station in a wireless relay network, an admission control request for a flow from a base station.
  • the admission control request may include one or more QoS parameters for the flow.
  • the technique or method may also include performing, by the relay station, local admission control for the flow based on the QoS parameters for the flow, sending, by the relay station, an admission control response for the flow to the base station providing a local admission control decision by the relay station, and receiving at the relay station an admitted flow indication for the flow from the base station.
  • FIG. 1 is a diagram illustrating a wireless network according to an example embodiment.
  • FIG. 2 is a timing diagram illustrating operation of quality of service information distribution according to an example embodiment.
  • FIG. 3 is a timing diagram illustrating operation of quality of sendee information distribution according to another example embodiment.
  • FIG. 4 is a flow chart illustrating quality of service information distribution according to an example embodiment.
  • FIG. 5 is a flow chart illustrating quality of service information distribution according to another example embodiment.
  • FIG. 6 is a flow chart illustrating quality of service information distribution according to yet another example embodiment.
  • FIG. 7 is a flow chart illustrating quality of service information distribution according to yet another example embodiment.
  • FIG. 8 is a flow chart illustrating quality of service information distribution according to another example embodiment.
  • FIG. 9 is a block diagram illustrating an apparatus that may be provided in a wireless node according to an example embodiment.
  • FIG. 10 is a diagram illustrating a wireless relay network according to an example embodiment.
  • the various embodiments described herein may be applicable to a wide variety of networks and technologies, such as IEEE 802.11 networks, IEEE 802.16 networks, cellular networks, or other wireless networks.
  • the various examples and embodiments may be applied to an environment, such as a wireless mesh network, where a plurality of mesh points (e.g., Access Points (AP) or base stations (BS)) may be coupled together via wired or wireless links.
  • mesh points e.g., Access Points (AP) or base stations (BS)
  • AP Access Points
  • BS base stations
  • One or more embodiments described herein may be applicable in ad hoc operation mode, where the stations or nodes may create a network together and communicate directly without an AP.
  • the various embodiments may be applicable to a variety of wireless nodes, including wireless nodes (such as mesh points, stations or STAs), Access Points, base stations, relay station and otiher types of nodes, and to a variety of networks including wireless networks and wired networks.
  • wireless nodes such as mesh points, stations or STAs
  • Access Points base stations
  • relay station and otiher types of nodes
  • networks including wireless networks and wired networks.
  • node may refer, for example, to a wireless station (STA), an AP or base station, a mesh point, a relay station (or intermediate wireless node), or other wireless computing device, as examples.
  • a flow may include, for example, one or more packets, frames or other data units, e.g., transmitted from anode. There may be one flow associated with a transmitting node. Or, a node may be transmitting multiple flows at the same time, for example.
  • a relay station may retrieve QoS parameters from QoS requests, and/or replies to manage its resources.
  • the relay stations may send an admission control message to the base station.
  • the admission control information may include resource and other information about the relay station, for example.
  • the base station may send an admission control request to the relay station on a path, and receive an admission control response from the relay station(s).
  • the admission control response may include resource and/or other information that may be used by the base station to manage network resources for one or more flows.
  • the base station may send an admitted flow indication to the relay station to inform the relay station(s) of the admitted flow.
  • HMAC keyed-hash message authentication code
  • a HMAC is a type of message authentication code (MAC) calculated using a cryptographic hash function in combination with a secret key.
  • MAC message authentication code
  • the HMAC or other authentication key may be used to simultaneously verify both the data integrity and the authenticity of a message, for example.
  • FIG. 1 is a diagram illustrating a wireless mesh network 100 according to an example embodiment.
  • various embodiments may be applicable to a network, such as a wireless mesh network, for example, as shown in FIG. 1, or other wireless networks.
  • the meshed network 100 is merely an example network, and the various embodiments may apply to a wide variety of wireless networks and systems.
  • a wireless meshed network may be considered to be a collection of mesh points (MPs) interconnected with wireless or wired links.
  • MP may be, for example, an Access Point (AP), base station (BS) or other wireless node.
  • AP Access Point
  • BS base station
  • a wireless meshed network may employ either a full mesh topology or a partial mesh topology.
  • each node (or mesh point) may be connected directly to each of the other MPs via a wireless link.
  • the mesh points may be connected to some but not necessarily all of the other mesh points in the meshed network.
  • mesh points MPl 5 MP2 and MP3 may be interconnected via wireless links (and/or via wired links). Also, each mesh point may be coupled to one or more wireless stations in its local cell.
  • MPl is located in cell 104 and is connected via wireless links to stations STA2 and STA3 within cell 104.
  • MP2 is located in cell 106 and is connected via wireless link to station STAl.
  • MP3 is located in cell 102 and is connected via wireless link to station STA4.
  • Network 100 (including MPl, MP2 and MP3) may also be considered a wireless distribution system.
  • Wireless meshed network 100 is merely an example network and the disclosure is not limited thereto.
  • Various embodiments and features described herein may be applicable to a wide variety of wireless networks including WLAN networks, cellular networks and the like.
  • a wireless relay network may be another example of a system in which end nodes (MS/SSs) are typically connected to the BS or AP via a Relay Station (RS).
  • FIG. 10 is a diagram illustrating a wireless relay network according to an example embodiment.
  • traffic between MS/SSs and BS/AP may pass through and may be processed by the RS, for example.
  • a relay station (RS) may be used to extend the network coverage and/or enhance the system throughput.
  • the traffic sent from the RS may be scheduled by the RS itself or scheduled by the BS instead.
  • a relay network may include any number of relay stations (RSs). For example, two or three relay stations, for example, may be coupled wirelessly along a path between a MS and a BS.
  • RSs relay stations
  • One challenge for such relay networks may relate to QoS, such as communicating QoS requests, making QoS or admission control decisions, and communicating admission control decisions or QoS related information to relay stations in the network, for example.
  • FIG. 2 is a diagram 200 illustrating operation of quality of service information distribution according to an example embodiment.
  • mobile station (MS) 202 may be in wireless communication (e.g., via wireless link) with relay station (RS) 204 (RSl), which may be in communication (e.g., via wireless link) with relay station (RS) 206 (RS2), which may be in further communication (e.g., via wireless link) with a base station (BS) 210.
  • RS relay station
  • RS2 relay station
  • BS base station
  • 210 a path may be established that that may include MS 202, RS 204, RS 206 and BS 210 to allow MS 202 to communicate with BS 210, for example.
  • MS 202 may be associated with BS 210, and may communicate with BS 210 via RSs 204 and 206.
  • BS 210 may be coupled to a network (not shown), such as a wired network, which may be a Local Area Network (LAN), Wide Area Network (WAN), the Internet, or other network.
  • LAN Local Area Network
  • WAN Wide Area Network
  • the Internet or other network.
  • four wireless nodes are coupled together, including wireless node 210 (e.g., a BS or AP), wireless nodes 204 and 206 (e.g., relay stations) and a wireless node 202 (e.g., a MS/SS).
  • this is merely an example relay network, and any number of relay stations (RSs) may be coupled between a MS and a BS.
  • RSs relay stations
  • each RS along the path may perform admission control for the flow and provide an admission control indication to BS 210.
  • BS 210 may then send a QoS reply message admitting the flow at the requested QoS or level of sendee if, for example, all of the RSs along the path have admitted the flow at the requested QoS.
  • This may be considered a form of distributed admission control since one or more (or even all) of the relay stations (RSs) are involved in the admission control decision.
  • RSs along a path may not necessarily perform admission control for the flow, but rather, the BS 210 may perform a centralized admission control for the flow based on a requested QoS request message for the flow (e.g., without input or admission control from the RSs).
  • a BS may be able to perform a centralized admission control or traffic management for a flow in some cases, since the BS may have information regarding the resource situation at each RS along the path, e.g., based on planning and management.
  • a centralized admission control may also be performed, for example, because all or most of the traffic from the RSs will be sent or forwarded to the BS, thereby in some cases providing updated traffic flow information to the BS, according to an example embodiment.
  • the traffic or radio conditions along each link may change more dynamically. In such a case where radio link conditions may change more dynamically, a more distributed admission control may provide quicker adaptation as compared to centralized admission control, although either approach may be used.
  • MS 202 may send a quality of service (QoS) request message 212 to BS 210 via RS 204 and RS 206.
  • QoS request message 212 may be transmitted to RS 204, which may then forward the QoS request message 212 to RS 206, which may then forward the QoS request message 212 to BS 210.
  • the hops from MS 202 to BS 210 via RS 204 and RS 206 may be considered a path or communication path, for example.
  • the QoS request message 212 may be sent from the MS 202 to the first relay station (RSl) 204.
  • the QoS request message 212 may be sent by MS 202 to request a quality of service (QoS) or allocation of network resources for a traffic flow from BS 202.
  • the QoS request message 212 may include a connection identifier or connection ID (CID) to identify a connection, a service flow identifier (SFID) to identify a flow, and one or more QoS parameters identifying a requested (or required) level of service or quality of service (QoS) for the flow.
  • CID connection identifier
  • SFID service flow identifier
  • QoS quality of service
  • the QoS parameters may include, for example, any information relating to a service level, a QoS, or a requested allocation of resources.
  • the QoS parameters for the requested service level for a flow may include one or more of the parameters included in the IEEE 802.16 Service Flow Encodings (see table 383 of the IEEE 802.16 standard).
  • QoS parameters may include traffic priority, maximum sustained traffic rate, maximum traffic burst, tolerated jitter, maximum latency, etc., for the flow.
  • Many other types of QoS parameters may be used, such as one or more parameters that may be included as part of an IEEE 802.11 traffic specification (TSPEC), or other parameters.
  • TSPEC IEEE 802.11 traffic specification
  • the relay stations 204 and 206 may retrieve or obtain the QoS parameters from the QoS request message 212 upon receiving the QoS request message 212, e.g., prior to forwarding QoS request message 212.
  • the RS may retrieve the QoS parameters for the flow, the SFID and CID from the QoS request message. The RS may then forward the QoS request message to the next hop (e.g., on to the next RS or to the BS if the RS is the last RS in the path).
  • Relay stations 204 and 206 may then each perform local admission control for the flow based on the requested service level or based on the QoS parameter set for the flow. For example, RSs 204, 206 may each compare the requested QoS (e.g., traffic priority, maximum sustained traffic rate, maximum latency, tolerable jitter,%) for the flow against available network resources at the RS, and may then determine whether sufficient resources at the RS are available to support the requested QoS for the flow. If sufficient resources are available to support or accommodate the requested QoS for the flow (or a portion of the requested QoS), these resources may be reserved by the RS and allocated for the flow, for example.
  • the requested QoS e.g., traffic priority, maximum sustained traffic rate, maximum latency, tolerable jitter,
  • Each RS 204, 206 may then send an admission control indication (ACI) message 214 to base station 210.
  • ACI message 214 may include, for example, an admission control decision (local with respect to this RS), such as information regarding the ability of the relay station to support or accommodate the requested QoS, among other information.
  • the ACI message 214 may, for example, indicate the QoS for the flow: 1) is not admitted at the RS, 2) is fully admitted at the RS (e.g., sufficient resources were available at the RS and reserved for the flow to meet the requested QoS), or 3) is partially admitted or supported at the RS (e.g., where a level of service is being provided or reserved by the RS which may be less than the QoS or level of service requested for the flow).
  • the base station 210 may then perform overall admission control for the flow, e.g., based upon the ACI (admission control indication) messages 214 from RSs 204 and 206.
  • BS 210 may then send a QoS reply message 216 back through relay stations 204 and 206 to mobile station 202.
  • the QoS reply message may provide the overall admission control decision for the flow, which may be based upon the admission control indication (ACI) messages 214 from RSs 204, 206. For example, if ACI messages from all RSs 204, 206 indicate that the requested QoS for the flow will be admitted or supported, ihen the QoS reply may also indicate that me QoS for the flow has been admitted.
  • ACI admission control indication
  • the QoS reply message 216 may indicate that the requested flow has been denied or rejected by the BS 210, for example. Also, the QoS reply may grant a QoS or service level that may be less than the requested QoS, e.g., based on one or more ACI messages 214 from RSs 204, 206, etc.
  • each RS 204, 206 may allocate resources for the flow (if not already allocated), and may schedule the flow.
  • the QoS request message 212, ACI message 214 and QoS reply message 216 may be provided as dynamic service (DSx) messages, such as IEEE 802.16 DSx messages, including a dynamic service add (DSA) message to add a new flow, a dynamic service change (DSC) message to change something regarding a flow, and a dynamic service delete (DSD) message to delete or de- allocate resources for a flow, or delete a flow, as examples.
  • DSA dynamic service add
  • DSC dynamic service change
  • DSD dynamic service delete
  • each of the messages described herein may be protected using an authentication code or HMAC.
  • the BS 210 may distribute an authentication key (AK) to allow each RS to receive and verify the authenticity of each message.
  • AK authentication key
  • the RSs 204, 206 may be able to make be able to verify the authenticity of the QOS request message and use the included QoS parameters to perform admission control based on the QoS request message if the RSs have the associated authentication key (AK) from the BS, for example.
  • the RSs 204, 206 may not perform (or may not be required to perform) local admission control, and then forward an admission control indication message 214 to BS 210.
  • BS 210 may perform a centralized admission control (e.g., without input or ACI messages from RSs) and then send a QoS reply message indicating the overall admission control decision for the request QoS for the flow.
  • RSs 204, 206 may, in some cases, receive the QoS reply message 216 and may allocate or reserve resources and schedule traffic for the flow based on the admission control decision provided in the QoS reply message 216.
  • the QoS parameters, CID, and SFID may be used by the RS for traffic scheduling when the flow is subsequently received.
  • the QoS reply 216 may also be received by the MS 202, indicating that the requested QoS for the flow was or was not granted, for example.
  • FIG. 3 is a diagram 300 illustrating operation of quality of service information distribution according to another example embodiment.
  • mobile station (MS) 302 may be in communication with relay stations 304 and 306 (RSl and RS 2), which may be in further communication with a base station (BS) 310.
  • BS base station
  • mobile station 302 may be associated with base station 310, and may communicate with base station (BS) 310 via relay stations (RSs) 304 and 306.
  • RSs relay stations
  • a QoS request message 312 may be sent by the MS 302 to the BS 310 via RSs 304 and 306.
  • the QoS request message 312 may include a CID, a SFID and one or more QoS parameters, for example.
  • the base station (BS) 310 may decide to request one or more or even all of the RSs on the path to assist with admission control decision for the requested flow. Therefore, BS 310 may then send an admission control (AC) request message 314 to (e.g., all) relay stations (RSs) on the path between the BS 310 and MS 302, including RSs 304 and 306.
  • AC admission control
  • the AC request message 314 may include the SFID, CID and QoS parameters for the requested flow.
  • the AC request message 314 may be used to request each RS along the path to perform admission control for the identified SFID or CID for a specified QoS, and to provide results or decision from such admission control back to the BS 310.
  • each RS 304, 306 may perform (local) admission control for the flow based on the requested QoS or requested service level for the flow. As noted above, this may include, for example, comparing the requested QoS or service level against available resources to determine if sufficient resources are available to accommodate the requested flow.
  • Each RS may then send an admission control (AC) response message 316 to indicate whether the RS has admitted or granted the requested QoS (or portion thereof) for the flow.
  • RSs may send an admission control (AC) response message 316 only if the requested flow was denied or rejected admission by the RS, although this is merely one example embodiment.
  • the base station (BS) 310 may then perform overall admission control for the flow, e.g., based upon the AC response messages 316 from RSs 204 and 206. BS 310 may then send a QoS reply message 318 via relay stations 204 and 206 to mobile station 202. The QoS reply message 318 may provide the overall admission control decision for the flow to MS 302. The admission control decision provided in QoS reply message 318 may be based upon the AC response messages 316 from RSs 304, 306.
  • the QoS reply message may notify MS 302 that the requested QoS have been rejected or denied, admitted, or partially admitted, for example, e.g., depending on the AC response messages 316 from RSs 304, 306 along the path between MS 302 and BS 310.
  • BS 310 may send an admitted flow indication (AFI) message 320 to inform all RSs on the path between BS 310 and MS 302 of the identity of the flow and its associated QoS parameters (e.g.,, CID, SFID, and QoS parameters for the admitted flow).
  • the information provided in the AFI message 320 may be used by each RS to perform scheduling and may be used to determine whether to grant resources to an uplink (e.g., MS to BS) flow or forward its uplink traffic in the case of contention based requests instead of letting the traffic from non-admitted uplink flow be forwarded and then be dropped by the BS 310, for example.
  • the RSs may send an admitted flow confirmation message to the BS 310 to confirm the reception of the AFI message.
  • one or more of the messages described with reference to FIG. 3 may be provided as dynamic service (DSx) messages, such as IEEE 802.16 DSx messages, including a dynamic service add (DSA) message, a dynamic service change (DSC) message, and a dynamic service delete (DSD) message, as examples.
  • DSx dynamic service
  • DSA dynamic service add
  • DSC dynamic service change
  • DSD dynamic service delete
  • Many other types of messages may be used, and the various embodiments may be applicable to a wide variety of wireless networks.
  • RS relay station
  • AC admission control
  • AFI admitted flow indication
  • the AC request and/or AFI messages may be sent as a unicast message sent to each of the one or more relay stations on the path between the MS 302 and the BS 310.
  • overhead may increase as the number of RS on a path increases since a separate message is sent to each RS.
  • the AC request and/or AFI messages may be sent as a Z-unicast message addressed to the RS directly attached to the MS.
  • the message may be sent to the RS 304 that is most directly attached to the MS, allowing the message to be received and read by each RS along the path.
  • This may provide a more efficient technique by transmitting one message that is used or read by all RSs along the path. This may require distribution of the authentication key to all RSs if protection is used, for example.
  • the RS may verify the authenticity, for example, and retrieve the parameters from the message. If the message is an admission control request message, the RS may perform admission control, and then send an admission control response message to the BS.
  • the AC request and/or AFI messages may be sent as a multicast message addressed to a multicast group address that includes the addresses (e.g., MAC addresses) of all the RSs in the path between the MS 302 and the BS 310 as multicast group members.
  • a RS receives the multicast message for example, every RS in the path (who is a member of the multicast group) may then route the multicast message to the other RSs on the path based on a defined multicast tree, for example. All members of the multicast group may, for example, share a group authentication key.
  • FIG. 4 is a flow chart 400 illustrating quality of service information distribution according to an example embodiment.
  • a quality of service request is received from a mobile station via one or more relay stations in a wireless relay network.
  • the quality of service request may be received at a relay station and/or base station, as an example.
  • an admission control indication for the flow from one or more relay stations in the network along a path may be received.
  • One or more relay stations may retrieve QoS parameters from the QoS request.
  • the relay station(s) may then send an admission control indication to a base station.
  • the admission control indication may indicate the relay resources, and/or the ability of the relay station to accommodate the QoS request, among other indications.
  • an admission control decision for the flow may be made based on the admission control indication(s) from the one or more relay stations.
  • the base station may accept or grant the requested QoS for the flow if the relay stations on the path are capable of providing the requested QoS.
  • the base station may use or accept a different QoS based on the determination that not all relay stations on the path are capable of achieving the requested QoS, but are capable of supporting a lower QoS, for example.
  • a QoS reply may be sent to the mobile station via the one or more relay stations along the path.
  • the QoS reply may include QoS parameters, which may include an indication of the QoS to be used for the flow, among other parameters.
  • the relay stations along the path may retrieve the QoS parameters including the QoS to be used. This may allow the relay stations to more efficiently allocate resources and better manage information flow.
  • FIG. 5 is a flow chart 500 illustrating quality of service distribution according to another example embodiment.
  • a QoS-related message is received at a relay station in a wireless relay network, where the QoS-related message may include one or more QoS parameters for a flow.
  • the relay station may retrieve the QoS parameters from the QoS- related message, e.g., to use the QoS parameters subsequently for an admission control decision and/or scheduling for the flow.
  • the relay station may receive a QoS request from a mobile station.
  • the relay station may retrieve the QoS parameters from the QoS request and may then forward the QoS request message to the next hop, such as the next relay station in the path, or to the base station if the receiving relay station is the last relay station in the path, for example.
  • FIG. 6 is a flow chart 600 illustrating quality of service distribution according to yet another example embodiment.
  • a QoS request may be received from a mobile station in a wireless network for a flow.
  • the QoS request may, for example, be received via one or more relay stations along a path.
  • the QoS request may be received by relay station(s) and/or by a base station.
  • an admission control request for the flow may be sent to one or more relay stations along the path.
  • the admission control request may include one of sending an admission control request for the flow as a unicast message to each of the one or more relay stations, sending an admission control request for the flow as a unicast message to the relay station directly coupled to the mobile station, or sending an admission control request for the flow as a multicast message addressed to a multicast group that includes each of the one or more relay stations.
  • Other message types may be used for the admission control request, for example.
  • the base station may send an admission control request to the relay station(s) to determine if the relay station(s) have the capability and/or resources to support the requested QoS.
  • the relay station(s) may receive the QoS parameters from the QoS request, and/or from the admission control request.
  • an admission control response may be received from the one or more relay stations in the network.
  • the admission control response may include an indication (or local admission control decision) that the relay station has sufficient resources, or not, to accommodate the requested QoS, for the flow, for example.
  • an admission control decision for the flow may be made, e.g., by the base station, based at least in part upon the admission control responses(s) from the one or more relay stations.
  • a QoS reply may be sent to the mobile station via the one or more relay stations along the path.
  • the QoS reply may include QoS parameters and other information regarding the flow.
  • an admitted flow indication message may be sent to the one or more relay stations along the path. This may allow the relay station(s) optionally to manage resources and flow based at least in part upon the admitted flow indication for the flow, at 662.
  • FIG. 7 is a flow chart illustrating quality of service distribution according to yet another example embodiment.
  • a QoS request for a flow may be received at a base station, via one or more relay stations along a path in a wireless relay network.
  • the QoS request may be received from a mobile station.
  • the base station may perform overall admission control for the flow including performing admission control for the flow for the one or more relay stations along the path.
  • the base station may send an admitted flow indication for the flow to the one or more relay stations along the path.
  • FIG. 8 is a flow chart illustrating quality of service distribution according to yet another example embodiment.
  • a relay station in a wireless relay network may receive an admission control request for a flow from a base station.
  • the admission control request may include one or more QoS parameters for the flow.
  • the relay station may perform local admission control for the flow based on the QoS parameters for the flow.
  • the relay station may send an admission control response for the flow to the base station providing a local admission control decision by the relay station for the flow.
  • the relay station may receive an admitted flow indication for the flow from the base station.
  • the relay station may perform scheduling for the flow based on the admitted flow indication, for example.
  • the relay station may send an admitted flow confirmation to the base station to confirm receipt of the admitted flow indication for the flow.
  • FIG. 9 is a block diagram illustrating an apparatus 900 that may be provided in a wireless node according to an example embodiment.
  • the example wireless node may include, for example, a wireless transceiver 902 to transmit and receive signals, a controller 904 to control operation of the station and execute instructions or software, and a memory 906 to store data and/or instructions.
  • Controller 904 may be programmable, and capable of executing software or other instructions stored in memory or on other computer media to perform the various tasks and functions described above, such as to perform various tasks or operate as described in any of FIGs. 1-8 for example.
  • Implementations of the various techniques described herein may be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. Implementations may implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, e.g., in a machine-readable storage device or in a propagated signal, for execution by, or to control the operation of, data processing apparatus, e.g., a programmable processor, a computer, or multiple computers.
  • data processing apparatus e.g., a programmable processor, a computer, or multiple computers.
  • a computer program such as the computer program(s) described above, can be written in any form of programming language, including compiled or interpreted languages, and can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment.
  • a computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network.
  • Method steps may be performed by one or more programmable processors executing a computer program to perform functions by operating on input data and generating output. Method steps also may be performed by, and an apparatus may be implemented as, for example, hardware or special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).
  • an FPGA field programmable gate array
  • ASIC application-specific integrated circuit

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Various embodiments are described relating to wireless networks, such as quality of service (QoS) request (212) and information distribution for wireless relay networks. According to an example embodiment, a technique or method may include receiving a QoS-related message at a relay station (204) in a wireless relay network. The QoS-related message may include one or more QoS parameters for a flow (510). The method or technique may also include retrieving, at the relay station (204), the QoS parameters from the QoS-related message to use the QoS parameters subsequently for admission control and/or scheduling for the flow (520). Other example embodiments are described.

Description

QOS REQUESTAND INFORMATION DISTRIBUTION FOR WIRELESS
RELAYNETWORKS
INVENTORS:
Haihong Zheng Yousuf Saifullah
PRIORITY CLAIM
[0001 ] This application claims the benefit of priority based on United States Patent Application Serial Number 11/479,976, filed on June 30, 2006, entitled "QoS Request and Information Distribution for Wireless Relay Networks," the disclosure of which is hereby incorporated by reference.
BACKGROUND
[0002] The rapid diffusion of Wireless Local Area Network (WLAN) access and the increasing demand for WLAN coverage is driving the installation of a very large number of Access Points (AP). However, many wireless networks today offer little or no Quality of Service (QoS). While QoS may refer to many different concepts, QoS may, for example, include providing different levels or qualities of service for different types of traffic. QoS may also allow for network resources to be allocated or reserved for certain traffic flows to meet service requirements or QoS requirements for the flow. A number of different parameters may be used to identify a requested QoS or flow requirements, such as, for example, maximum delay or latency, maximum jitter, minimum data rate or bandwidth, or other QoS related parameters. QoS may allow nodes in a wireless network to allocate or prioritize network resources for higher priority traffic flows. However, as wireless networks become more complicated, it becomes increasingly more challenging to provide for QoS for different flows across a network.
SUMMARY
[0003] Various embodiments are described relating to wireless networks, such as wireless relay networks, and also relating to quality of service (QoS) request and information distribution for wireless relay networks.
[0004] According to an example embodiment, a method or technique may include receiving a quality of service (QoS) request for a flow from a mobile station via one or more relay stations in a wireless relay network, receiving an admission control indication for the flow from one or more relay stations in the network along a path, and making an admission control decision for the flow based at least in part upon the admission control indication(s) from the one or more relay stations.
[0005] According to another example embodiment, a technique or method may include receiving a QoS-related message at a relay station in a wireless relay network. The QoS-related message may include one or more QoS parameters for a flow. The method or technique may also include retrieving, at the relay station, the QoS parameters from the QoS-related message to use the QoS parameters subsequently for an admission control decision and/or scheduling for the flow.
[0006] According to another example embodiment, a technique or method may include receiving, via one or more relay stations along a path, a QoS request for a flow from a mobile station in a wireless network, sending an admission control request for the flow to the one or more relay stations along the path, receiving an admission control response for the flow from the one or more relay stations in the network, and making an admission control decision for the flow based at least in part upon the admission control response(s) from the one or more relay stations.
[0007] According to another example embodiment, a technique or method may include receiving at a base station, via one or more relay stations along a path, a QoS request for a flow from a mobile station in a wireless relay network. The technique or method may also include performing, by the base station, overall admission control for the flow including performing admission control for the flow for the one or more relay stations along the path, and sending, from the base station, an admitted flow indication for the flow to the one or more relay stations along the path.
[0008] According to yet another example embodiment, a technique or method may include receiving, at a relay station in a wireless relay network, an admission control request for a flow from a base station. The admission control request may include one or more QoS parameters for the flow. The technique or method may also include performing, by the relay station, local admission control for the flow based on the QoS parameters for the flow, sending, by the relay station, an admission control response for the flow to the base station providing a local admission control decision by the relay station, and receiving at the relay station an admitted flow indication for the flow from the base station.
BRIEF DESCRIPTION OF THE DRAWINGS
[0009] FIG. 1 is a diagram illustrating a wireless network according to an example embodiment.
[0010] FIG. 2 is a timing diagram illustrating operation of quality of service information distribution according to an example embodiment.
[0011 ] FIG. 3 is a timing diagram illustrating operation of quality of sendee information distribution according to another example embodiment.
[0012] FIG. 4 is a flow chart illustrating quality of service information distribution according to an example embodiment.
[0013] FIG. 5 is a flow chart illustrating quality of service information distribution according to another example embodiment.
[0014] FIG. 6 is a flow chart illustrating quality of service information distribution according to yet another example embodiment.
[0015] FIG. 7 is a flow chart illustrating quality of service information distribution according to yet another example embodiment.
[0016] FIG. 8 is a flow chart illustrating quality of service information distribution according to another example embodiment.
[0017] FIG. 9 is a block diagram illustrating an apparatus that may be provided in a wireless node according to an example embodiment.
[0018] FIG. 10 is a diagram illustrating a wireless relay network according to an example embodiment.
DETAILED DESCRIPTION
[0019] The various embodiments described herein may be applicable to a wide variety of networks and technologies, such as IEEE 802.11 networks, IEEE 802.16 networks, cellular networks, or other wireless networks. In other example embodiments, although not required, the various examples and embodiments may be applied to an environment, such as a wireless mesh network, where a plurality of mesh points (e.g., Access Points (AP) or base stations (BS)) may be coupled together via wired or wireless links. One or more embodiments described herein may be applicable in ad hoc operation mode, where the stations or nodes may create a network together and communicate directly without an AP. The various embodiments may be applicable to a variety of wireless nodes, including wireless nodes (such as mesh points, stations or STAs), Access Points, base stations, relay station and otiher types of nodes, and to a variety of networks including wireless networks and wired networks. The term "node" may refer, for example, to a wireless station (STA), an AP or base station, a mesh point, a relay station (or intermediate wireless node), or other wireless computing device, as examples.
[0020] In a wireless network, it may be desirable, at least in some cases, to distribute quality of service (QoS)-related information, such as QoS requests, QoS parameters, and the like, to the various nodes, mesh points, APs, etc. to allocate, reserve or manage network resources for the various traffic flows. A flow may include, for example, one or more packets, frames or other data units, e.g., transmitted from anode. There may be one flow associated with a transmitting node. Or, a node may be transmitting multiple flows at the same time, for example. According to an example embodiment, a relay station may retrieve QoS parameters from QoS requests, and/or replies to manage its resources. In another embodiment, the relay stations may send an admission control message to the base station. The admission control information may include resource and other information about the relay station, for example.
[0021 ] According to another embodiment, the base station may send an admission control request to the relay station on a path, and receive an admission control response from the relay station(s). The admission control response may include resource and/or other information that may be used by the base station to manage network resources for one or more flows. According to another embodiment, the base station may send an admitted flow indication to the relay station to inform the relay station(s) of the admitted flow.
[0022] In addition, various messages may be protected using an authentication code, such as a keyed-hash message authentication code, or HMAC. A HMAC is a type of message authentication code (MAC) calculated using a cryptographic hash function in combination with a secret key. As with other MACs, the HMAC or other authentication key may be used to simultaneously verify both the data integrity and the authenticity of a message, for example.
[0023] FIG. 1 is a diagram illustrating a wireless mesh network 100 according to an example embodiment. In an example embodiment, various embodiments may be applicable to a network, such as a wireless mesh network, for example, as shown in FIG. 1, or other wireless networks. The meshed network 100 is merely an example network, and the various embodiments may apply to a wide variety of wireless networks and systems.
[0024] According to an example embodiment, a wireless meshed network may be considered to be a collection of mesh points (MPs) interconnected with wireless or wired links. Each MP may be, for example, an Access Point (AP), base station (BS) or other wireless node. For example, a wireless meshed network may employ either a full mesh topology or a partial mesh topology. In a full mesh topology, each node (or mesh point) may be connected directly to each of the other MPs via a wireless link. In a partial mesh topology, the mesh points may be connected to some but not necessarily all of the other mesh points in the meshed network.
[0025] In the example wireless mesh network 100 illustrated in FIG, 1, mesh points MPl5 MP2 and MP3 may be interconnected via wireless links (and/or via wired links). Also, each mesh point may be coupled to one or more wireless stations in its local cell. For example, MPl is located in cell 104 and is connected via wireless links to stations STA2 and STA3 within cell 104. MP2 is located in cell 106 and is connected via wireless link to station STAl. MP3 is located in cell 102 and is connected via wireless link to station STA4. Network 100 (including MPl, MP2 and MP3) may also be considered a wireless distribution system. Wireless meshed network 100 is merely an example network and the disclosure is not limited thereto. Various embodiments and features described herein may be applicable to a wide variety of wireless networks including WLAN networks, cellular networks and the like.
[0026] As noted above, a wireless relay network may be another example of a system in which end nodes (MS/SSs) are typically connected to the BS or AP via a Relay Station (RS). FIG. 10 is a diagram illustrating a wireless relay network according to an example embodiment. Typically, traffic between MS/SSs and BS/AP may pass through and may be processed by the RS, for example. For example, a relay station (RS) may be used to extend the network coverage and/or enhance the system throughput. For example, the traffic sent from the RS may be scheduled by the RS itself or scheduled by the BS instead. If scheduled by the RS itself, the BS and RS may for example perform scheduling independently, with the RS receiving and possibly decoding the frame from the BS, and then forwarding the frame to the MS/SS. Although only one RS is shown in the relay network of FIG. 10, a relay network may include any number of relay stations (RSs). For example, two or three relay stations, for example, may be coupled wirelessly along a path between a MS and a BS. One challenge for such relay networks may relate to QoS, such as communicating QoS requests, making QoS or admission control decisions, and communicating admission control decisions or QoS related information to relay stations in the network, for example.
[0027] FIG. 2 is a diagram 200 illustrating operation of quality of service information distribution according to an example embodiment. In the example shown in FIG. 2, mobile station (MS) 202 may be in wireless communication (e.g., via wireless link) with relay station (RS) 204 (RSl), which may be in communication (e.g., via wireless link) with relay station (RS) 206 (RS2), which may be in further communication (e.g., via wireless link) with a base station (BS) 210. For example, a path may be established that that may include MS 202, RS 204, RS 206 and BS 210 to allow MS 202 to communicate with BS 210, for example.
[0028] Initially, MS 202 may be associated with BS 210, and may communicate with BS 210 via RSs 204 and 206. BS 210 may be coupled to a network (not shown), such as a wired network, which may be a Local Area Network (LAN), Wide Area Network (WAN), the Internet, or other network. In the example of FIG. 2, four wireless nodes are coupled together, including wireless node 210 (e.g., a BS or AP), wireless nodes 204 and 206 (e.g., relay stations) and a wireless node 202 (e.g., a MS/SS). However, this is merely an example relay network, and any number of relay stations (RSs) may be coupled between a MS and a BS. [0029] Two example embodiments will be briefly described with reference to FIG. 2. In a first embodiment, each RS along the path may perform admission control for the flow and provide an admission control indication to BS 210. BS 210 may then send a QoS reply message admitting the flow at the requested QoS or level of sendee if, for example, all of the RSs along the path have admitted the flow at the requested QoS. This may be considered a form of distributed admission control since one or more (or even all) of the relay stations (RSs) are involved in the admission control decision. In a second embodiment, RSs along a path may not necessarily perform admission control for the flow, but rather, the BS 210 may perform a centralized admission control for the flow based on a requested QoS request message for the flow (e.g., without input or admission control from the RSs).
[0030] According to an example embodiment, a BS may be able to perform a centralized admission control or traffic management for a flow in some cases, since the BS may have information regarding the resource situation at each RS along the path, e.g., based on planning and management. A centralized admission control may also be performed, for example, because all or most of the traffic from the RSs will be sent or forwarded to the BS, thereby in some cases providing updated traffic flow information to the BS, according to an example embodiment. However, in other cases the traffic or radio conditions along each link may change more dynamically. In such a case where radio link conditions may change more dynamically, a more distributed admission control may provide quicker adaptation as compared to centralized admission control, although either approach may be used.
[0031 ] As shown in the example of FIG. 2, MS 202 may send a quality of service (QoS) request message 212 to BS 210 via RS 204 and RS 206. In other words, the QoS request message 212 may be transmitted to RS 204, which may then forward the QoS request message 212 to RS 206, which may then forward the QoS request message 212 to BS 210. The hops from MS 202 to BS 210 via RS 204 and RS 206 may be considered a path or communication path, for example.
[0032] The QoS request message 212 may be sent from the MS 202 to the first relay station (RSl) 204. The QoS request message 212 may be sent by MS 202 to request a quality of service (QoS) or allocation of network resources for a traffic flow from BS 202. The QoS request message 212 may include a connection identifier or connection ID (CID) to identify a connection, a service flow identifier (SFID) to identify a flow, and one or more QoS parameters identifying a requested (or required) level of service or quality of service (QoS) for the flow.
[0033] The QoS parameters may include, for example, any information relating to a service level, a QoS, or a requested allocation of resources. In an example embodiment, the QoS parameters for the requested service level for a flow may include one or more of the parameters included in the IEEE 802.16 Service Flow Encodings (see table 383 of the IEEE 802.16 standard). For example, QoS parameters may include traffic priority, maximum sustained traffic rate, maximum traffic burst, tolerated jitter, maximum latency, etc., for the flow. Many other types of QoS parameters may be used, such as one or more parameters that may be included as part of an IEEE 802.11 traffic specification (TSPEC), or other parameters. However, these are merely illustrative examples, and the various embodiments are not limited thereto.
[0034] In the first example embodiment with respect to FIG. 2, the relay stations 204 and 206 may retrieve or obtain the QoS parameters from the QoS request message 212 upon receiving the QoS request message 212, e.g., prior to forwarding QoS request message 212. Upon a RS receiving a QoS request message 212, the RS may retrieve the QoS parameters for the flow, the SFID and CID from the QoS request message. The RS may then forward the QoS request message to the next hop (e.g., on to the next RS or to the BS if the RS is the last RS in the path).
[003S] Relay stations 204 and 206 may then each perform local admission control for the flow based on the requested service level or based on the QoS parameter set for the flow. For example, RSs 204, 206 may each compare the requested QoS (e.g., traffic priority, maximum sustained traffic rate, maximum latency, tolerable jitter,...) for the flow against available network resources at the RS, and may then determine whether sufficient resources at the RS are available to support the requested QoS for the flow. If sufficient resources are available to support or accommodate the requested QoS for the flow (or a portion of the requested QoS), these resources may be reserved by the RS and allocated for the flow, for example.
[0036] Each RS 204, 206 may then send an admission control indication (ACI) message 214 to base station 210. ACI message 214 may include, for example, an admission control decision (local with respect to this RS), such as information regarding the ability of the relay station to support or accommodate the requested QoS, among other information. The ACI message 214 may, for example, indicate the QoS for the flow: 1) is not admitted at the RS, 2) is fully admitted at the RS (e.g., sufficient resources were available at the RS and reserved for the flow to meet the requested QoS), or 3) is partially admitted or supported at the RS (e.g., where a level of service is being provided or reserved by the RS which may be less than the QoS or level of service requested for the flow).
[0037] The base station 210 may then perform overall admission control for the flow, e.g., based upon the ACI (admission control indication) messages 214 from RSs 204 and 206. BS 210 may then send a QoS reply message 216 back through relay stations 204 and 206 to mobile station 202. The QoS reply message may provide the overall admission control decision for the flow, which may be based upon the admission control indication (ACI) messages 214 from RSs 204, 206. For example, if ACI messages from all RSs 204, 206 indicate that the requested QoS for the flow will be admitted or supported, ihen the QoS reply may also indicate that me QoS for the flow has been admitted. Likewise, if one or more RSs have rejected the requested QoS or requested service level for the flow (e.g., as indicated by ACI message 214), then the QoS reply message 216 may indicate that the requested flow has been denied or rejected by the BS 210, for example. Also, the QoS reply may grant a QoS or service level that may be less than the requested QoS, e.g., based on one or more ACI messages 214 from RSs 204, 206, etc.
[0038] In another example embodiment, upon receiving the QoS reply message, each RS 204, 206 may allocate resources for the flow (if not already allocated), and may schedule the flow.
[0039] Also, in an example embodiment, the QoS request message 212, ACI message 214 and QoS reply message 216 may be provided as dynamic service (DSx) messages, such as IEEE 802.16 DSx messages, including a dynamic service add (DSA) message to add a new flow, a dynamic service change (DSC) message to change something regarding a flow, and a dynamic service delete (DSD) message to delete or de- allocate resources for a flow, or delete a flow, as examples.
[0040] Also, each of the messages described herein (QoS request message, ACI message, QoS reply message, etc.), may be protected using an authentication code or HMAC. The BS 210 may distribute an authentication key (AK) to allow each RS to receive and verify the authenticity of each message. Thus, for example, where RSs 204 and 206 receive a QoS request message that may be protected with an authentication code, the RSs 204, 206 may be able to make be able to verify the authenticity of the QOS request message and use the included QoS parameters to perform admission control based on the QoS request message if the RSs have the associated authentication key (AK) from the BS, for example.
[0041 ] In the second embodiment with respect to FIG. 2, the RSs 204, 206 may not perform (or may not be required to perform) local admission control, and then forward an admission control indication message 214 to BS 210. In such case, BS 210 may perform a centralized admission control (e.g., without input or ACI messages from RSs) and then send a QoS reply message indicating the overall admission control decision for the request QoS for the flow. In such a case, RSs 204, 206 may, in some cases, receive the QoS reply message 216 and may allocate or reserve resources and schedule traffic for the flow based on the admission control decision provided in the QoS reply message 216. The QoS parameters, CID, and SFID, may be used by the RS for traffic scheduling when the flow is subsequently received. The QoS reply 216 may also be received by the MS 202, indicating that the requested QoS for the flow was or was not granted, for example.
[0042] FIG. 3 is a diagram 300 illustrating operation of quality of service information distribution according to another example embodiment. In the example shown in FIG. 3, mobile station (MS) 302 may be in communication with relay stations 304 and 306 (RSl and RS 2), which may be in further communication with a base station (BS) 310. Initially, mobile station 302 may be associated with base station 310, and may communicate with base station (BS) 310 via relay stations (RSs) 304 and 306.
[0043] As shown in this example, a QoS request message 312 may be sent by the MS 302 to the BS 310 via RSs 304 and 306. The QoS request message 312 may include a CID, a SFID and one or more QoS parameters, for example. [0044] In response to receiving the QoS request message 312, the base station (BS) 310 may decide to request one or more or even all of the RSs on the path to assist with admission control decision for the requested flow. Therefore, BS 310 may then send an admission control (AC) request message 314 to (e.g., all) relay stations (RSs) on the path between the BS 310 and MS 302, including RSs 304 and 306. The AC request message 314 may include the SFID, CID and QoS parameters for the requested flow. The AC request message 314 may be used to request each RS along the path to perform admission control for the identified SFID or CID for a specified QoS, and to provide results or decision from such admission control back to the BS 310.
[0045] In response to receiving the AC request message 314, each RS 304, 306, may perform (local) admission control for the flow based on the requested QoS or requested service level for the flow. As noted above, this may include, for example, comparing the requested QoS or service level against available resources to determine if sufficient resources are available to accommodate the requested flow. Each RS may then send an admission control (AC) response message 316 to indicate whether the RS has admitted or granted the requested QoS (or portion thereof) for the flow. In one example embodiment, RSs may send an admission control (AC) response message 316 only if the requested flow was denied or rejected admission by the RS, although this is merely one example embodiment.
[0046] The base station (BS) 310 may then perform overall admission control for the flow, e.g., based upon the AC response messages 316 from RSs 204 and 206. BS 310 may then send a QoS reply message 318 via relay stations 204 and 206 to mobile station 202. The QoS reply message 318 may provide the overall admission control decision for the flow to MS 302. The admission control decision provided in QoS reply message 318 may be based upon the AC response messages 316 from RSs 304, 306. For example, the QoS reply message may notify MS 302 that the requested QoS have been rejected or denied, admitted, or partially admitted, for example, e.g., depending on the AC response messages 316 from RSs 304, 306 along the path between MS 302 and BS 310.
[0047] After admitting a flow from MS 302 with a certain QoS requirement, the
BS 310 may send an admitted flow indication (AFI) message 320 to inform all RSs on the path between BS 310 and MS 302 of the identity of the flow and its associated QoS parameters (e.g.,, CID, SFID, and QoS parameters for the admitted flow). The information provided in the AFI message 320 may be used by each RS to perform scheduling and may be used to determine whether to grant resources to an uplink (e.g., MS to BS) flow or forward its uplink traffic in the case of contention based requests instead of letting the traffic from non-admitted uplink flow be forwarded and then be dropped by the BS 310, for example. Although not shown in FIG. 3, the RSs may send an admitted flow confirmation message to the BS 310 to confirm the reception of the AFI message.
[0048] As with the messages of FIG. 2, one or more of the messages described with reference to FIG. 3 may be provided as dynamic service (DSx) messages, such as IEEE 802.16 DSx messages, including a dynamic service add (DSA) message, a dynamic service change (DSC) message, and a dynamic service delete (DSD) message, as examples. Many other types of messages may be used, and the various embodiments may be applicable to a wide variety of wireless networks.
[0049] If there is more than one relay station (RS) in the path between the MS and the BS, then several different techniques or formats may be used to send the admission control (AC) request message(s) 314 and/or the admitted flow indication (AFI) message(s).
[0050] First, the AC request and/or AFI messages may be sent as a unicast message sent to each of the one or more relay stations on the path between the MS 302 and the BS 310. With this unicast scheme, however, overhead may increase as the number of RS on a path increases since a separate message is sent to each RS.
[0051 ] Second, the AC request and/or AFI messages may be sent as a Z-unicast message addressed to the RS directly attached to the MS. In this example, the message may be sent to the RS 304 that is most directly attached to the MS, allowing the message to be received and read by each RS along the path. This may provide a more efficient technique by transmitting one message that is used or read by all RSs along the path. This may require distribution of the authentication key to all RSs if protection is used, for example. When the message reaches the RS on the path, the RS may verify the authenticity, for example, and retrieve the parameters from the message. If the message is an admission control request message, the RS may perform admission control, and then send an admission control response message to the BS.
[0052] Third, the AC request and/or AFI messages may be sent as a multicast message addressed to a multicast group address that includes the addresses (e.g., MAC addresses) of all the RSs in the path between the MS 302 and the BS 310 as multicast group members. When a RS receives the multicast message, for example, every RS in the path (who is a member of the multicast group) may then route the multicast message to the other RSs on the path based on a defined multicast tree, for example. All members of the multicast group may, for example, share a group authentication key.
[0053] FIG. 4 is a flow chart 400 illustrating quality of service information distribution according to an example embodiment. At 410, a quality of service request is received from a mobile station via one or more relay stations in a wireless relay network. The quality of service request may be received at a relay station and/or base station, as an example.
[0054] At 420, an admission control indication for the flow from one or more relay stations in the network along a path may be received. One or more relay stations may retrieve QoS parameters from the QoS request. The relay station(s) may then send an admission control indication to a base station. The admission control indication may indicate the relay resources, and/or the ability of the relay station to accommodate the QoS request, among other indications.
[0055] At 430, an admission control decision for the flow may be made based on the admission control indication(s) from the one or more relay stations. For example, the base station may accept or grant the requested QoS for the flow if the relay stations on the path are capable of providing the requested QoS. Alternatively, the base station may use or accept a different QoS based on the determination that not all relay stations on the path are capable of achieving the requested QoS, but are capable of supporting a lower QoS, for example.
[0056] At 440, optionally, a QoS reply may be sent to the mobile station via the one or more relay stations along the path. The QoS reply may include QoS parameters, which may include an indication of the QoS to be used for the flow, among other parameters. The relay stations along the path may retrieve the QoS parameters including the QoS to be used. This may allow the relay stations to more efficiently allocate resources and better manage information flow.
[0057] FIG. 5 is a flow chart 500 illustrating quality of service distribution according to another example embodiment. At 510, a QoS-related message is received at a relay station in a wireless relay network, where the QoS-related message may include one or more QoS parameters for a flow.
[0058] At 520, the relay station may retrieve the QoS parameters from the QoS- related message, e.g., to use the QoS parameters subsequently for an admission control decision and/or scheduling for the flow.
[0059] For example, the relay station may receive a QoS request from a mobile station. The relay station may retrieve the QoS parameters from the QoS request and may then forward the QoS request message to the next hop, such as the next relay station in the path, or to the base station if the receiving relay station is the last relay station in the path, for example.
[0060] FIG. 6 is a flow chart 600 illustrating quality of service distribution according to yet another example embodiment. At 610, a QoS request may be received from a mobile station in a wireless network for a flow. The QoS request may, for example, be received via one or more relay stations along a path. The QoS request may be received by relay station(s) and/or by a base station.
[0061 ] At 620, an admission control request for the flow may be sent to one or more relay stations along the path. Optionally, at 622, the admission control request may include one of sending an admission control request for the flow as a unicast message to each of the one or more relay stations, sending an admission control request for the flow as a unicast message to the relay station directly coupled to the mobile station, or sending an admission control request for the flow as a multicast message addressed to a multicast group that includes each of the one or more relay stations. Other message types may be used for the admission control request, for example.
[0062] The base station may send an admission control request to the relay station(s) to determine if the relay station(s) have the capability and/or resources to support the requested QoS. The relay station(s) may receive the QoS parameters from the QoS request, and/or from the admission control request.
[0063] At 630, an admission control response may be received from the one or more relay stations in the network. The admission control response may include an indication (or local admission control decision) that the relay station has sufficient resources, or not, to accommodate the requested QoS, for the flow, for example.
[0064] At 640, optionally, an admission control decision for the flow may be made, e.g., by the base station, based at least in part upon the admission control responses(s) from the one or more relay stations.
[0065] At 650, optionally, a QoS reply may be sent to the mobile station via the one or more relay stations along the path. The QoS reply may include QoS parameters and other information regarding the flow.
[0066] At 660, optionally, an admitted flow indication message may be sent to the one or more relay stations along the path. This may allow the relay station(s) optionally to manage resources and flow based at least in part upon the admitted flow indication for the flow, at 662.
[0067] FIG. 7 is a flow chart illustrating quality of service distribution according to yet another example embodiment.
[0068] At 710, a QoS request for a flow may be received at a base station, via one or more relay stations along a path in a wireless relay network. The QoS request may be received from a mobile station.
[0069] At 720, the base station may perform overall admission control for the flow including performing admission control for the flow for the one or more relay stations along the path.
[0070] At 730, the base station may send an admitted flow indication for the flow to the one or more relay stations along the path.
[0071 ] FIG. 8 is a flow chart illustrating quality of service distribution according to yet another example embodiment.
[0072] At 810, a relay station in a wireless relay network may receive an admission control request for a flow from a base station. The admission control request may include one or more QoS parameters for the flow.
[0073] At 820, the relay station may perform local admission control for the flow based on the QoS parameters for the flow.
[0074] At 830, the relay station may send an admission control response for the flow to the base station providing a local admission control decision by the relay station for the flow.
[0075] At 840, the relay station may receive an admitted flow indication for the flow from the base station. The relay station may perform scheduling for the flow based on the admitted flow indication, for example.
[0076] At 850, which may be optional in an example embodiment, the relay station may send an admitted flow confirmation to the base station to confirm receipt of the admitted flow indication for the flow.
[0077] FIG. 9 is a block diagram illustrating an apparatus 900 that may be provided in a wireless node according to an example embodiment. The example wireless node may include, for example, a wireless transceiver 902 to transmit and receive signals, a controller 904 to control operation of the station and execute instructions or software, and a memory 906 to store data and/or instructions. Controller 904 may be programmable, and capable of executing software or other instructions stored in memory or on other computer media to perform the various tasks and functions described above, such as to perform various tasks or operate as described in any of FIGs. 1-8 for example.
[0078] Implementations of the various techniques described herein may be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. Implementations may implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, e.g., in a machine-readable storage device or in a propagated signal, for execution by, or to control the operation of, data processing apparatus, e.g., a programmable processor, a computer, or multiple computers. A computer program, such as the computer program(s) described above, can be written in any form of programming language, including compiled or interpreted languages, and can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network.
[0079] Method steps may be performed by one or more programmable processors executing a computer program to perform functions by operating on input data and generating output. Method steps also may be performed by, and an apparatus may be implemented as, for example, hardware or special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).
[0080] While certain features of the described implementations have been illustrated as described herein, many modifications, substitutions, changes and equivalents will now occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the various embodiments.

Claims

WHAT IS CLAIMED IS:
1. A method comprising: receiving a quality of service (QoS) request (212) for a flow from a mobile station (202) via one or more relay stations (204) in a wireless relay network (410); receiving an admission control indication (214) for the flow from the one or more relay stations (204) in the network along a path (420); and making an admission control decision for the flow based at least in part upon the admission control indication^) from the one or more relay stations (430).
2. The method of claim 1 and further comprising sending a QoS reply (216) to the mobile station (202) via the one or more relay stations (204) along the path (440).
3. The method of claim 1 wherein the QoS request (212) comprises a connection identifier (CID), a service flow ID (SFID), and one or more QoS parameters for the flow.
4. A method comprising: receiving a QoS-related message at a relay station (204) in a wireless relay network, the QoS-related message including one or more QoS parameters for a flow (510); and retrieving, at the relay station (204), the QoS parameters from the QoS-related message to use the QoS parameters subsequently for an admission control decision and/or scheduling for the flow (520).
5. The method of claim 4 wherein receiving the QoS-related message • comprises at least one of: receiving, at the relay station (204), a QoS request (212) for a flow from a mobile station (202); or receiving, at the relay station (204), a QoS reply (216) for a flow from a base station (210).
6. The method of claim 4 and further comprising: performing, by the relay station (204), admission control for the flow based on the received QoS-related message; and sending, by the relay station (204), an admission control indication (214) for the flow to a base station (212).
7. The method of claim 4 and further comprising at least one of: performing, by the relay station (204), admission control for the flow based on the retrieved QoS parameters; and scheduling the flow, by the relay station (204), based on the retrieved QoS parameters.
8. The method of claim 4 and further comprising the relay station (204) sending an admission control indication (214) for the flow to a base station (210).
9. A method comprising: receiving, via one or more relay stations (304) along a path, a QoS request (312) for a flow from a mobile station (302) in a wireless network (610); sending an admission control request (314) for the flow to the one or more relay stations (304) along the path (620); receiving an admission control response (316) for the flow from the one or more relay stations (304) in the network (630); and making an admission control decision for the flow based at least in part upon the admission control response (316) from the one or more relay stations (304) (640).
10. The method of claim 9 wherein the sending the admission control request (314) comprises sending the admission control request (314) for the flow as a unicast message directed to a relay station (304) that is directly coupled to the mobile station (302), the admission control request (314) including one or more QoS parameters for the flow (622).
11. The method of claim 10 and further comprising: one or more of the relay stations (304) along the path retrieving the QoS parameters from the admission control request (314); performing local admission control for the flow by each of the one or more relay stations (304) along the path based on the QoS parameters; sending an admission control response (316) to the base station (310) based on the performing local admission control.
12. The method of claim 9 wherein the sending the admission control request (314) comprises at least one of: sending an admission control request (314) for the flow as a unicast message to each of the one or more relay stations (304); sending an admission control request (314) for the flow as a unicast message to a relay station (304) directly coupled to the mobile station (302); or sending an admission control request (314) for the flow as a multicast message addressed to a multicast group that includes each of the one or more relay stations (304) (622).
13. The method of claim 9 and further comprising sending a QoS reply (318) to the mobile station (302) via the one or more relay stations (304) along the path (650).
14. The method of claim 9 and further comprising sending an admitted flow indication to the one or more relay stations (304) along the path (660).
15. The method of claim 14 wherein the sending the admitted flow indication comprises sending the admitted flow indication for the flow as a unicast message directed to a relay station (304) that is directly coupled to the mobile station (302), the admitted flow indication including one or more QoS parameters for the flow.
16. The method of claim 15 and further comprising: one or more of the relay stations (304) along the path retrieving the QoS parameters from the admitted flow indication; performing scheduling for the flow by each of the one or more relay stations (304) along the path based on the QoS parameters; and sending an admitted flow confirmation to the base station (310).
17. The method of claim 14 wherein the sending the admitted flow indication comprises: sending the admitted flow indication message to the one or more relay stations (304) along the path, one or more of the relay stations (304) performing scheduling for the flow based at least in part upon the admitted flow indication for the flow (662).
18. The method of claim 14 wherein the sending the admitted flow indication comprises at least one of: sending an admitted flow indication message for the flow as a unicast message to each of the one or more relay stations (304); sending an admitted flow indication message for the flow as a unicast message to a relay station (304) directly coupled to the mobile station (302); or sending an admitted flow indication message for the flow as a multicast message addressed to a multicast group that includes each of the one or more relay stations (304).
19. The method of claim 14 wherein one or more of the QoS request, admission control request, admission control response and admitted flow indication comprises a connection identifier (CID), a service flow ID (SFID), and one or more QoS parameters for the flow.
20. A method comprising: receiving at a base station (310), via one or more relay stations (304) along a path, a QoS request (312) for a flow from a mobile station (302) in a wireless relay network (710); performing, by the base station (310), overall admission control for the flow including performing admission control for the flow for the one or more relay stations (304) along the path (720); sending, from the base station (310), an admitted flow indication for the flow to the one or more relay stations (304) along the path (730).
21. The method of claim 20 wherein the performing, by the base station (310), overall admission control for the flow comprises performing centralized admission control for the flow for the one or one or more relay stations (304) along the path without receiving local admission control information from the one or more of the relay stations (304) along the path.
22. The method of claim 20 wherein the performing, by the base station (310), overall admission control for the flow comprises: sending an admission control request (314) for the flow to each of the one or more relay stations (304) along the path; receiving an admission control response (316) for the flow from the one or more relay stations (304) providing a local admission control decision for the flow; and performing, by the base station (310), admission control for the flow based on the admission control response (316).
23. A method comprising: receiving, at a relay station (304) in a wireless relay network, an admission control request (314) for a flow from a base station (310), the admission control request (314) including one or more QoS parameters for the flow (810); performing, by the relay station (304), local admission control for the flow based on the QoS parameters for the flow (820); and sending, by the relay station (304), an admission control response (316) for the flow to the base station (310) providing a local admission control decision by the relay station (304) (830); receiving at the relay station (304) an admitted flow indication for the flow from the base station (310) (840).
24. The method of claim 23 and further comprising sending, by the relay station (304), an admitted flow confirmation to the base station (310) (850).
25. An apparatus (900) for wireless communication, the apparatus (900) comprising: a controller (904); a memory (906) coupled to the controller (904); and a wireless transceiver (902) coupled to the controller (904); the apparatus (900) adapted to: receive a QoS-related message at a relay station (204) in a wireless relay network, the QoS-related message including one or more QoS parameters for a flow; retrieve, at the relay station (204), the QoS parameters from the QoS- related message to use the QoS parameters subsequently for an admission control decision and/or scheduling for the flow.
26. An apparatus (900) for wireless communication, the apparatus (900) comprising: a controller (904); a memory (906) coupled to the controller (904); and a wireless transceiver (902) coupled to the controller (904); the apparatus (900) adapted to: receive, at a relay station (304) in a wireless relay network, an admission control request (314) for a flow from a base station (310), the admission control request (314) including one or more QoS parameters for the flow; perform, by the relay station (304), local admission control for the flow based on the QoS parameters for the flow; and send, by the relay station (304), an admission control response for the flow to the base station (310) providing a local admission control decision by the relay station (304); and receive, at the relay station (304), an admitted flow indication for the flow from the base station (310).
PCT/IB2007/001776 2006-06-30 2007-06-28 Qos request and information distribution for wireless relay networks WO2008004059A2 (en)

Priority Applications (6)

Application Number Priority Date Filing Date Title
EP07766593A EP2039076A4 (en) 2006-06-30 2007-06-28 Qos request and information distribution for wireless relay networks
JP2009517468A JP4972163B2 (en) 2006-06-30 2007-06-28 QoS request and information distribution for wireless relay networks
KR1020087031787A KR101107902B1 (en) 2006-06-30 2007-06-28 Qos request and information distribution for wireless relay networks
AU2007270867A AU2007270867B2 (en) 2006-06-30 2007-06-28 QoS request and information distribution for wireless relay networks
BRPI0715586A BRPI0715586A8 (en) 2006-06-30 2007-06-28 REQUEST FOR QOS AND DISTRIBUTION OF INFORMATION FOR WIRELESS RETRANSMISSION NETWORKS
IL195927A IL195927A0 (en) 2006-06-30 2008-12-15 Qos request and information distribution for wireless relay networks

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US11/479,976 2006-06-30
US11/479,976 US8483123B2 (en) 2006-06-30 2006-06-30 QoS request and information distribution for wireless relay networks

Publications (2)

Publication Number Publication Date
WO2008004059A2 true WO2008004059A2 (en) 2008-01-10
WO2008004059A3 WO2008004059A3 (en) 2008-04-24

Family

ID=38876542

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2007/001776 WO2008004059A2 (en) 2006-06-30 2007-06-28 Qos request and information distribution for wireless relay networks

Country Status (10)

Country Link
US (1) US8483123B2 (en)
EP (1) EP2039076A4 (en)
JP (1) JP4972163B2 (en)
KR (1) KR101107902B1 (en)
CN (1) CN101485159A (en)
AU (1) AU2007270867B2 (en)
BR (1) BRPI0715586A8 (en)
IL (1) IL195927A0 (en)
MY (1) MY146326A (en)
WO (1) WO2008004059A2 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009089655A1 (en) * 2008-01-17 2009-07-23 Alcatel Shanghai Bell Company, Ltd. Method and device for data relay transmission in wireless relay network
JP2012235488A (en) * 2008-03-10 2012-11-29 Samsung Electronics Co Ltd Reception control apparatus and method for service flow in broadband wireless access communication system using multi-hop relay method
US8483123B2 (en) 2006-06-30 2013-07-09 Nokia Corporation QoS request and information distribution for wireless relay networks
TWI424728B (en) * 2008-10-24 2014-01-21 Qualcomm Inc Bearer qos mapping for cell relays
CN112752240A (en) * 2019-10-30 2021-05-04 大唐移动通信设备有限公司 Direct communication processing method and device, relay terminal and remote terminal

Families Citing this family (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7881276B2 (en) * 2006-07-31 2011-02-01 Industrial Technology Research Institute System and method for relaying data
US20080101220A1 (en) * 2006-10-31 2008-05-01 Samsung Electronics Co., Ltd. Header suppression/compression apparatus and method for providing multicast and broadcast service (MBS) in broadband wireless access system
US7742448B2 (en) * 2006-11-07 2010-06-22 Motorola, Inc. Optimizing topology learning in a multihop network
US8503454B2 (en) * 2007-05-04 2013-08-06 Samsung Electronics Co., Ltd. Apparatus and method for setting up quality of service in a wireless communication system
US20090141661A1 (en) * 2007-11-29 2009-06-04 Nokia Siemens Networks Oy Residual traffic state for wireless networks
EP2232908A2 (en) * 2008-01-02 2010-09-29 InterDigital Technology Corporation Method and apparatus for cooperative wireless communications
US8355357B2 (en) * 2008-03-10 2013-01-15 Samsung Electronics Co., Ltd. Apparatus and method for admission control for service flow in broadband wireless access communication system using multi-hop relay scheme
TW201004180A (en) * 2008-07-07 2010-01-16 Interdigital Patent Holdings Method and apparatus for cooperative relaying in wireless communications
KR101546780B1 (en) 2008-12-18 2015-08-25 삼성전자주식회사 Apparatus and method for handling error for service flow modification in a broadband wireless communication network
JP5225114B2 (en) * 2009-01-08 2013-07-03 三菱電機株式会社 Communications system
TWI385976B (en) * 2009-01-19 2013-02-11 Univ Nat Taiwan Science Tech Call admission controller and method thereof and multi-hop wireless backhaul network system using the same
WO2010121204A1 (en) 2009-04-17 2010-10-21 Research In Motion Limited Mechanisms for evolved packet system quality of service class identifier extension
JP5047231B2 (en) * 2009-06-25 2012-10-10 株式会社日立製作所 Wireless communication apparatus and wireless communication method
MY164508A (en) * 2009-07-13 2017-12-29 Mimos Berhad System and method for embedded mesh path management
CN101990325B (en) * 2009-07-31 2013-04-24 华为技术有限公司 Method, device and system for determining and maintaining QoS (Quality of Service) parameters of multi-hop network
JP2011071899A (en) * 2009-09-28 2011-04-07 Kyocera Corp Radio terminal and wireless communication method
WO2011041573A1 (en) * 2009-10-01 2011-04-07 Entropic Communications, Inc. System and method for a managed network with quality-of-service
JP2011137850A (en) * 2009-12-25 2011-07-14 Dainippon Printing Co Ltd Infrared reflection member
CN102045787B (en) * 2010-01-25 2014-01-08 新邮通信设备有限公司 Downlink scheduling method, donor base station and relay node
WO2012072097A1 (en) * 2010-11-29 2012-06-07 Nokia Siemens Networks Oy Carrier selection in relay systems
EP2480026B1 (en) * 2011-01-17 2013-01-09 Alcatel Lucent Coordinated transmissions in communication networks
US8862871B2 (en) * 2011-04-15 2014-10-14 Architecture Technology, Inc. Network with protocol, privacy preserving source attribution and admission control and method
WO2013013288A1 (en) * 2011-07-26 2013-01-31 Research In Motion Limited Mobile device for a smart relay network
WO2013013289A1 (en) 2011-07-26 2013-01-31 Research In Motion Limited Smart relay network
US8885463B1 (en) 2011-10-17 2014-11-11 Juniper Networks, Inc. Path computation element communication protocol (PCEP) extensions for stateful label switched path management
US8787154B1 (en) 2011-12-29 2014-07-22 Juniper Networks, Inc. Multi-topology resource scheduling within a computer network
US8824274B1 (en) * 2011-12-29 2014-09-02 Juniper Networks, Inc. Scheduled network layer programming within a multi-topology computer network
US10031782B2 (en) 2012-06-26 2018-07-24 Juniper Networks, Inc. Distributed processing of network device tasks
US9450817B1 (en) 2013-03-15 2016-09-20 Juniper Networks, Inc. Software defined network controller
US10193801B2 (en) 2013-11-25 2019-01-29 Juniper Networks, Inc. Automatic traffic mapping for multi-protocol label switching networks
US10944583B2 (en) 2015-06-30 2021-03-09 Nokia Solutions And Networks Oy Proximity services priority control for multicast traffic in proximity services user equipment-network relay scenario
US9949146B1 (en) * 2016-04-07 2018-04-17 Sprint Communications Company L.P. Control over data services that are delivered over a wireless access point
US10299185B1 (en) 2017-04-24 2019-05-21 Sprint Communications Company L.P. Wireless relay quality-of-service based on relay-delivered media services
CN111277972B (en) * 2019-01-25 2022-12-23 维沃移动通信有限公司 Method for determining QoS parameter of direct communication interface and related equipment

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040242154A1 (en) 2002-05-27 2004-12-02 Shinji Takeda Mobile communication system, transmission station, reception station, relay station, communication path deciding method, and communication path deciding program

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7068600B2 (en) * 2002-04-29 2006-06-27 Harris Corporation Traffic policing in a mobile ad hoc network
US7007102B2 (en) 2002-04-29 2006-02-28 Harris Corporation Admission control in a mobile ad hoc network
US6954435B2 (en) * 2002-04-29 2005-10-11 Harris Corporation Determining quality of service (QoS) routing for mobile ad hoc networks
JP4084639B2 (en) * 2002-11-19 2008-04-30 株式会社エヌ・ティ・ティ・ドコモ Admission control method in mobile communication, mobile communication system, mobile station, admission control device, and admission control program
GB2411549B (en) 2004-02-27 2007-07-25 Toshiba Res Europ Ltd Method of routing in an ad hoc network
KR20060013059A (en) * 2004-08-05 2006-02-09 삼성전자주식회사 Apparatus and method of processing massage in portable internet system
US7339913B2 (en) * 2004-08-17 2008-03-04 Intel Corporation Method and system of network management and service provisioning for broadband wireless networks
US7719972B2 (en) 2004-12-03 2010-05-18 Intel Corporation Methods and apparatus for providing an admission control system in a wireless mesh network
US7933236B2 (en) * 2005-10-27 2011-04-26 Nortel Networks Limited Methods and systems for a wireless routing architecture and protocol
US20070116051A1 (en) * 2005-11-23 2007-05-24 Chen An M Method and apparatus for transporting IP datagrams over FLO network
US8737984B2 (en) * 2006-03-13 2014-05-27 Apple Inc. WiMAX intra-ASN service flow ID mobility
US8483123B2 (en) 2006-06-30 2013-07-09 Nokia Corporation QoS request and information distribution for wireless relay networks
US20090141661A1 (en) * 2007-11-29 2009-06-04 Nokia Siemens Networks Oy Residual traffic state for wireless networks

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040242154A1 (en) 2002-05-27 2004-12-02 Shinji Takeda Mobile communication system, transmission station, reception station, relay station, communication path deciding method, and communication path deciding program

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8483123B2 (en) 2006-06-30 2013-07-09 Nokia Corporation QoS request and information distribution for wireless relay networks
WO2009089655A1 (en) * 2008-01-17 2009-07-23 Alcatel Shanghai Bell Company, Ltd. Method and device for data relay transmission in wireless relay network
JP2011510543A (en) * 2008-01-17 2011-03-31 アルカテル−ルーセント Method and device for data relay transmission in a wireless relay network
CN101919177B (en) * 2008-01-17 2013-04-24 上海贝尔股份有限公司 Method and device for data relay transmission in wireless relay network
US8638675B2 (en) 2008-01-17 2014-01-28 Alcatel Lucent Method and device for data relay transmission in wireless relay network
JP2012235488A (en) * 2008-03-10 2012-11-29 Samsung Electronics Co Ltd Reception control apparatus and method for service flow in broadband wireless access communication system using multi-hop relay method
TWI424728B (en) * 2008-10-24 2014-01-21 Qualcomm Inc Bearer qos mapping for cell relays
CN112752240A (en) * 2019-10-30 2021-05-04 大唐移动通信设备有限公司 Direct communication processing method and device, relay terminal and remote terminal

Also Published As

Publication number Publication date
US8483123B2 (en) 2013-07-09
MY146326A (en) 2012-07-31
JP4972163B2 (en) 2012-07-11
IL195927A0 (en) 2009-09-01
JP2009543397A (en) 2009-12-03
EP2039076A2 (en) 2009-03-25
WO2008004059A3 (en) 2008-04-24
BRPI0715586A8 (en) 2016-04-19
US20080002608A1 (en) 2008-01-03
AU2007270867A1 (en) 2008-01-10
EP2039076A4 (en) 2012-04-25
KR20090016000A (en) 2009-02-12
AU2007270867B2 (en) 2011-02-24
BRPI0715586A2 (en) 2013-10-29
KR101107902B1 (en) 2012-01-25
CN101485159A (en) 2009-07-15

Similar Documents

Publication Publication Date Title
AU2007270867B2 (en) QoS request and information distribution for wireless relay networks
EP2323441B1 (en) Method of transmitting a message in a mesh network having a maximum number of next hop addresses
US7835332B2 (en) Method and apparatus for scheduling in WLAN mesh communication system
CN1898920B (en) Communication network and communication method, transmission station and receiving station for the communication networks and the operation method
JP4761365B2 (en) Communication scheduling method
CN101517969B (en) Resource dispatching method and resource dispatching system based on wireless system
US9769825B2 (en) Fast wireless local area network communication method and apparatus using multiple transfer rate partitioning and cooperative transmission
KR101178370B1 (en) Traffic management for multi-hop wireless communication
JP2010520655A (en) Wireless communication system
JP2008099282A (en) Wireless communication systems
WO2022232986A1 (en) Relay selection and reselection
US8687562B2 (en) Wireless network enhancements
CN111345105B (en) Network node and method in a mesh network
CN114449589A (en) Time slot resource reservation system and method
EP2498455A1 (en) Method and system to coordinate the communication channel access in a technology independent way in order to improve channel efficiency and to provide QoS guarantees
EP3097715B1 (en) Use of shared resources indicated by template frame
US20140286163A1 (en) Data channel scheduling method and system for orthogonal frequency division multiplexing access (ofdma)-based wireless mesh network
Yang et al. Admission control for wireless mesh networks based on active neighbor bandwidth reservations
WO2019192465A1 (en) Method and device for requesting for and scheduling relay resource
JP2023541109A (en) Communication method and device and readable storage medium
JP2005269343A (en) Mobile terminal equipment and multi-hop wireless system
JP4688156B2 (en) Packet scheduling method and apparatus
KR20060129043A (en) Method, intermediate station and central control unit for the packet-switched data transmission in a self-organizing radio network
AHMED et al. Dynamic Bandwidth Allocation Schemes for Multi-hop Wireless Mesh Networks.
KR20180058638A (en) Method and apparatus for distributed resource allocation in wireless communication system

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200780025044.8

Country of ref document: CN

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

Ref document number: 07766593

Country of ref document: EP

Kind code of ref document: A2

WWE Wipo information: entry into national phase

Ref document number: 6866/CHENP/2008

Country of ref document: IN

WWE Wipo information: entry into national phase

Ref document number: 195927

Country of ref document: IL

WWE Wipo information: entry into national phase

Ref document number: 12008502837

Country of ref document: PH

Ref document number: 2009517468

Country of ref document: JP

REEP Request for entry into the european phase

Ref document number: 2007766593

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2007766593

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 1020087031787

Country of ref document: KR

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2007270867

Country of ref document: AU

NENP Non-entry into the national phase

Ref country code: RU

ENP Entry into the national phase

Ref document number: 2007270867

Country of ref document: AU

Date of ref document: 20070628

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: PI0715586

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20081223