在4G網絡中，多媒體廣播-群播服務是智慧型手機中新興的應用程式。而合作式中繼網絡在次世代無線網絡中將發揮的重要作用。在本論文中，我們將研究次世代無線網路中的群播和合作式中繼協定的問題。

首先，我們介紹3GPP和3GPP2中的群播架構和操作定義。本論提供了系統性的比較。除了系統架構，包括行動管理，服務品質和安全機制都將在本論中被討論。此外，我們也研究挑戰性的議題，包括無線資源管理，功率控制，可擴展性，和複雜性。在群播金鑰管理中，金鑰的儲存和計算成本是兩個最重要的問題。在3GPP多媒體廣播-群播服務（MBMS）和3GPP2廣播-群播（BCMCS）服務中，當更新安全金鑰時，我們將研究如何降低計算成本和金鑰的儲存。我們建議MBMS和BCMCS採用邏輯金鑰階層結構（LKH）和Hybrid-LKH的動態金鑰更新方法。數值計算的結果證明計算成本和金鑰的儲存可以顯著減少。

在次世代合作式中繼無線網絡中，兩個互相合作的行動電話間的平均等待時間和服務方式是兩個重要的問題。本論文提出了兩種模式來分析兩個有限服務佇列模型的平均等待時間（TQLS）。第一種模式是一種分析模型，其中包含黎曼-希爾伯特邊值問題的方法。第二模型是一個數值模型，其中包括離散式的傅立葉變換（DFT）技術和Power Series Algorithm（PSA）。根據數值分析、模擬結果和守恆定律，我們證明有限的（I，J）服務方式是最好的。它可以讓兩個互相合作的行動電話間的平均等待時間達到最佳的平衡狀態。

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.

