Study on IEEE 802.11s MDA Reservation Mechanism for Weighted Adjustment Scheduling Algorithm in Multi-channel for Wireless Mesh Network

碩士 === 國立臺灣科技大學 === 電機工程系 === 100 === A wireless mesh LAN is a communications network made up of radio nodes that support Mesh service. In IEEE 802.11s draft, not only the Mesh network topology be introduced, but also a new reservation based MAC access scheme, MDA, be introduced. Nodes that support...

Full description

Bibliographic Details
Main Authors: MING-CHE HSU, 許銘哲
Other Authors: Bih-Hwang Lee
Format: Others
Language:zh-TW
Published: 2012
Online Access:http://ndltd.ncl.edu.tw/handle/s48r65
id ndltd-TW-100NTUS5442144
record_format oai_dc
spelling ndltd-TW-100NTUS54421442019-05-15T20:51:11Z http://ndltd.ncl.edu.tw/handle/s48r65 Study on IEEE 802.11s MDA Reservation Mechanism for Weighted Adjustment Scheduling Algorithm in Multi-channel for Wireless Mesh Network IEEE 802.11s MDA在多通道環境下以權重調整為基礎之排程方案之研究 MING-CHE HSU 許銘哲 碩士 國立臺灣科技大學 電機工程系 100 A wireless mesh LAN is a communications network made up of radio nodes that support Mesh service. In IEEE 802.11s draft, not only the Mesh network topology be introduced, but also a new reservation based MAC access scheme, MDA, be introduced. Nodes that support MDA can access wireless medium with lower collision probability. In a previous study, it was suggested so that MDA can operate on multi-channel environment. Compared with the MDA, MMDA does effectively enhance the system performance. In addition, there has a research study on MMDA in high loading situation. The data transmission period has been reserved to the saturation, and it can dynamically allocate Contention Period ratio to increase date Transmission Period. So it helps to reserved more MDAOP to improve system performance. However, in multi-hop network environment, each mesh nodes transmission data are first-in-first-out sorting mechanism. Thus, when the high hop-count data is in the forwarding process, it’s also arranged in a queue behind the position. When the network load becomes heavy, high hop-count of transmission opportunities will be reduced. Hence, discard probability will improve. Besides, the high hop-count data re-transmission cost is also higher than the low hop-count. This result will cause the waste of network resources and unfairness. In order to solve the above problems, we propose a dynamic adjustment of the sorting queue. The method considers data Time-to-live (TTL), and MeshRetryTimeout to do the adjustment factors. This thesis hopes to increase the transmission performance of high hop-count to achieve balance of the network system. Bih-Hwang Lee 黎碧煌 2012 學位論文 ; thesis 63 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立臺灣科技大學 === 電機工程系 === 100 === A wireless mesh LAN is a communications network made up of radio nodes that support Mesh service. In IEEE 802.11s draft, not only the Mesh network topology be introduced, but also a new reservation based MAC access scheme, MDA, be introduced. Nodes that support MDA can access wireless medium with lower collision probability. In a previous study, it was suggested so that MDA can operate on multi-channel environment. Compared with the MDA, MMDA does effectively enhance the system performance. In addition, there has a research study on MMDA in high loading situation. The data transmission period has been reserved to the saturation, and it can dynamically allocate Contention Period ratio to increase date Transmission Period. So it helps to reserved more MDAOP to improve system performance. However, in multi-hop network environment, each mesh nodes transmission data are first-in-first-out sorting mechanism. Thus, when the high hop-count data is in the forwarding process, it’s also arranged in a queue behind the position. When the network load becomes heavy, high hop-count of transmission opportunities will be reduced. Hence, discard probability will improve. Besides, the high hop-count data re-transmission cost is also higher than the low hop-count. This result will cause the waste of network resources and unfairness. In order to solve the above problems, we propose a dynamic adjustment of the sorting queue. The method considers data Time-to-live (TTL), and MeshRetryTimeout to do the adjustment factors. This thesis hopes to increase the transmission performance of high hop-count to achieve balance of the network system.
author2 Bih-Hwang Lee
author_facet Bih-Hwang Lee
MING-CHE HSU
許銘哲
author MING-CHE HSU
許銘哲
spellingShingle MING-CHE HSU
許銘哲
Study on IEEE 802.11s MDA Reservation Mechanism for Weighted Adjustment Scheduling Algorithm in Multi-channel for Wireless Mesh Network
author_sort MING-CHE HSU
title Study on IEEE 802.11s MDA Reservation Mechanism for Weighted Adjustment Scheduling Algorithm in Multi-channel for Wireless Mesh Network
title_short Study on IEEE 802.11s MDA Reservation Mechanism for Weighted Adjustment Scheduling Algorithm in Multi-channel for Wireless Mesh Network
title_full Study on IEEE 802.11s MDA Reservation Mechanism for Weighted Adjustment Scheduling Algorithm in Multi-channel for Wireless Mesh Network
title_fullStr Study on IEEE 802.11s MDA Reservation Mechanism for Weighted Adjustment Scheduling Algorithm in Multi-channel for Wireless Mesh Network
title_full_unstemmed Study on IEEE 802.11s MDA Reservation Mechanism for Weighted Adjustment Scheduling Algorithm in Multi-channel for Wireless Mesh Network
title_sort study on ieee 802.11s mda reservation mechanism for weighted adjustment scheduling algorithm in multi-channel for wireless mesh network
publishDate 2012
url http://ndltd.ncl.edu.tw/handle/s48r65
work_keys_str_mv AT mingchehsu studyonieee80211smdareservationmechanismforweightedadjustmentschedulingalgorithminmultichannelforwirelessmeshnetwork
AT xǔmíngzhé studyonieee80211smdareservationmechanismforweightedadjustmentschedulingalgorithminmultichannelforwirelessmeshnetwork
AT mingchehsu ieee80211smdazàiduōtōngdàohuánjìngxiàyǐquánzhòngdiàozhěngwèijīchǔzhīpáichéngfāngànzhīyánjiū
AT xǔmíngzhé ieee80211smdazàiduōtōngdàohuánjìngxiàyǐquánzhòngdiàozhěngwèijīchǔzhīpáichéngfāngànzhīyánjiū
_version_ 1719104738271690752