TW200935811A - Method of gaining access to a network - Google Patents

Abstract

The present invention relates to a method for gaining access to a network by a secondary station, said network comprising at least one primary station, said method comprising transmitting at a secondary station a message to the primary station using a retransmission protocol, wherein the number of allowed retransmissions of the message from the secondary station has a dependency on a current parameter of the secondary station.

Description

200935811 IX. INSTRUCTIONS: TECHNICAL FIELD OF THE INVENTION The present invention relates to a method of obtaining access to a network transmission resource, and to a broadcasting station operating in accordance with the method. For example, the invention relates to mobile communication systems such as UMTs (Universal Mobile K Systems) or to another communication system such as a random access channel. [Prior Art] ❹ ❹ In a conventional telecommunication system network, a random access channel (rach) is used to obtain access to the network. In a random access procedure, a base station or a station knife is assigned a physical resource to a mobile station or a secondary station. This resource may be a time slot, and/or a frequency subcarrier, and/or a code. Conventionally, this random access procedure, as illustrated in the figure, first sends a request to the primary station. In the picture! The information transmitted by the secondary station is 2 as described in Schedule 1, and the information transmitted by the primary station is indicated by time, Table B3. The request sent by the secondary station UE1 is designated as a - random access preamble in the - UMTS system, and includes a randomly selected signature. This request can be sent in the special block of the RACH, also _, randomly selected in a special (four) = frequency block 'from the set of time frequency blocks. Then the primary station can respond to the preamble of a random access response 2, by acknowledging the transmission resource for the transmission of the next message and the identifier for the secondary station H, which is referred to as a temporary specific cell in the bribe 8 'Eight network temporary identifier (labeled C-RNTI). Next, the secondary station UE1 transmits a message containing DATA 1 in the physical resource of the knives. 2. In this random access procedure, when a plurality of secondary stations respectively transmit their random access preambles in the same-time frequency block with the 135009.doc -6 - 200935811 same-preamble signature 'The conflict has occurred. For example, in the previous example, a second secondary station, UE2, whose transmission is illustrated in schedule 2, transmits a random access preamble in the same-time frequency block and has the same threshold as the secondary station. Set the signature. In this case, the primary station cannot determine that a plurality of secondary stations UE1 and UE2 are requesting resources, and see the preamble request initiated by the unique secondary station. The primary station will then respond by means of a response, which is acknowledged by providing a temporary c_RNTI, and a resource in this example. When a plurality of secondary stations UE1 and UE2 transmit their messages 30 and 4, respectively, the messages contain DATA 1 and DATA 2, respectively, and in the allocated resource block, it is possible that the primary station will not be able to decode the received hierarchical message because Each message is different 'where the message corresponds to each station of the plurality of stations. Thus the 'primary station' will indicate by means of a negative acknowledgement message (labeled NACK) 50 that the message was not received correctly. This can be done, for example, using an ARQ protocol (Automatic Repeat Request Protocol), such as a hybrid automatic repeat request (ARQ) protocol. When the NACK 50 is received, the secondary stations UE1 and UE2 will retransmit at the same time. DATA 1 and DATA 2 correspond to messages 60 and 70, respectively. However, since each message will be layered, there may be no retransmissions. Therefore, the secondary stations UE1 and UE2 must start the random access procedure again, which results in delaying the inefficient use of radio communication resources and dissipating power. SUMMARY OF THE INVENTION Next, an object of the present invention is to alleviate the above problem of identification. Another object of the present invention is to propose a method of obtaining network access, which is 135009.doc 200935811 to limit the outcome of the conflict. At t:: another: The purpose is to propose a method of obtaining access that shortens the delay caused by a conflict of plants. To: 'The present invention proposes that the party that obtains the network access by the station at one time contains the at least one primary station, and the method includes the secondary station using the -retransmission protocol to transmit a message to the primary station, where This time·

