Multicast and Cooperative Relay in Next-Generation Wireless Networks
博士 === 國立清華大學 === 資訊工程學系 === 100 === Multimedia Broadcast-Multicast Services are emerging applications for smart phones in 4G networks. Besides, cooperative relay networks play an important role in next-generation wireless networks. In this thesis, we study the issues of multicast and cooperative r...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/60619217735152579772 |
id |
ndltd-TW-100NTHU5392020 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-100NTHU53920202016-04-04T04:17:09Z http://ndltd.ncl.edu.tw/handle/60619217735152579772 Multicast and Cooperative Relay in Next-Generation Wireless Networks 次世代無線網路中的群播與合作式中繼協定之研究 Weng, Jeng-Feng 翁建峰 博士 國立清華大學 資訊工程學系 100 Multimedia Broadcast-Multicast Services are emerging applications for smart phones in 4G networks. Besides, cooperative relay networks play an important role in next-generation wireless networks. In this thesis, we study the issues of multicast and cooperative relay in next-generation wireless networks. First, we present the multicast architectures and perations defined in 3GPP and 3GPP2. This thesis provides a systematic comparison of them. In addition to system architectures, various issues including mobility, QoS, and security are discussed. Moreover, we discuss the challenges in Radio Resource Management (RRM), power control, scalability, and complexity. In multicast key management, key storages and computational cost are two most important issues to update security keys. In this thesis, we study how to reduce the cost of computation and storage to update the security keys in 3GPP Multimedia Broadcast-Multicast Services (MBMS) and 3GPP2 Broadcast-Multicast Service (BCMCS).We propose the Logical Key Hierarchy (LKH) and Hybrid-LKH approaches with dynamic rekeying for MBMS and BCMCS, the numerical results show that the computational cost and the key storages can be reduced significantly. The mean waiting time and service disciplines between the erroneous MS and the Helper MS are two important issues in next-generation cooperative relay wireless networks. This thesis presents two models to analyze the mean waiting time for a two-queue model with limited services (TQLS). The first model is an analytical model which contains the Riemann-Hilbert Boundary Value Problem approach. The second model is a numerical model that includes the Discrete Fourier Transforms (DFT’s) technique and the Power Series Algorithm (PSA) . In terms of the numerical analysis, simulation results and the conservation law, we show that the (I, J)-Limited service discipline is the best for the TQLS to balance the mean waiting time between the erroneous MS and the Helper MS. Chen, Jyh-Cheng 陳志成 2012 學位論文 ; thesis 91 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
博士 === 國立清華大學 === 資訊工程學系 === 100 === Multimedia Broadcast-Multicast Services are emerging applications for smart phones in 4G networks. Besides, cooperative relay networks play an important role in next-generation wireless networks. In this thesis, we study the issues of multicast and cooperative relay in next-generation wireless networks.
First, we present the multicast architectures and perations defined in 3GPP and 3GPP2. This thesis provides a systematic comparison of them. In addition to system architectures, various issues including mobility, QoS, and security are discussed. Moreover, we discuss the
challenges in Radio Resource Management (RRM), power control, scalability, and complexity. In multicast key management, key storages and computational cost are two most important issues to update security keys. In this thesis, we study how to reduce the cost of computation
and storage to update the security keys in 3GPP Multimedia Broadcast-Multicast Services (MBMS) and 3GPP2 Broadcast-Multicast Service (BCMCS).We propose the Logical
Key Hierarchy (LKH) and Hybrid-LKH approaches with dynamic rekeying for MBMS and BCMCS, the numerical results show that the computational cost and the key storages
can be reduced significantly.
The mean waiting time and service disciplines between the erroneous MS and the Helper MS are two important issues in next-generation cooperative relay wireless networks.
This thesis presents two models to analyze the mean waiting time for a two-queue model with limited services (TQLS). The first model is an analytical model which contains the Riemann-Hilbert Boundary Value Problem approach. The second model is a numerical model that includes the Discrete Fourier Transforms (DFT’s) technique and the Power Series Algorithm (PSA) . In terms of the numerical analysis, simulation results and the conservation law, we show that the (I, J)-Limited service discipline is the best for the TQLS to balance the mean waiting time between the erroneous MS and the Helper MS.
|
author2 |
Chen, Jyh-Cheng |
author_facet |
Chen, Jyh-Cheng Weng, Jeng-Feng 翁建峰 |
author |
Weng, Jeng-Feng 翁建峰 |
spellingShingle |
Weng, Jeng-Feng 翁建峰 Multicast and Cooperative Relay in Next-Generation Wireless Networks |
author_sort |
Weng, Jeng-Feng |
title |
Multicast and Cooperative Relay in Next-Generation Wireless Networks |
title_short |
Multicast and Cooperative Relay in Next-Generation Wireless Networks |
title_full |
Multicast and Cooperative Relay in Next-Generation Wireless Networks |
title_fullStr |
Multicast and Cooperative Relay in Next-Generation Wireless Networks |
title_full_unstemmed |
Multicast and Cooperative Relay in Next-Generation Wireless Networks |
title_sort |
multicast and cooperative relay in next-generation wireless networks |
publishDate |
2012 |
url |
http://ndltd.ncl.edu.tw/handle/60619217735152579772 |
work_keys_str_mv |
AT wengjengfeng multicastandcooperativerelayinnextgenerationwirelessnetworks AT wēngjiànfēng multicastandcooperativerelayinnextgenerationwirelessnetworks AT wengjengfeng cìshìdàiwúxiànwǎnglùzhōngdeqúnbōyǔhézuòshìzhōngjìxiédìngzhīyánjiū AT wēngjiànfēng cìshìdàiwúxiànwǎnglùzhōngdeqúnbōyǔhézuòshìzhōngjìxiédìngzhīyánjiū |
_version_ |
1718215036995895296 |