[1] J.-C. Chen and T. Zhang, IP-Based Next-Generation Wireless Networks. John Wily
& Sons, Inc., Jan. 2004. http://www.cs.nthu.edu.tw/˜jcchen/book.
html.
[2] J.-F. Weng, J.-C. Chen, and K.-W. Cheng, “Comparative study of broadcast and multicast
in 3GPP and 3GPP2 networks,” Computer Communications, vol. 31, pp. 4220–
4229, Nov. 2008.
[3] 3GPP TS 33.246, “3G Security; Security of Multimedia Broadcast/Multicast Servicei,”
June 2006.
[4] 3GPP TS 23.246, “Multimedia Broadcast/Multicast Service (MBMS); architecture and
functional description,” June 2009.
[5] 3GPP2 S.R0030-A, “Broadcast/Multicast Service-Stage1,” Jan. 2004.
[6] 3GPP2 X.P0019, “Broadcast and Multicast Service Framework,” Mar. 2004.
[7] 3GPP2 X.S0022-A, “Broadcast and Multicast Service in cdma2000 Wireless IP Network,”
June 2006.
[8] C. K. Wong, M. Gouda, and S. S. Lam, “Secure group communications using key
graphs,” IEEE/ACM Trans. Netw., vol. 8, pp. 16–31, Feb. 2000.
[9] J.-F. Weng and J.-C. Chen, “Dynamic Rekeying in 3GPP Multimedia Broadcast/
Multicast Service (MBMS),” IEEE Communications Letters, vol. 14, pp. 288–290,
Apr. 2010.
[10] L. Kleinrock, Queueing Systems, Volume 2, Computer Applications. Wiley-
Interscience, 1976.
[11] 3GPP TS 22.146, “Multimedia Broadcast/Multicast Service, Stage 1,” June 2006.
[12] 3GPP TS 23.246, “Multimedia Broadcast/Multicast Service (MBMS); Architecture
and functional description,” June 2006.
[13] 3GPP TS 33.220, “Generic Authentication Architecture (GAA); Support for subscriber
certificates,” June 2006.
[14] J. Arkko, E. Carrara, F. Lindholm, M. Naslund, and K. Norrman, “MIKEY: Multimedia
Internet KEYing.” IETF RFC 3830, Aug. 2004.
[15] K. Chowdhury, P. Yegani, and L. Madour, “DHCP Options for Broadcast and Multicast
Control Servers.” IETF RFC 4280, Nov. 2005.
[16] 3GPP2 S.S0083-A, “Broadcast-Multicast Service Security Framework,” Aug. 2004.
[17] 3GPP TR 25.922, “Radio resource management strategies,” Mar. 2007.
[18] R. A. Jordi Perez-Romero, Oriol Sallent and M. A. Diaz-Guera, Radio Resource Management
Strategied in UMTS. John Wily & Sons, Inc., 2005.
[19] J. H. Nishith D.Tripathi and H. F.VanLandingham, Radio Resource Management in
Cellular Systems. Kluwer Academic Publishers, 2001.
[20] H. Holma and A. Toskala, WCDMA For UMTS, Radio Access For Third Generation
Mobile Communications,3nd. John Wily & Sons, Inc., 2004.
[21] 3GPP TS 25.301, “Radio Interface Protocol Architecture,” June 2006.
[22] H. Holma and A. Toskala, HSDPA/HSUPA for UMTS. John Wily & Sons, Inc., 2006.
[23] H. Holma and A. Toskala, WCDMA for UMTS V HSPA Evolution and LTE,4nd. John
Wily & Sons, Inc., 2007.
[24] 3GPP TS 25.308, “High Speed Downlink Packet Access (HSDPA); Overall description,”
Dec. 2004.
[25] V. Vartiainen, and J. Kurjenniemi, “Point-to-multipoint multimedia broadcast service
(MBMS) performance over HSPDA,” Proc. of IEEE International Symposium on Personal,
Indoor and Mobile Radio Communications (PIMRC), pp. 1–5, Sept. 2007.
[26] A. Soares, N. Souto, J. C. Silva, P. Eusebio, and A. Correia, “Effective radio resource
management for MBMS in UMTS networks,” ACM Wireless Personal Communications,
vol. 42, pp. 185–211, Oct. 2007.
[27] 3GPP2 C.S0002-D, “Physical Layer Standard for cdma2000 Spread Spectrum Systems
Release D,” Sept. 2005.
[28] 3GPP2 C.S0002-C, “Physical Layer Standard for cdma2000 Spread Spectrum Systems
Release C,” July 2004.
[29] R. T. Derryberry, A. Hsu, and W. Tamminen, “Overview of cdma2000 revision D,”
White Paper of CDMA Development Group, pp. 1–3, 2004.
[30] A. Alexiou, C. Christos, and E. Rekkas, “A power control scheme for efficient radio
bearer selection in MBMS,” Proc. of International Symposium on a World of Wireless,
Mobile and Multimedia Networks, pp. 1–8, June 2007.
[31] G. Xylomenos, V. Tsakanikas, and G. C.Polyzos, “Reducing the transmission power requirements
of the multimedia broadcast/multicast service,” Mobile and Wireless Communications
Summit, pp. 1–5, July 2007.
[32] C. K. Wong, M. Gouda, and S. S. Lam, “Secure group communications using key
graphs,” IEEE/ACM Transactions on Networking, vol. 8, pp. 16–29, Feb. 2000.
[33] E. H. D. Wallner and R. Agee, “Key management for multicast: Issues and architectures.”
IETF RFC 2627, June 1999.
[34] T. Ballardie, “Scalable multicast key distribution.” IETF RFC 1949, May 1996.
[35] S. Banerjee, and B. Bhattacharjee, “Scalable secure group communication over IP multicast,”
IEEE Journal on Selected Areas in Communications, vol. 20, pp. 1511–1527,
Oct. 2002.
[36] A. Alexiou, C. Bouras, “Multicast in UMTS: Evaluation and recommendations,” Wireless
Communications and Mobile Computing, vol. 8, pp. 463–481, May 2008.
[37] A. Alexiou, C. Bouras, and E. Rekkas, “Cost analysis of the MBMS multicast mode
of UMTS,” IEEE Symposium on Computers and Communications, pp. 797–802, Feb.
2007.
[38] D. M. Wallner, E. J. Harder, and R. C. Agee, “Key management for multicast: issues
and architectures.” IETF RFC 2627, June 1999.
[39] B. Briscoe, “MARKS: Zero side effect multicast key management using arbitrarily revealed
key sequences,” in Proc. of International Workshop on Networked Group Communication
(NGC), (Pisa, Italy), pp. 17–20, Nov. 1999.
[40] R. Canetti, T. Malkin, and K. Nissim, “Efficient Communication-Storage Tradeoffs for
Multicast Encryption,” in EUROCRYPT’99, pp. 459–474, 1999.
[41] M. Li, R. Poovendran, and C. Berenstein, “Optimization of Key Storage for Secure
Multicast,” in Proc. of Conference Information Sciences and Systems, pp. 21–24, Mar.
2001.
[42] M. Li, R. Poovendran, and C. Berenstein, “Design of Secure Multicast Key Management
Schemes With Communication,” IEEE Communications Letters, vol. 6, pp. 108–
110, Mar. 2002.
[43] S. Ann, K. G. Lee, and H. S. Kim, “A path selection method in IEEE 802.16j mobile
multi-hop relay networks,” in Proc. of International Conference on Sensor Technologies
and Applications, pp. 808–812, Aug. 2008.
[44] S. S. Wang, H. C. Yin, Y. H. Tsai, and S. T. Sheu, “An effective path selection metrics
for IEEE 802.16-based multi-hop relay networks,” in Proc. of IEEE Symposium on
Computers and Communications, pp. 1051–1056, July 2007.
[45] B. Wang and M. Mutka, “Path selection for mobile stations in IEEE 802.16 multihop
relay networks,” in Proc. of International Symposium on a World of Wireless, Mobile
and Multimedia Networks, pp. 1–8, June 2008.
[46] D. M. Shrestha, S. H. Lee, S. C. Kim, and Y. B. Ko, “New approaches for relay selection
in IEEE 802.16 mobile multi-hop relay networks,” in Proc. of International Euro-Par
Conference, pp. 908–959, Aug. 2007.
[47] C.-K. Hsien, J.-C. Chen, and J.-F. Weng, “Cooperative Adaptive Partner Selection for
Real-Time Services in IEEE 802.16j Multihop Relay Networks,” in Proc. of IEEEWireless
Communications and Networking Conference (WCNC10), pp. 1–6, Apr. 2010.
[48] T. M. Cover and A. A. E. Gamal, “Capacity theorems for the relay channel,” IEEE
Transactions on Information Theory, vol. 52, pp. 572–584, Sept. 1979.
[49] A. Host-Madsen, “Upper and lower bounds for channel capacity of asynchronous
cooperative diversity networks,” IEEE Transactions on Information Theory, vol. 50,
pp. 3062–3080, Dec. 2004.
[50] R. Gowaikar, A. F. Dana, R. Palanki, B. Hassibi, and M. Effros, “Capacity of wireless
erasure networks,” IEEE Transactions on Information Theory, vol. 52, pp. 789–804,
Mar. 2006.
[51] G. Kramer, M. Gastpar, and P. Gupta, “Cooperative strategies and capacity theorems
for realy networks,” IEEE Transactions on Information Theory, vol. 51, pp. 3037–3063,
Sept. 2005.
[52] A. Bletsas and A. Lippman, “Implementing Cooperative Diversity Antenna Arrays with
Commodity Hardware,” IEEE Communications Magazine, vol. 44, pp. 33–40, Dec.
2006.
[53] M. S. Kang, B. C. Jung, and D. K. Sung, “Effect of Cooperative and Selection Relaying
Schemes on Multiuser Diversity in Downlink Cellular Systems with Realys,” Journal
of Communications and networks, vol. 10, pp. 175–185, June 2008.
[54] J. Boyer, D. D. Falconer, and H. Yanikomeroglu, “Cooperative Connectivity Models
forWireless Realy Networks,” IEEE Transactions on Wireless Communications, vol. 6,
pp. 1992–2000, June 2007.
[55] M. Peng and W. Wang, “Investigation of Cooperative Relay Node Selection in Heterogeneous
Wireless Communication Systems ,” in Proc. of IEEE International Conference
on Commnuications, pp. 174–178, May 2008.
[56] H. Adam, C. Bettstetter, and S. M. Senouci, “Adaptive relay selection in cooperative
wireless networks,” in Proc. of IEEE International Symposium on Personal, Indoor and
Mobile Radio Communications, pp. 1–5, Sept. 2008.
[57] A. H. Bastami and A. Olfat, “Selection Relaying Schemes for Cooperative Wireless
Networks With Adaptive Modulation ,” IEEE Transactions on Vehicular Technology,
vol. 60, pp. 1539–1558, May 20011.
[58] Y. Zhao, R. S. Adve, and T. J. Lim, “Improving amplify-and-forward relay networks:
Optimal power allocation versus selection,” in Proc. of the IEEE International Symposium
on Information Theory, pp. 1234–1238, July 2006.
[59] A. S. Ibrahim, Z. Han, and K. J. R. Liu, “Distributed power-efficient cooperative routing
in wireless ad hoc networks,” in Proc. of the IEEE Global Telecommunications
Conference, pp. 4413–4418, Nov. 2007.
[60] D. Chen, H. Ji, and X. Li, “An Energy-Efficient Distributed Relay Selection and Power
Allocation Optimization Scheme overWireless Cooperative Networks ,” in Proc. of the
IEEE Conference on Communications, pp. 1–5, June 2011.
[61] P. Liu, Z. Tao, Z. Lin, E. Erkip, and S. Panwar, “Cooperative wireless communications:
a cross-layer approach,” IEEE Wireless Communications, vol. 13, pp. 84–92,
Aug. 2006.
[62] A. Sadek, K. Liu, and A. Ephremides, “Cooperative Multiple Access for Wireless Networks:
Protocols Design and Stability Analysis,” in Proc. of 40th Annual Conference
on Information Sciences and Systems,2006, pp. 1224–1229, Mar. 2006.
[63] T. C.-Y. Ng and W. Yu, “Joint optimization of relay strategies and resource allocations
in cooperative cellular networks,” IEEE Journal on Selected Areas in Communications,
vol. 25, pp. 328–339, Feb. 2007.
[64] A. Kwasinski, Z. Han, and K. J. R. Liu, “Cooperative Multimedia Communications:
Joint Source Coding and Collaboration,” in Proc. of IEEE Global Telecommunications
Conference, St. Louis, pp. 374–378, Nov. 2005.
[65] D. Gunduz and E. Erkip, “Joint source-channel cooperation: Diversity versus spectral
efficiency,” in Proc. of IEEE International Symposium Information Theory, p. 392,
June 2004.
[66] Y. Zhang, H.-H. Chen, and M. Guizani, Cooperative Wireless Communications. CRC
Press, 2009.
[67] Z. Han and H. V. Poor, “Coalition game with cooperative transmission: a cure for
the curse of boundary nodes in selfish packet-forwarding wireless networks,” IEEE
Transactions on Communications, vol. 57, pp. 203–213, Jan. 2009.
[68] K. wen Cheng and J. cheng Chen, “Design and analysis of cooperative mobile multicast
protocol (CMMP) for intermittent network connectivity,” IEEE Transactions on
Wireless Communications, vol. 8, pp. 2881–2891, June 2009.
[69] M. Eisenberg, “Queues with Periodic Service and Changeover Time,” Operations Research,
vol. 20, pp. 440–451, 1972.
[70] L. Takacs, “Two Queues Attended by a Single Server,” Operations Research, vol. 16,
pp. 639–650, 1968.
[71] J. W. Cohen and O. J. Boxma, “The M/G/1 queue with alternating service formulated
as a Riemann-Hilbert problem,” in PERFORMANCE ’81: Proc. 8th Int. Conf. Comput.
Performance,, pp. 181–199, 1981.
[72] J. W. Cohen and O. J. Boxma, Boundary value problems in queueing system analysis.
NORTH-HOLLAND, 1983.
[73] M. Eisenberg, “Two Queues with Alternating Service,” SIAM Journal of Applied Mathematics,
vol. 36, pp. 287–303, 1979.
[74] D. S. Lee, “A generalized non-preemptive priority queue,” in , Proc. of IEEE INFOCOM’
95, pp. 354–360, Apr. 1995.
[75] D. S. Lee, “A two-queue model with exhaustive and limited service disciplines ,”
Stochastic Models, vol. 12, pp. 285–305, 1996.
[76] D. S. Lee, “Analysis of a Two-Queue Model with Bernoulli Schedules,” Journal of
Applied Probability, vol. 34, pp. 176–191, 1997.
[77] J. A. Weststrate and R. D. van der Mei, “Waiting times in a two-queue model with
exhaustive and Bernoulli service,” Operations Research, vol. 40, pp. 289–303, 1994.
[78] W. Feng, M. Kowada, and K. Adachi, “Performance analysis of a two-queue model
with an (M,N)-threshold service schedule,” Operations Research, vol. 44, pp. 101–
124, 2001.
[79] R. P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction,
Fifth Edition. Addison-Wesley, 2003.
[80] K. H. Rosen, Handbook of Discrete and Combinatorial Mathematics. The CRC Press,
1999.
[81] K. K. Leung, “Waiting Time Distributions for Token-Passing Systems with Limited-
One Service via Discrete Fourier Transforms,” in Proc. of IEEE INFOCOM’90, (San
Francisco), pp. 1111 – 1118, jun 1990.
[82] K. K. Leung, “Waiting Time Distributions for Token-Passing Systems with limited-k
Services via Discrete Fourier Transforms,” in Proc. of the 14th IFIP WG 7.3 International
Symposium on Computer Performance Modelling, Measurement and Evaluation,
pp. 333 – 347, sep 1990.
[83] G. Hooghiemstra, M. Keane, and S. V. D. Ree, “Power series for stationary distridutions
of coupled processor models,” SIAM Journal of Applied Mathematics, vol. 48,
pp. 1159–1166, 1988.
[84] J. Blanc, “A numerical approach to cyclic-server queueing models,” Queueing Systems,
vol. 6, pp. 173–188, 1990.
[85] P.Wynn, “On the Convergence and Stability of the Epsilon Algorithm,” SIAM Journal
on Numerical Analysis, vol. 3, pp. 91–122, 1996.
[86] J. Blanc, “Performance analysis and optimization with the power-series algorithm,”
Lecture Notes in Computer Science, vol. 729, pp. 53–80, 1993.
[87] J. Blanc, “An Algorithm Solution of Polling Models with Limited Service Disciplines,”
IEEE Transactions on Communications, vol. 40, pp. 1152–1155, 1992.
[88] J. Blanc, “A note on waiting times in systems with queues in parallel,” Journal of
Applied Probability, vol. 24, pp. 540–546, 1987.
[89] J. Blanc, “On a numerical method for calculating state probabilities for queueing systems
with more than one waiting line ,” Journal of Computational and Applied Mathematics,
vol. 20, pp. 119–125, 1987.
[90] H. Takagi, Analysis of Polling Systems. The MIT Press, Cambridge, Massachusetts,
1986.
[91] “The network simulator 2 (ns-2).” http://www.isi.edu/nsnam/ns.
79