The number of allowed retransmissions of e has a dependency on the current parameters of the secondary station. ~ So 'if there is a conflict between the secondary stations, the secondary station with the highest number of allowed retransmissions will have the opportunity to retransmit its data separately, because the other secondary stations will reach their respective allowed retransmissions earlier. . Because &, at least one of the secondary stations will have network access, thus limiting the outcome of a conflict. Moreover, in some variations of the invention, it is possible to provide a higher number of allowed retransmissions for a predetermined type of secondary station, such as having a special signature level or, for example, having a high priority for transmitting data (eg, security critical data or Emergency call) The present invention also relates to a primary station that includes components for performing the method according to the present invention. In another aspect of the invention, a primary station is proposed that includes means for performing the method in accordance with the present invention. This and other aspects of the invention will be apparent, and the embodiments described hereinafter are set forth. [Embodiment] The present invention relates to a system of communication 300 as illustrated in FIG. 2, including a primary station 100, such as a base station or a progress node B (eNodeB), and at least one 135009.doc 200935811 station 200 as a mobile station or A user device (also labeled as a UE). The radio system 300 includes a plurality of primary stations 1 and/or a plurality of secondary stations 200. The primary station 100 includes a transmission member 11A and a receiving member 12A. The output of the transmission member 110 and the input of the receiving member 12A are coupled to the antenna 130 by a coupling member 140, which may be, for example, a circulator or a changeover switch "coupled to the transmission member u" and the receiving member 12 A control component 150, for example, can be a processor. The secondary station 2 includes a transport member 210 and a receiving member 22A. The input of the transmission member 21A and the input of the receiving member 220 are coupled to an antenna 230 by a coupling member 240, which may be, for example, a circulator or a changeover switch. Coupled to the transfer member 2 1 and the receiving member 220 is a control member 250, which may be, for example, a processor. The transmission from the primary radio station 1 to the secondary station 200 occurs on the first channel 160 and the transmission from the secondary radio station 2 to the first radio station 1 发生 occurs on a second channel 260. As explained above, when a station 2 wants to obtain network access, it must request a primary station on the random access channel (RACH), for example. Next, the primary station 100 replies and indicates an allocated resource for the transmission of the data. The secondary station uses the allocated resources to transfer its data. However, in a conventional telecommunications system, when a large number of stations occur, it can result in no collision station gaining network access, which causes delays, inefficient use of radio communication resources, and dissipation of power. In accordance with a first embodiment of the present invention, a system permits secondary stations 200 to be more easily accessed and to reduce delays. This embodiment will be illustrated with the aid of Figures 3 and 4. Figure 3 includes: a schedule 4〇 corresponding to the first secondary station UE1i transmission; a schedule 402 corresponding to the transmission of the secondary station UE2 of the 135009.doc 200935811; and a schedule 403 corresponding to the transmission of the primary station ι〇〇 . According to this embodiment, in step s4 of FIG. 4, if two secondary stations UE1 and UE2 request to access the random access preamble 410 in the same resource block and have the same signature, the primary station 1〇 〇 has the impression of being connected only once. At step S4, the primary station transmits a reply 420 which is received by the two secondary stations uei and UE2. In this reply 42〇, the primary station instructs a resource to be allocated, which will be used by the secondary station to transmit its data. Moreover, the primary station 100 can transmit a temporary identifier, such as the C-RNTI * as described above. This temporary identifier is used for the connection of the secondary station and for a period of time after the generation. Some secondary stations that already have network access may already have a valid temporary identifier. This applies to the "non-initial access"UE scenario. In step S402, the two secondary stations UE1 and UE2 will transmit their respective data DATA1 and data2 in the corresponding messages 43A and 440. Such messages may further include a non-access stratum UE m (labeled nas ue ID) corresponding to the secondary station, for example, an International Mobile Subscriber Identity (Identified IMSI). Since DATA1 and DATA2 are different, it is very likely that the message 43 is not correctly received by the primary station in step S4〇3. If the primary station can decode the received message (the situation is: for example, if no conflict exists, or if the two conflict messages are received very weakly), then in step S404, a predetermined retransmission will be performed according to a predetermined A protocol (such as ARQ, or HARQ or similar) sends an ACK to the secondary station. The woven signal from the correct reception can be carried, for example, by the absence of a reply. In this case, in step S404, the station is to be not transferred to the secondary station. 135009.doc 200935811 In step S405, if the primary station is unable to decode the message, it will signal NACK 450. When the secondary stations UE1 and UE2 receive the negative acknowledgement message 450, they will check how many times they are allowed to retransmit the message (s4〇6). According to the present invention, the number of retransmissions is allowed, meaning that each time the station is allowed to attempt to transmit its data again and again, the primary station may be different from the other. In the first embodiment, this number depends on whether each station has a temporary identifier, such as C_RNTI, before it requests access. This means that it depends on whether the station is performing non-initial access and whether the temporary identifier is still valid. If this is the case, the number of allowed retransmissions will be the maximum or at least greater than the number of allowed retransmissions for the corresponding initial access secondary station. In this example, 'the secondary station UE1 is implementing a non-initial access, and the secondary station UE2 is implementing an initial access. Then, the number of allowed retransmissions of UE2 (for example, 1) is less than the number of allowed retransmissions of UE1 ( For example, 3). Therefore, it can be clearly seen from Fig. 3 that the secondary stations UE1 and UE2 retransmit their data once in the respective messages 460 and 470. Next, the number of retransmissions of the secondary station UE2 reaches the number of allowed retransmissions' and in step S407, the secondary station UE2 suspends its access attempt. Thus, for the second attempt 490, the secondary station UE1 is only one transmission station, which will then be fully received by the primary station 100, and acknowledgment by the ACK 500 in step S404. This makes it possible to supply a secondary station that already has network access. This is advantageous because these secondary stations can already be fully adapted to the network of consideration. The present invention prevents collisions from causing rejection of all conflicting secondary stations, but ultimately results in a successful access. Therefore, the number of secondary stations experiencing delays is reduced by 135009.doc 200935811 is less useful. This is also useful because secondary stations with a C-RNTI are likely to access the network regularly, and users do not expect to experience repetition. Delay, delay can only occur during initial access. Longer in a variation of this embodiment, the secondary station has not yet accessed the network (i.e., the secondary station does not have a temporary access identifier) can be supplied with an advantageous condition by The number of allowed retransmissions corresponding to this situation is greater than the number of allowed retransmissions of the corresponding "non-initial access" station. This may make it possible to provide easy access to the stations, which have no chance of having resource access. Therefore, all stations can have the possibility of network access. In the first embodiment, the number of allowed retransmissions for each category (non-initial access/initial access) is signaled to the secondary station on the broadcast channel (BCH). However, in one variation of this embodiment, if there are two types such as (non-initial access/initial access), for example, only the number of allowed retransmissions corresponding to the initial access category is signaled to the secondary station. Therefore, when the secondary station enters the retransmission coordination, after the number of allowed signal retransmissions is reached, the initial access secondary station " will stop retransmitting its data. "non-initial secondary station" will continue to retransmit its data until the primary station receives the message correctly or until the primary station stops sending NACKs. Therefore, this avoids signaling the number of this category, reducing the overhead, and The choice of the number of retransmissions allowed allows for great flexibility. This also allows the system to have an undefined limit operation on the number of retransmissions, i.e., the maximum number of retransmissions can be infinite. In another variation of the first embodiment, the categories may be selected differently, or another class may be attached. Therefore, it is possible to select the number of allowed retransmissions among a set of predetermined values, for example, based on the priority of the secondary station. Its tone, the transmission of a secondary station with a security message or an urgent message, is given special privileges, so its resource access is promoted. Prioritize, such as the nature of the signature, based on the data to be transmitted or based on the characteristics of the secondary station. For example, some users may be restricted from accessing services due to their signatures. In this case, the number of allowed retransmissions can be lower than this category. Another - secret can be estimated using the number of failed attempts to get _ access to consider the priority of the secondary station. Therefore, the more the secondary station fails to obtain network access, the higher the number of retransmissions is allowed, and the lower-try is more likely to succeed. In the second embodiment of the invention, the number of retransmissions allowed for each selection can be made by a specific algorithm. For example, the number of allowed retransmissions can be three =, for example; i1, 3, and 5. Each-minor station uses the - algorithm to select this value... for example, every-second station can be ❹-characteristics, such as

