WO2008049809A1 - Procédé de programmation basée sur des connexions avec un support de service différencié pour des réseaux sans fil multisauts - Google Patents

Procédé de programmation basée sur des connexions avec un support de service différencié pour des réseaux sans fil multisauts Download PDF

Info

Publication number
WO2008049809A1
WO2008049809A1 PCT/EP2007/061290 EP2007061290W WO2008049809A1 WO 2008049809 A1 WO2008049809 A1 WO 2008049809A1 EP 2007061290 W EP2007061290 W EP 2007061290W WO 2008049809 A1 WO2008049809 A1 WO 2008049809A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
requests
individual
network
traffic
Prior art date
Application number
PCT/EP2007/061290
Other languages
English (en)
Inventor
Luca Coletti
Simone Redana
Original Assignee
Nokia Siemens Networks Gmbh & Co. Kg
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 Siemens Networks Gmbh & Co. Kg filed Critical Nokia Siemens Networks Gmbh & Co. Kg
Priority to US12/312,122 priority Critical patent/US8811297B2/en
Priority to EP07821654A priority patent/EP2078389B1/fr
Priority to DE602007009556T priority patent/DE602007009556D1/de
Priority to CN2007800398553A priority patent/CN101554076B/zh
Priority to AT07821654T priority patent/ATE483343T1/de
Publication of WO2008049809A1 publication Critical patent/WO2008049809A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2408—Traffic characterised by specific attributes, e.g. priority or QoS for supporting different services, e.g. a differentiated services [DiffServ] type of service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/15—Flow control; Congestion control in relation to multipoint traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
    • H04L47/724—Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/78—Architectures of resource allocation
    • H04L47/781—Centralised allocation of resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/805—QOS or priority aware
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/824—Applicable to portable or mobile terminals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/827—Aggregation of resource allocation or reservation requests
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
    • H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/24—Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • H04W84/22—Self-organising networks, e.g. ad-hoc networks or sensor networks with access to wired networks

