TWI812355B - Wireless network system and data transferring method thereof - Google Patents
Wireless network system and data transferring method thereof Download PDFInfo
- Publication number
- TWI812355B TWI812355B TW111126804A TW111126804A TWI812355B TW I812355 B TWI812355 B TW I812355B TW 111126804 A TW111126804 A TW 111126804A TW 111126804 A TW111126804 A TW 111126804A TW I812355 B TWI812355 B TW I812355B
- Authority
- TW
- Taiwan
- Prior art keywords
- data
- age
- time
- information
- data generation
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims description 24
- 230000005540 biological transmission Effects 0.000 claims abstract description 28
- 238000004891 communication Methods 0.000 claims description 4
- 238000013459 approach Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000005070 sampling Methods 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
Description
本揭露是有關於一種以ALOHA協定為基礎的無線網路系統與其資料傳輸方法。This disclosure relates to a wireless network system and its data transmission method based on the ALOHA protocol.
ALOHA是一種多重存取協定(multiple access control)協定，用以讓裝置可以在無線網路中存取射頻通道。在時槽(slotted)ALOHA演算法中，時間被分為多個時槽，當裝置要傳送資料時會根據一特定機率在一個時槽中傳輸資料。如果傳輸成功了，裝置會在同一個時槽中接收到確認(acknowledgment)，如果沒有傳輸成功，裝置會在下一個時槽中再度嘗試傳輸。資訊年齡(age of information，AoI)是物聯網(Internet of Things，IoT)的一個重要效能指標，定義為從資料被產生到資料被接受之間所經過的時間。此外，佔空比(duty cycle)是關於功率消耗的重要指標，通常可以降低產生資料的頻率來降低佔空比，但這也會增加平均的資訊年齡。如何在低佔空比的限制下降低平均資訊年齡，為此領域技術人員所關心的議題。ALOHA is a multiple access control protocol that allows devices to access radio frequency channels in wireless networks. In the slotted ALOHA algorithm, time is divided into multiple slots. When the device wants to transmit data, it will transmit data in a slot according to a specific probability. If the transmission is successful, the device will receive an acknowledgment in the same time slot. If the transmission is not successful, the device will try the transmission again in the next time slot. Age of information (AoI) is an important performance indicator of the Internet of Things (IoT), which is defined as the time that elapses from when data is generated to when the data is accepted. In addition, the duty cycle is an important indicator of power consumption. Generally, the frequency of data generation can be reduced to reduce the duty cycle, but this will also increase the average information age. How to reduce the average information age under the restriction of low duty cycle is a topic of concern to those skilled in the field.
本揭露的實施例提出一種無線網路系統，包括基地台與至少一個裝置。裝置通訊連接至基地台，這些裝置用以執行演算法。此演算法包括：在一時槽中，判斷先前N個時槽內是否已經產生資料，其中N為正整數，若是的話則根據資料已經經過多少個時槽來設定一資料產生時間，若否的話則產生新資料並重置資料產生時間；傳送上述資料或新資料至基地台；以及如果傳送成功，則設定資訊年齡(age of information，AoI)等於資料產生時間，否則增加資訊年齡。Embodiments of the present disclosure provide a wireless network system, including a base station and at least one device. The devices communicate with the base station and are used to execute algorithms. This algorithm includes: in a time slot, determine whether data has been generated in the previous N time slots, where N is a positive integer. If so, set a data generation time based on how many time slots the data has passed. If not, then Generate new data and reset the data generation time; transmit the above data or new data to the base station; and if the transmission is successful, set the age of information (AoI) equal to the data generation time, otherwise increase the information age.
在一些實施例中，在判斷先前N個時槽內是否已經產生資料的步驟之前，演算法還包括：判斷資訊年齡是否大於等於一第一臨界值；如果資訊年齡大於等於第一臨界值，根據一預設機率執行判斷先前N個時槽內是否已經產生資料的步驟，否則增加資訊年齡並處理下一個時槽；以及如果資訊年齡小於第一臨界值，增加資訊年齡並處理下一個時槽。In some embodiments, before the step of determining whether data has been generated in the previous N time slots, the algorithm further includes: determining whether the information age is greater than or equal to a first critical value; if the information age is greater than or equal to the first critical value, according to A preset probability is executed to determine whether data has been generated in the previous N time slots; otherwise, the information age is increased and the next time slot is processed; and if the information age is less than the first critical value, the information age is increased and the next time slot is processed.
在一些實施例中，其中根據資料已經經過多少個時槽來設定資料產生時間的步驟是根據以下數學式1執行，其中 為資料產生時間， 為目前時槽， 為資料所產生的時槽。 [數學式1] In some embodiments, the step of setting the data generation time according to how many time slots the data has passed through is performed according to the following mathematical formula 1, where is the data generation time, is the current time slot, The time slot generated for the data. [Mathematical formula 1]
在一些實施例中，上述重置資料產生時間的步驟是將資料產生時間設定為1。In some embodiments, the step of resetting the data generation time is to set the data generation time to 1.
在一些實施例中，上述的裝置是透過多重存取協定(multiple access control)通訊連接至基地台。In some embodiments, the above-mentioned devices are connected to the base station through multiple access control communications.
以另一個角度來說，本揭露的實施例提出一種無線網路系統的資料傳輸方法。此無線網路系統包括基地台與至少一個裝置。資料傳輸方法包括：在一時槽中，判斷先前N個時槽內裝置是否已經產生資料，其中N為正整數，若是的話則根據資料已經經過多少個時槽來設定一資料產生時間，若否的話則產生新資料並重置資料產生時間；透過裝置傳送資料或新資料至基地台；以及如果傳送成功，則設定裝置所對應的資訊年齡等於資料產生時間，否則增加資訊年齡。From another perspective, embodiments of the present disclosure provide a data transmission method in a wireless network system. The wireless network system includes a base station and at least one device. The data transmission method includes: in a time slot, determine whether the device in the previous N time slots has generated data, where N is a positive integer. If so, set a data generation time based on how many time slots the data has passed. If not, Then generate new data and reset the data generation time; send data or new data to the base station through the device; and if the transmission is successful, set the information age corresponding to the device equal to the data generation time, otherwise increase the information age.
以另一個角度來說，資料傳輸方法還包括：判斷資訊年齡是否大於等於第一臨界值；如果資訊年齡大於等於第一臨界值，根據一預設機率執行判斷先前N個時槽內是否已經產生資料的步驟，否則增加資訊年齡並處理下一個時槽；以及如果資訊年齡小於第一臨界值，增加資訊年齡並處理下一個時槽。From another perspective, the data transmission method also includes: judging whether the information age is greater than or equal to the first critical value; if the information age is greater than or equal to the first critical value, judging whether the information has been generated in the previous N time slots according to a preset probability step of the data, otherwise increase the information age and process the next time slot; and if the information age is less than the first threshold value, increase the information age and process the next time slot.
在上述的系統與方法中，可以降低平均資訊年齡。In the above system and method, the average information age can be reduced.
為讓本發明的上述特徵和優點能更明顯易懂，下文特舉實施例，並配合所附圖式作詳細說明如下。In order to make the above-mentioned features and advantages of the present invention more obvious and easy to understand, embodiments are given below and described in detail with reference to the accompanying drawings.
關於本文中所使用之「第一」、「第二」等，並非特別指次序或順位的意思，其僅為了區別以相同技術用語描述的元件或操作。The terms "first", "second", etc. used in this article do not specifically refer to the order or order, but are only used to distinguish components or operations described with the same technical terms.
圖1是根據一實施例繪示無線網路系統的示意圖。請參照圖1，無線網路系統100包括了基地台110以及多個裝置120。基地台110與裝置120之間通訊連接，這可透過多重存取協定或其他任意合適的協定來實現。基地台110與裝置120可以是具有計算能力的任意電子裝置，在一些實施例中裝置120可以是感測器、微控制器、或任意可以進行資料感測、紀錄、處理的裝置。例如，在資料感測的應用中，裝置120可實施訊號取樣以及類比數位轉換，而轉換後的資料傳送給基地台110。本揭露並不限制無線網路系統100的應用。FIG. 1 is a schematic diagram of a wireless network system according to an embodiment. Please refer to FIG. 1 , a wireless network system 100 includes a base station 110 and a plurality of devices 120 . The communication connection between the base station 110 and the device 120 can be achieved through multiple access protocols or any other suitable protocols. The base station 110 and the device 120 can be any electronic device with computing capabilities. In some embodiments, the device 120 can be a sensor, a microcontroller, or any device that can sense, record, and process data. For example, in data sensing applications, the device 120 can perform signal sampling and analog-to-digital conversion, and the converted data is transmitted to the base station 110 . This disclosure does not limit the applications of the wireless network system 100.
在此，每個裝置120會執行一演算法，用以決定如何將資料傳送給基地台。圖2是根據一實施例繪示演算法200的虛擬碼(pseudo code)，首先假設演算法200是由第i個裝置所執行，AoI代表資訊年齡(age of information)，為了簡化起見圖2中的“instantaneous AoI”都簡稱為資訊年齡。對於多個時槽中的第k個時槽(第1行)，判斷第i個裝置的資訊年齡(AoI)是否大於等於第一臨界值 (第2行)。如果第i個裝置的資訊年齡(AoI)大於等於第一臨界值 ，根據一預設機率判斷是否要繼續執行(第3-4行)，其中 為實數， 便是預設機率。如果要繼續執行，判斷先前N個時槽內是否已經產生資料(第5行)，其中N為正整數。具體來說，如果在第j個時槽中已經產生過資料，則判斷 是否成立，若此不等式成立表示先前N個時槽內已經產生過資料。如果先前N個時槽內已經產生過資料，接下來根據資料已經經過多少個時槽來設定一個資料產生時間G(第6行)，如以下數學式1所示。 [數學式1] Here, each device 120 executes an algorithm to determine how to transmit data to the base station. Figure 2 is a pseudo code illustrating the algorithm 200 according to an embodiment. First, it is assumed that the algorithm 200 is executed by the i-th device, and AoI represents the age of information. For simplicity, Figure 2 The "instantaneous AoI" in are all referred to as information age. For the k-th time slot (line 1) among multiple time slots, determine whether the age of information (AoI) of the i-th device is greater than or equal to the first critical value (line 2). If the age of information (AoI) of the i-th device is greater than or equal to the first threshold , determine whether to continue execution based on a preset probability (lines 3-4), where is a real number, It is the default probability. If you want to continue execution, determine whether data has been generated in the previous N time slots (line 5), where N is a positive integer. Specifically, if data has been generated in the jth time slot, then determine Is it true? If this inequality is true, it means that data has been generated in the previous N time slots. If data has been generated in the previous N time slots, then a data generation time G (line 6) is set based on how many time slots the data has passed through, as shown in the following mathematical formula 1. [Mathematical formula 1]
其中 為資料產生時間， 也稱為目前時槽， 為資料所產生的時槽。如果先前N個時槽內沒有產生過資料，則產生新資料(第8行)並重置資料產生時間(第9行)，也就是將資料產生時間G設定為1。接下來傳送資料(第11行)，如果沒有產生新資料則傳送第j個時槽所產生的舊資料，否則傳送目前產生的新資料。如果傳送成功(第12行)，則設定第i個裝置的資訊年齡AoI等於資料產生時間G(第13行)。如果在同一個時槽內有其他裝置傳送資料，則第i個裝置不會接收到確認，這會造成傳送資料失敗。如果沒有傳送成功(第14行)，則增加第i個裝置的資訊年齡AoI，例如加上1(第15行)。如果在第4行的判斷為否，也就是根據預設機率判斷沒有要嘗試傳送資料，則增加第i個裝置的資訊年齡AoI，例如加上1(第18行)。如果在第2行的判斷為否，也就是第i個裝置的資訊年齡(AoI)小於第一臨界值 ，則增加第i個裝置的資訊年齡AoI，例如加上1(第21行)。最後回到第1行處理下一個時槽。值得注意的是，正整數N會小於第一臨界值 ，因為裝置並不會使用上一輪( 個時槽之前)所產生的資料。 in is the data generation time, Also called the current time slot, The time slot generated for the data. If no data has been generated in the previous N time slots, new data is generated (line 8) and the data generation time is reset (line 9), that is, the data generation time G is set to 1. Next, the data is transmitted (line 11). If no new data is generated, the old data generated in the jth time slot is transmitted. Otherwise, the new data generated currently is transmitted. If the transmission is successful (line 12), the information age AoI of the i-th device is set equal to the data generation time G (line 13). If there are other devices transmitting data in the same time slot, the i-th device will not receive the confirmation, which will cause the data transmission to fail. If the transmission is not successful (line 14), increase the information age AoI of the i-th device, for example, add 1 (line 15). If the judgment in line 4 is negative, that is, it is judged based on the preset probability that there is no attempt to transmit data, then the information age AoI of the i-th device is increased, for example, 1 (line 18). If the judgment in line 2 is no, that is, the age of information (AoI) of the i-th device is less than the first critical value , then increase the information age AoI of the i-th device, for example, add 1 (line 21). Finally, return to line 1 to process the next time slot. It is worth noting that the positive integer N will be smaller than the first critical value , because the device does not use the previous round ( time slots ago).
在此根據上述的演算法提供一個例子來詳細說明。圖3是根據一實施例繪示各個時槽的資訊年齡以及資料產生時間。請參照圖3，曲線310代表資訊年齡，而曲線320代表資料產生時間，橫軸代表時槽(從時槽0至時槽12)，縱軸代表資訊年齡以及資料產生時間的數值。請合併參照圖2與圖3，在此例子中設定第一臨界值 等於3，而正整數N設定為2。此外，為了簡化說明，在此假設演算法200第4行的判斷都為是。首先，在前兩個時槽(時槽0與時槽1)中，演算法第2行的判斷為否，因此跳至第21行增加資訊年齡。 An example is provided here based on the above algorithm to explain in detail. FIG. 3 illustrates the information age and data generation time of each time slot according to an embodiment. Please refer to Figure 3. The curve 310 represents the information age, and the curve 320 represents the data generation time. The horizontal axis represents the time slot (from time slot 0 to time slot 12), and the vertical axis represents the information age and data generation time. Please refer to Figure 2 and Figure 3 together to set the first critical value in this example. is equal to 3, and the positive integer N is set to 2. In addition, in order to simplify the explanation, it is assumed here that the judgments in line 4 of the algorithm 200 are all yes. First, in the first two time slots (time slot 0 and time slot 1), the judgment of line 2 of the algorithm is no, so it jumps to line 21 to increase the information age.
在時槽2中，由於此時的資訊年齡大於等於3，因此進行演算法第5行的判斷，由於先前N個時槽內沒有產生資料，演算法第5行的判斷為否，接著進行第8~9行，產生資料 ，並將資料產生時間G設定為1。假設資料傳送成功，接著進行演算法第13行，將資訊年齡設定為資料產生時間，兩者都為1。 In time slot 2, since the information age at this time is greater than or equal to 3, the judgment on line 5 of the algorithm is made. Since no data has been generated in the previous N time slots, the judgment on line 5 of the algorithm is no, and then the judgment on line 5 of the algorithm is made. Lines 8~9, generate data , and set the data generation time G to 1. Assuming that the data transmission is successful, proceed to line 13 of the algorithm and set the information age to the data generation time, both of which are 1.
在時槽3與時槽4，資訊年齡都小於3，因此演算法第2行的判斷為否，累加資訊年齡(演算法第21行)以後處理下一個時槽。In time slot 3 and time slot 4, the information age is less than 3, so the judgment in line 2 of the algorithm is no, and the information age is accumulated (line 21 of the algorithm) and then the next time slot is processed.
在時槽5，演算法第2行的判斷為是，進行第5行。由於先前N個時槽內沒有產生資料，第5行的判斷為否，因此進行第8~9行，產生資料 ，並將資料產生時間G設定為1。假設資料沒有傳送成功，進行演算法第15行，將資訊年齡累加1。 In time slot 5, the judgment of line 2 of the algorithm is yes, and line 5 is executed. Since no data has been generated in the previous N time slots, the judgment of line 5 is no, so lines 8~9 are executed to generate data. , and set the data generation time G to 1. Assuming that the data is not transmitted successfully, proceed to line 15 of the algorithm to accumulate the information age by 1.
在時槽6，演算法第5行的判斷為是，因此進行第6行的計算，此時k=6、j=5，因此G=6-5+1=2。假設資料傳送成功，在第13行中將資訊年齡設定為資料產生時間，兩者都為2。In time slot 6, the judgment of line 5 of the algorithm is yes, so the calculation of line 6 is performed. At this time, k=6, j=5, so G=6-5+1=2. Assuming that the data transmission is successful, the information age is set to the data generation time in line 13, both of which are 2.
在時槽7，由於資訊年齡小於3，因此演算法第2行的判斷為否，累加資訊年齡(演算法第21行)以後處理下一個時槽。In time slot 7, since the information age is less than 3, the judgment in line 2 of the algorithm is no, and the information age is accumulated (line 21 of the algorithm) before processing the next time slot.
在時槽8，演算法第5行的判斷為否，進行第8~9行，產生資料 ，並將資料產生時間G設定為1。假設資料沒有傳送成功，進行演算法第15行，將資訊年齡累加1。 In time slot 8, the judgment of line 5 of the algorithm is no, and lines 8 to 9 are executed to generate data. , and set the data generation time G to 1. Assuming that the data is not transmitted successfully, proceed to line 15 of the algorithm to accumulate the information age by 1.
在時槽9，演算法第5行的判斷為是，因此進行第6行的計算，此時k=9、j=8，因此G=9-8+1=2。假設資料沒有傳送成功，進行演算法第15行，將資訊年齡累加1。In time slot 9, the judgment of line 5 of the algorithm is yes, so the calculation of line 6 is performed. At this time, k=9, j=8, so G=9-8+1=2. Assuming that the data is not transmitted successfully, proceed to line 15 of the algorithm to accumulate the information age by 1.
在時槽10，演算法第5行的判斷為是，因此進行第6行的計算，此時k=10、j=8，因此G=10-8+1=3。假設資料沒有傳送成功，進行演算法第15行，將資訊年齡累加1。In time slot 10, the judgment of line 5 of the algorithm is yes, so the calculation of line 6 is performed. At this time, k=10, j=8, so G=10-8+1=3. Assuming that the data is not transmitted successfully, proceed to line 15 of the algorithm to accumulate the information age by 1.
在時槽11，演算法第5行的判斷為否，進行第8~9行，產生資料 ，並將資料產生時間G設定為1。假設資料傳送成功，在第13行中將資訊年齡設定為資料產生時間，兩者都為1。 In time slot 11, the judgment of line 5 of the algorithm is no, and lines 8 to 9 are executed to generate data. , and set the data generation time G to 1. Assuming that the data transmission is successful, the information age is set to the data generation time in line 13, both of which are 1.
綜合來說，如果在先前N個時槽內有產生資料，則傳送舊資料(時槽6、9、10)，否則產生並傳送新資料(時槽2、5、8、11)。上述做法有幾個現象。第一，相較於傳統的臨界值ALOHA，上述做法減少產生新資料的頻率，當要求低佔空比的限制下，例如限制佔空比為0.02，上述做法有更大的範圍可以找到合適的第一臨界值 以及傳輸機率，藉此降低平均資訊年齡。第二，當增加正整數N時，會降低產生新資料的頻率，導致更低的佔空比，可以降低平均資訊年齡。第三，當產生資料的活動比率比較高時(例如90%相對於50%)，上述做法可以降低更多的佔空比，同樣可以降低平均資訊年齡。 In summary, if data has been generated in the previous N time slots, the old data (time slots 6, 9, and 10) will be transmitted, otherwise new data (time slots 2, 5, 8, and 11) will be generated and transmitted. There are several phenomena associated with the above approach. First, compared to the traditional critical value ALOHA, the above approach reduces the frequency of generating new data. When a low duty cycle is required, for example, the duty cycle is limited to 0.02, the above approach has a wider range to find a suitable first critical value and transmission probability, thereby reducing the average information age. Second, when increasing the positive integer N, it will reduce the frequency of generating new data, resulting in a lower duty cycle, which can reduce the average information age. Third, when the activity ratio of generating data is relatively high (for example, 90% versus 50%), the above approach can reduce the duty cycle more, and can also reduce the average information age.
圖4是根據一實施例繪示無線網路系統的資料傳輸方法的流程圖。請參照圖4，在步驟401，判斷先前N個時槽內是否已經產生資料。如果判斷結果為是，在步驟402中根據資料已經經過多少個時槽來設定資料產生時間，否則在步驟403中產生新資料並重置資料產生時間。在步驟404中，傳送資料至基地台。在步驟405，判斷是否傳送成功。如果傳送成功，在步驟406中設定資訊年齡等於資料產生時間，否則在步驟407中增加資訊年齡。圖4的流程是對應至圖2演算法的第5~15行，然而圖4的方法可以搭配以上實施例使用也可以搭配其他演算法使用，換言之，圖4的流程之前、之後、以及各步驟之間也可以加入其他的步驟。圖4各步驟可以用電路或是程式碼實作，本揭露並不在此限。FIG. 4 is a flowchart illustrating a data transmission method of a wireless network system according to an embodiment. Please refer to Figure 4. In step 401, it is determined whether data has been generated in the previous N time slots. If the judgment result is yes, in step 402, the data generation time is set according to how many time slots the data has passed; otherwise, in step 403, new data is generated and the data generation time is reset. In step 404, data is transmitted to the base station. In step 405, it is determined whether the transmission is successful. If the transmission is successful, set the information age equal to the data generation time in step 406, otherwise increase the information age in step 407. The process in Figure 4 corresponds to lines 5 to 15 of the algorithm in Figure 2. However, the method in Figure 4 can be used with the above embodiments or with other algorithms. In other words, the process before, after, and each step in Figure 4 Other steps can also be added in between. Each step in Figure 4 can be implemented using circuits or program codes, and the present disclosure is not limited thereto.
雖然本發明已以實施例揭露如上，然其並非用以限定本發明，任何所屬技術領域中具有通常知識者，在不脫離本發明的精神和範圍內，當可作些許的更動與潤飾，故本發明的保護範圍當視後附的申請專利範圍所界定者為準。Although the present invention has been disclosed above through embodiments, they are not intended to limit the present invention. Anyone with ordinary knowledge in the technical field may make some modifications and modifications without departing from the spirit and scope of the present invention. Therefore, The protection scope of the present invention shall be determined by the appended patent application scope.
100:無線網路系統 110:基地台 120:裝置 200:演算法 310,320:曲線 401~407:步驟 100:Wireless network system 110:Base station 120:Device 200:Algorithm 310,320:Curve 401~407: Steps
圖1是根據一實施例繪示無線網路系統的示意圖。 圖2是根據一實施例繪示演算法200的虛擬碼(pseudo code)。 圖3是根據一實施例繪示各個時槽的資訊年齡以及資料產生時間。 圖4是根據一實施例繪示無線網路系統的資料傳輸方法的流程圖。 FIG. 1 is a schematic diagram of a wireless network system according to an embodiment. FIG. 2 illustrates a pseudo code (pseudo code) of the algorithm 200 according to an embodiment. FIG. 3 illustrates the information age and data generation time of each time slot according to an embodiment. FIG. 4 is a flowchart illustrating a data transmission method of a wireless network system according to an embodiment.
200:演算法 200:Algorithm
Claims (8)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| TW111126804A TWI812355B (en) | 2022-07-18 | 2022-07-18 | Wireless network system and data transferring method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| TW111126804A TWI812355B (en) | 2022-07-18 | 2022-07-18 | Wireless network system and data transferring method thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| TWI812355B true TWI812355B (en) | 2023-08-11 |
| TW202406399A TW202406399A (en) | 2024-02-01 |
Family
ID=88585855
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| TW111126804A TWI812355B (en) | 2022-07-18 | 2022-07-18 | Wireless network system and data transferring method thereof |
Country Status (1)
| Country | Link |
|---|---|
| TW (1) | TWI812355B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020223453A2 (en) * | 2019-04-30 | 2020-11-05 | Idac Holdings, Inc. | Open loop harq in wireless systems |
| CN111935550A (en) * | 2020-08-06 | 2020-11-13 | 北京邮电大学 | Data packet scheduling method and device based on timeliness and electronic equipment |
| CN114143744A (en) * | 2020-09-03 | 2022-03-04 | 英特尔公司 | Intelligent transport system co-channel coexistence frame structure with asymmetric gap duration |
| CN114390630A (en) * | 2021-11-29 | 2022-04-22 | 暨南大学 | Internet of things communication method, device and equipment based on information age and storage medium |
| CN114615684A (en) * | 2022-02-25 | 2022-06-10 | 哈尔滨工业大学（深圳） | Information age optimization method and device of closed-loop system and storage medium |
-
2022
- 2022-07-18 TW TW111126804A patent/TWI812355B/en active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020223453A2 (en) * | 2019-04-30 | 2020-11-05 | Idac Holdings, Inc. | Open loop harq in wireless systems |
| CN111935550A (en) * | 2020-08-06 | 2020-11-13 | 北京邮电大学 | Data packet scheduling method and device based on timeliness and electronic equipment |
| CN114143744A (en) * | 2020-09-03 | 2022-03-04 | 英特尔公司 | Intelligent transport system co-channel coexistence frame structure with asymmetric gap duration |
| CN114390630A (en) * | 2021-11-29 | 2022-04-22 | 暨南大学 | Internet of things communication method, device and equipment based on information age and storage medium |
| CN114615684A (en) * | 2022-02-25 | 2022-06-10 | 哈尔滨工业大学（深圳） | Information age optimization method and device of closed-loop system and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| TW202406399A (en) | 2024-02-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8040836B2 (en) | Local network coding for wireless networks | |
| US20200213019A1 (en) | Method and Apparatus for Adaptive Searching of Distributed Datasets | |
| CN107995036B (en) | Data transmission method, device, server and readable storage medium | |
| US9369255B2 (en) | Method and apparatus for reducing feedback and enhancing message dissemination efficiency in a multicast network | |
| RU2670605C9 (en) | System and method for indicating type of response frame | |
| US10659941B2 (en) | Communicating packets in a mesh network | |
| CN108040355B (en) | Network access method and system | |
| US11671210B2 (en) | Retransmission control method, communications interface, and electronic device | |
| CN103716137A (en) | Method and system for identifying reasons of ZigBee sensor network packet loss | |
| CN102651229B (en) | Semiconductor device and data processing method | |
| US10187179B1 (en) | System for configuring a packet detection threshold of an audio device | |
| US8010103B2 (en) | Passive and active scanning in wireless network | |
| KR20220010450A (en) | User equipment assistance for resource selection in new radio vehicle to everything | |
| TW202119253A (en) | System and method for producing test data | |
| TWI812355B (en) | Wireless network system and data transferring method thereof | |
| US20130070781A1 (en) | Probabilistic contention window management | |
| WO2022156801A1 (en) | Method for determining validity of reference signal transmission occasion, and user equipment | |
| CN113259490B (en) | Multi-level node network data transmission method based on UDP transmission protocol | |
| CN112261703B (en) | Cross-protocol opportunistic routing method and device, electronic equipment and storage medium | |
| CN110990490A (en) | Method, device, equipment and medium for posting block chain in block chain network | |
| CN114885393B (en) | Control method and device for network access of equipment and terminal equipment | |
| TWI811006B (en) | Wireless internet of things system and wireless communication method thereof for reducing duty cycle | |
| WO2021142664A1 (en) | Communication frequency point determination method and apparatus, electronic device, and medium | |
| US20210092644A1 (en) | Rts/cts handshaking method for improving efficiency of communication resources | |
| Orooji et al. | Performance analysis of spectrum monitoring for cognitive radios |