WO2009069047A1 - Structure de files d'attente de transmission basées sur des liaisons pour des réseaux sans fil - Google Patents

Structure de files d'attente de transmission basées sur des liaisons pour des réseaux sans fil Download PDF

Info

Publication number
WO2009069047A1
WO2009069047A1 PCT/IB2008/054882 IB2008054882W WO2009069047A1 WO 2009069047 A1 WO2009069047 A1 WO 2009069047A1 IB 2008054882 W IB2008054882 W IB 2008054882W WO 2009069047 A1 WO2009069047 A1 WO 2009069047A1
Authority
WO
WIPO (PCT)
Prior art keywords
queues
transmission
queue
respective transmission
transmission links
Prior art date
Application number
PCT/IB2008/054882
Other languages
English (en)
Inventor
Hans J. Reumerman
Yunpeng Zang
Lothar Stibor
Bernard Walke
Hui Chen
Original Assignee
Koninklijke Philips Electronics N.V.
Philips Intellectual Property & Standards Gmbh
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 Koninklijke Philips Electronics N.V., Philips Intellectual Property & Standards Gmbh filed Critical Koninklijke Philips Electronics N.V.
Publication of WO2009069047A1 publication Critical patent/WO2009069047A1/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/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/621—Individual queue per connection or flow, e.g. per VC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/60—Queue scheduling implementing hierarchical scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/6215—Individual queue per QOS, rate or priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage

