TWI268060B - Media access communication protocol installed under IEEE 802.11 ad hoc wireless network environment - Google Patents

Media access communication protocol installed under IEEE 802.11 ad hoc wireless network environment Download PDF

Info

Publication number
TWI268060B
TWI268060B TW93116745A TW93116745A TWI268060B TW I268060 B TWI268060 B TW I268060B TW 93116745 A TW93116745 A TW 93116745A TW 93116745 A TW93116745 A TW 93116745A TW I268060 B TWI268060 B TW I268060B
Authority
TW
Taiwan
Prior art keywords
node
wireless network
transmission
atim
network environment
Prior art date
Application number
TW93116745A
Other languages
Chinese (zh)
Other versions
TW200425678A (en
Inventor
Shih-Lin Wu
Pao-Chu Tseng
Original Assignee
Univ Chang Gung
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Univ Chang Gung filed Critical Univ Chang Gung
Priority to TW93116745A priority Critical patent/TWI268060B/en
Publication of TW200425678A publication Critical patent/TW200425678A/en
Application granted granted Critical
Publication of TWI268060B publication Critical patent/TWI268060B/en

Links

Abstract

The invention comprises two methods, which firstly schedules transmission of each active host system to reduce some unnecessary idle time and reduce the data collision during transmission and further employs the fully connected nature of wireless network topology so that each active host system in network can mutually hear the message transmitted from each node that can dynamically adjust the ATIM window size.

Description

1268060 玖、發明說明: : 【發明所屬之技術領域】 本毛明係有關於-種在I職_· 11 a(j hoc無線網路環境下所設計媒 體擷取通訊協定之方法,尤指_種在特定之臓說u ad —無線網路 環境下,所設計之媒體擷取通訊協定。 【先前技術】 本發明的電源管理協定固然為觀觀· n標準的改進技術,但此利 用正口排城動恶5周整職802· 11 ad hoc網路電源管理中的ATIM視窗 ;^的U來提昇adhoc無線網路的效能,目前尚無類似的文章或成品 【發明内容】 本發明之主要目的在提供_種在臟·· n 所設之媒體擷取通訊協定以達省電之功效。 衣兄卜 ’ ΐ發明主要係包括兩個步驟。首先是對每—個行動主 ,择專輸排知,以減少一些不必要的閒置時間及減少傳送中的資料發生 ,里’再利収全連接(fully _ected)無線網路姆的特性,網路中 母個仃動主機可以互相聽到彼此所送, ·^ 作動態的調整。 木進而將ATIMwind〇wSlze 【實施方式】 IEEE802.11的規範中,假設網路中所有的行動 《幌,咖嫩編™ == 同的日祕1始。在be勘n interval開始的時候,每 且會在ATIM windQw期間—直醒著。假如有—二動 栈有臟ast暫存職魏給餘省f ;;;::^ATIM frame mine式的彳了動主機會回應—個a 個beacon lnterval期間,傳送者與接收者 下弋正 ^ DCF w 1268060 齡 * \ , ^ ·' · ; ’ 一框。而為了使處於省電模式的行動主機擁有較高的優先權,只有beac〇n、 "ACK RTS、CTS 和 ATIM frame 可以在 ATIM window 中被傳送。 : 請參閱如第一圖所示,其中,Node A,B和C在beacon interval開始1268060 玖 发明 发明 发明 发明 发明 发明 发明 发明 发明 发明 发明 发明 发明 发明 发明 发明 发明 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本In a specific wireless network environment, the designed media capture protocol. [Prior Art] The power management protocol of the present invention is an improved technology of the observation n standard, but the use of the positive port Defeated City 5 weeks of full-time 802.11 ad hoc network power management in the ATIM window; ^ U to improve the performance of the adhoc wireless network, there is no similar article or finished product [invention] The main The purpose is to provide the power of the media set by the dirty media to achieve power saving. The brothers' invention mainly consists of two steps. First, for each action master, choose the special sales. Knowing that in order to reduce some unnecessary idle time and reduce the occurrence of data in transit, it is characterized by fully _ected wireless network, and the host in the network can hear each other. Send, ·^ for dynamic adjustment Wood and then ATIMwind〇wSlze [Embodiment] In the IEEE802.11 specification, assume that all actions in the network "幌, 咖嫩编TM == the same day of the secret 1 start. Every time during the ATIM windQw - awake. If there is - the second move stack has dirty ast temporary storage service Wei to Yu province f;;;:: ^ATIM frame mine type of the host will respond - a During beacon lnterval, the sender and receiver are squatting ^ DCF w 1268060 age * \ , ^ · ' · ; ' box. In order to make the mobile host in power saving mode have higher priority, only beac〇n , "ACK RTS, CTS and ATIM frame can be transmitted in the ATIM window. : See as shown in the first figure, where Node A, B and C start at beacon interval

的時候都會醒來。在歷window期間中,node c沒有任何的atim斤廳 要送,所以在ATIM window之後會回到睡眠狀態模式。node A現在有資料 訊框要送給PS node B,首先在ATIM window期間裡,他會傳送一個ATIM frame 給 node B。而且 n〇de B 會回應一個 ATIM ACK 給 node A。在 ATIM window 之後,node A跟node β會遵循DCF存取的規則去交換他們的資料訊框和 ACKs。所有睡眠的n〇(je會在下一個atim window開始的時候再次醒來。我 • 們知暹DCF是建立在contention-based CSMA/CA機制的基礎上的,由於訊 框碰撞和增長訊框的延遲,所以他會浪費珍貴的電池和頻寬。 ^ 在IEEE 802· 11中的ATIM window大小是固定的。然而已有研究報告 指出,ATIM window大小對於產能(throughput)與電量消耗方面有重大的 影響。不同的traffic load需要不同的ATIM window大小,這樣才會有更 好的網路效能。為了達到此目標,在這發明中我們還提出一俩新穎的機制, 可以適應traffic load去動態的調整ATIM window。 =本發明5又计了以下的兩個步驟,目的是要讓行動設備中有限的電量做 隶有效率的利用,其中第一部份是對每一個行動主機的傳輸做排程,以減 少一些不必要的閒置時間及減少傳送中的資料發生碰撞;另一部份是利用 Φ 完全連接(fulW connected)無線網路拓蹼的特性,網路中每個行動主機 可以互相聽到彼此所送出來的訊息,將ATIM window size作動態的調整。 (一)傳輪排裎機制I will wake up when I am. During the window period, node c does not have any atm box to send, so it will return to sleep mode after the ATIM window. Node A now has a data frame to send to PS node B. First, during the ATIM window, he will send an ATIM frame to node B. And n〇de B will respond to an ATIM ACK to node A. After the ATIM window, node A and node β will follow their DCF access rules to exchange their data frames and ACKs. All sleep n〇 (je will wake up again at the beginning of the next atim window. I know that Siam DCF is based on the contention-based CSMA/CA mechanism due to frame collision and delay of the growth frame. So he will waste precious batteries and bandwidth. ^ The size of the ATIM window in IEEE 802·11 is fixed. However, research reports indicate that the size of the ATIM window has a significant impact on throughput and power consumption. Different traffic loads require different ATIM window sizes in order to achieve better network performance. In order to achieve this goal, we also propose a novel mechanism in this invention, which can adapt to traffic load to dynamically adjust ATIM. Window. = The fifth step of the present invention is to take the following two steps in order to make a limited use of the limited amount of power in the mobile device. The first part is to schedule the transmission of each mobile host to Reduce unnecessary idle time and reduce collision of data in transit; the other part is to use Φ fulW connected wireless network topology Nature, every action in the host network can hear each other by sending messages to each other out of the ATIM window size for dynamic adjustment. (A) transfer mechanism Permuterm take off clothes

排程機制可以減少網路中資料訊框被延遲傳送的時間,並增進行動設 備電ϊ使用效能和增加頻道的利用度,以及避免frames的碰撞。為了節省 更多的電池能量,我們m計的通訊協定中,允許當一個處於省電(ps)狀 node ’在元成負料訊框傳送時回到睡眠模式。這個機制跟標準的BEEThe scheduling mechanism can reduce the delay in the transmission of data frames in the network, improve the efficiency of mobile devices, increase channel utilization, and avoid collisions of frames. In order to save more battery power, our m-meter communication protocol allows a power-saving (ps) node to go back to sleep mode when it is transmitted in the negative frame. This mechanism is in line with the standard BEE

802.11的δ又δ十不同,在IEEE 802· 11的標準中,若一個ps node在ATIM window裡接到一個ATIM frame,應該保持醒著在整個beacon區間,直到 下一次的ATIM window結束。因此,我們所設計的通訊協定中,必須先決The δ and δ of 802.11 are different. In the IEEE 802.11 standard, if a ps node receives an ATIM frame in the ATIM window, it should remain awake throughout the beacon interval until the next ATIM window ends. Therefore, in the communication protocol we design, it must be a prerequisite

1268060 =二個node在ATIM window後傳送她什縱的次序。而 低個決独她傳送龍訊料的鱗法,赠整_路上的總耗電量最 花眷2們的提出的PIOtoC()1中,我們稱一個被暫存的data如脈所需 費==間為working duratl〇n,這個t訊被夹帶在每一細Μ㈣肥 停路上每個節點醉够斜間,仙使崎短工作時間 所以在、歷Wlnd0w結束之後,擁有最短她1 -观 n、即點’可岭—個傳魏所暫存的或欲傳送的資料訊框。一個 2的勺^wo响duratlon是指一個她所有耐 =此,e在14次beacon interval中所需傳送及接收資料訊框的 …心’每—個n〇de利⑽序這個tQtai wQrking duratiQn,決定傳 =壬f -個傳送的PS node,這個排程傳送機制是設計為了讓ps n〇de 可=延長他的電池生命,在絲了所有ps nQde傳送之後,剩下的be麵 ^^、,間’用以讓其他的⑽—⑽知依照卿程序^競爭這個 杲"來傳送data frames。這個機制可以分成三個步驟: (A )、建立傳送表: 就如同IEEE 802· 11 -樣,所有節點都是fully c〇nnected和時間同 v的’所以所有PS她的ATIM windows可以同時開始。在beacon intervai 開始的時候,每一個node會在ATIM window區間保持醒著。若有一個node 有為、、罔路中任一 PS node暫存的da_ta frame,或是PS node有暫存的data frame要送給其他的⑽de,他們將會在ATIM window期間送出ATIM frames 、巧他們的接收者。當接收到A·如,之後,接收者會回應—個八顶 ACKs’然後完成在ATIMwind〇w之後保留他們要傳送的的資料什挪㊀權利。 frame裡包含了傳送的ID、接收者的ID和傳送者在ATIM wind〇w之 灸茜化夕y的時間來此筆data frame(稱之為working duration)給接收 者了以。己做 ATIM (Sender一ID,Receiver—ID,Working一Duration)。因為 無線媒介的傳播特性,任何其他的node可以監聽到每一個ATIM frame裡 的資訊。 7 1268060 SS 8. 〇5 年月S修(更;)正替換頁| 表 1 傳送表(transmission table)1268060 = Two nodes transmit her order in the order of the ATIM window. And the low ones decided to send the dragon's material scale method, and the total power consumption on the road was the most costly. In the PIOtoC()1, we called a temporary data such as pulse. ==Between working duratl〇n, this t message is entrained in each fine (four) fat stop on each side of the node drunk enough to slant, Xian makes the short working hours so after the end of the calendar Wlnd0w, has the shortest she 1 - View n, that is, the point 'Ke Ling' - a message frame that is temporarily stored or to be transmitted by Wei. A 2 scoop ^wo ring duratlon means that she is all resistant = this, e needs to transmit and receive data frames in 14 beacon intervals... heart 'every n 〇 de profit (10) order this tQtai wQrking duratiQn, Decided to pass = 壬f - a transmitted PS node, this scheduling mechanism is designed so that ps n〇de can extend his battery life, after all the ps nQde transmission, the remaining be surface ^^, , in order to let the other (10) - (10) know according to the Qing program ^ competition this 杲 " to transmit data frames. This mechanism can be divided into three steps: (A), establish a transfer table: Just like IEEE 802.11 - all nodes are fully c〇nnected and time is the same as v' so all PS her ATIM windows can start at the same time. At the beginning of beacon intervai, each node will remain awake in the ATIM window. If there is a node with a da_ta frame temporarily stored in any of the PS nodes, or if the PS node has a temporary data frame to be sent to the other (10)de, they will send the ATIM frames during the ATIM window. Their recipients. When A·如 is received, the receiver will respond with an eight-top ACKs and then complete the right to keep the information they want to transmit after ATIMwind〇w. The frame contains the transmitted ID, the recipient's ID, and the sender's time in the ATIM wind〇w's moxibustion. This data frame (called working duration) is given to the receiver. I have done ATIM (Sender-ID, Receiver-ID, Working-Duration). Because of the propagation characteristics of the wireless medium, any other node can listen to the information in each ATIM frame. 7 1268060 SS 8. 〇5 year month S repair (more;) replacement page | Table 1 transmission table (transmission table)

Sender^ID Receiver_ID Working—Duration A B 10 A C 20 B C 30 D E 35Sender^ID Receiver_ID Working—Duration A B 10 A C 20 B C 30 D E 35

請參閱如第二圖所示,網路上有五個PSn〇de,分別為節點A,B , C, D及E ’在ATIM window期間,只有四個ATIM訊框被成功的發送,分別 是(A,B,l〇)、(A,C,20)、(B,C,30)、及(D,E,35),而網路上的 母一個節點,皆會建置一個如表1傳送表(transmission table)。它表示 節點A在ATIM window之後,需要10單位時間來傳送資料訊框給節點&, 其他各列可依此類推。 (B )、決定傳送順序 (a)為了要決定ATIM window之後第一個傳送資料訊框的node,每一個 node會將曾經出現在transmi ss i on tab 1 e裡的各節點的work i ng durat i on 分別加總,將會得到各節點的total working during,例如表1中,節點 A的 total working duration 則為 10+20=30,節點8的 total working duration 則為 10+30=40,而節點 C、D 及 E 的 total working duration 則 分別為 20+30=50、35 及 35。 原則上,擁有最短total working duration的節點,將成為傳輸排程 中的第一個傳送者。但有一種情形需考慮,即如表1中的節點D及e,在整 個transmission table中,此兩節點中的資料交換過程中與其他的節點沒 有關係,也就當他們兩者的資料交換完成後,便可同時進入睡眠,我們稱 之為成對的資料流(pair-flow),此時若讓此pair-flow有第一個資料傳 送的權利時,有機會讓整個網路的總耗電量降低;因此,當transmission table中存在著pair-flow時,我們的演算法會試圖讓此pair—n〇w有最 8 ....... 1268060 = 亚重新計算讓灿―—提前傳送的所有節—耗電旦, 順序。 讀決定傳輸 (b)在選擇下一個傳送者時,我們的演算法合 · 中已完成排序的部份刪 、=咖测taMe 將持續黾十· · 得k即點。而此兩步驟 我Γ10η table中所有節點的傳送順序都決定為止。 35、及 35。^入 〇及E 的 t〇tal W〇rklng during 分別為 20、30、50、 將I二t ’因為節點A擁有最小日勺t()tal WOTking du]fatic)n,節 ^將广成為ATIM window之後第-個傳送資料訊框的節點;但是因為 定table中存在著_的餘—flQw,因此我們試圖將其設 j弟-個傳送者,接著我們依照步驟⑹,將ATIM (D,e,35)刪除,此See the second figure, there are five PSn〇de on the network, namely nodes A, B, C, D and E. During the ATIM window, only four ATIM frames were successfully sent, respectively ( A, B, l〇), (A, C, 20), (B, C, 30), and (D, E, 35), and the parent node on the network will be built as shown in Table 1. Transmission table. It means that node A needs 10 units of time after the ATIM window to transmit the data frame to the node & the other columns can be deduced by analogy. (B), determine the order of transmission (a) In order to determine the node of the first data frame after the ATIM window, each node will work i ng durat of each node that has appeared in transmi ss i on tab 1 e If i on is added separately, it will get the total working during each node. For example, in Table 1, the total working duration of node A is 10+20=30, and the total working duration of node 8 is 10+30=40. The total working durations of nodes C, D, and E are 20+30=50, 35, and 35, respectively. In principle, the node with the shortest total working duration will be the first transmitter in the transmission schedule. However, there is a situation to be considered, that is, nodes D and e in Table 1, in the entire transmission table, the data exchange process in the two nodes has no relationship with other nodes, that is, when the data exchange between them is completed. After that, we can go to sleep at the same time. We call it pair-flow. If we have this pair-flow right to transmit the first data, we have the opportunity to make the total consumption of the entire network. The power is reduced; therefore, when there is a pair-flow in the transmission table, our algorithm will try to make this pair-n〇w have the most 8 .... 1268060 = Sub-recalculation lets the Chan - advance All sections transmitted - power consumption, order. Read decision transmission (b) When selecting the next transmitter, the part of our algorithm that has been sorted is deleted, and the taMe will continue to 黾10. And in these two steps, the order of transmission of all the nodes in the 10n table is determined. 35, and 35. ^〇〇 and E's t〇tal W〇rklng during 20, 30, 50, respectively, I 2 t 'Because node A has the smallest tune t()tal WOTking du]fatic)n, the section ^ will become the ATIM After the window, the node that transmits the data frame is the first one; but because there is a residual_flQw in the table, we try to set it as a transmitter, then we follow the step (6) to ATIM (D, e , 35) delete, this

