1242993 玖、發明說明 (發明說明應敘明：發明所屬之技術領祕 ^ 【一、發明所屬之技術領域】 本毛月、係關於一種於無線區域網路之競入存取 之方法尤心種於無線通訊網路之6回饋競入存取 方法。 【二、先前技術】 近年來由於無線通訊迅速發展，無線通訊網路已 逐漸普及，人們不止期待無線通訊網路提供多樣化且 不同服務品質，更期待無線通訊網路能迅速提供服 務’然而’當無線通訊網路中許多行動台欲鏈結至該 無線通訊網路要求服務時，該行動台需先登錄至一位 於該無線通訊網路中的基地台，而該基地台同一時槽 内只允許一行動台登錄，當同一時槽有許多行動台欲 進行登錄時，各行動台利用一上行鏈結傳送欲登錄之 資料至該基地台，由於各行動台所傳送之訊號間互相 干擾、重疊等因素’該基地台接收到一些難以辨識的 訊號’因此，該基地台利用一下行鏈結傳送一碰撞訊 號至各行動台，而各行動台需再進行一隨機程序（例 如：Controlled Slotted-Aloha， CS-Aloha)以決定 下一時槽是否進行登錄，若下一時槽欲登錄之行動台 個數亦不為1而再次產生碰撞時，則必須重複上述程 序，由於該基地台無法正確地估測欲登錄之行動台個 數，當有許行動台欲登錄時會反覆進行該隨機程序， 將使得無線通訊網路之效率不彰，故習知之無線區域 6 1242993 網路中多個行動台競入存取之方法實有予以改進之 必要。 發明人爰因於此，本於積極發明之精神，亟思一 種可以解決上述問題之「無線通訊網路之6回饋競入 存取方法」，幾經研究實驗終至完成此項發明。 【三、發明内容】 本發明之主要目的係在提供一種於無線區域網 路之競入存取之方法，尤指一種無線通訊網路之6回 饋競入存取方法。 依據本發明之一特色，係提出一種無線通訊網路 之6回饋競入存取方法，該無線通訊網路包含至少一 基地台，其中，該基地台可識別同時要求登入該無線 區域網路之行動台個數最多為5個，該方法包括下述 步驟：（A)每一欲登入之行動台以一隨機程序來決定 其在下一時槽是否可進行競入存取；（B)以基地台偵 知行動台個數，定義為一現行行動台個數，如其介於 2及5之間時，執行下列步驟；（C )每一現行行動台以 一基於該現行行動台個數之隨機程序來決定其在下 一時槽是否可進行競入存取；（D)以基地台偵知行動 台個數，如其為1時，允許該行動台登入，並將該現 行行動台個數遞減；以及（E)如該現行行動台個數為 0，執行步驟（A )，否則執行步驟（C )。 由於本發明構造新穎，能提供產業上利用，且確 有增進功效，故依法申請發明專利。 7 1242993 【四、實施方式】 為使貴審查委員能進一步瞭解本發明之梦 特徵及其目的，茲附以較佳具體實 戶· 4\叶細說 有關本發明之於無線通訊網路之6回饋競入 之技術的較佳實施例，請先參照第1圖所 本 之應用系統的示意圖，該無線區域網路包含至，丨、 地台1 0，以及複數個行動台丨丨，其係同時要求^ 無線區域網路，其中，該基地台丨〇分別預存有工 個行動台11同時要求登入該無線區域網路之機辞 度函數的分佈曲線，據此而可識別同時要求登入 線區域網路之行動台個數最多為5個，該基地台 據本發明之無線通訊網路之6回饋競入存取方法 在該複數個行動台1 1中選取一行動台以讓其進# 錄。 本發明之無線通訊網路之6回饋競入存取方 流程圖可見於第2圖’首先，於步驟S301中，每 登入之行動台11以一隨機程序來決定其在下一畴 是否可進行競入存取，其中，可在下一時槽進行 存取之行動台個數定義為現行行動台個數G，該 程序可為CS-Aloha協定··尽(a〇 = w;，當中，/c為 得最大飽和容量之最佳值（the optimal value yielding maximized saturated throughput)， 預估之行動台個數，Λ：之值與#並無關係，一般 “50 時，《《I·54。 構、 明如 存取 發明 一基 入該 至5 s密 該無 10依 ，以 t登 法之 一欲 F槽 競入 隨機 可獲 Λ Ν為 ，當 1242993 於步驟S 3 Ο 2中，該基地台1 〇偵知欲登錄之行動台 1 1，判斷該現行行動台個數G是否介於2及6之間，如 其介於2及6之間時，則執行步驟S 3 0 3，反之，若該現 行行動台個數大於等於6 ’由於基地台1 〇無法識別， 故重回步驟S 3 Ο 1，而若該現行行動台個數為1時，表 僅有一個行動台11欲進行競入存取（content access)，則可讓該行動台11進行登錄，之後，重回 步驟S 3 (Π，讓其他剩下之行動台1 1繼續進行隨機程序 來決定其在下一時槽是否可進行競入存取。 於步驟S303中，每一現行行動台11執行一基於該 現行行動台個數之隨機程序來決定其在下一時槽是 否可進行競入存取，該隨機程序可為cs —Aloha協定： /MG) = 1/G，當中，G為該現行行動台個數。 於步驟S 3 0 4中，以基地台丨〇偵知行動台個數l， 判斷該可進行競入存取之行動台個數是否為丨，如其 為1時，表僅有一個行動台丨丨欲進行競入存取，則執 行步驟S305，於下一 一個時槽讓該行動台1 1進行登錄。1242993 发明 Description of the invention (The description of the invention should state: the technical know-how of the invention ^ [1. The technical field to which the invention belongs] This month, it is particularly concerned about a method of competitive access in a wireless local area network. 6 feedback competitive access methods for wireless communication networks. [II. Prior Technology] In recent years, due to the rapid development of wireless communication, wireless communication networks have gradually become popular. People not only expect wireless communication networks to provide diversified and different service qualities, but also look forward to The wireless communication network can quickly provide services. However, when many mobile stations in the wireless communication network want to link to the wireless communication network to request services, the mobile station must first log in to a base station located in the wireless communication network, and the Only one mobile station is allowed to log in to the base station at the same time slot. When there are many mobile stations to log in at the same time slot, each mobile station uses an uplink link to send the data to be registered to the base station. Signals interfere with each other, overlap and other factors 'The base station received some unrecognizable signals' Therefore, the base station The station uses the following link to transmit a collision signal to each mobile station, and each mobile station needs to perform a random procedure (for example: Controlled Slotted-Aloha, CS-Aloha) to determine whether to register in the next time slot. When the number of mobile stations to be registered is not 1 and a collision occurs again, the above procedure must be repeated. Because the base station cannot correctly estimate the number of mobile stations to be registered, it will repeat when there are some mobile stations that want to register. Carrying out this random procedure will make the wireless communication network inefficient, so it is necessary to improve the method for multiple mobile stations to enter and access the wireless area 6 1242993 network. Based on the spirit of active invention, I am thinking about a "six-feedback wireless access method for wireless communication networks" that can solve the above problems. After several research experiments, the invention has been completed. [III. Summary of the Invention] The main purpose of the present invention is The invention provides a method for competitive access in a wireless local area network, in particular a 6-feedback competitive access method for a wireless communication network. This is a 6-feedback competitive access method for a wireless communication network. The wireless communication network includes at least one base station, and the base station can identify a maximum of 5 mobile stations simultaneously requesting to log in to the wireless local area network. The method includes the following steps: (A) each mobile station that wants to log in uses a random procedure to determine whether it can perform competitive access in the next slot; (B) the number of mobile stations detected by the base station, Defined as the number of current mobile stations, if it is between 2 and 5, perform the following steps; (C) Each current mobile station determines whether it will be in the next time slot based on a random procedure based on the number of current mobile stations. Competitive access can be made; (D) The number of mobile stations detected by the base station, if it is 1, allow the mobile station to log in and decrease the number of current mobile stations; and (E) if the current mobile station If the number is 0, step (A) is performed, otherwise step (C) is performed. Since the present invention has a novel structure, can provide industrial use, and has indeed improved efficacy, it has applied for an invention patent in accordance with the law. 7 1242993 [IV. Implementation Modes] In order to enable your review committee to further understand the dream features and objectives of the present invention, a better specific user is attached here. 4 \ Leave details about the 6 feedbacks of the present invention on wireless communication networks For a preferred embodiment of the competing technology, please first refer to the schematic diagram of the application system shown in Figure 1. The wireless local area network includes, 丨, base station 10, and multiple mobile stations 丨 丨, which are simultaneously Requirement ^ wireless LAN, where the base station has pre-stored the distribution curve of the logarithmic function of each mobile station 11 requesting to log in to the wireless LAN at the same time. The number of mobile stations on the road is a maximum of five. According to the six-feedback competitive access method of the wireless communication network of the present invention, the base station selects one of the plurality of mobile stations 11 to let it enter the # record. The 6-feedback bidder accessor flowchart of the wireless communication network of the present invention can be seen in FIG. 2 'First, in step S301, each logged-in mobile station 11 uses a random procedure to determine whether it can bid in the next domain. Access, in which the number of mobile stations that can be accessed in the next time slot is defined as the current number of mobile stations G, and the procedure can be CS-Aloha protocol ·· (a〇 = w ;, where / c is obtained The optimal value yielding maximized saturated throughput, the estimated number of mobile units, the value of Λ: has nothing to do with #, generally "50 hours," "I · 54. Access to the invention will be based on the 5 sec secret and no 10 relies on, and one of the t registration methods will randomly obtain Λ Ν for the F slot entry. When 1242993 is in step S 3 02, the base station 10 detects The mobile station 11 who knows to log in, determines whether the number G of the current mobile station is between 2 and 6, and if it is between 2 and 6, step S 3 0 3 is executed, otherwise, if the current mobile station The number of stations is greater than or equal to 6 ', because the base station 10 cannot be identified, the process returns to step S 3 〇 1, If the current number of mobile stations is 1, and only one mobile station 11 wants to perform content access, the mobile station 11 can be registered, and then, step S3 (Π, let The remaining mobile stations 11 continue to perform random procedures to determine whether they can perform competitive access in the next time slot. In step S303, each active mobile station 11 executes a random procedure based on the number of the current mobile stations. To determine whether it can perform competitive access in the next time slot, the random procedure may be cs-Aloha agreement: / MG) = 1 / G, where G is the number of the current mobile stations. In step S304, Based on the base station 丨 〇 detecting the number of mobile stations l, determine whether the number of mobile stations that can perform competitive access is 丨, if it is 1, the table has only one mobile station 丨 丨 for competitive access, Then, step S305 is performed, and the mobile station 11 is allowed to register in the next time slot.
台個數大於等於2且等The number of units is greater than or equal to 2
#判定該基地台1 0所偵知之行動 等於現行行動台個數減1 (2 $ L 1242993 and L=G-1)，表示在現行行動台"中有一未參與競 入存取之行動台1 1，則該基地台1 0利用該下行鏈結送 出一偷取時槽訊號，並執行步驟S 3 0 6，於下一個時槽 讓違未參與競入存取之行動台11進行競入存取並允 許該行動台1 1登錄。 於步驟S 3 0 7中，將該現行行動台個數遞減，再判 斷現行行動台個數是否為0 (步驟S308 )，如是，重 回步驟S 3 0 1，否則執行步驟S 3 0 3。#Determine that the action detected by the base station 10 is equal to the number of current mobile stations minus 1 (2 $ L 1242993 and L = G-1), indicating that there is a mobile station that does not participate in competitive access in the current mobile station " 1 1, then the base station 10 sends a steal time slot signal using the downlink link, and executes step S 306 to allow the mobile station 11 that violates the bidding access to enter the bid in the next time slot Access and allow the mobile station 11 to log in. In step S307, the number of current mobile stations is decremented, and it is determined whether the number of current mobile stations is 0 (step S308). If yes, step S303 is repeated, otherwise step S303 is performed.
第3圖係顯示依據本發明之無線通訊網路之6回 饋矶入存取方法之一範例的競入存取過程示意圖，首 先於時槽A中，基地台以一下行鏈結將一預估之行動 台個數= 5 0 )傳送至各欲進行競入存取之行動台， 母欲且入之行動台以一 CS-Aloha協定之隨機程序 來決定其在下一時槽是否可進行競入存取，其中，該 隨機程序為：尺= 54/50,行動台3、行動么19、 行動台31及行動台45為可在下一時槽進行競入存取 之行動台，故現行行動台個數G為4。FIG. 3 is a schematic diagram of the competitive access process, which is an example of the 6-feedback access method of the wireless communication network according to the present invention. First, in the slot A, the base station links an estimated The number of mobile stations = 50) is transmitted to each mobile station that wants to perform competitive access, and the mobile station that the parent wants to use determines a random procedure of the CS-Aloha agreement to determine whether it can perform competitive access in the next slot. Among them, the random procedure is: ruler = 54/50, mobile station 3, mobile 19, mobile 31, and mobile 45 are mobile stations that can perform competitive access in the next slot, so the current number of mobile stations is G Is 4.
於時槽B中，行動台3、行動台19、行動台3ι及行 動台45以一 CS-Aloha協定之隨機程序來決定其在下 一時槽是否可進行競入存取，其中，該隨機程序為·· /MG) = l/G=l/4，行動台3及行動台19可進行競入存 取，然而該基地台偵知可進行競入存取之行動台個數 (L = 2)大於等於2且不等於現行行動台個數減 1(G-1 = 3)，表示在現行行動台中由於執行隨機程序仍 有2個以上之行動台欲進行競入存取，故重新執行隨 機程序/MG)。 ％ 10 1242993 於時槽C中，行動台3、行動台19、行動台3i及行 動台45以一 CS-Aloha協定之隨機程序來決定其在下 「時槽是否可進行競入存取，其中，八^) = 1/^1/4， 行動台31可進行競入存取，該基地台偵知行動台個 數，判斷該可進行競入存取之行動台個數是否為i， 因僅有行動台31可進行競入存取，故於下一個時槽讓 邊行動台3 1進行登錄，並將現行行動台個數減1。 於時槽D中，行動台3、行動台19及行動台45以一 Aloha協定之隨機程序來決定其在下一時槽是否 可進行競入存取，其中，八（(〇 = 1/(； = 1/3，行動台19 參 及行動台45可進行競入存取，該基地台偵知行動台個 數’判定其所偵知之行動台個數大於等於2且等於現 行行動台個數減1 (G-1=2)，表示在現行行動台中有一 未參與競入存取之行動台（行動台3)，則該基地台利 用该下行鏈結送出一偷取時槽訊號，並於下一個時槽 (於時槽E中）讓該未參與競入存取之行動台（行動台3) 進行登錄，且將現行行動台個數減1。 於時槽F中’行動台19及行動台45以一 cs —A1〇ha · 協疋之隨機程序來決定其在下一時槽是否可進行競 入存取’其中’ PR(G) = l/G=l/2，行動台19可進行競 入存取，該基地台偵知行動台個數，判斷該可進行競 入存取之行動台個數是否為1，因僅有行動台19可進 行競入存取，故於下一個時槽讓該行動台丨9進行登 錄，並將現行行動台個數減1。 於時槽Η中，現行行動台個數為〇，基地台以一下 行鏈結將一預估之行動台個數^ = 5 〇 _ 4 = 4 6 )傳送至 11 1242993 各欲進行競入存取之行動台，故行動台8以一 CS-A1 oh a協定之隨機程序來決定其在下一時槽是否 Λ Λ 可進行競入存取，其中，= 1 · 54/46。 由上述之說明可知，本發明之無線通訊網路之6 回饋競入存取方法可藉由同時要求登入該無線通訊 網路之1至5個行動台個數之資訊，而快速有效地完成 競入存取之過程，並於現行行動台中有一未參與競入 存取時，該基地台利用該下行鏈結送出一偷取時槽訊 號，於下一個時槽讓該未參與競入存取之行動台進行 競入存取並允許該行動台登錄，以加速競入存取，改 善無線通訊網路之效率不彰之現象。 綜上所陳，本發明無論就目的、手段及功效，在 在均顯示其迥異於習知技術之特徵，為場式可程式閘 陣列燒錄之設計上的一大突破，懇請 貴審查委員 明察，早曰賜准專利，俾嘉惠社會，實感德便。惟應 注意的是，上述諸多實施例僅係為了便於說明而舉例 而已，本發明所主張之權利範圍自應以申請專利範圍 所述為準，而非僅限於上述實施例。 12 1242993 【五、圖式簡單說明】 第1圖係本發明之應用系統的示意圖。 第2圖係依據本發明競入存取之流程圖。 第3圖係依據本發明之競入存取過程示意圖。 【圖號說明】 基地台 10 行動台 11In time slot B, mobile station 3, mobile station 19, mobile station 3m, and mobile station 45 use a CS-Aloha protocol to determine whether they can perform competitive access in the next time slot. Among them, the random procedure is · / / MG) = l / G = l / 4, mobile station 3 and mobile station 19 can perform competitive access, but the base station detects the number of mobile stations that can perform competitive access (L = 2) Greater than or equal to 2 and not equal to the number of existing mobile stations minus 1 (G-1 = 3), which means that in the current mobile station, since there are still 2 or more mobile stations that want to enter the competitive access, random procedures are re-executed. / MG). % 10 1242993 In time slot C, mobile station 3, mobile station 19, mobile station 3i, and mobile station 45 use a random procedure of the CS-Aloha agreement to determine whether they can perform competitive access in the following time slot. Among them, Eight ^) = 1 / ^ 1/4. Mobile station 31 can perform competitive access. The base station detects the number of mobile stations and determines whether the number of mobile stations that can perform competitive access is i. There is mobile station 31 for competitive access, so in the next time slot, side mobile station 31 will be registered, and the number of current mobile stations will be reduced by 1. In time slot D, mobile station 3, mobile station 19 and Mobile station 45 uses a random procedure agreed by Aloha to determine whether it can perform competitive access in the next time slot. Among them, eight ((0 = 1 / (; = 1/3, mobile station 19 can participate in mobile station 45). In the case of competitive access, the number of mobile stations detected by the base station is determined to be greater than or equal to 2 and equal to the number of current mobile stations minus 1 (G-1 = 2), indicating that there is one The mobile station (mobile station 3) that has not participated in the competitive access, then the base station uses the downlink link to send a steal time slot signal, and A time slot (in time slot E) allows the mobile station (mobile station 3) that does not participate in competitive access to register, and decreases the number of current mobile stations by 1. In time slot F, 'mobile station 19 and action The station 45 uses a random procedure of CS-A10ha to determine whether it can perform competitive access in the next time slot 'where' PR (G) = l / G = l / 2, and the mobile station 19 can perform competition. Access, the base station detects the number of mobile stations, determines whether the number of mobile stations that can perform competitive access is 1, because only mobile station 19 can perform competitive access, so in the next time slot Let the mobile station 9 register and reduce the number of current mobile stations by 1. In the time slot, the number of current mobile stations is 0, and the base station will link an estimated number of mobile stations with the following link ^ = 5 〇_ 4 = 4 6) to 11 1242993 each mobile station that wants to perform competitive access, so mobile station 8 uses a random procedure of CS-A1 oh a agreement to determine whether it can be performed in the next time slot Λ Λ Competitive access, where = 1 · 54/46. As can be seen from the above description, the 6-feedback competitive access method of the wireless communication network of the present invention can be obtained by It is required to log in to the information of the number of 1 to 5 mobile stations in the wireless communication network, and quickly and effectively complete the process of competitive access. When one of the current mobile stations does not participate in competitive access, the base station uses the The downlink link sends a steal time slot signal, and in the next time slot, the mobile station that does not participate in competitive access performs competitive access and allows the mobile station to register to accelerate competitive access and improve the wireless communication network. In summary, the present invention shows that, regardless of the purpose, means and effect, the present invention shows its characteristics that are quite different from the conventional technology, and it is a great design for the field type programmable gate array programming. For the breakthrough, I urge your reviewing committee to make a clear observation and grant a quasi-patent as early as possible to benefit the society. However, it should be noted that the above-mentioned embodiments are merely examples for the convenience of description. The scope of the claimed rights of the present invention shall be based on the scope of the patent application, rather than being limited to the above-mentioned embodiments. 12 1242993 [Fifth, a brief description of the drawings] Figure 1 is a schematic diagram of the application system of the present invention. FIG. 2 is a flowchart of competitive access in accordance with the present invention. FIG. 3 is a schematic diagram of a competitive access process according to the present invention. [Illustration of drawing number] Base station 10 Mobile station 11
1313