Definitions

  • the present invention refers to broadband wireless access networks, and more particularly it concerns a connection-based scheduling method with differentiated service support for hierarchical multi-hop relay networks.
  • the invention can be used for instance in networks based on IEEE standards 802.16x, which is one of the promising standards where protocol elements are defined, worth of being considered when designing air interfaces for new generation systems, i.e. beyond-3G (3rd Generation) and 4G (4th Generation) systems.
  • a multi-hop hierarchical relay network is a network where a base station is associated with a plurality of Relay Nodes (RNs), arranged e.g. according to a logical tree structure, and last-hop (or single-hop) connections are provided towards user terminals (UTs) around each relay node.
  • RNs Relay Nodes
  • UTs user terminals
  • the multi-hop traffic is transmitted between the base station, which is connected to a fixed backbone network, and the relay nodes that are strategically placed.
  • the last-hop traffic takes place between the relay node and a variable number of user terminals.
  • the multi-hop technology allows enlarging the overall system coverage with low cost infrastructures, since the relay nodes have a simpler structure and therefore are cheaper than base stations.
  • QoS Quality of Service
  • Method for controlling the access to a TDMA wireless channel from nodes deployed as either a linear or tree topology network for multihop transmissions in uplink from a requesting node to a centralized node and/or in downlink from the centralized node towards an end node including the steps of:
  • - releasing permissions also called grants, for the use exclusive of TDMA channel for a given time by the centralized node to each node along uplink and/or downlink multihop path/s, characterized in that said requesting node issues a cumulative request for the resources needed on each link along the end-to-end path.”
  • the requests of resources for sending uplink flows from relay nodes to the base station and/or downlink flows from base station to relay nodes are computed by each requesting node for the end-to-end connection instead of being computed only for the next link towards destination.
  • connection based scheduling This is made possible in networks with tree topology and centralized scheduling where a request of resources is computed on individual links between two adjacent nodes, and the network configuration is generally known to the requesting nodes.
  • each requesting node issues a cumulative request given by summing up the same request for each link that separates the node from the base station (in uplink) plus each link separating the base station from the destination node (in downlink).
  • the base station in response to all cumulative requests, grants uplink and/or downlink resources for each link.
  • a grant is intended as an individual permission given to the node for the use exclusive of the common resource (e.g. the TDMA radio channel) for a fraction of time.
  • the cumulative request/grant is made possible, e.g. in IEEE 802.16 networks, by the structure of the centralised control scheduling messages
  • This strategy together with an order of transmission depending on the topology (in uplink direction the node farthest form the base station transmits first and the node closest to the base station transmits last, and in downlink direction transmission occurs in the reverse order) guarantees that packets wait for being transmitted only in the source relay nodes and not in the forwarding or transit relay nodes, and that they are delivered to the destination within one frame once they are sent from the source node.
  • a further one-frame delay is to be considered in the average for the last hop from/to the user terminal.
  • fairness in respect of the number of hops and of the propagation direction (as shown by the delay curves reported in Figs. 16 and 17 of the application) is achieved.
  • a relay node generally handles connections associated with services having different QoS requirements, such as, in the simplest case, real time and non-real time services (e.g. to support both multimedia and web browsing applications).
  • QoS requirements such as, in the simplest case, real time and non-real time services (e.g. to support both multimedia and web browsing applications).
  • a grant of resources determined on the basis of the total traffic of the relay nodes can result ultimately in a risk of lack of resources for real time traffic (or generally traffic with higher QoS requirements), especially for nodes more distant from the base station: this results in turn in a degradation of the QoS, especially in case traffic distribution among real time/non real time services (or, generally, among different classes of service) at the different nodes is non-uniform.
  • connection-based scheduling that can result in a fair grant of resources among the different nodes not only in terms of the overall traffic handled by a node but also in terms of the different services to which the traffic refers.
  • this object is achieved in that, in the presence of traffic belonging to different classes of service, the cumulative request issued by a source node for the resources needed on each link up to the destination node comprises the concatenation of a plurality of individual cumulative requests each concerning traffic belonging to a different class of service.
  • the method of the invention will also be referred to as "connection-based scheduling with differentiated service support.
  • the grant of resources to a node is advantageously non-differentiated with respect to the different classes of service, since the node knows the distribution of its traffic demands and can suitably share the resources it has been granted. Also the message relevant to the grant of resources reserved to said source node could be concatenated at a transmitting node with the individual requests.
  • the invention starts from the following considerations. Considering by way of example an IEEE 802.16 compliant network and assuming that each relay node is assigned a transmission opportunity within each frame (and more particularly within the schedule control sub-frame) for sending request and grant control messages (Mesh Centralized Scheduling - MSH-CSCH - messages), 4 OFDM symbols are assigned to a relay node for the transmission of a MSH-CSCH message. Therefore, assuming the most robust modulation and coding for the control sub-frame, which corresponds to 24 bytes per OFDM symbol (QPSK 1/2), the available resources are equal to 96 bytes. Now, it can be seen that, in the general case of a tree network, the length of the MSH-CSCH message, in bytes, assuming no link updates (see the IEEE Standard) is given by the following equation:
  • OHM S H- CSC H 4 + ⁇ Nj, hi
  • d (1 ) i 1
  • NumRNs is the number of relay nodes within the multi-hop relay network and N' ch ⁇ i d is the number of relay nodes with a distance from the base station one hop higher than the distance between the i-th relay node and the base station.
  • Relation (1 ) can be deduced from the MSH-CSCH message structure disclosed in the standard (see Table 82). Reference can also be made to the paper "Performance
  • FIG. 1 is a schematic diagram of a multi-hop network
  • - Fig. 2 is a diagram showing the request/grant profile with the connection-based algorithm
  • - Fig. 3 is a graph of the mesh-frame structure according to standard IEEE 802.16
  • - Fig. 4 is a graph showing the structure of the schedule control sub-frame according to the present invention.
  • - Fig. 5 is a graph of the mean delay versus the total offered throughput in a multi-hop network using the invention
  • - Fig. 6 is a graph of the mean delay versus the total offered throughput in a multi-hop network not using the invention. Description of the preferred embodiments
  • Fig. 1 there is schematically shown the architecture of a hierarchical multi-hop relay network compliant with IEEE Standard 802.16.
  • Each relay node has wireless access to the adjacent nodes and/or to the base station, depending on its location along the branch.
  • branching level x is x-hop spaced from the base station.
  • a number of user terminals UT are arranged around each relay node, as shown for relay node RN(2,1 ), and have wireless access thereto.
  • the whole of the relay nodes and the base station forms a mesh structure supporting multi-hop links.
  • a relay node and the user terminals served by that node form a Point-to-Multipoint structure supporting single-hop links.
  • Multi-hop links are shown by solid lines and single hop links are shown by dotted lines in the Figure.
  • the tree configuration is a logical one, and that the physical arrangement is strictly related with the characteristics of the area where the network is deployed and, in general, will result in the provision of a limited number of strategically located relay nodes.
  • the multiplexing of multi-hop and last-hop air interface can be performed according to different concepts.
  • the standard does not define the solution.
  • the frequency domain is a possible approach.
  • the total frequency band is divided into two sub-bands: the first sub- band is assigned for multi-hop and the second one for last-hop communication, respectively.
  • the Orthogonal Frequency Division Multiple Access (OFDMA) can be adopted to split the available frequency band into two parts.
  • OFDMA Orthogonal Frequency Division Multiple Access
  • Another approach is multiplexing multi-hop and last-hop air interface in time domain. We consider a super frame as combination of two frames: a frame assigned to multi-hop traffic and the other to last-hop traffic.
  • the network provides for a centralised, connection-based scheduling. This means on the one hand that each node issues a cumulative request for the end-to-end connection, containing resource requests not only for the next hop but also for each link towards the destination, and, on the other hand, that the base station gathers all cumulative requests and, in response, grants or allocates uplink and/or downlink resources for each link involved in the connection.
  • Fig. 2 shows the profile of the requests/grants resulting from the application of the above strategy to a path from BS to node RN(n,1 ).
  • R 1 ,, and G 1J are the requests and the grants, respectively, on link j for the connection (uplink and/or downlink) between BS and node RN(i,1 ).
  • the Figure makes it apparent that, due to the centralised management, the "population" of requests/grants on each link increases as the distance from the base station decreases. It is to be borne in mind that the Figure is only qualitative and that, even if the requests/grants are shown by equally sized rectangles whatever the relay node and the link, this does not imply any assumption on the amount of resources actually requested/granted.
  • Fig. 3 shows the frame organisation for the multi-hop operation mode in an IEEE 802.16 compliant network ("mesh operation mode", according to the standard), considering for sake of simplicity and by way of example a branch of the tree structure with four relay nodes denoted here as RN1 , RN2, RN3, RN4.
  • a mesh frame consists of a control sub-frame and a data sub-frame, which are configured by base station BS.
  • control sub-frames Two types of control sub-frames exist: - Network Control sub-frame, used by BS to broadcast network information and by new terminals that want to perform network entry.
  • - Schedule Control sub-frame used by BS and the RNs to transmit requests and grants for a new resource allocation within the data sub-frame. Only this second type of control sub-frame is of interest for the invention and has been shown in the Figure.
  • a centralised scheduling is used and hence requests and grants are transmitted by the base station and the relay nodes through MSH-CSCH messages.
  • the Figure further shows that each relay node RN1 - RN4 is assigned a transmission opportunity within each frame for sending request and grant control messages.
  • This is not mandatory.
  • the standard does not require that resources are assigned to each RN within one control sub-frame: if a transmission opportunity for each relay node is not assumed within one control sub-frame, the transmission order of request and grant messages does not change but it is performed on multiple frames basis.
  • the grant message does not reach each relay node in one frame, data collisions can occur due to non- updated information on resource allocation in each relay node. Measures are to be studied in order to avoid data collisions.
  • the data transmission occurs within the data sub-frame according to the last grant message sent from the base station.
  • the transmission order depends on the traffic direction (downlink/uplink) and is BS, RN1 , RN2, RN3 for downlink traffic and RN4, RN3, RN2, RN1 for uplink traffic. This strategy guarantees that packets wait for being transmitted only in the source relay node and not in the forwarding or transit relay nodes.
  • the invention aims at improving the connection-based scheduling so that the base station, when granting resources to a relay node, can take into account that the traffic handled by that node can relate to different classes of services with different QoS requirements.
  • the BS is able to distinguish between service requests from each RN related to the different classes of service and to establish a priority among the requests it receives (differentiated service).
  • Packet classification is a standard function in the IEEE 802.16 compliant networks considered in the described exemplary embodiment, and thus no problem exists in enabling the relay nodes to perform it.
  • a differentiated service support by the base station In order to allow a differentiated service support by the base station, according to the invention more than one MSH-CSCH request messages are concatenated in the slot of the scheduling control sub-frame assigned to a given relay node, each request concerning a different class of service.
  • Fig. 4 refers, by way of non-limiting example only, to a coarse classification of the traffic handled by a relay node RNi into "traffic with real-time demands" (RT traffic) and “traffic without real-time demands” (non-real-time, nRT, traffic). This can correspond for instance to distinguishing traffic relating to multimedia and web browsing applications, respectively.
  • the slot of the scheduling control sub-frame may contain the concatenation of an MSH-CSCH request message requesting resources for the RT traffic and an MSH-CSCH request message requesting resources for the nRT traffic.
  • the requests for the different kinds of traffic (referred to hereinafter as individual or partial requests) are still cumulative requests for the resources needed on each link along the end-to-end path.
  • a node is to simultaneously forward both a resource request (in uplink) and a grant (in downlink), also a MSH-CSCH grant message could be concatenated with the individual request messages, since the transmission slot has generally sufficient space to allow so.
  • BS Upon receiving the concatenated individual request messages, BS updates its perception of resource needs for the links included in the message and, in the following frame, computes and sends the grant message. Grants are calculated according to a BS- specific policy that is not part of the present invention. For instance, considering the RT/nRT example, BS could assign more grants on links where there are higher RT loads with respect to other links with lower RT loads or could allot first resources to real-time traffic and then allot the remaining resources, if any, to non-real traffic.
  • the actual grant on each link can be calculated for instance in the manner disclosed in the above-mentioned patent application: the base station grants resources for each link according to either a profile of grants equal to the profile of the requests for that link if the whole amount of requested resources is below the maximum permissible net throughput for the TDMA channel, or a profile lower than the profile of the requests for that link, if the whole amount of requested resources is not below that maximum permissible net throughput, wherein the lower profile is calculated through a normalisation with respect to the ratio between said maximum permissible net throughput and the whole amount of requested resources.
  • Other strategies could result in BS favouring only real time traffic, or favouring the farthest relay nodes, etc.
  • a grant as indicated in Fig. 4, is undifferentiated or aggregate, i.e. it concerns the whole traffic handled by the node. Differentiation of the grants according to the service classes is not necessary, since the relay node knows the composition of its requests and can suitably allocate resources to the different service classes without specific instructions from the base station.
  • the only modification requested in the structure of the MSH-CSCH message defined in the standard could be the addition of a "real time/non real time" flag to be set to the proper value when the request/grant flag is 1 (request message). However, that flag is not necessary if the order of concatenation of the requests for the different classes of services is predefined.
  • Figs. 5 and 6 are graphs obtained by simulations carried out on the network with four nodes considered in Fig. 3. The simulations have been performed considering the IEEE 802.16 Point-to-MultiPoint air-interface specifications for the last hop from a relay node to the user terminals.
  • the graphs show the mean delay, expressed in number of frames, vs. the total offered traffic (sum of the traffic to/from a node), assuming a condition in which the aggregate traffic is almost the same at each node whereas different nodes have different ratios of the real time to the non real time traffic.
  • the load at RN1 , RN2, RN3 is composed of 20% real-time traffic and 80% non real-time traffic and the load at RN4 is composed of 40% real-time traffic and 60% non real-time traffic.
  • Fig. 5 is obtained by using the invention and Fig. 6 without using the invention.
  • connection-based scheduling in terms of delay, obtaining fairness also among different kinds of connections.
  • the invention can be immediately adopted in IEEE 802.16x networks with a very simple modification, or even no modification, of the structure of the MSH-CSCH messages, as well as in beyond- 3G systems with a frame-based physical layer. It is evident that the above description has been given by way of non-limiting example and that changes and modifications are possible without departing from the scope of the invention.
  • Fig. 4 shows the simple case of two types of traffic flows, more than two request messages can be concatenated, if a finer classification is performed: e.g. as many request messages as are the classes of service supported by the network could be concatenated (for instance, the IEEE standard defines four classes of services).
  • the "real time/non real time" flag if provided, will become a more general
  • OHM S H CSC H of each message depends on such number, according to equation (1 ).
  • the MAC can align its scheduling intervals with the underlying PHY framing.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)