transmission table t ^ total working duration ^ I-I 成為弟-個餅訊轉送者,航_傳補序將變為(D—>e)、(a_>b) 及(A >C)然後才疋(b-〉c) ’我們發現這樣排序的結果所消耗的總電量為 =5+(10+20)*3娜2:325,小於將擁有最短 total w〇rking durati〇n 的 節點A没為第-個傳送者的耗電量為少,這樣的傳送順序為(a—⑻及 (八>〇、<3->〇然後才是(〇->£),總耗電量為(1〇+2〇)*5+30*4+35*2=340。 因此,在這樣的情形下,我們的演算法將選擇將pair_fl〇w提前的順序來 作傳送排程。 (C )、傳送 data frame 在ATIM window結束後,每個節點依據之排序的結果,依次傳送資料 說框’而母個節點可使用頻道的時間為將與AIMT訊框中定義的時間相同。 我們一樣用弟一圖來說我們的運作方式;在ATIM window結束之後,等待 一個SIFS的時間’郎點D首先將資料訊框送出給節點e,當他們成功的將 資料訊框傳送完成後,可同時回到睡眠狀況;等待一個Sips的時間後,第 二個傳送者,節點A,將分別傳送資料訊框給節點b及節點C,當節點A 完成資料傳送後同樣可以回到睡眠狀況;最後節點B同樣等待SIFS時間 1268060 ~^ΤΎΓ . 年月日修(更)正替換: 點,依DCF程序K〇^terVal將可供其他網路上不是處於省電模式的節 ' '耘序观肀發迗他們欲傳送的資料訊框。 個被傳遞^ ,網路上所有的節崎可正確無誤地接收或監聽每一 因是每個_ 较在無_ad hGC網路中卻枝真的如此,原 們也提出‘、、=動的’加上無線傳輸媒介不可靠的傳送特性,當然我 覆方法來解決此問題。同樣地,我們還是以第二圖 龄如㈣作的’假魏_沒有舰之雜㈣次序來 專Τί、ΐ即點E,此時下—個傳送者,此例中為節‘減若發現在㈣ win+ow、、Ό束後加上二個SIFS的時間,都沒有任何節點在傳送資料,即頻道 '咖 1,了二個SIFS的時間,節點A便判斷節點D可能發生了非翻的錯 誤於疋便立刻送出自己欲傳送的資料訊框,以避免頻道產生不必要閒置 的情形。其結果請參考如第三圖所示。 (二)鱼態調整ATIM WinHrw ς卜p 為了讓處於省電模式下的行動設備能省下更多電,並且增加頻道的使 用率,我們改變原來IEEE 802· 11的省電MAC協定,將其固定的atim window size,改為可變動的,並不事先決定它的大小,而是依據網路上流量的大 小來動能決定ATIM window size,詳細的運作程序如下,我們設定了兩個 ATIM Window必須終止的規則,並且在表2中我們詳列了下面穑述中所需的 • 用到的變數及常數: 表2通訊- 除定中所使用的參數 TsiFS time of short inter-frame spacing Tdifs time of distributed inter-frame spacing Tack time to transmit an ACK Tcw-min time of min. contention window TFrame time to transmit j?th data frame in scheduling "table TFRAME-min time to transmit a rain, data frame Tatim time to transmit an ATIM frame TcURR last ATIM frame transmission ending time ϊ268〇6〇 ^9: Ο 5 年>j β修便)正潜狯Transmission table t ^ total working duration ^ II becomes the brother-seat message transferer, the navigation_transfer sequence will become (D->e), (a_>b) and (A >C) then B->c) 'We found that the total power consumed by this sorted result is =5+(10+20)*3Na 2:325, which is less than the node A that will have the shortest total w〇rking durati〇n - The transmitter consumes less power. The order of transmission is (a - (8) and (eight > 〇, <3-> 〇 then (〇 - > £), the total power consumption is (1〇+2〇)*5+30*4+35*2=340. Therefore, in such a case, our algorithm will choose to advance the order of pair_fl〇w in advance. (C) After the end of the ATIM window, each node transmits the data box according to the result of the sorting, and the time when the parent node can use the channel is the same as the time defined in the AIMT frame. In the picture, how we operate; after the end of the ATIM window, wait for a SIFS time 'Lang D to send the data frame to node e first, when they succeed in the information After the transfer is completed, it can return to the sleep state at the same time; after waiting for a time of Sips, the second transmitter, node A, will transmit the data frame to node b and node C respectively, and when node A completes the data transmission, it can also return. To sleep state; finally, Node B also waits for SIFS time 1268060 ~^ΤΎΓ. Year, month, repair (more) is replacing: Point, according to DCF program K〇^terVal will be available for other sections on the network that are not in power saving mode' The order of view is the information frame they want to transmit. The ones that are transmitted ^, all the festivals on the network can receive or monitor correctly. Really, the originals also proposed ',, = move' plus the unreliable transfer characteristics of wireless transmission media, of course, I have to solve this problem. Similarly, we are still using the second figure (4) Fake Wei _ no ship miscellaneous (four) order to specialize ί, ΐ point E, this time the next transmitter, in this case for the section 'decrease if found in (four) win+ow, after the addition of two SIFS At the time, no node is transmitting data, ie channel 'Caf 1' At the time of two SIFS, node A judges that node D may have a non-turning error and immediately sends out the data frame that he wants to transmit, so as to avoid unnecessary idleness of the channel. For the result, please refer to the third figure. (2) Fish state adjustment ATIM WinHrw p p p In order to save more power in mobile devices in power saving mode, and increase channel usage, we changed the original IEEE 802·11 power saving MAC protocol Change its fixed atim window size to changeable, without predetermining its size. Instead, determine the ATIM window size based on the amount of traffic on the network. The detailed operation procedure is as follows. We have set two ATIMs. The rules that Window must terminate, and in Table 2 we detail the variables and constants used in the following description: Table 2 Communication - Parameters used in the delimitation TsiFS time of short inter-frame spacing Tdifs Time of distributed inter-frame spacing Tack time to transmit an ACK Tcw-min time of min. contention window TFrame time to transmit j?th data frame in scheduling " Table TFRAME-min time to transmit a rain, data frame Tatim time to transmit an ATIM frame TcURR last ATIM frame transmission ending time ϊ268〇6〇 ^9: Ο 5 years>j β修便)

Beacon IntervalBeacon Interval

規則一: ,ATIM/indQw期間所有的行動節點都是醒著的,由於無線傳輸的特 母-個㈣可聽到網路上每—轉送中訊框,不論頻道是閒置或忙石亲, T個f卩點都有相_頻道魏;#網路上的結果_咖道閒置的時間 到Tws +tcw_的時間,我們假設網路上不再有任何節點想要送出…頂1 =,因此所有的節點立刻結束此次的·wind〇w,並且進入傳輸排程的階 奴,也就是 IF Channel IdleTime >= Tdifs + T,n THEN ATIM—WIN = (Τ· - TBTT) + T刪 + Tc驗 m下面我們以第四圖為例說明此運作規則。在ATIM wind〇w期間,只有 2點A送* - A·訊框給節點β,在^之後,節點B回覆咖、給 節點A ’在A及B交換完他們的控制訊框後,節點Α,β,.及c發現頻道^ 置了 TWs +T⑽in的時間,於是他們結束此次的ATIMwind〇w,並且進入傳輸 ,程的階段。根據我們傳輸排程的演算法,在ATIMwind〇w結束後,節點A 等=tsifs後,便將其欲送給節點B的資料訊框送出,當節點A及B完成他們 的貧,傳輸後,便可回到睡眠狀態;至於節點c,因其在ATIM wind〇w期 間’沒有收到或送出任何ATIM訊框,於是它在ATIMwind〇w^#束之後,便 可回到原來的睡眠狀態,其他未使用的beac〇n期間,將可供網路中處於活 動狀態的節點,競爭傳送資料訊框用。 、 規則二: 如如面&到的’在一個完全連接(fully connected)的無線網路中,每 一個網路中的節點可以經由監聽網路上所傳送的ΑΉΜ訊框,得知每個曾經 送出ATIM訊框的節點’在ATIM window結束後需要花多才時間(我們稱之 為working during)來傳送資料訊框;當他們每收到一個ATIM訊框,會 將所茜working during加總,加總後的working during稱之為total 11 1268060 working duration。如果網路上的節點發現,beacon interval扣除到目前 為止所有ATIM訊框所花費掉的時間,再扣除尬ai奶作丨呢血恤忌後剩 下的時間’已不足以用來傳送一個ATIM訊框加上一個最短的資料訊框及ACK 時,便立刻終止ATIMwindow,待一個SIFS的時間後,所有傳送過ATIM訊 框的節點’依據排程後的傳遞資料訊框的順序,依序發送自己的資料訊框。 也就是當Rule 1: All the action nodes during the ATIM/indQw period are awake, because the special transmission of the wireless transmission--(four) can hear every transmission media frame on the network, regardless of whether the channel is idle or busy stone, T f卩点有相_Channel Wei; #网络的结果_Cao Dao idle time to Tws +tcw_ time, we assume that there are no more nodes on the network that want to send out... Top 1 =, so all nodes immediately End this ·wind〇w, and enter the order of the transmission slave, that is, IF Channel IdleTime >= Tdifs + T, n THEN ATIM-WIN = (Τ· - TBTT) + T delete + Tc test m below We use the fourth picture as an example to illustrate this operational rule. During the ATIM wind〇w, only 2 points A send * - A · frame to node β, after ^, node B returns to the coffee, to node A 'after A and B exchange their control frame, nodeΑ , β, . and c found that channel ^ set TWs + T (10) in time, so they ended the ATIMwind 〇 w, and entered the transmission, the stage of the process. According to the algorithm of our transmission schedule, after the end of ATIMwind〇w, after node A, etc. =tsifs, the data frame to be sent to node B is sent out. When nodes A and B complete their poverty, transmission, You can go back to sleep; as for node c, because it did not receive or send any ATIM frame during ATIM wind〇w, it can return to its original sleep state after ATIMwind〇w^# bundle. During the period of other unused beac〇n, the nodes in the network that are active will be used to compete for the data frame. Rule 2: As in the face & to 'in a fully connected wireless network, each node in the network can learn each message through the frame transmitted on the network. The node that sent the ATIM frame 'has to spend a lot of time (we call it working during) at the end of the ATIM window to transmit the data frame; when they receive an ATIM frame, they will add the total during the processing, plus The total working period is called total 11 1268060 working duration. If the node on the network finds that the beacon interval deducts the time spent on all the ATIM frames so far, and then deducts the remaining time after the bloody taboo is not enough to transmit an ATIM frame. With the shortest data frame and ACK, the ATIMwindow is terminated immediately. After the time of one SIFS, all the nodes that have transmitted the ATIM frame send their own in order according to the order of the data frames after scheduling. Information frame. That is when

ReraainingBI = TBTTnext ^ - TsIFs - Z(1-lton)(Wi IF RemainingBI < 2TWs + TWme- + Tack THEN ATIM-WI. Τ·-TBTTReraainingBI = TBTTnext ^ - TsIFs - Z(1-lton)(Wi IF RemainingBI < 2TWs + TWme- + Tack THEN ATIM-WI. Τ·-TBTT

Tsifs + Tack /Tsifs + Tack /

ixxxm_nin-丄curr一 IDI1 ^月參閱如第五圖所不,在TBTT時間,網路上的每個節點都會一起競爭 beacon,待網路上其中一節點成功發送出beac〇n後(第四圖及第五圖 ,略發达^beacon的部份),網路上的所有節點依照DCF的方式競爭發送atim ,框。在第五圖中,節點a,Β,及c分別成功的送出簡訊框給節點β, ^及A,而網路中在傳送,接收或閒置的節都會依據訊框裡所夹帶 白=w〇rklng duratl〇n的訊息,去計算目前所剩餘的以細 上:ningBI)大小,當他們聽到節點C送出來的訊框時也發現 小於發送—個ATIM訊框加上—個最小資料訊框所需 ’·、Γ的各節點’便在節點B回覆ACK給節點c後結束這一次 、 Wlnd〇W,即點八在ATIM window結束後SIFS的時間’將資料訊柜 送給節點B ’而節點BAC將依序H 碰 資料傳送難的演算法所做的貝似框,此傳歧序將依照我們 (i)i擬環境 並與 的恤mc' load則=據=個^到4G個’每次增加1◦個。網路上 的網路情形,我們$ x lsSQn》佈產生。為了讓模擬環境更符合真實 我們讓actlve行動主機與PS行動主機相較起來有較^Ixxxm_nin-丄curr-IDI1 ^Monday, as shown in the fifth figure, at the TBTT time, each node on the network will compete with the beacon, and one of the nodes on the network will successfully send the beac〇n (fourth figure and the first Five maps, slightly developed ^beacon part), all nodes on the network compete to send atm, box according to DCF. In the fifth figure, nodes a, Β, and c respectively send the message box to nodes β, ^ and A, respectively, while the nodes in the network that transmit, receive, or idle are based on the white=w 〇rklng duratl〇n message, to calculate the current remaining size: ningBI) size, when they hear the frame sent by node C also found that less than send - an ATIM frame plus a minimum data frame The required '·, 各's nodes' will end this time after Node B replies ACK to node c, Wlnd〇W, that is, at the SIFS time after the end of the ATIM window, 'send the data cabinet to node B' The node BAC will follow the order H to the data transfer difficult algorithm. The sequence will be in accordance with our (i)i environment and the shirt mc' load = data = ^ ^ to 4G ' Increase by 1 each time. The network situation on the network, we generated $x lsSQn. In order to make the simulation environment more realistic, we have the actlve mobile host compared with the PS mobile host.

12 1268060 -~^5r97VT 〜 年月日修(更j正替換計 packet arrive rate。因此,我們設定active行動主機與PS行動主機的 -packet arrive rate 分別為 6 packets/sec 及 1 packets/sec。而每個封 包的接收者疋k機遥自於網路上的行動主機。實驗中的]3eacon interval 為100ms ;另外’ IEEE 802.11的ATIM window為5 ms,而我們所提出的 省電方法的ATIM window是依網路上的traffic load作動態調整。在我們 的模擬貫驗中,傳送封包時電篁的消耗數據如表3。表3是參考於[L·12 1268060 -~^5r97VT ~ Year and month repair (more j is replacing the packet arrival rate. Therefore, we set the -packet arrival rate of the active mobile host and the PS mobile host to 6 packets/sec and 1 packets/sec respectively. The receiver of each packet is remote from the mobile host on the network. The 3eacon interval in the experiment is 100ms; the 'ATIM window of IEEE 802.11 is 5 ms, and the ATIM window of our proposed power saving method is According to the traffic load on the network for dynamic adjustment. In our simulation test, the power consumption data of the packet when transmitting the packet is shown in Table 3. Table 3 is based on [L·

Feeney. An Energy Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks. ACM/ Kluwer Mobile 躲加r如肌/始·飢s,V〇i· 6, pp· 239 — 249, 2〇〇1·],它是實際 利用Lucent WaveLAN的無線網路卡來作實驗,所測出在傳送各種封包時;^ 需的電源消耗量。每-組模擬時間都是執行2〇秒。我們觀察如下四項么士果 來證明我們的方法相較於麵802.u有較佳的表現;分別為電量的^用 效率(Kbytes/joule)、網路上各主機為每秒傳送的資料量總和 (Kbytes/sec) ’ ATIM訊框碰撞的次數,及自奶-行動主機與ps 機主機送出的訊框數。 表3模擬中所使用的電量消耗參數Feeney. An Energy Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks. ACM/ Kluwer Mobile Avoiding r such as muscle/starting hunger, V〇i· 6, pp· 239 — 249, 2〇〇1· ], it is actually using the wireless network card of Lucent WaveLAN to experiment, and it is measured when the various packets are transmitted; Each set of simulation time is executed for 2 seconds. We observe the following four factors to prove that our method has better performance than 802.u; the power efficiency (Kbytes/joule) and the amount of data transmitted by each host on the network per second. Sum (Kbytes/sec) 'The number of ATIM frame collisions, and the number of frames sent from the milk-action host and the ps host. Table 3 Power consumption parameters used in the simulation

Parameter —---Value Transmit 420+1.9xframe size (//J) Receive 330+0. 42xframe size (// J) idle 808mW doze —---^27mWParameter —---Value Transmit 420+1.9xframe size (//J) Receive 330+0. 42xframe size (// J) idle 808mW doze —---^27mW

電=制效轉果线在第六圖。第第六圖 主機,包括act則行動主機與四行 =上母個仃動 位焦耳的資料傳輸量。而第六圖(動為機在20㈣模擬過程中單 用效率。由第六圖⑷及第六圖PS行動主機的電量使 提出的方法有較優的表現。尤其是1^目^職咖.1卜本發明所 是臟觀u的5倍。會有這、dPS了動域而言,本發明的效能甚至 有讀結果,是因為本發明採用了排程的策略, 13 祗 9· 1268060 ..... I > 扯勢. 去減少訊框碰齡及電量的消耗;而動_整 少了行動主機不必要的閒置時間。另外,第七圖則是用來,’亦減 路中累積的資料輸出量。相同地’本發明同樣分別利 ^ ⑸說明網路中所有行動主機及只針 =)及弟七圖 ^ IEEE 80, Π 在本發明所設計的協定中,PS行動主機在_視窗後,不需要再為 而且只要是在A™視窗曾經成功送出ATIM的:機,: 疋可以成功地將暫存的資料訊框送給目的主機。因此動乂 定柯以避免許多不必要的閒置時間,而訊框碰撞== 會減少’且有較佳的頻道使用率。 也有 接由第人圖可以清楚的看出,在·視窗綱,聰峨 =源官理所造成的ΑΉΜ訊框碰撞次數,遠比本發明所提出的省電方 由= 登明本發明所提出的齡,的確可大大減緩龍訊框碰撞的 賴提«定的運作料,這獅果是可職的 的協定中’ a™視窗會依網路上資料流量的多募作適當地調整m 11的ATIM視窗卻不管網路上資料流量的情形而固定不變。 第九圖說明了在模擬的過程中’姑-行動主機及叫亍動主機 出的純赌數。很清楚地可以知道,在我們所提出的協定中, =4丁動主機,連active行動主機都比麵觀n有較好的表現。 弟二圖,第七圖及第八圖,我們可以證實這個省電騎訊協定亦可以 滅輕貢料的延遲’這對有qqS限制的龍而言是很重要的。 由以上的換擬貫驗,可證明此發明協定相較於傳統臓· Η協定 的電源管理的效能,*但可讓單位焦傳輸量(断奴咐心聊, ytes/joule)提昇25%〜2GG% ’還可以因為大幅減少碰撞的次數,進而提昇 網路的封包傳輸率(throughput, bytes/sec)。 【圖式簡單說明】 第一圖係為IEEE 802.11電源管理運作模式。 第一圖係為排程通訊協定的運作例子。 第一圖係為排程通訊協定錯誤修覆(err〇r re⑽㈣的運作例子。 14 1268060 [7T〇i 修(更赚丨 第四圖係為第一種結束ATIM window的方法,其中,當channelIdleTime - — >=Tdifs + Tcwmin時,每個行動主機便立刻結束此時的ΑΉΜ window ° 第五圖係為第二種結束ATIM window的方式,其中,當RemainingBI< 2Tsifs + TFRAMEmin + !^〇^時,每個行動主機便立刻結束此時的 ATIM window ° 第六圖(9)在模擬的難巾’财的行動域在網路上所產生的單位焦 耳的資料輸出量。⑹僅考慮網路中處於ps狀態的行動主機: 所產生的單位焦耳的資料輸出量。 第七_)在模擬的過財’所錢行社機在網路上職生的單位時 間的資料輸出量。⑹僅考慮網路中處於ps狀態的行動主機, 所產生的單位時間的資料輸出量。 1同_路流量所造成不同的ATIM訊框碰撞的次數。 弟九圖=為PS及active行動主機在模擬的過程中分別送㈣資料訊Electricity = system effect fruit line in the sixth picture. Figure 6 The host, including act, the mobile host and the four lines = the upper parent's data transfer amount. The sixth figure (moving for the machine in the 20 (four) simulation process alone efficiency. From the sixth figure (4) and the sixth figure PS mobile host power to make the proposed method has a better performance. Especially 1 ^ ^ ^ ^. 1 The present invention is five times as large as the dirty view u. With this, dPS, the performance of the present invention has even read results, because the present invention employs a scheduling strategy, 13 祗 9·1268060 . .... I > Ripple. To reduce the age of the frame and the consumption of electricity; and move _ to reduce the unnecessary idle time of the mobile host. In addition, the seventh picture is used, 'also reduce the road Cumulative data output. Similarly, the present invention also provides separate (5) descriptions of all mobile hosts and only pins in the network =) and the other seven figures ^ IEEE 80, Π In the protocol designed by the present invention, the PS mobile host is After the _ window, you don't need to do it anymore. As long as it is successfully sent to the ATIM machine in the ATM window: 疋, you can successfully send the temporary data frame to the destination host. Therefore, it is necessary to avoid many unnecessary idle time, and the frame collision == will decrease 'and have better channel usage rate. It can also be clearly seen from the figure of the first person that the number of collisions caused by the frame in the window of the window is far greater than the power saving method proposed by the present invention. The age of the squad can indeed greatly slow down the collision of the Longxun frame. The lion's fruit is a workable agreement. The ATM screen will adjust the m 11 according to the multiple data flows on the Internet. The ATIM window is fixed regardless of the data traffic on the network. The ninth figure illustrates the number of net gamblings that the affirmative action host and the slamming host have in the process of simulating. It is clear that in our proposed agreement, the =4 host, even the active mobile host has better performance than the face n. In the second picture, the seventh picture and the eighth picture, we can confirm that this power-saving riding agreement can also eliminate the delay of light tribute. This is very important for dragons with qqS restrictions. From the above-mentioned conversion test, it can be proved that the agreement of the invention is better than the power management of the traditional 臓·Η agreement, but the unity coke transmission volume (ytes/joule) can be increased by 25%~ 2GG% ' can also greatly reduce the number of collisions, thereby increasing the network's packet transmission rate (throughput, bytes / sec). [Simple diagram of the diagram] The first diagram is the IEEE 802.11 power management operation mode. The first picture is an example of the operation of a scheduled communication protocol. The first picture is an example of the operation of the scheduling protocol error repair (err〇r re(10)(4). 14 1268060 [7T〇i repair (more profitable fourth picture is the first method to end the ATIM window, where when channelIdleTime - - >=Tdifs + Tcwmin, each action host immediately ends the ΑΉΜ window ° The fifth picture is the second way to end the ATIM window, where RemainingBI< 2Tsifs + TFRAMEmin + !^〇^ At the time, each mobile host immediately ends the ATIM window at this time. Figure 6 (9) The amount of data output per unit of joule generated on the network in the simulated action field of the difficult towel. (6) Only consider the network. The mobile host in the ps state: The data output per unit of joule produced. The seventh _) in the simulated over-profits, the amount of data output per unit of time spent on the Internet. (6) Consider only the network The data output of the mobile host in the ps state, the unit time generated. 1 The number of different ATIM frame collisions caused by the same traffic. The nine-figure map = for the PS and active mobile hosts in the simulation process respectively Send (4) information

Claims (1)

l268〇6〇 ^ V 令·.: 匕.々Η 拾、申請專利範圍: —— 1、-種在臓說11 ad hoe無線網路環境下所設 定之方法,該方法之步驟為: &稍體擷取相協 (7每-個行動主機的傳輸做排程:首妓對每_個行動主機的 αΓ將ΓτίΠ 賴置日销及減少傳送巾的轉發生碰撞; ⑹將ATIM wmdow 作動態的調整:再利用完全連 c〇一)無線網路拓蹲的特性,網路中每個行動主機可以互 彼此所送出來的訊息,將冊wind〇w size作動態的·。心 2專利範圍第i項所述之在臓8〇211 adh〇c無線網路環境下 斤4媒體擷取通Λ定之方法,其中’該傳輪排鋪包 (a) 建立傳送表; · (b) 決定傳送順序;及, (c) 傳送資料訊框。 3、 如申凊專利範圍第2項所述之在臓8〇2· u ad ^無線網路環 所設計媒體擷取通訊協定之方法,其中,該決定傳送順序係演雜成 $的貧料流(pair-flow)有最高的傳送優先權,並重新計算讓成對的 資料流(pair-flow)提前傳送的所有節點總耗電量,再與沒有將其提 前傳送的總耗電量作比較,麵較省電的方式作決定傳輸順序 4、 如申請專利範圍第2項所述之在臓8G2· 11 ad hQe無線網路環境下 所設計媒體擷取通訊協定之方法,其中,該傳送資料訊框係等待一個 SIFS的時間,將資料訊框送出後,可同時回到睡眠狀態,但節點若發 現f ATIM window結束後加上二個SIFS的時間,都沒有任何節點在& 送資料,即頻道持續閒置了二個SIFS的時間,節點便判斷前一節點可 月b發生了非預期的錯誤,於是便立刻送出自己欲傳送的資料訊框,以 避免頻道產生不必要閒置。 5、 如申請專利範圍第丄項所述之在IEEE 802· n ad h〇c無線網路環境下 所設計媒體擷取通訊協定之方法,其中,該動態的調整係為了讓處於 省電模式下的行動設備能省下更多電,並增加頻道的使用率,並藉由 改變原來巧££802.11的省電仏人(:協定,將其固定的"謹^11(1(^4^, 16 ος Q 〇 ς 1 1268060 ^|· έ槪更)正聲換頁 改為可變動的’且不事先決定其大小,而是依據網路上流量的大小來 動能決定 ATIM window size。 拾壹、圖式: 如次頁L268〇6〇^ V 令·.: 匕.々Η Pick up, apply for a patent scope: —— 1, a kind of method set in ad 11 ad hoe wireless network environment, the steps of the method are: & Slightly draw the agreement (7 per-action host transmission schedule: the first 妓 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ The adjustment: reuse the characteristics of the wireless network topology, each mobile host in the network can send messages to each other, the volume windww size for dynamic. The method of the 24〇211 adh〇c wireless network environment described in item ii of the heart 2 patent scope, in the wireless network environment, wherein the transmission tray (a) establishes a transmission table; b) determine the order of transmission; and, (c) transmit the data frame. 3. The method for drawing a communication protocol in the media designed by the wireless network ring in the 臓8〇2·u ad ^ wireless network ring as described in item 2 of the patent scope of the claim, wherein the decision transmission sequence is a poor material The pair-flow has the highest transmission priority, and recalculates the total power consumption of all the nodes that are sent in advance by the paired data flow, and then the total power consumption without transmitting it in advance. Comparing, the power saving method is used to determine the transmission sequence. 4. The method for designing a media retrieval protocol in the 臓8G2·11 ad hQe wireless network environment as described in claim 2, wherein the transmission The data frame waits for a SIFS time. After sending the data frame, it can return to sleep at the same time. However, if the node finds the time after the end of the f ATIM window and adds two SIFS, no node sends the data in & That is, when the channel continues to idle for two SIFS times, the node judges that the previous node may have an unexpected error in the monthly b, and then immediately sends out the data frame that it wants to transmit, so as to avoid unnecessary idleness of the channel. 5. The method for designing a media capture protocol in an IEEE 802. n ad h〇c wireless network environment as described in the scope of the patent application, wherein the dynamic adjustment is in a power saving mode. The mobile device can save more power and increase the channel usage rate, and by changing the original power-saving 仏 802 802 802 : : : : : : : : : : : : : : : : : : : : : : : : : : 802 802 802 802 802 802 802 802 802 802 802 , 16 ος Q 〇ς 1 1268060 ^|· έ槪 ) 正 正 正 正 正 正 正 正 正 正 正 正 正 正 正 正 正 正 正 正 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 Type: as the next page 1717
TW93116745A 2004-06-10 2004-06-10 Media access communication protocol installed under IEEE 802.11 ad hoc wireless network environment TWI268060B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW93116745A TWI268060B (en) 2004-06-10 2004-06-10 Media access communication protocol installed under IEEE 802.11 ad hoc wireless network environment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW93116745A TWI268060B (en) 2004-06-10 2004-06-10 Media access communication protocol installed under IEEE 802.11 ad hoc wireless network environment

Publications (2)

Publication Number Publication Date
TW200425678A TW200425678A (en) 2004-11-16
TWI268060B true TWI268060B (en) 2006-12-01

Family

ID=38220532

Family Applications (1)

Application Number Title Priority Date Filing Date
TW93116745A TWI268060B (en) 2004-06-10 2004-06-10 Media access communication protocol installed under IEEE 802.11 ad hoc wireless network environment

Country Status (1)

Country Link
TW (1) TWI268060B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7630702B2 (en) 2005-03-24 2009-12-08 Lg Electronics Inc. Method of supporting sleep mode in broadband wireless access system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7630702B2 (en) 2005-03-24 2009-12-08 Lg Electronics Inc. Method of supporting sleep mode in broadband wireless access system

Also Published As

Publication number Publication date
TW200425678A (en) 2004-11-16

Similar Documents

Publication Publication Date Title
Yang et al. Modeling and performance analysis for duty-cycled MAC protocols with applications to S-MAC and X-MAC
CN101404602B (en) DCF protocol node self-adapting dormancy mechanism suitable for multi-hop ad hoc network
CN103312697B (en) Based on the underwater sensor network MAC protocol implementation method of space-time justice
CN101232518B (en) Low-power dissipation media access control method of node dynamic state resting
CN1682493B (en) Apparatus and method for announcing a pending QoS service schedule to a wireless station
KR20150016458A (en) Method and apparatus for transmission scheduling in wireless sensor network
CN105792309B (en) Unmanned aerial vehicle group communication routing method is perceived based on game theory QoS towards energy-efficient
WO2007081614A3 (en) Method and apparatus for optimal atim size setup for 802.11 networks in an ad hoc mode
MY134458A (en) A method and an apparatus for adding a new member to an active group call in a group communication network
Zhu et al. Efficient power management for infrastructure IEEE 802.11 WLANs
EP1771033A3 (en) Power saving mode in wireless communications
CN102868602A (en) Improved routing method based on social correlation degree in delay tolerant network
CN102833834B (en) Implementation method for wireless sensor network energy-saving MAC (media access control)
Schmid et al. Disentangling wireless sensing from mesh networking
Zhu et al. Access point buffer management for power saving in IEEE 802.11 WLANs
CN103052091A (en) Adaptive awake window
CN105119726B (en) A kind of wireless sensing net node fast wake-up method and device thereof
JP2006303888A (en) Wireless communication system, wireless network system, communication method, and program
Hong et al. ROSS: Receiver oriented sleep scheduling for underwater sensor networks
Tseng et al. An adaptive contention control strategy for IEEE 802.15. 4-based wireless sensor networks
TWI268060B (en) Media access communication protocol installed under IEEE 802.11 ad hoc wireless network environment
CN110121206A (en) A kind of multi-hop wireless awakening method based on limited queue length queuing model
JP2005260780A5 (en)
Wu et al. An energy efficient MAC protocol for IEEE 802.11 WLANs
Chou et al. Optimal asymmetric and maximized adaptive power management protocols for clustered ad hoc wireless networks

Legal Events

Date Code Title Description
MM4A Annulment or lapse of patent due to non-payment of fees