Definitions

  • the present invention generally relates to an apparatus, a control method, a transmitter device and a computer program product for transmitting data to a wireless mobile unit.
  • QoS quality of service
  • WLAN wireless local area network
  • WAVE Wireless Access in Vehicular Environments
  • a reason is that the structure of a transmission queue used in the transmission protocol, e.g. current WAVE Medium Access Control (MAC) protocol, cannot efficiently deal with link changes caused by the high mobility of vehicles.
  • QoS support is a crucial design aspect for vehicular communication systems, e.g. vehicular ad-hoc Networks (VANET) such as the WAVE system, in which two-fold QoS supports may be defined:
  • VANET vehicular ad-hoc Networks
  • safety applications should always have a higher priority than non-safety applications, due to their requirements on high reliability and low latency communications for disseminating safety messages.
  • this is realized through a synchronized channel coordination scheme on the basis of multiple frequency channels.
  • two classes of frequency channels may be defined. At least one control channel (CCH) which may be exclusively used by high priority safety applications and system control messages, and at least one service channel (SCH) which may be allocated to non-safety applications. All WAVE devices may be synchronized to a global time basis, e.g. the Universally Coordinated Time (UTC), and may have to monitor the CCH during common CCH time intervals.
  • UTC Universally Coordinated Time
  • Fig. 1 shows an exemplary schematic diagram indicating a synchronization pattern 4 with a synchronization interval 3 (e.g. Sync Interval) which is formed by an alternation of a CCH interval 1 and an SCH interval 2.
  • a synchronization interval 3 e.g. Sync Interval
  • high priority safety applications can be physically separated from non-safety applications.
  • different channel access priorities may be allocated to different applications.
  • the current WAVE MAC protocol follows an enhanced distributed channel access (EDCA) mechanism, such as the EDCA mechanism specified in the IEEE 802.1 Ie specification for providing multiple channel access priorities.
  • a total of eight user priority levels can be mapped to four access categories (ACs), where each access category corresponds to one transmission queue.
  • ACs access categories
  • Fig. 2 shows a schematic block diagram of a transmit control structure or arrangement, where transmission data is processed in a link layer control unit 41 and then supplied to a channel router 42 which is adapted to separate the transmission data in accordance with the desired transmission channel, e.g., CCH for WAVE service advertisement (WSA) data or SCH for WSA or Internet protocol (IP) data, and to supply the data to a CCH processing unit 43 and to an SCH processing unit 44, respectively.
  • the CCH and SCH processing units 43, 44 supply their channel data to respective buffer units 45 which comprise one transmission queue per access category (AC).
  • each transmission queue provided in the respective buffer units 45 has its own backoff entity 46 that counts the probability of getting access to a channel.
  • All backoff entities 46 work independently from each other. Different parameter settings of different backoff entities statistically differentiate the probabilities of queues trying to get access to the channel. These parameter settings may comprise at least one of an arbitration inter- frame space (AIFS) setting, a contention window (CW) setting, and a transmission opportunity (TXOP) setting, which may all depend on the access category allocated to the respective transmission queue, As shown in Fig. 2, internal contention resolution units 47 employ an internal contention resolution scheme for resolving possible collisions, when multiple transmission queues residing in one physical device try to get access to the channel at the same time. The queue with higher priority (i.e. access category) can win the opportunity for transmission against the one with lower priority.
  • AIFS arbitration inter- frame space
  • CW contention window
  • TXOP transmission opportunity
  • a channel selector 48 selects the desired channel based on the outputs of the internal contention resolution unit 47 and initiates a transmission attempt 49.
  • management data may be supplied to the channel selector 48 from a management queue 40.
  • ACs access categories
  • packets with the same AC will be put into the same queue regardless of the receiver of each packet, as they all have the same priority.
  • one transmission queue per channel type e.g. CCH or SCH is allocated to every access category.
  • the retransmission does not help, when the link failure is caused by the mobility, i.e., the receiver is leaving the transmitter and is no longer within the transmission range of the transmitter.
  • the channel resource is wasted and all following packets in the same queue are blocked, even if they are addressing other receivers which are still within the communication range.
  • Fig. 3 illustrate the problem in more detail.
  • On board units (OBUs) on vehicles 50, 51 try to access the Internet through a road ride unit (RSU) 52.
  • RSU road ride unit
  • a unicast link between each OBU and the RSU 52 is established for supporting this service.
  • the RSU 52 On CCH, the RSU 52 has to broadcast a WSA packet periodically in each CCH interval.
  • a specific service request will be sent by the OBU of the first user to the RSU 52 for initiating a unicast data transmission from the RSU 52 to the OBU on the first vehicle 51 in the following SCH intervals.
  • the OBU on the second vehicle 50 After a short period, due to the mobility of the second vehicle 50, the OBU on the second vehicle 50 reaches the transmission range of the RSU 52 and carries out the same procedures to initiate the same service from the RSU 52.
  • the packets from the RSU 52 to the OBU on the second vehicle 50 have the same AC as the ones to the OBU on the first vehicle 51 , as they are of the same service.
  • a link-based transmission queue structure and control scheme are provided, which could be implemented separately or as extensions to the current transmission protocols, such as the WAVE MAC protocol. More than one unique transmission queue is allocated to a specific access category. The unique transmission queues may be allocated to different transmission links, wherein at least one transmission link is allocated to one unique transmission queue. Thereby, efficiency is improved in cases where many transmission links of the same category are handled by one transmitter apparatus, e.g., RSU. Namely, active links are allocated to available transmission queues of the buffer unit. If all available transmission queues have been allocated and new transmission links have to be established, it is started to share transmission queues by two or more links. In such sub-optimal cases, still an increase in efficiency can be obtained.
  • the proposed solution enables QoS support with an accent on dealing with users with low offered load and strict delay requirements in wireless networks, such as multiple input multiple output (MIMO) networks, while keeping at the same time high throughput for other users.
  • MIMO multiple input multiple output
  • each unique transmission queue is allocated to one transmission link. If all available transmission queues per access category have been used up, no further transmission links can be established and service requests are rejected. In this example, each unique transmission queue is thus never shared with other links. In this way queues can be controlled independently according to the status of each link.
  • a transmission queue can be created when a new link is established for a unicast transmission. Packets of this link are buffered in its private queue. A queue of a unicast link can be identified by the receiver and the access category of the packets.
  • all queues for the SCH at the transmitter could be suspended at the starting point of a CCH Interval and resumed again when an SCH interval begins and a request of service from the user is received again.
  • the service provider will notice it in time by missing the service request from this user and can thus avoid transmitting obsolete packets to it.
  • a transmission queue can be suspended, deleted, dropped or destroyed and optionally all packets can be discarded if a service request has not been received from the corresponding service user for a predefined time period, e.g. a predetermined number of consecutive synchronization intervals.
  • contention resolution could be extended to support two levels.
  • another level of contention resolution may be introduced for resolving the contention among multiple queues with the same access category.
  • a mechanism of arbitration can be applied for determining the winner of the contention. For example, depending on the creation time of the queues, the queue which has been created or established earlier wins the contention.
  • the present invention can be implemented as a computer program product which comprises code means for performing the steps of the above method when run on a computer or computing device, module, or chip provided at the transmitter apparatus.
  • Fig. 1 shows a schematic diagram of a synchronization pattern which can be used in the embodiment
  • Fig. 2 shows a schematic block diagram of a conventional transmission control structure for prioritized channel access
  • FIG. 3 shows diagrams of a scenario which leads to an obsolete packet problem in the conventional control structure
  • Fig. 4 shows a schematic diagram of a link based transmission control structure according to the embodiment
  • Fig. 5 shows an example of a software-based implementation of the embodiment.
  • a set of queues for a single channel e.g. the SCH
  • the invention applies to both sets of queues for CCH and SCH, or to any number of channels of any type.
  • Fig. 4 shows a schematic block diagram of a link based transmission control structure according to the embodiment.
  • a new queue structure is shown for SCH as an exemplary channel, where each transmission queue has two attributes: AC and link ID (LID).
  • AC may be the same as initially described in connection with the current WAVE MAC protocol, while LID identifies to which transmission link this queue is associated or allocated.
  • LID link ID
  • the same queue structure can be used as well for the CCH access structure.
  • channel data is processed in a link layer control unit 26 and then supplied to a MAC based transmission control unit 22 which is adapted to separate the transmission data of the concerned channel, e.g. SCH.
  • the channel data is then supplied by the transmission control unit 22 to the respective buffer unit 21 which comprises several transmission queues per access category (AC).
  • An LID which identifies an associated transmission link is allocated to each transmission queue.
  • each transmission queue provided in the buffer unit 21 has its own backoff entity that counts the probability of getting access to a channel. All backoff entities work independently from each other. Different parameter settings of different backoff entities statistically differentiate the probabilities of queues trying to get access to the channel. These parameter settings may comprise at least one of an arbitration inter- frame space (AIFS) setting, a contention window (CW) setting, and a transmission opportunity (TXOP) setting, which may all depend on the access category allocated to the respective transmission queue,
  • AIFS arbitration inter- frame space
  • CW contention window
  • TXOP transmission opportunity
  • a first internal contention resolution unit 24 employs an internal contention resolution scheme for resolving possible collisions, when multiple transmission queues residing in one physical device try to get access to the channel at the same time.
  • the queue with higher priority i.e. access category
  • the multi-transmission queue and backoff entity structure and the internal contention resolution mechanism allow traffics with higher priority to have higher probability of getting the channel resource than the ones with lower priorities.
  • a second internal contention resolution unit 23 may be introduced for resolving the contention among multiple queues with the same access category.
  • a mechanism of arbitration can be applied for determining the winner of the contention. For example, depending on the creation time of the queues, the queue which has been created or established earlier wins the contention. Of course, any other arbitration mechanism could be used in the second internal contention resolution unit 23.
  • a channel selector functionality (not shown) of the transmission control unit 22 may select the desired channel based on the output of the second internal contention resolution unit 23 and initiates a transmission attempt towards a physical layer control unit 25.
  • a transmission queue of the buffer unit 21 can be created by the transmission control unit 22 when a new link is established for a unicast transmission. Packets of this link are buffered in its private queue.
  • a queue of a unicast link can be identified by the receiver or LID and the access category (AC) of the packets. According to the synchronized scheme described initially, all queues for the SCH at the transmitter could be suspended at the starting point of a CCH interval and resumed again when an SCH interval begins and a request of service from the user is received again.
  • the transmission control unit 22 assumes that the respective service user has left the transmission range.
  • the queue and the corresponding backoff entity can then be suspended. They can be resumed again by the transmission control unit 22, when a service request is received from the service user within a predefined period of time, e.g. a predetermined number of synchronization intervals.
  • the transmission control unit 22 can be adapted to suspend, delete, drop or destroy a transmission queue and optionally to discard all packets, if a service request has not been received from the corresponding service user for a predefined time period, e.g. a predetermined number of consecutive synchronization intervals.
  • the proposed transmission device 200 comprises a processing unit 210, which may be provided on a single chip or a chip module and which may be any processor or computer device with a control unit which performs control based on software routines of a control program stored in a memory 212.
  • Program code instructions are fetched from the memory 212 and are loaded to the control unit of the processing unit 210 in order to perform the processing steps of the above functionalities described in connection with Fig. 4.
  • the processing steps of blocks 21, 23 and 24 may be performed on the basis of input data DI and may generate output data DO, wherein the input data DI may correspond to data blocks to be queued for transmission and the output data DO may correspond to data blocks scheduled for transmission by the physical layer control unit 25.
  • an apparatus, a method and a computer program product for controlling transmission of data to at least one receiving unit have been described, wherein at least two queues are provided per channel for storing data packets of a predetermined access category of respective transmission links to the at least one receiving unit.
  • the at least two queues are allocated to different ones of the respective transmission links, and data packets to be transmitted via the respective transmission links are stored in the at least two queues based on the allocation.
  • the invention is not restricted to high-mobility vehicular environments, in an effort to solve the problem brought by the high mobility of the vehicles. It applies for all wireless networks, such as wireless ad-hoc networks or wireless mesh networks with changing network topology, which utilize contention based channel access with QoS support, e.g. WAVE and IEEE 802.i l WLAN.
  • the invention is also applicable to all wireless networks implementing MIMO technologies. It is especially interesting for small office or home office (SO-HO) scenarios, with the network traffic composed of applications with different delay and throughput requirements, where QoS support is necessary for a successful operation.
  • SO-HO small office or home office
  • the invention might also be applied to wired networks, provided that they implement MIMO technologies in some way. It might even be contemplated to apply the invention to other kinds of networks.
  • a computer program may be stored/distributed on a suitable medium, such as an optical storage medium or a solid-state medium supplied together with or as part of other hardware, but may also be distributed in other forms, such as via the Internet or other wired or wireless telecommunication systems. Any reference signs in the claims should not be construed as limiting the scope thereof.