Abstract

L'invention concerne un procédé de programmation centralisée de l'accès à un canal de radio commun dans des réseaux sans fil multisauts. Les demandes des nœuds de relais (RN(1,1)... RN(n, Nn), RNi) de ressources pour envoyer des flux de liaison montante vers la station de base (BS) et/ou des flux de liaison descendante vers des nœuds de relais (RN(1,1)... RN(n,Nn), RNi) sont calculés par un nœud demandeur pour toutes les liaisons jusqu'à la destination et envoyées sous forme de demandes cumulées pour toutes les liaisons concernées. Dans le cas où le trafic pour lequel un accès au canal commun est demandé concerne différentes classes de service, chaque demande cumulée comprend la concaténation d'une pluralité de demandes cumulées individuelles, concernant chacune le trafic appartenant à une classe de service différente.
PCT/EP2007/061290 2006-10-27 2007-10-22 Procédé de programmation basée sur des connexions avec un support de service différencié pour des réseaux sans fil multisauts WO2008049809A1 (fr)

Priority Applications (5)

Application Number Priority Date Filing Date Title
US12/312,122 US8811297B2 (en) 2006-10-27 2007-10-22 Method of connection based scheduling with differentiated service support for multi-hop wireless network
EP07821654A EP2078389B1 (fr) 2006-10-27 2007-10-22 Procédé de programmation basée sur des connexions avec un support de service différencié pour des réseaux sans fil multisauts
DE602007009556T DE602007009556D1 (de) 2006-10-27 2007-10-22 Verfahren zum scheduling auf verbindungsbasis mit differenzierter dienstunterstützung für drahtlose mehrsprung-netze
CN2007800398553A CN101554076B (zh) 2006-10-27 2007-10-22 具有对多跳无线网络的差异化服务支持的基于连接的调度方法
AT07821654T ATE483343T1 (de) 2006-10-27 2007-10-22 Verfahren zum scheduling auf verbindungsbasis mit differenzierter dienstunterstützung für drahtlose mehrsprung-netze

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP06425740A EP1916808A1 (fr) 2006-10-27 2006-10-27 Procédé de programmation basée sur connexion avec support de service différencié pour réseaux sans fil à sauts multiples
EP06425740.5 2006-10-27