An identifier, such as its processor serial number, or IMS!, and a predetermined function to select one of the three possible values (for example, the number of the NASID (4) (four) with the NASID - the maximum number, the value of NA, please To have a station to choose to retransmit ^ ^ has an even number of random selections to allow the number of retransmissions (or number) ° another possible number of predetermined functions), for example, as a random, a sufficient number of random generations can be kissed prior to. Actually, in this description, random, also refers to "pseudo-random,,. : With: Processing Implementation 'Therefore, the function may be an identification function, wherein the output is in some embodiments' predetermined. This second embodiment can solve the same number of instructions as described above. The first embodiment of the present invention does not 135009.doc • 13 - 200935811 can help a plurality of secondary station conflict situations, such secondary stations have -c. RNTI 'or can not help a plurality of secondary station conflicts In this case, the secondary stations do not own a C-RNTI. It will be appreciated from the second embodiment that the number of retransmissions allowed for a given secondary station can vary from one access attempt to the other.

The maximum number of retransmissions can be selected from one of the group times known to the primary station. After reaching the maximum number of retransmissions in the group, the primary station will clear its buffer and start receiving processing again; in each case, the secondary station will stop retransmission, etc. The number of retransmissions, leaving the initial collision of the number of secondary stations to continue to retransmit and improve the opportunity for the primary station to decode a data message. Note that the first and third embodiments can be combined. For example, for "initial access secondary station", the number of allowed retransmissions can be randomly selected from the first to the possible values, for example, similarly, non-initial access secondary stations" The number of times may be from the second subgroup of possible values with 3 and .4, if - conflict occurs, for example, there are three stations to be visited, I includes initial access: owed to station, and two "non-initial storage = access" The number of retransmissions allowed for each of the secondary stations is different. Guided:: The secondary station is at the end of the second pass agreement. In another example, when the conflicting station obtains network access ends. With a -retransmission agreement to secondary in another embodiment of the invention, the maximum retransmission packet, or higher layer messaging (e.g., in - broadcast channel). The configuration can be used not only in mobile communication systems, but also in the mobile communication system 135009.doc 200935811. Using ARQ or HARQ as part of the random access procedure, the LTE is also applicable to another standard. Such as wiMAXi progression or cdma2000 ° In fact, the invention is not limited to the umts or mobile telecommunications systems described herein as examples, but may extend to any other communication system that allocates resources to the terminal for requesting access, for example including a peer-to-peer network. Road, where peer entities can compete for access to transmission resources.

