臺灣博碩士論文加值系統

在本篇論文中，利用了聯盟賽局理論的概念去找尋在具有多傳輸節點的雙向傳輸式合作式通訊網路中的穩定合作群組分配。在雙向傳輸合作式通訊網路中，欲交換資料的傳輸節點之間並不存在直接連結，必須透過其他節點的幫忙傳送訊息，在此互利關係之下，節點間將會存在合作的動機。我們利用了聯盟賽局理論來分析節點間合作的效益，使合作群組之間的消息量能最大化。為了找尋穩定的合作群組配對，我們先使用了K-means分群演算法找尋起始群組分配，再以聯盟賽局理論為基礎設計了合併－分散(merge-and-split)式演算法去尋找穩定且具有更大消息量的的群組分配。而在無線網路環境中通常不存在伺服器可以進行演算法處理群組分配的問題。因此我們將演算法改良成分散式演算法，透過聯盟賽局理論以及分散式演算法的幫助，節點間能自己形成穩定且具有最大消息量的合作群組。

A game-theoretic approach to find the stable partition in a multi-node two-
way relay cooperative network is proposed in this work. In the two-way relaying
system, since the direct link between two nodes in any pair does not exist, help is
needed from other nodes to forward signals exchanged between these two nodes. In
this work, the coalition formation game is adopted to partition pairs of nodes in a
multi-node two-way relay cooperative network with the goal of maximizing overall
capacity in the system. To form the partitions, the K-mean clustering is utilized to
obtain the initial partitions followed by the well-known merge-and-split algorithm.
However, this approach is centralized, which makes it less attractive in a distributed
environment. Thus, a decentralized way of partitioning is proposed in this work as
well. The simulation results show that the performance gaps between the centralized
approach and the distributed one are small in terms of the overall farewell. Both
approaches attain similar farewell to that of the optimal partition.

1. Introduction -1
2. System Model -4
2.1. System Model -4
3. Game Theoretic Formulation and Analysis -10
3.1. Game Theoretic Formulation and Analysis -10
3.1.1. Transferable Coalitional Game Formulation -10
3.1.2. Optimum time allocation-13
3.1.3. Optimum power allocation -16
3.1.4. Joint Optimum Time and Power Allocation -18
4. Coalition Formation -20
4.1. Coalition Formation -20
4.1.1. Centralized coalition formation algorithm - 21
4.1.2. distributed coalition formation algorithm - 22
5. Simulation Results -27
6. Conclusion -37
7. Appendix -38
7.1. The proof of the non-superadditivity of the two-way relay communication network under optimal time allocation - 38
7.2. The proof of the non-superadditivity of the two-way relay communication network under optimal power allocation - 41
Bibliography-43