Publications (1)

Publication Number Publication Date
WO2008049809A1 true WO2008049809A1 (fr) 2008-05-02

Family

ID=37831533

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2007/061290 WO2008049809A1 (fr) 2006-10-27 2007-10-22 Procédé de programmation basée sur des connexions avec un support de service différencié pour des réseaux sans fil multisauts

Country Status (8)

Country Link
US (1) US8811297B2 (fr)
EP (2) EP1916808A1 (fr)
CN (1) CN101554076B (fr)
AT (1) ATE483343T1 (fr)
DE (1) DE602007009556D1 (fr)
ES (1) ES2353565T3 (fr)
RU (1) RU2444852C2 (fr)
WO (1) WO2008049809A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100315956A1 (en) * 2008-02-14 2010-12-16 Panasonic Corporation Radio communication relay device, radio communication base station device, radio communication system, and radio communication method
CN102724014A (zh) * 2011-12-31 2012-10-10 幕福奇 一种树状网络多跳无线通信系统无线帧长自适应调整方法及装置
CN103051553A (zh) * 2013-01-25 2013-04-17 西安电子科技大学 网络流量均衡分割系统及分割方法

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101212721B (zh) * 2007-12-25 2011-01-19 华为软件技术有限公司 信息处理方法、系统及信息合并装置
JP5544013B2 (ja) * 2009-06-30 2014-07-09 エルジー エレクトロニクス インコーポレイティド 無線通信システムにおける中継器の優先順位付け動作のための方法及び装置
CN101969669B (zh) * 2009-07-27 2013-02-13 电信科学技术研究院 一种调整数据量的方法、系统和装置
CN102065483B (zh) * 2009-11-18 2013-12-04 华为技术有限公司 流量控制方法、装置
US20120287790A1 (en) * 2010-01-11 2012-11-15 Min Huang Method and Apparatus
US9686188B2 (en) * 2012-09-13 2017-06-20 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for node realignment in a telecommunications network
CN103118435B (zh) 2012-12-11 2015-11-25 华为技术有限公司 一种节点调度方法、设备及系统
KR20140116675A (ko) * 2013-03-25 2014-10-06 인텔렉추얼디스커버리 주식회사 Ｏｆｄｍａ 기반 무선 메쉬 네트워크를 위한 데이터 채널 스케줄링 시스템 및 방법
CN106488561A (zh) * 2015-08-28 2017-03-08 北京信威通信技术股份有限公司 一种多跳网络中的资源分配方法
US10554368B2 (en) * 2015-10-07 2020-02-04 Microsoft Technology Licensing, Llc Wireless data-acknowledgement communication using frame aggregation
JP6983931B2 (ja) * 2019-09-17 2021-12-17 株式会社東芝 無線通信装置、無線通信システム、無線通信方法及びプログラム

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030202476A1 (en) * 2002-04-29 2003-10-30 Harris Corporation Determining quality of service (QoS) routing for mobile AD HOC networks
US6804251B1 (en) * 1998-11-12 2004-10-12 Broadcom Corporation System and method for multiplexing data from multiple sources
EP1610503A1 (fr) * 2004-06-25 2005-12-28 Siemens Mobile Communications S.p.A. Contrôle d'acheminement dans des réseaux de communication

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2181229C1 (ru) * 2001-10-04 2002-04-10 Оао "Персональные Коммуникации" Способ динамического перераспределения загрузки базовых станций сотовой сети связи и устройство для его осуществления (варианты)
US7406074B2 (en) * 2002-07-12 2008-07-29 Lucent Technologies Inc. Bundling messages in communication networks
FI20030724A0 (fi) * 2003-05-14 2003-05-14 Nokia Corp Tiedonsiirtomenetelmä, järjestelmä, tukiasema ja tilaaja-asema
US8489949B2 (en) * 2003-08-05 2013-07-16 Qualcomm Incorporated Combining grant, acknowledgement, and rate control commands
JP4086304B2 (ja) * 2004-04-23 2008-05-14 株式会社東芝 通信装置、通信システム、および通信制御プログラム
AU2005284753B2 (en) * 2004-09-15 2010-05-20 Nokia Technologies Oy Requesting and/or allocating communication resources at a new access point before transmitting a reassociation request
US7480304B2 (en) * 2004-12-29 2009-01-20 Alcatel Lucent Predictive congestion management in a data communications switch using traffic and system statistics
CN100450281C (zh) * 2005-03-31 2009-01-07 西门子（中国）有限公司 一种分布式多跳无线网络的接入方法
US7486928B2 (en) * 2005-04-14 2009-02-03 Kddi Corporation Methods and apparatus for wireless communications
US8060640B2 (en) * 2005-05-27 2011-11-15 Microsoft Corporation Combining SIP requests with SIP responses
US8554232B2 (en) * 2005-08-17 2013-10-08 Apple Inc. Method and system for a wireless multi-hop relay network
US8391254B2 (en) * 2005-10-06 2013-03-05 Samsung Electronics Co., Ltd Channel configuration and bandwidth allocation in multi-hop cellular communication networks
US20070116234A1 (en) * 2005-10-19 2007-05-24 Marco Schneider Methods and apparatus for preserving access information during call transfers
US7933236B2 (en) * 2005-10-27 2011-04-26 Nortel Networks Limited Methods and systems for a wireless routing architecture and protocol
US8565673B2 (en) * 2006-07-19 2013-10-22 Stmicroelectronics, Inc. Hierarchical networks utilizing frame transmissions pipelining

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6804251B1 (en) * 1998-11-12 2004-10-12 Broadcom Corporation System and method for multiplexing data from multiple sources
US20030202476A1 (en) * 2002-04-29 2003-10-30 Harris Corporation Determining quality of service (QoS) routing for mobile AD HOC networks
EP1610503A1 (fr) * 2004-06-25 2005-12-28 Siemens Mobile Communications S.p.A. Contrôle d'acheminement dans des réseaux de communication

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"Definition and assessment of relay based cellular deployment concepts for future radio scenarios considering 1st protocol caracteristics", INTERNET CITATION, 30 June 2005 (2005-06-30), XP002359226, Retrieved from the Internet <URL:https://www.ist-winner.org/DeliverableDocuments/D3-4.pdf> [retrieved on 20051215] *
ALAVI H S ET AL: "A Quality of Service Architecture for IEEE 802.16 Standards", COMMUNICATIONS, 2005 ASIA-PACIFIC CONFERENCE ON PERTH, WESTERN AUSTRALIA 03-05 OCT. 2005, PISCATAWAY, NJ, USA,IEEE, 3 October 2005 (2005-10-03), pages 249 - 253, XP010860780, ISBN: 0-7803-9132-2 *
ANTONIO CAPONE ET AL: "QoS Routing in Multi-hop Wireless Networks: a New Model and Algorithm", INTERNET CITATION, 12 February 2004 (2004-02-12), XP002309068, Retrieved from the Internet <URL:http://www.tlc-networks.polito.it/QoS-IP2005/program.html> [retrieved on 20041201] *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100315956A1 (en) * 2008-02-14 2010-12-16 Panasonic Corporation Radio communication relay device, radio communication base station device, radio communication system, and radio communication method
CN102724014A (zh) * 2011-12-31 2012-10-10 幕福奇 一种树状网络多跳无线通信系统无线帧长自适应调整方法及装置
CN102724014B (zh) * 2011-12-31 2016-11-16 慕福奇 一种树状网络多跳无线通信系统无线帧长自适应调整方法及装置
CN103051553A (zh) * 2013-01-25 2013-04-17 西安电子科技大学 网络流量均衡分割系统及分割方法
CN103051553B (zh) * 2013-01-25 2015-09-02 西安电子科技大学 网络流量均衡分割系统及分割方法

