Wireless communication method, device and data structure
Abstract
A method of providing wireless communication is disclosed. The method may include providing a number of stations configured for transmitting signals wirelessly over at least one channel and dividing the stations into at least two clusters. The stations within each cluster may operate cooperatively to transmit or receive signals corresponding to the cluster simultaneously.

Term
1 yearto projected expiry
Projected expiry 3 October 2027, counted from filing; an application has no term until it is granted.
- Priority
- Filed
- Published
- Today
- Projected expiry
37 claims: 22 independent, 15 dependent
- 1A method of providing wireless communication, the method comprising:providing a number of stations configured for transmitting signals wirelessly over at least one channel;dividing the stations into at least two clusters, stations within each cluster being configured for operating cooperatively to transmit or receive signals corresponding to the cluster simultaneously.
- 11A method of providing wireless communication, the method comprising:providing a number of stations configured for transmitting signals wirelessly over at least one channel;and dividing the stations into at least two groups, stations within different groups being configured for operating independently to transmit or receive signals over the at least one channel.
- 19A data structure for wireless communication, the data structure comprising:a first data section available for carrying a first set of signals for stations in a first cluster that are configured for operating cooperatively to transmit and receive signals corresponding to the first cluster;a second data section following the first data section, the second data section being available for carrying a second set of signals for stations in a second cluster that are configured for operating cooperatively to transmit and receive signals corresponding to the second cluster, wherein the first data section and second data section occupy two distinctive time intervals.
- 24The data structure of one of claims 20 to 23, wherein the second data section is available for carrying a fourth set of signals for stations in a fourth cluster that are configured for operating cooperatively to transmit and receive signals corresponding to the fourth cluster, at least one station in the second cluster and at least one station in the fourth cluster belonging to a second group, the second group including stations configured for operating independently to transmit cluster-dependent signals over the channel.
- 30A wireless communication device comprising:a first station coupled with at least one second station, the first and second stations being within a first cluster, wherein the stations within the first cluster are configured to operate cooperatively to transmit or receive signals corresponding to the cluster over at least one channel and at least one of the stations transmits only data signals without transmitting at least one of a preamble and a MAP message.
Independent claims22
33 paragraphs in 5 sections, as filed
FIELD OF INVENTION
0001The application relates to wireless communication systems and methods of providing wireless communication, more particularly, to wireless communication systems, methods and related data structure.
BACKGROUND
0002Communication systems, such as wireless communication systems, provide one or more communication networks that allow user terminals or mobile stations (users) to move within the network without losing the ability to continue or have communication with the network. To provide a network, a wireless communication relies on stations to transmit signals to users. However, each station has limited coverage due to the limitation on signal strength and the fact the signal strength degrades over distance. As the distance between users and stations increases, the strength of the signal received becomes lower and the transmission quality becomes lower. Additionally, signal quality and coverage may be affected by factors such as physical structures, signal interference, weather, transmission conditions, formats, etc. Therefore, coverage gaps or "holes" may exist and users in those areas may have limited or no network access.
0003One solution to avoid or reduce coverage holes is to provide more base stations to enhance the communication coverage and system capacity. However, system cost increases as the number of stations increases. As an alternative solution, a communication network may rely on relay stations, such as those implementing the concept of multi-hop relaying (MR). However, in some applications, the use of relaying stations may increase the need for station-to-station handovers and may require increased process overhead for handovers due to limited coverage areas of each relay station. In some applications, it also may reduce the spectrum efficiency because multiple transmissions are needed for multi-hop relays.
SUMMARY OF INVENTION
0004Examples consistent with the present invention may provide methods for providing wireless communication through clustering of stations.
0005One example provides a method of providing wireless communication. The method includes providing a number of stations configured for transmitting signals wirelessly over at least one channel and dividing the stations into at least two clusters. The stations within each cluster may operate cooperatively to transmit or receive signals corresponding to the cluster.
0006Another example provides a method of providing wireless communication. The method includes providing a number of stations configured for transmitting signals wirelessly over at least one channel and dividing the stations into at least two groups. The stations in different groups may operating independent of each other to transmit or receive signals over the at least one channel.
0007Still another example provides a data structure for wireless communication. The data structure includes a first data section available for carrying a first set of signals for stations in a first cluster. The stations in the first cluster are configured for operating cooperatively to transmit and receive signals corresponding to the first cluster. The data structure also includes a second data section that may follow the first data section. The second data section is available for carrying a second set of signals for stations in a second cluster that may operate cooperatively to transmit and receive signals corresponding to the second cluster. The first data section and second data section may occupy two distinctive time intervals.
0008Another example provides a method of providing wireless communication. The method includes providing a number of stations configured for transmitting signals wirelessly over at least one channel and dividing the stations into at least one cluster. The stations within each cluster may operate cooperatively to transmit or receive signals corresponding to the cluster simultaneously. At least one of the stations may transmit only data signals without transmitting a preamble, a MAP message, or both.
0009Still another example provides a first station. The first station is coupled with a second station. The first and second stations are within a first cluster. The stations within the first cluster are configured to operate cooperatively to transmit or receive signals corresponding to the cluster over at least one channel. One of the stations transmits only data signals without transmitting a preamble or a MAP message.
BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS
0010The foregoing summary, as well as the following detailed description of the invention, will be better understood when read in conjunction with the appended drawings.
0011In the drawings:
0012FIG. 1 is an exemplary data structure in the prior art;
0013FIG. 2 is an exemplary data structure for MR-enabled mode without applying a clustering process;
0014FIG. 3 a is an exemplary clustering process;
0015FIG. 3b is another exemplary clustering process;
0016FIG. 4 is an exemplary data structure for MR-enabled mode with exemplary clustering implemented;
0017FIG. 5 is an exemplary clustering and grouping process;
0018FIG. 6 is an exemplary data structure for MR-enabled mode with exemplary clustering and grouping implemented.
DETAILED DESCRIPTION OF THE INVENTION
0019Examples of the invention may provide a method applicable to wireless communications and data structures applicable to wireless communications. In some examples, a method may include classifying stations, such as control stations, base stations, relay stations or mobile stations, into different clusters and groups. With clustering and grouping, the frequency spectrum may be used or reused to increase the bandwidth efficiency. Also the number of station-to-station handovers may be reduced. In some examples, cooperative transmission services or mechanisms may be used for stations in the same cluster. In some applications, examples of the invention may enhance network coverage and/or improve data throughput of a wireless network. Specifically, examples of the invention may provide one or more advantages in certain applications, such as increasing the utilization of radio resources, reducing the significant overhead needed by frequent handover processes, allowing frequency or channel reuse and supporting cooperative transmission services. As a result, a communication network with improved system capacity may be provided. In particular, methods or data structures illustrated below may be implemented in systems supporting multi-hop relaying (''MR") techniques.
0020A conventional channel grouping system or method may group terminals or nodes based on radio signal strength, as this may allow each node in a group to receive same or similar quality or strength of signals and provide same or similar quality of service. Examples of the present invention may divide stations into groups so that the stations in the same group can avoid or reduce interference among those stations. Also stations may be divided into clusters so that the stations in the same cluster may provide cooperative transmission services. In some examples, flexibilities may be provided to enable broad and flexible grouping and clustering, so that adjustments may be made to achieve one or more of various goals, such as system capacity and diversity in signals.
0021Some communication systems use techniques involving multiple antennas and certain pre-coding or coding techniques. Such systems may transmit various signals between groups of nodes or stations at the same time. Within a group, user terminals or mobile stations (users) may recognize the desired signals from the mixed or hybrid signals with co-channel interference and repeat the radio signal using a beam-forming technology by coordinating the transmission of the nodes in the same group. Examples of the invention may enable signal relay by redesigning the data structure and transmitting relayed signals in different frequency and time by scheduling techniques. In other words, relaying signals through multiple antennas may be avoided. Clustering in some examples may also extend service coverage and decrease the number of handovers.
0022Some other communication systems use path selection techniques. Each path may include one relay link between a base station and a relay station and one radio access link between a relay station and a user. By using steps such as tracking, forwarding, deciding and executing, one or more transmission paths available for transmitting signals from a base station to a user may be selected and an active set may be provided to provide information of the available paths for users. The information may be updated over time and several paths may be available at the same time to transmit the same data by cooperative transmission.
0023In examples of the present invention, stations belonging to the same cluster may operate cooperatively, such as by transmitting and receiving the same set of signals or data simultaneously. Additionally, stations belonging to the same group may reuse channels, which are usually provided within a frequency spectrum, to operate independently. In addition, a multi-hop relay data structure may be designed based on the concept of clustering and grouping to support radio resources allocation, and in some cases, to support data transmission for multi-hop relay services. In one example, some stations in the cluster may transmit only data signals without transmitting a preamble or a MAP message.
0024As an example, stations such as relay stations may be used by a wireless communication system to enhance the service coverage and/or increase the user throughput. In one example, an IEEE 802.16e system may be used to illustrate methods of applying clustering and grouping to a wireless communication system, such as an MR-enabled system. Such a system may be backward compatible with IEEE 802.16 systems or may be compatible with other systems to support radio resource allocations and data transmission.
0025FIG. 1 illustrates an example of the data structure under an IEEE 802.16e PMP (point-to-multipoint) mode. A base station, used intermittently as a control station for associated relay stations, may transmit the preamble first to provide a reference for a subscribe station (SS) synchronization, which may include adjusting the timing offset, frequency offset, and/or power. In one example, a subscribe station is a station that follows the indication of a base station to transmit and receive data. Next to the preamble, information such as an FCH (Frame Control Header), a DL-MAP (downlink MAP) message, and/or a UL-MAP (uplink-MAP) message may be transmitted to provide certain information of a transmitted frame. In one example, The DL-MAP message and UL-MAP message may indicate the resource allocation of the frame. After the subscribe station decodes these messages, time slot and frequency assignments may be determined or allocated for receiving and/or transmitting data.
0026In one example of an MR system, relay stations may play two roles of base stations and subscribe stations. A base station may support downlink synchronization with relay stations and subscribe stations that are directly coupled with the base station and provide DL-MAP message and UL-MAP message to indicate resource allocation for relay stations and subscribe stations. In this case, relay stations may work in the same way as subscribe stations. On the other hand, a subscribe station that is coupled to a relay station may get the synchronization and allocation information from the relay station without going through the base station. In this example, the relay station may work like or as a base station. Therefore, in some examples of an MR-enabled system, the data structure may include a base-station preamble, base-station MAP message, relay-station preamble, and relay-station MAP message to be compatible with IEEE 802.16e and support MR techniques.
0027A simple way to achieve backward compatibility is to conduct time division in the data structure. FIG. 2 illustrates an example of a data structure where time division is applied to a communication network with one base station (BS) and two relay stations (RSs). A simple time division implementation may allow the base station and the two relay stations (RS1 and RS2) to transmit their own data, such as packets and control overhead, at different times. However, as the number of relay stations increases, the overhead needed for the preamble and MAP message also increases. Additionally, if the users of the communication network move frequently, such as among various relay stations, handovers may occur frequently to synchronize each user with different relay stations, which may include PHY (physical) level adjustments. This technique may reduce the system performance of an MR-enabled system.
0028Examples of the invention may apply a clustering process and may provide a different data structure. FIG. 3a illustrates an example of a clustering process where a MR base station itself may be placed in one cluster, cluster 1, and relay stations may be divided into two or more clusters, such as cluster 2 (with RS and RS2) and cluster 3 (with RS3 and RS4) as illustrated. Cluster 1, cluster 2 and cluster 3 may be considered as a virtual group. With a MR base station included in the virtual group, relay stations function as transparent stations to mobile stations. All the relay stations within the same group either transmit the same set of signal information as that of the MR base station or may not transmit any signal information. The signal information may include the preamble, FCH and MAP message. The radio resources therefore may be shared by the base station and all the relay stations within the same group for data burst transmission. A cooperative service also allows the stations in the same cluster simultaneously to transmit and/or receive the same set of signal information. For users in this cluster, stations, such as one or more of base stations and relay stations, in the same cluster may provide the same preamble to provide users with synchronized signals in a multi-path manner. In other words, users may see signals coming from two or more stations as a combined signal coming from a station through multi-path transmission. Therefore, for stations in the same cluster, they may share the allocated radio resources and schedule the data transmission accordingly, such as in a sequential order. As a result, in one example, only one MAP message in a cluster is transmitted from all stations to indicate the scheduling for data transmission.
0029FIG. 3b illustrates an example of a clustering process applied to a plurality of relay stations in a group where no base station is included in the group. In the absence of a MR base station, one of the relay stations may become a group header of the group and may be non-transparent to mobile stations. As shown in FIG. 3b, one relay station, e.g. RS0 as a group header acting as a base station is placed in cluster 1. In this embodiment, RS0 is non-transparent to mobile stations. Other relay stations may be divided into two or more clusters, e.g. cluster 2 (with RS 1 and RS2) and cluster 3 (with RS3 and RS4). Cluster1, cluster 2 and cluster 3 are considered as a group without MR base station. All the relay stations within the same group may either transmit the same set of signal information as that of the non-transparent group header or may not transmit any signal information. The signal information may include the preamble, FCH and MAP message. The radio resources therefore may be shared by all the relay stations within the same group for data burst transmission. The group header may transmit the preamble, FCH and MAP message to mobile station and may be recognized as an ordinary base station by a mobile station. Using this clustering process, the group is transparent to its mobile station (s).
0030FIG. 4 illustrates a data structure according to one example of the invention. Referring to FIG. 4, all stations in the same cluster (Cluster 1) may transmit the same preamble and MAP message at the same time. This may avoid the need to transfer multiple control signals, such as in FIG. 2. Compared to FIG. 2, the data structure in FIG. 4 may improve the utilization of radio resources available for transmitting signals. In some examples, using the same preamble may also avoid the need for users or stations to perform handover processes frequently. In FIG. 4, R may represent a ranging channel in which a subscribe station can transmit a request to a base station in a content-based manner in one example. In some examples of the invention, a base station and associated relay station or stations may be placed in a single cluster of a wireless communication system, such as an MR-enabled system. This may reduce the amount of control signals or control signal overhead needed, thereby providing effective utilization of radio resources.
0031If all of the stations in a network share the common resources carrying the same signals or contents, the limited bandwidth of one channel limits the amount of data that can be transferred. In other words, there is no frequency or bandwidth reuse to better utilize the available bandwidth. In one example of the present invention, the size of or the number of stations in a cluster may be reduced. Also, stations that are interference-free or that have limited signal interference among themselves may be placed in one group. FIG. 5 illustrates an example of grouping clusters or stations together according to the level of interferences among clusters or stations. In particular, two or more clusters that do not interfere or significantly interfere with each other may be grouped together in one group. Also, two or more clusters that interfere with each other may be placed in different groups.
0032In one example of the invention, different clusters in the same group may transmit cluster-dependent signals, such as cluster-dependent control signals and user data, which may differ from cluster to cluster. Due to the nature of the grouping illustrated above, the cluster-dependent signals from different clusters do not or rarely interfere with each other. Therefore, more than one set of data or signals may be transmitted simultaneously to provide better bandwidth usage. FIG. 6 illustrates an exemplary data structure that can be designed based on this concept. Referring to FIG. 6, resources allocated to a group may be used independently by all other clusters in the same group. In other words, stations of different clusters but of the same group may reuse the same channel or the same bandwidth to transfer different sets of data or signals. In some examples, techniques combining clustering and grouping may reduce frequent handovers and/or improve the utilization of radio resources.
0033It will be appreciated by those skilled in the art that changes could be made to the examples described above without departing from the broad inventive concept thereof. It is understood, therefore, that this invention is not limited to the particular examples or embodiments disclosed, but it is intended to cover modifications within the spirit and scope of the present invention as defined by the appended claims.
Contents5
8 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| JP2009260967A | Cited by | Japan | Examiner |
| EP1073297A2 | Cites | European Patent Office (EPO) | Applicant |
| EP1370024A2 | Cites | European Patent Office (EPO) | Search report |
| US2003123404A1 | Cites | United States of America | Search report |
| US2005232183A1 | Cites | United States of America | Search report |
| WO2006120669A2 | Cites | World Intellectual Property Organization (WIPO) | Search report |
15 members in 6 offices; this record represents the family
Priority claims6
| Document | Office | Kind | Date |
|---|---|---|---|
| 828132P | United States of America | – | |
| 82813206 | United States of America | P | |
| 864705 | United States of America | – | |
| 864739 | United States of America | – | |
| 86470507 | United States of America | A | |
| 86473907 | United States of America | A |
Members15
| Document | Office | Kind | |
|---|---|---|---|
| EP1909441A2This record | European Patent Office (EPO) | A2 | |
| KR20080031652A | Republic of Korea | A | |
| US2008084892A1 | United States of America | A1 | |
| US2008085677A1 | United States of America | A1 | |
| TW200818955A | Taiwan Province of China | A | |
| JP2008092580A | Japan | A | |
| CN101166058A | China | A | |
| KR100952653B1 | Republic of Korea | B1 | |
| EP1909441A3 | European Patent Office (EPO) | A3 | |
| US7965985B2 | United States of America | B2 | |
| TWI352550B | Taiwan Province of China | B | |
| US8203994B2 | United States of America | B2 | |
| JP5191202B2 | Japan | B2 | |
| CN101166058B | China | B | |
| EP1909441B1 | European Patent Office (EPO) | B1 |
66 legal events, as 10 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Notification of lapseLapsedST | ST | FR | |
| Patent lapsedLapsedMM4A | MM4A | IE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent ceasedCeasedPL | PL | CH | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filedOpposition26N | 26N | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Invalidated european patentMG4D | MG4D | LT | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Discontinued in the netherlands as no translation has been filedVDEP | VDEP | NL | |
| Deletion acc. to par. 5 (withdrawal of the translation of the ep patent)MK05 | MK05 | AT | |
| Discontinued in the netherlands as no translation has been filedVDEP | VDEP | NL | |
| Translation of granted ep patentGrantedTRGR | TRGR | SE | |
| Dpma publication of mentioned ep patent grantGrantedR096 | R096 | DE | |
| Reference to at number (ep patent validated in austria)REF | REF | AT | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| European patent takes effect as a national patent in ch/liEP | EP | CH | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Intention to grant announcedINTG | INTG | EP | |
| Party data changed (applicant data changed or rights of an application transferred)RAP1 | RAP1 | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Designation fees paidAKX | AKX | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Search report despatchedORIGINAL CODE: 0009013PUAL | PUAL | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 1909441
- Application
- 70193883
Titles3
- German
- Drahtlose Kommunikationssysteme und -verfahren sowie Datenstruktur
- English
- Wireless communication systems, methods, and data structure
- French
- Systèmes, procédés de communication sans fil et structure de données
Classification
- CPC, 10
- H04W16/26
- H04W40/16
- H04B7/15592
- H04B7/2606
- H04W4/08
- H04W84/047
- H04W72/23
- H04W40/22
- H04W40/32
- H04W88/04
- IPC, 5
- H04L12 56
- H04W4 08
- H04W16 26
- H04W72 04
- H04W84 04
Designated states37
- Contracting states, 32
- Austria
- Belgium
- Bulgaria
- Switzerland
- Cyprus
- Czechia
- Germany
- Denmark
- Estonia
- Spain
- Finland
- France
- United Kingdom
- Greece
- Hungary
- Ireland
- Iceland
- Italy
- Liechtenstein
- Lithuania
- Luxembourg
- Latvia
- Monaco
- Malta
and 8 moreShow fewer
- Netherlands (Kingdom of the)
- Poland
- Portugal
- Romania
- Sweden
- Slovenia
- Slovakia
- Türkiye
- Extension states, 5
- Albania
- Bosnia and Herzegovina
- Croatia
- North Macedonia
- Serbia