WO2001078296A1 - Method for accessing a communication medium - Google Patents
Method for accessing a communication medium Download PDFInfo
- Publication number
- WO2001078296A1 WO2001078296A1 PCT/US2001/010257 US0110257W WO0178296A1 WO 2001078296 A1 WO2001078296 A1 WO 2001078296A1 US 0110257 W US0110257 W US 0110257W WO 0178296 A1 WO0178296 A1 WO 0178296A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- frame
- traffic
- window
- slots
- contention slots
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
- H04W74/0841—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
Definitions
- This invention relates generally to the field of accessing a communication medium. More particularly, certain embodiments of this invention relate to accessing a framed and slotted communication medium such as those complying with MPT1327, Tetra and similar protocols.
- Wireless trunking communication systems utilize two or more communication channels to effect communication between two or more parties.
- One channel is utilized as a control channel which allocates the remaining communication channels to the users.
- the function of this control channel is to set up calls between users .
- a radio user In order to set up a call, a radio user initiates a call setup process by communicating with a central controller via the control channel with a request that a call be set up. The central controller then takes the remaining steps needed to set up the communication on one of the available communication channels.
- the MPT1327 specification is published by the department of trade and industry (DTI) in the U.K. and it details a common signaling standard for land based trunked radio systems operating primarily in the U.K.'s VHF Band III Sub-band 1 & 2. Although this is a U.K. standard, this protocol has become a widely used standard for trunking systems across the world.
- DTI department of trade and industry
- the central system controller communicates with the radios in the system over the control channel using a repeating frame of information.
- the frame contains control information as well as a series of contention slots.
- the contention slots are made available to the radio units for purposes of securing access to the control channel.
- the equipment manuf cturers have freedom to determine how many contention slots are in the frame at any given time subject to this minimum and maximum.
- a radio In order for a radio to place a call request message, it first has to select one of the contention slots on the control channel allocated for call request purposes.
- the contention slot accessed is generally selected randomly so that if several radios are attempting to secure a contention slot, their signals are unlikely to collide.
- collisions become more frequent as the radios attempt to secure use of the same slot. This results in inefficient use of the control channel and delays in securing a call set up.
- This problem is generally addressed by increasing the number of contention slots per frame. This provides more contention slots from which each radio can randomly select, thus, reducing the probability of collision. As a channel becomes less loaded, fewer contention slots are needed to more efficiently use the channel capacity.
- U.S. Patent No. 4,398,289 to Schoute shows one example of a variation in the slotted ALOHA protocol which adjusts the frame length in accordance with the traffic on a channel .
- the technique used in this patent is simulated and compared with standard slotted ALOHA and the present invention at a later point in this document and is referred to as "Load Estimation.”
- Load Estimation There is need for a method for allocating the contention slots in such a system which can operate efficiently and preserve data throughput while minimizing delays . It is advantageous if such method is quickly adaptive, simple to implement and flexible.
- FIG. 1 is a diagram of the control channel frame structure for MPT1327 networks, Tetra networks and similar networks.
- FIG. 2 is a general flow diagram describing the Tree Algorithm which determines the number of contention slots in the next frame based upon the number of contention slots in a current frame, in accordance with an embodiment of the present invention.
- FIG. 3 is a flow chart describing an implementation of the Window Spreading algorithm of an embodiment in accordance with the present invention.
- FIG. 4 is a flow chart of the operation of a radio unit under a system using the Tree Algorithm and the Window Spreading algorithm in accordance with embodiments of the present invention.
- FIG. 5 is a chart of a simulation of throughput comparing an embodiment of the present invention with two other techniques .
- FIG. 6 is a chart of a simulation of delay performance comparing an embodiment of the present invention with two other techniques.
- FIG. 1 there is shown a diagram of the frame structure of a system according to the present invention.
- This structure is also the structure of many systems employing a Random Access Method including MPT1327 and Tetra compliant systems.
- a control slot 20 is allocated in each frame 28 to provide call setups and other outgoing information from the central controller.
- this control slot 20 there is a series of contention slots 24.
- One complete frame is made up of the control slot 20 plus a defined number of contention slots 24 so that a first frame is • shown as 28 and a second frame is shown as 30.
- frame 28 is shown as having So contention slots, wherein So is 50, and frame 30 is shown as having Si contention slots, wherein Si is 51, since the number of slots per frame can vary depending on a number transmitted by the central controller during the control slot.
- the number of contention slots per frame can be adjusted using a very simple and rapidly responding algorithm which is generally described in FIG. 2. According to this algorithm, contention slot 1 is always retained in the frame structure--that is, there is always at least one contention slot per frame. Those of ordinary skill in the art will understand that any number of contention slots could be defined as the minimum number available in a frame without departing from the present invention.
- the algorithm determines if a collision occurred during that contention slot. This can be readily determined for many instances by the central controller on the basis of whether or not the data received during that slot was corrupted, damaged or otherwise mutilated. If the data was corrupted for reasons other than a collision of data from two or more radios attempting to access the same contention slot, it is still considered a collision. The algorithm adapts very quickly and occasional errors in making this determination will not cause significant problems.
- the number of contention slots in each frame is adjusted based upon the number of collisions which occur in the preceding frame.
- the number of contention slots in any frame Sk is given by:
- S( k -i) is the number of contention slots in frame number (k-1) , the frame preceding frame number k, N is an integer, M is the number of contention slots with collisions in frame (k-1) , and
- P is the number of contention slots with no collisions in frame (k-1) .
- this algorithm depends only on the preceding frame to determine how many slots are to be placed on the subsequent frame allows for very fast adaptation of the frame size. Since the number of contention slots depends only on a small sample of information, it is possible that the system can adapt in the wrong direction for average traffic conditions. For example, it is possible for a reduction in the number of contention slots in a subsequent frame when average traffic is actually increasing, and vice versa. The rapid response of this algorithm causes such instantaneous errors to be of little concern since the system will very rapidly adapt to the instantaneous traffic load to correct for this situation very quickly (probably the next frame) .
- an embodiment of the present invention contemplates an enhancement to the above algorithm. This enhancement is described in connection with FIG. 3 and 4 and is referred to hereinafter as a Window Spreading Algorithm.
- the present Window Spreading enhancement involves superimposing a dynamically changing window structure on the frame structure.
- the algorithm described above in connection with FIG. 2 is referred to hereinafter as a Tree Expansion since the number of contention slots can increase like a binary tree.
- the effective number of contention slots available can be increased in this algorithm by superimposing a window structure on the frames to increase the throughput for high traffic loads while maintaining the delay at an acceptable level.
- FIG. 3 generally, when traffic conditions are estimated to be above a certain threshold level (ETH) , the Window Spreading algorithm is enabled. Once the traffic drops below a threshold (TH) , the Window Spreading algorithm is disabled. Two different thresholds are used in this embodiment, but this is not to be limiting.
- each radio unit randomly chooses a frame from the current window. Once the selected frame is established, the radio unit randomly chooses a contention slot from the frame.
- the idea is to provide the radio units with a larger number of contention slots to choose from than the maximum number contemplated by the protocol .
- the probability of collision might sometimes increase, but overall throughput can be maintained while maintaining an acceptable level of delay. This is because the window structure does not affect the waiting period of the individual radio units. If a radio unit is transmitting a request for the first time, it only needs to wait for the beginning of the next frame regardless the number of frames in the actual window. If a radio unit is re- transmitting a request after a collision, it does not need to wait until the end of the present window, it only needs to wait until the beginning of the next frame.
- the system first initializes the frame length (FL) , the number of frames per window (FPW) , the threshold for entering the Window Spreading algorithm (ETH) , the threshold for adding the window spreading algorithm (TH) , the maximum number of frames per window (MFPW) and the minimum number of frames per window (mFPW) .
- the Spread mode (a flag indicating whether or not the system is operating using the Window Spreading algorithm) is initially set as "NO".
- the frame is executed at 104, which means that the central controller sends and synchronizes the contention slots while at the same time the central controller monitors for an incoming call request on the inbound channel .
- the number of frames per window is transmitted in the control word 20 of every frame 28. Also, during the execution of a frame, the controller accounts for slots in which a collision occurs.
- %SPF three numbers for three frames
- the number of slots per frame is decided at 110 using the number of collided slots in the previous frame.
- the controller then starts making contention slots available to the radio units.
- the end of a frame is encountered. If the end of a window has not been processed at 109, control passes to 110 where the number of slots per frame is calculated based upon the Tree Expansion algorithm and the process returns to 104. If at 109, the end of the window has been reached, the number of collided slots per window is computed as a percentage as an indicator of traffic loading at 116. If this number (%SPW) is not greater than or equal to the threshold TH at 120, the number of frames per window FPW is reduced (for example by one) subject to the minimum number of frames mFPW at 124.
- the number of frames per window is increased (for example by one) subject to the maximum number of frames per window MFPW at 130.
- control passes to 136 where the number of frames per window (FPW) is examined and compared with the minimum value (generally 1) . If the number of frames per window is at the minimum, it is an indication that the Spread mode is not needed and the spread mode is set to "NO" at 140. Control then passes back to 110 as before. If the FPW is not equal to the minimum, then control passes directly back to 110.
- the threshold TH is exceeded, the number of windows grows, subject to the maximum.
- the Spread mode is initially entered when three consecutive frames have more than 75% collided frames. The first time through the process after meeting this criteria, the Spread mode is entered at 108.
- TH is set to 50% collided slots per window.
- the number of frames per window will be increased at 130 and the Spread mode will be retained at 136.
- %SPW is not greater than or equal to TH at 120, and the FPW reaches the minimum mFPW at 124, the Spread mode will be exited at 140.
- the above process should appropriately account for startup conditions based upon the particular system parameters and operational parameters selected. For example, a calculation in 105 of percentage of collided contention slots in three consecutive frames is only valid after the first three frames occur. As described briefly above, a simple and practical way of estimating the traffic conditions at the central controller without need for reporting by the radio units is by monitoring the number of collided slots per frame. However, the frame length parameter can also be readily used as a measure of traffic loading for purposes of comparison with TH and/or ETH. As stated previously, most of the algorithms attempt to increase the frame length if previous frames are considered highly congested.
- the central controller can determine if the traffic load is above the overflow point just by averaging the length of previous consecutive frames. No information from the radio units is needed.
- the frame length and number of frames per window and related data are transmitted to the radio units in the control portion of the frame. This enables each radio unit to determine which and how many contention slots are available for use.
- FIG. 4 describes operation of a radio unit under the system described in conjunction with FIGs . 2 and 3.
- the radio unit has a call request ready to transmit to the central controller in order to arrange a call setup.
- the next frame is awaited at 204 where the radio unit then determines at 210 from the control portion of the frame whether the system is in window spreading mode or not, the window size (if in the spreading mode) , and how many contention slots are available in the next frame (note that the number of contention slots can vary from frame to frame) . If the system is in Window Spreading mode (i.e. using the Window Spreading algorithm), the radio unit then identifies the frame as the first frame of a first window and randomly selects a frame from the first window at 216 and awaits the beginning of the selected frame at 220. The radio unit then randomly selects a contention slot from the selected frame at 224 and places the call request data in the selected contention slot.
- Window Spreading mode i.e. using the Window Spreading algorithm
- the radio unit determines whether any frames remain in the first window. If no frames remain, then the radio unit waits for the next frame at 204, and the process continues for a new window that begins at the next frame and has a current window size (CWS) defined in the next frame. If one or more frames remain, then the radio unit waits for the next frame at 232 and randomly selects one of the remaining frames at 216, after which the process continues. (If there is but one frame left, then, of course, the random selection is that frame..
- CWS current window size
- the call request goes through at 236. If, at 210, the system is not in Window Spreading mode, 216 and 220 are bypassed since the window is effectively a window of one frame and the process resumes at 224. Note that each radio counts and keeps track of the window size from the beginning to the first frame it encounters and determines a new window size only after the completion of each current window, so that the windows of one radio unit are not necessarily aligned with those of other radio units or the central controller. )
- Tree Expansion and Window Spreading throughput is shown as 502, while Load Estimation is shown as 504 and slotted ALOHA is shown as 506.
- the criteria used as a threshold for initially entering the Window Spreading algorithm (ETH) was for 75% or more of the slots to be collided in three or more consecutive frames .
- the threshold for incrementing or decrementing the window size (TH) was for 50% or more of the slots in the entire window to be collided. If the number of frames per window drops to the minimum (1 in this example) the Window Spreading mode can be considered exited and the system can be considered as operating only under the Tree Expansion algorithm according to this simulation. Thus, there is a higher threshold for entry into the Window Spreading mode than to exit it.
- Normalized Offered Traffic represents, on average, the inverse of the number of contention slots available for each call request.
- a Normalized Offered Traffic of 1.0 means there is, on average, one contention slot per call request.
- a Normalized Offered Traffic of 0.5 means that there are, on average two contention slots available for each call request, and so on.
- the Offered Traffic was simulated using a Poisson distribution of call requests.
- Delay time for the Tree Expansion and Window Spreading algorithms of the present invention is shown as 602.
- the delay time for Load Estimation is shown as 604 and for slotted ALOHA is shown as 606. While the delay time of the Tree Expansion and Window Spreading algorithms of the present invention is generally longer than that of slotted ALOHA, the delay time, at about 3 time units (e.g. 3 seconds under the simulation parameters for MPT1327 which were used) , remains acceptable for a system of this type while throughput is dramatically improved over slotted ALOHA. Compared with the Load Estimation algorithm, delay is generally better under high traffic conditions while throughput is significantly improved.
- Expansion algorithms of the present invention provides the advantages of reasonable delay and strong improvement in throughput.
- those having ordinary skill in the art will appreciate that either of these algorithms and modifications thereof can be used independently without departing from the present invention.
- the present Tree Spreading algorithm geometrically increases the number of slots for each collided slot, but other variations could be used.
- slots are deleted from subsequent frames if no collision occurs at a particular slot. Variations of this are possible by, for example, deleting a slot for every two slots without collisions. Similar variations in the Window Spreading algorithm are also possible and contemplated by the present invention.
- the above description should only be considered as an example of the type of algorithm that can be applied by using the number of collisions in a slot as a basis for determining frame and window parameters.
- a small number of frames e.g. two to ten
- Such a system would react somewhat slower to changing traffic conditions, but might more accurately characterize the channel loading.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Time-Division Multiplex Systems (AREA)
- Small-Scale Networks (AREA)
- Signal Processing For Digital Recording And Reproducing (AREA)
- Communication Control (AREA)
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
BRPI0105797-9A BRPI0105797B1 (en) | 2000-04-11 | 2001-03-30 | Method used on a central controller of a communication system to adjust a number of holding slots in a variable length frame protocol and a variable length frame |
CA002372568A CA2372568C (en) | 2000-04-11 | 2001-03-30 | Method for accessing a communication medium |
AU2001253022A AU2001253022A1 (en) | 2000-04-11 | 2001-03-30 | Method for accessing a communication medium |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/547,238 US6353617B1 (en) | 2000-04-11 | 2000-04-11 | Method for accessing a communication medium |
US09/547,238 | 2000-04-11 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2001078296A1 true WO2001078296A1 (en) | 2001-10-18 |
Family
ID=24183885
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US2001/010257 WO2001078296A1 (en) | 2000-04-11 | 2001-03-30 | Method for accessing a communication medium |
Country Status (6)
Country | Link |
---|---|
US (1) | US6353617B1 (en) |
CN (1) | CN1205777C (en) |
AU (1) | AU2001253022A1 (en) |
BR (1) | BRPI0105797B1 (en) |
CA (1) | CA2372568C (en) |
WO (1) | WO2001078296A1 (en) |
Families Citing this family (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7170904B1 (en) * | 2000-08-28 | 2007-01-30 | Avaya Technology Corp. | Adaptive cell scheduling algorithm for wireless asynchronous transfer mode (ATM) systems |
US7024469B1 (en) | 2000-08-28 | 2006-04-04 | Avaya Technology Corp. | Medium access control (MAC) protocol with seamless polling/contention modes |
US20020075891A1 (en) * | 2000-12-16 | 2002-06-20 | Slim Souissi | Network assisted random access method |
US20020118661A1 (en) * | 2000-12-22 | 2002-08-29 | Daniel Voce | Method of optimizing random access performance in a mobile communications network using dynamically controlled persistence techniques |
EP1364492A2 (en) * | 2001-02-21 | 2003-11-26 | Koninklijke Philips Electronics N.V. | Contention resolution protocol |
US7209467B2 (en) * | 2002-11-26 | 2007-04-24 | Texas Instruments Incorporated | Adaptive adjustment of backoff times in wireless network communications |
KR100479865B1 (en) * | 2002-11-27 | 2005-03-31 | 한국전자통신연구원 | Method for resolving collision in communication system using media access control based of contention |
US7376143B2 (en) * | 2003-09-30 | 2008-05-20 | Intel Corporation | Systems and methods for contention control in wireless networks |
WO2005069529A1 (en) * | 2003-12-22 | 2005-07-28 | Nokia Corporation | A method and a device for decreasing a transmission delay in a multi-channel data transmission |
JP4363404B2 (en) * | 2006-01-26 | 2009-11-11 | ソニー株式会社 | Receiving apparatus and method, and program |
US8126396B2 (en) * | 2006-11-09 | 2012-02-28 | Broadcom Corporation | Wireless network that utilizes concurrent interfering transmission and MIMO techniques |
JP4987118B2 (en) | 2008-02-27 | 2012-07-25 | 日本電信電話株式会社 | Wireless communication method, base station apparatus, and wireless communication system |
KR101475880B1 (en) * | 2008-03-11 | 2014-12-30 | 에스케이텔레콤 주식회사 | System and method requesting bandwidth allocation |
FI123253B (en) * | 2008-06-19 | 2013-01-15 | Cassidian Finland Oy | Control mechanism for use of common control channel |
CN101686189B (en) * | 2008-09-26 | 2016-03-02 | 华为技术有限公司 | A kind of data transmission method for uplink and device |
WO2012149734A1 (en) * | 2011-09-09 | 2012-11-08 | 华为技术有限公司 | Conflict detection method and device |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4630264A (en) * | 1984-09-21 | 1986-12-16 | Wah Benjamin W | Efficient contention-resolution protocol for local multiaccess networks |
US5953344A (en) * | 1996-04-30 | 1999-09-14 | Lucent Technologies Inc. | Method and apparatus enabling enhanced throughput efficiency by use of dynamically adjustable mini-slots in access protocols for shared transmission media |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
NL189062C (en) | 1980-02-15 | 1992-12-16 | Philips Nv | METHOD AND SYSTEM FOR TRANSFER OF DATA PACKAGES. |
GB2165127B (en) | 1984-09-26 | 1988-04-07 | Philips Electronic Associated | Multiple access communications system |
GB2198013B (en) | 1986-11-28 | 1990-07-25 | Marconi Co Ltd | A communication system |
SE464438B (en) | 1989-08-25 | 1991-04-22 | Eritel Ab | PROCEDURES TO ADAPT RADIO COMMUNICATION SYSTEM WITH BASE STATION AND MULTIPLE MOBILE STATIONS FOR TRAFFIC AND PERFORMANCE REQUIREMENTS |
-
2000
- 2000-04-11 US US09/547,238 patent/US6353617B1/en not_active Expired - Lifetime
-
2001
- 2001-03-30 BR BRPI0105797-9A patent/BRPI0105797B1/en not_active IP Right Cessation
- 2001-03-30 WO PCT/US2001/010257 patent/WO2001078296A1/en active Application Filing
- 2001-03-30 AU AU2001253022A patent/AU2001253022A1/en not_active Abandoned
- 2001-03-30 CN CN01800894.1A patent/CN1205777C/en not_active Expired - Lifetime
- 2001-03-30 CA CA002372568A patent/CA2372568C/en not_active Expired - Lifetime
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4630264A (en) * | 1984-09-21 | 1986-12-16 | Wah Benjamin W | Efficient contention-resolution protocol for local multiaccess networks |
US5953344A (en) * | 1996-04-30 | 1999-09-14 | Lucent Technologies Inc. | Method and apparatus enabling enhanced throughput efficiency by use of dynamically adjustable mini-slots in access protocols for shared transmission media |
Also Published As
Publication number | Publication date |
---|---|
AU2001253022A1 (en) | 2001-10-23 |
US6353617B1 (en) | 2002-03-05 |
BR0105797A (en) | 2002-03-05 |
CA2372568A1 (en) | 2001-10-18 |
CN1205777C (en) | 2005-06-08 |
BRPI0105797B1 (en) | 2015-07-28 |
CN1366750A (en) | 2002-08-28 |
CA2372568C (en) | 2004-06-22 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6353617B1 (en) | Method for accessing a communication medium | |
US7426385B2 (en) | Communication device and method for communicating over a digital mobile network | |
EP1243146B1 (en) | Channel-type switching from a common channel to a dedicated channel based on common channel load | |
KR100800884B1 (en) | Transmission controlling method of reverse rink in mobile communication system | |
US6414943B1 (en) | Method and apparatus for controlling asymmetric dynamic radio bearers in mobile packet data communications system | |
US20030012217A1 (en) | Channel-type switching to a common channel based on common channel load | |
CA2432766A1 (en) | Method of optimizing random access performance in a mobile communications network using dynamically controlled persistence techniques | |
WO1998059449A2 (en) | A method and system for wireless communication | |
KR20070050858A (en) | Apparatus and method for post-processing data rate control value in a high rate packet data system | |
CN109314884B (en) | Service data distribution method and device | |
EP1331767B1 (en) | Method and apparatus for random access packet transmission by performing load control functionality | |
JP2000517502A (en) | Setting of service level in digital mobile communication system | |
JP2002534020A (en) | Selective and efficient message delivery method in mobile communication system | |
CA2443930A1 (en) | Method for dynamic load management of random access shared communications channels | |
EP1414256B1 (en) | A method and system for transferring of a call connection connecting a base station and a mobile user terminal between dedicated and shared channels | |
US8073448B2 (en) | Method and apparatus for handling uplink transmission rate in a handover region | |
US20030198199A1 (en) | Method of throttling uplink traffic in a wireless communication system | |
RU2340119C2 (en) | Method of adjusting transmit window size on radio channel control level | |
US7295817B2 (en) | Wireless data communication unit | |
EP1513281A1 (en) | A method and apparatus for link adaptation for packet transmission | |
KR101830227B1 (en) | Method and apparatus for setting barring factor for controlling access of user equipment | |
EP1411738A1 (en) | A telecommunications base station, and a method of detection by a base station of a sequence of data representing a request for call connection from a mobile | |
KR100842610B1 (en) | Method for flow control on radio link between utran and ue in umts | |
WO2005062542A1 (en) | A method in a communication system | |
KR101553881B1 (en) | Method for controlling traffic load in data communication channel |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 01800894.1 Country of ref document: CN |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
ENP | Entry into the national phase |
Ref document number: 2372568 Country of ref document: CA Ref document number: 2372568 Country of ref document: CA Kind code of ref document: A |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
122 | Ep: pct application non-entry in european phase | ||
NENP | Non-entry into the national phase |
Ref country code: JP |