Also Published As

Publication number Publication date
RU2009119995A (ru) 2010-12-10
RU2444852C2 (ru) 2012-03-10
DE602007009556D1 (de) 2010-11-11
CN101554076A (zh) 2009-10-07
EP2078389B1 (fr) 2010-09-29
EP1916808A1 (fr) 2008-04-30
ATE483343T1 (de) 2010-10-15
CN101554076B (zh) 2013-01-16
US8811297B2 (en) 2014-08-19
EP2078389A1 (fr) 2009-07-15
ES2353565T3 (es) 2011-03-03
US20100128680A1 (en) 2010-05-27

Similar Documents

Publication Publication Date Title
US8811297B2 (en) Method of connection based scheduling with differentiated service support for multi-hop wireless network
RU2420038C2 (ru) Способ управления доступом к беспроводному каналу tdma из узлов сети линейной или древовидной топологии
US7894388B2 (en) Method and apparatus for relay zone bandwidth allocation
Kim et al. Fair and efficient multihop scheduling algorithm for IEEE 802.16 BWA systems
US8027290B2 (en) Methods of jointly assigning resources in a multi-carrier, multi-hop wireless communication system
EP2178328A2 (fr) Procédé de transmission de données dans un réseau maillé
Makarevitch Distributed scheduling for WiMAX mesh network
RU2434345C2 (ru) Способ и узел для обеспечения поддержки качества услуг в ретрансляционных системах связи
Raslan et al. Dynamic bandwidth allocation in fiber-wireless (FiWi) networks
Niyato et al. A radio resource management framework for IEEE 802.16-based OFDM/TDD wireless mesh networks
CN100515115C (zh) 微波存取全球互通系统中带宽竞争的方法
KR100921492B1 (ko) 무선 데이터 통신 시스템의 패킷 스케줄링 방법
Soundararajan et al. A scheduling algorithm for IEEE 802.16 and IEEE 802.11 hybrid networks
Wang et al. A probing process for dynamic resource allocation in fixed broadband wireless access networks
Venkatkumar et al. Multi-user relaying with full frequency reuse for enhanced LTE-GBR coverage
Zhang et al. Reducing signaling overhead and latency of 802.16 j service flow management
Jabbar et al. Directivity with Efficient Routing and Centralized Scheduling Algorithms for WiMAX Based Mesh Networks-ENG
Wang et al. Performance of Wireless Mesh Networks with Centralized Multihop Scheduling for Intelligent Transportation Systems
Seth et al. End-to-end optimal scheduling scheme for multi-hop IEEE 802.16 j (WiMAX) networks
Manickam et al. An instantaneous call admission control using information dissemination for WiMAX mesh networks
Wang et al. Centralized Spatial Reuse Designing for Fixed Multihop Relay Wireless Access Networks
Pabst et al. Combined uplink resource reservation and power control for relay-based OFDMA systems
Bhakthavathsalam Reinforcement of privacy in 802.16 MAC common part sublayer using the principle of circularity.
Wang et al. QoS. Services. in. Wireless. Metropolitan. Area. Networks
Yan et al. Load balancing in integrated optical wireless networks: Algorithms and evaluation

Legal Events

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

Ref document number: 200780039855.3

Country of ref document: CN

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

Ref document number: 07821654

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2007821654

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2686/DELNP/2009

Country of ref document: IN

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2009119995

Country of ref document: RU

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 12312122

Country of ref document: US