Landscapes

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

Abstract

L'invention concerne un dispositif, un procédé et un produit-programme informatique pour commander la transmission de données à au moins une unité de réception, au moins deux files d'attente étant prévues par canal pour stocker les paquets de données d'une catégorie d'accès prédéterminée de liaisons de transmission respectives vers la ou les unités de réception. Les deux files d'attente ou plus sont attribuées à des liaisons différentes parmi les liaisons de transmission respectives, et les paquets de données à transmettre par l'intermédiaire des liaisons de transmission respectives sont stockés dans les deux files d'attente ou plus sur la base de l'attribution.
PCT/IB2008/054882 2007-11-26 2008-11-20 Structure de files d'attente de transmission basées sur des liaisons pour des réseaux sans fil WO2009069047A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP07121517 2007-11-26
EP07121517.2 2007-11-26

Publications (1)

Publication Number Publication Date
WO2009069047A1 true WO2009069047A1 (fr) 2009-06-04

Family

ID=40263584

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2008/054882 WO2009069047A1 (fr) 2007-11-26 2008-11-20 Structure de files d'attente de transmission basées sur des liaisons pour des réseaux sans fil

Country Status (2)

Country Link
TW (1) TW200943833A (fr)
WO (1) WO2009069047A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102724764A (zh) * 2012-06-27 2012-10-10 电子科技大学 用于车载无线自组织网络的自适应mac协议
KR101565707B1 (ko) 2014-08-26 2015-11-03 경북대학교 산학협력단 차량 단말기의 데이터 송수신 방법
EP3557803A4 (fr) * 2016-12-14 2020-08-12 LG Electronics Inc. -1- Appareil et procédé de communication v2x
WO2020182688A1 (fr) * 2019-03-08 2020-09-17 Canon Kabushiki Kaisha Gestion de réduction de puissance pour transmission prioritaire intra-file d'attente dans des réseaux de communication

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050089064A1 (en) * 1999-05-21 2005-04-28 Ofer Zimmerman Method and apparatus for bandwidth request/grant protocols in a wireless communication system
US20050237984A1 (en) * 2004-04-21 2005-10-27 Mathilde Benveniste Organization of automatic power save delivery buffers at an access point
US20060268716A1 (en) * 2005-05-26 2006-11-30 Wijting Carl S Traffic prioritization techniques for wireless networks

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050089064A1 (en) * 1999-05-21 2005-04-28 Ofer Zimmerman Method and apparatus for bandwidth request/grant protocols in a wireless communication system
US20050237984A1 (en) * 2004-04-21 2005-10-27 Mathilde Benveniste Organization of automatic power save delivery buffers at an access point
US20060268716A1 (en) * 2005-05-26 2006-11-30 Wijting Carl S Traffic prioritization techniques for wireless networks

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
NAKJUNG CHOI* ET AL: "A Solicitation-based IEEE 802.11p MAC Protocol for Roadside to Vehicular Networks", 2007 MOBILE NETWORKING FOR VEHICULAR ENVIRONMENTS, IEEE, PI, 11 May 2007 (2007-05-11), pages 91 - 96, XP031133861, ISBN: 978-1-4244-1690-5 *
OSAMU MAESHIMA ET AL: "A Roadside-to-vehicle Communication System for Vehicle Safety using Dual Frequency Channels", INTELLIGENT TRANSPORTATION SYSTEMS CONFERENCE, 2007. ITSC 2007. IEEE, IEEE, PI, 1 September 2007 (2007-09-01), pages 349 - 354, XP031151553, ISBN: 978-1-4244-1395-9 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102724764A (zh) * 2012-06-27 2012-10-10 电子科技大学 用于车载无线自组织网络的自适应mac协议
CN102724764B (zh) * 2012-06-27 2014-11-19 电子科技大学 用于车载无线自组织网络的自适应mac协议
KR101565707B1 (ko) 2014-08-26 2015-11-03 경북대학교 산학협력단 차량 단말기의 데이터 송수신 방법
EP3557803A4 (fr) * 2016-12-14 2020-08-12 LG Electronics Inc. -1- Appareil et procédé de communication v2x
US10917835B2 (en) 2016-12-14 2021-02-09 Lg Electronics Inc. Apparatus and method for V2X communication
WO2020182688A1 (fr) * 2019-03-08 2020-09-17 Canon Kabushiki Kaisha Gestion de réduction de puissance pour transmission prioritaire intra-file d'attente dans des réseaux de communication