In the specification and special account of the present invention, please refer to the word "quote" (a) or "an" and "do not exclude plural of these terms". Including. Other elements or steps will be apparent from the reading of this disclosure. Other modifications will be apparent to those skilled in the art. Such modifications may include another feature that is known to the art of radio communication technology and transmission power control and that may be used in place of or in addition to the features already described herein. [Simple diagram of the diagram] Figure U has been described as a set of schedules representing a plurality of secondary stations β and - between the main stations - the traditional random access procedure; Figure 2 is a representation of a network According to the invention, the network comprises a primary station and a primary station; =3 is a set of schedules representing a real machine access procedure in accordance with the present invention; and Figure 4 is a representation of the method of the present invention. flow chart. [Main component symbol description] 10 Random access preamble 135009.doc -15· 200935811

20 Response 30 Message 40 Message 50 Negative Response Message (NACK) 60 Message 70 Message 100 Primary Station 110 Transmission Component 120 Receiving Member 130 Antenna 140 Coupling Member 150 Control Member 160 First Channel 200 Secondary Station 210 Transmission Member 220 Receiving Member 230 Antenna A schedule of 402 vehicles 401 corresponding to a transmission of the first secondary station UE1 402 403 a schedule corresponding to the transmission of the second secondary MUE2 corresponds to a schedule of transmission of the primary station 410 Random access preamble 420 Reply 430 message 135009.doc -16- 200935811

440 Message 450 Negative Answer Message (NACK) 460 Message 470 Message 500 Answer Message (ACK) DATA1 Data DATA2 Data 17- 135009.doc

Claims (1)

200935811, Patent Application Area 1. A method for obtaining a network access by a station, the network includes a J-main station, the method includes the secondary station transmitting a message to the primary station by using a retransmission agreement, The number of allowed retransmissions of the message from the secondary station has one of the current parameters of one of the secondary stations. 2 » 1 - Jr's method 'where the current parameter contains a quantity - selected using a predetermined selection algorithm and the dependencies thereof are used according to the use. The number of choices allowed by the algorithm selection algorithm is used to set the number of allowed retransmissions. 3 · As in May, the method of seeking " item 2 is too v4l. 丄 $, wherein the predetermined selection algorithm performs a random selection from a predetermined set of numbers. 4. As in the method of claim 2, the pre-selection algorithm includes a function for deriving one of the characteristics of the two-person station. 5. If t of claim 4, soil # i , , the characteristic of the secondary station is one of the minor identifiers of the secondary station or its 7^ part. 6. A number as in any of claims 2 to 5. The method of the item, wherein the function is an identity function 7. If Htr Λψ, jj-I of the second item 2 is already supported / ^ the current parameter contains whether the secondary station has i-access identifier, and its secondary If the station already has ^ packet 3, if it is the - _ 侑, fen line character, then select the allowed retransmission number, then select 兮 ☆ 逻 没有 没有 does not have an access identification to allow the number of retransmissions - 8 · As requested in item 7 - the value of the brother. Do not assign to the secondary station. The network is provided to provide the access identification 135009, doc 200935811 9. If the D month is 7 or 8 of the formula 10. If the request item 7 ', the first value of the middle s is greater than the second value. η·, as described above, the second method: wherein the first value is less than the second value.乂% of any item has an -identifier, then "if the secondary station has already been numbered, then A the secondary station stops receiving the negative response message... the person wants the station to stop the message. 12. If the request is In the item, there is a method of possessing - knowing (four) $. If the secondary station has no number °, then if the secondary station stops receiving the negative response letter 2, the secondary station will stop the retransmission of the message. I3· A method of claiming any one of items 5 to U, wherein the first quantity and one of the first quantities are predetermined. 14. The method of any of the preceding claims, wherein the retransmission is allowed The number of times is badly signaled by the network. 15. Any one of the preceding claims wherein the number of allowed retransmissions is selected based at least in part on a priority level of the secondary station. The method of 15 'where the priority level of the secondary station depends on one of the attributes of the data to be transmitted. 17·If the item 15 or 16 is the method', the priority level of the secondary station depends on the previous The number of failed attempts to access the network. 18. A primary station, Means comprising means for performing the method of the foregoing claim. 19, a secondary station comprising means for obtaining access to a network, the network comprising at least one primary station, wherein the secondary station comprises A retransmission protocol transmits a message to the component of the primary station, wherein the number of allowed retransmissions of the message from the secondary station depends on the current parameter of one of the secondary stations.