Routing and Centralized Scheduling Strategies in IEEE 802.16 Mesh Networks
碩士 === 國立東華大學 === 資訊工程學系 === 96 === In the IEEE 802.16 mesh network, we consider the problems of the routing tree construction and centralized scheduling. The routing tree construction algorithm constructs a routing tree and every SS (subscriber station) in the routing tree has its own routing path....
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/99378199779493009946 |
id |
ndltd-TW-096NDHU5392033 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-096NDHU53920332015-10-13T13:51:28Z http://ndltd.ncl.edu.tw/handle/99378199779493009946 Routing and Centralized Scheduling Strategies in IEEE 802.16 Mesh Networks IEEE802.16網狀網路之路由與集中式排程策略之設計 Lyu-Chen Ou 歐律辰 碩士 國立東華大學 資訊工程學系 96 In the IEEE 802.16 mesh network, we consider the problems of the routing tree construction and centralized scheduling. The routing tree construction algorithm constructs a routing tree and every SS (subscriber station) in the routing tree has its own routing path. The centralized scheduling allocates the minislots to all SSs and the SSs transmit the packets along the routing path. The routing tree and centralized scheduling impact the performance of the mesh network. We propose an efficient routing tree construction algorithm and two scheduling algorithms. The costs of our proposed algorithms are compared with existing algorithms. We use experiments to analyze the performance of our algorithms and existing algorithms. The results show that the performance of our algorithms is better than that of other algorithms. Shou-Chih Lo 羅壽之 2008 學位論文 ; thesis 91 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立東華大學 === 資訊工程學系 === 96 === In the IEEE 802.16 mesh network, we consider the problems of the routing tree construction and centralized scheduling. The routing tree construction algorithm constructs a routing tree and every SS (subscriber station) in the routing tree has its own routing path. The centralized scheduling allocates the minislots to all SSs and the SSs transmit the packets along the routing path. The routing tree and centralized scheduling impact the performance of the mesh network. We propose an efficient routing tree construction algorithm and two scheduling algorithms. The costs of our proposed algorithms are compared with existing algorithms. We use experiments to analyze the performance of our algorithms and existing algorithms. The results show that the performance of our algorithms is better than that of other algorithms.
|
author2 |
Shou-Chih Lo |
author_facet |
Shou-Chih Lo Lyu-Chen Ou 歐律辰 |
author |
Lyu-Chen Ou 歐律辰 |
spellingShingle |
Lyu-Chen Ou 歐律辰 Routing and Centralized Scheduling Strategies in IEEE 802.16 Mesh Networks |
author_sort |
Lyu-Chen Ou |
title |
Routing and Centralized Scheduling Strategies in IEEE 802.16 Mesh Networks |
title_short |
Routing and Centralized Scheduling Strategies in IEEE 802.16 Mesh Networks |
title_full |
Routing and Centralized Scheduling Strategies in IEEE 802.16 Mesh Networks |
title_fullStr |
Routing and Centralized Scheduling Strategies in IEEE 802.16 Mesh Networks |
title_full_unstemmed |
Routing and Centralized Scheduling Strategies in IEEE 802.16 Mesh Networks |
title_sort |
routing and centralized scheduling strategies in ieee 802.16 mesh networks |
publishDate |
2008 |
url |
http://ndltd.ncl.edu.tw/handle/99378199779493009946 |
work_keys_str_mv |
AT lyuchenou routingandcentralizedschedulingstrategiesinieee80216meshnetworks AT ōulǜchén routingandcentralizedschedulingstrategiesinieee80216meshnetworks AT lyuchenou ieee80216wǎngzhuàngwǎnglùzhīlùyóuyǔjízhōngshìpáichéngcèlüèzhīshèjì AT ōulǜchén ieee80216wǎngzhuàngwǎnglùzhīlùyóuyǔjízhōngshìpáichéngcèlüèzhīshèjì |
_version_ |
1717743693007421440 |