Also Published As

Publication number Publication date
TW200943833A (en) 2009-10-16

Similar Documents

Publication Publication Date Title
JP6934081B2 (ja) ランダムアクセス性能改善のための基地局支援
EP1430619B1 (fr) Système et procédé mettant en oeuvre des algorithmeset des protocoles permettant les protocoles d'access multiple par détection de porteuse (CSMA) dans des réseaux sans fil
KR100645539B1 (ko) 무선 랜 시스템의 무선 자원 사용 장치 및 방법
CN109219144B (zh) 无线Ad-hoc网络分布式资源分配的方法
Karol et al. Distributed-queueing request update multiple access (DQRUMA) for wireless packet (ATM) networks
KR101484059B1 (ko) 다중 전송 속도 파티셔닝 및 협력 전송을 이용한 고속 무선랜 통신 방법 및 무선랜 통신 장치
Shao et al. A multi-priority supported medium access control in vehicular ad hoc networks
KR20160039659A (ko) 업링크 및 다운링크 송신들의 wlan ofdma 설계를 위한 시스템 및 방법
RU2617717C2 (ru) Устройство и способ для планирования услуги адаптивного предоставления и опроса в системе широкополосного беспроводного доступа
WO2006025658A1 (fr) Procede pour la communication bidirectionnelle entre un dispositif source et un dispositif de destination durant un temps de voie attribue
US8194679B2 (en) System for data transfer in a wireless network
US10582535B2 (en) Contention based access channel signaling
US9756654B2 (en) Timer-based scheme for user equipment queue state estimation
JP4335219B2 (ja) 無線ｌａｎトラヒック優先制御方法及びその装置
WO2018107370A1 (fr) Procédé, appareil et système d'attribution de canal point à multipoint
WO2009069047A1 (fr) Structure de files d'attente de transmission basées sur des liaisons pour des réseaux sans fil
KR101529672B1 (ko) 다중 전송 속도 파티셔닝 및 협력 전송을 이용한 고속 무선랜 통신 방법 및 무선랜 통신 장치
KR101040290B1 (ko) 우선순위 기반의 매체접속방식의 무선 네트워크 시스템, 무선 네트워크 통신 방법
KR100999039B1 (ko) 무선 네트워크 시스템, 무선 네트워크 통신 방법 및 무선 네트워크 통신장치
KR101040218B1 (ko) 무선 개인영역 네트워크에서 주기 음성 데이터 서비스 품질 향상 방법
US7688783B1 (en) Mixing basic service set (BSS) traffic and mesh forwarding traffic
Kim et al. Distributed semi-synchronous channel coordination for multi-channel wireless networks
EP3298840B1 (fr) Support de transactions d'interrogation-réponse par paquets au niveau d'une couche inférieure
JP2004180207A (ja) 通信方法、基地局及び情報機器
KR101565707B1 (ko) 차량 단말기의 데이터 송수신 방법

Legal Events

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

Ref document number: 08853462

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08853462

Country of ref document: EP

Kind code of ref document: A1