[1] J. Laneman, D. Tse, and G. W. Wornell, “Cooperative diversity in wireless
networks: Efficient protocols and outage behavior,” IEEE Trans. Inf. Theory,
vol. 50, no. 12, pp. 3062–3080, 2004.
[2] W. Su, A. Sadek, and K. J. R. Liu, “SER performance analysis and optimum
power allocation for decode-and-forward cooperation protocol in wireless networks,”
in Proc. IEEE WCNC ’05, 2005, pp. 984–989.
[3] B. Maham and A. Hjorungnes, “Asymptotic performance analysis of amplifyand-
forward cooperative networks in a nakagami-m fading environment,” IEEE
Commun. Lett., vol. 13, pp. 300–302, May 2009.
[4] Q. Liu, X. Ma, and G. Zhou, “A general diversity gain function and its application
in amplify-and-forward cooperative networks,” IEEE Trans. Signal
Process., vol. 59, pp. 859–863, Feb. 2011.
[5] Y. Yang, H. Hu, J. Xu, and G. Mao, “Relay technologies for WiMAX and LTEadvanced
mobile systems,” IEEE Commun. Mag., vol. 47, pp. 100–105, Oct.
2009.
[6] B. Rankov and A. Wittneben, “Spectral efficient protocols for half-duplex fading
relay channels,” IEEE J. Sel. Areas Commun., vol. 25, pp. 379–389, Feb.
2007.
[7] T. Oechtering, E. Jorswieck, R. Wyrembelski, and H. Boche, “On the optimal
transmit strategy for the MIMO bidirectional broadcast channel,” IEEE Trans.
Commun., vol. 57, pp. 3817–3826, Dec. 2009.
43
[8] Y. Zhang, Y. Ma, and R. Tafazolli, “Power allocation for bidirectional AF
relaying over Rayleigh fading channels,” IEEE Commun. Lett., vol. 14, no. 2,
pp. 145–147, 2010.
[9] T. Liu, W. Xu, X. Dong, and W. Lu, “Adaptive power allocation for bidirectional
amplify-and-forward multiple-relay multiple-user networks,” in Proc.
IEEE GLOBECOM ’10, Dec. 2010, pp. 1–6.
[10] P. K. Upadhyay and S. Prakriya, “Performance of two-way opportunistic relaying
with analog network coding over Nakagami-m fading,” IEEE Trans. Veh.
Technol., vol. 60, no. 4, pp. 1965–1971, 2011.
[11] S. Talwar, Y. Jing, and S. Shahbazpanahi, “Joint relay selection and power
allocation for two-way relay networks,” IEEE Signal Process. Lett., vol. 18,
no. 2, pp. 91–94, 2011.
[12] L. Song, G. Hong, B. Jiao, and M. Debbah, “Joint relay selection and analog
network coding using differential modulation in two-way relay channels,” IEEE
Trans. Veh. Technol., vol. 59, no. 6, pp. 2932–2939, 2010.
[13] T. Driessen, Cooperative games, Solutions and Applications. Kluwer Academic
Publishers Dordrecht, The Netherlands, 1988.
[14] B. Peleg and P. Sudh‥olter, Introduction to The Theory of Cooperative Games.
Springer, 2007.
[15] S. J. Kim, N. Devroye, and V. Tarokh, “Bi-directional half-duplex relaying
protocols,” Journal of Communications and Networks, vol. 11, no. 5, pp. 433–
444, 2009.
[16] H. Guo, J. Ge, and H. Ding, “Symbol error probability of two-way amplifyand-
forward relaying,” IEEE Commun. Lett., vol. 15, no. 1, pp. 22–24, 2011.
44
[17] X. Wang and G. B. Giannakis, “Power-efficient resource allocation for timedivision
multiple access over fading channels,” IEEE Trans. Inf. Theory, vol. 54,
no. 3, pp. 1225–1240, 2008.
[18] L. Shapley, “Cores of convex games,” International Journal of Game Theory,
vol. 1, pp. 11–26, 1971.
[19] Z. Han and H. Poor, “Coalition games with cooperative transmission: A cure
for the curse of boundary nodes in selfish packet-forwarding wireless networks,”
IEEE Trans. Commun., vol. 57, pp. 203–213, Apr. 2009.
[20] Y. Liang and V. V. Veeravalli, “Distributed optimal resource allocation for
fading relay broadcast channels,” in IEEE Workshop on Signal Processing Advances
in Wireless Communications, 2005, pp. 550–554.
[21] J. Yang, D. Gunduz, D. Brown, and E. Erkip, “Resource allocation for cooperative
relaying,” in Annual Conference on Information Sciences and Systems,
2008, pp. 848–853.
[22] S. Sarkar, C. Singh, and A. Kumar, “A coalitional game model for spectrum
pooling in wireless data access networks,” in Information Theory and Applications
Workshop, 2008, pp. 310–319.
[23] S. Boyd, S. Kim, L. Vandenberghe, and A. Hassibi, “A tutorial on geometric
programming,” Optimization and Engineering, vol. 8, pp. 67–127, 2007.
[24] M. Grant, S. Boyd, and Y. Ye, “cvx users guide,” Technical Report Build 711,
Citeseer. Available at: http://citeseerx. ist. psu. edu/viewdoc/download, Tech.
Rep., 2009.
[25] J. Matyas, “Random optimization,” Automation and Remote Control, vol. 26,
no. 2, pp. 246–253, 1965.
45
[26] N. Baba, “Convergence of a random optimization method for constrained optimization
problems,” Journal of Optimization Theory and Applications, vol. 33,
no. 4, pp. 451–461, 1981.
[27] K. Apt and T. Radzik, “Stable partitions in coalitional games,” arXiv preprint
cs/0605132, 2006.
[28] W. Saad, Z. Han, M. Debbah, and A. Hjorungnes, “A distributed coalition formation
framework for fair user cooperation in wireless networks,” IEEE Trans.
Wireless Commun., vol. 8, pp. 4580–4593, Sep. 2009.
[29] W. Saad, Z. Han, M. Debbah, A. Hjorungnes, and T. Basar, “Coalitional game
theory for communication networks: A tutorial,” IEEE Signal Process. Mag.,
vol. 26, pp. 77–97, Sep. 2009.
[30] J. Han and M. Kamber, Data mining: Concepts and Techniques. Morgan
Kaufmann, 2006.
[31] J. Katriel, “On a generalized recurrence for bell numbers,” Journal of Integer
Sequences, vol. 11, no. 2, p. 3, 2008.
[32] M. Gerla and J. T.-C. Tsai, “Multicluster, mobile, multimedia radio network,”
Wireless networks, vol. 1, no. 3, pp. 255–265, 1995.
[33] L. S. Shapley, “A value for n-person games,” DTIC Document, Tech. Rep.,
1952.
46