隨著當代行動網路上傳的需求逐漸提高，如 何緩解行動網路的負擔已成為不可避免的網路問題。由於終端裝置運算能力及儲存空間的增強，邊緣運算成為熱門的解決方案。其中，裝置對裝置(Device-to-Device，D2D)傳輸技術的研究開始受到重視。由於 D2D傳輸勢必會面臨裝置與裝置間的傳輸效益問題，因此，基於賽局理論與D2D傳輸的結合之研究近來受到高度重視。當用戶有檔案資料想上傳至後台時，若自身行動網路狀況不佳，如遭遇壅塞、訊號不佳、或網路流量不足等問題而無法順利上傳時，即可以D2D傳輸方法，將檔案傳給周圍其他網路狀況較佳的用戶，由他們將檔案上傳至後台，使得以解決因時效過期或裝置容量不足而導致檔案失效或遺失之問題。在本論文的研究中，我們基於賽局理論且結合D2D傳輸架構，提出一套三層式的D2D賽局演算法。首先，用戶檔案需要上傳至後台時，先以賽局前判斷，來決定是否提出D2D需求，若需求小於臨界值，則選擇自身行動網路上傳檔案。反之，則會提出D2D傳輸需求給其他用戶。其他用戶收到需求後，進入演算法第二步，用戶會以執行此D2D傳輸，所獲得自身利益是否大於傳輸成本為考量，來決定是否執行任務。當用戶同意執行此次任務，便進入演算法最後步驟，當檔案成功上傳至系統平台，會以檔案分數來增加系統平台效益。最後，本研究以模擬方式，驗證三層式演算法可明顯增加裝置及平台的效益，同時降低傳輸成本。

With the increasing demand for uploading in mobile networks, how to relieve the burden of mobile networks has become an inevitable network problem. Due to the enhancement of computing power and storage space of terminal devices, edge computing is known as a promising solution. Meanwhile, the research on device-to-device (D2D) communications receives much attention. Since D2D communications will face the problem of transmission efficiency between devices, the combination of game theory and D2D communications is considered. When users want to upload files such as videos and pictures to the backhaul servers, if their network conditions are not good such as congestion, poor signal and insufficient network traffic, their files cannot be uploaded smoothly. Alternatively, D2D-based data transmission techniques can be used to transfer files to other users if those have better network conditions around and can upload files to the backhaul. This way can solve the problem of file invalidation or loss due to expiration of the time limit or insufficient device capacity. In this thesis study, we design a three-layer and D2D-based
game mechanism. First of all, when a user has a file to upload to the backhaul, it will first determine whether to make a D2D demand based on the pre-match judgment. After other users receive the demand, the user will decide whether to perform this task by considering whether the self-interest obtained by performing this D2D transmission task is greater than the transmission cost. After the user agrees to perform this task, the file is successfully uploaded to the system platform. The score of the file will be used to increase the efficiency of the system platform. Finally, our study has verified that the proposed three-layer algorithm can significantly increase the efficiency of the device and platform, while reducing the transmission cost by means of simulation.

[1] L. Atzori, A. Iera, and G. Morabito, “The internet of things: A survey,” Comput.
Netw., vol. 54, no. 15, pp. 2787–2805, Oct. 2010.
[2] W. Khan, E. Ahmed, S. Hakak, I. Yaqoob, and A. Ahmed, “Edge computing: A
survey,” Future Generation Computer Systems, vol. 97, 02 2019.
[3] 拓墣產研, “科技新報,” https://technews.tw/2018/05/16/edge-computing/, 2018.
[4] 國家通訊傳播委員會, “全球b4g/5g、iot 需求情境、應用與技術發展趨勢,”
https://www.ncc.gov.tw/chinese/files/18102/5056_40607_181023_1.pdf.
[5] G. Americas, “5g services and use cases,” https://www.5gamericas.org/files/3215/
1190/8811/5G_Services_and_Use_Cases.pdf, 2017.
[6] S. Wang, X. Zhang, L. Wang, J. Yang, and W. Wang, “Joint design of device to
device caching strategy and incentive scheme in mobile edge networks,” IET Communications,
vol. 12, no. 14, pp. 1728–1736, 2018.
[7] E. Baccour, A. Erbad, A. Mohamed, and M. Guizani, “Ce-d2d: Dual framework
chunks caching and offloading in collaborative edge networks with d2d communication,”
in Proceedings of 2019 15th International Wireless Communications Mobile
Computing Conference (IWCMC), 2019, pp. 1550–1556.
[8] X. Li, X. Wang, P. Wan, Z. Han, and V. C. M. Leung, “Hierarchical edge caching in
device-to-device aided mobile networks: Modeling, optimization, and design,” IEEE
Journal on Selected Areas in Communications, vol. 36, no. 8, pp. 1768–1785, 2018.
[9] A. S. Bedi, K. Rajawat, and M. Coupechoux, “An online approach to d2d trajectory
utility maximization problem,” in Proceedings of IEEE INFOCOM 2018 - IEEE
Conference on Computer Communications, 2018, pp. 1610–1618.
[10] P.-C. Teng and C.-L. Hu, “Led dimming control mechanism based on machine learning:
a practical case in smart farms,” https://hdl.handle.net/11296/3dz6y4, 2019.
[11] “Game theory,” https://zh.wikipedia.org/wiki/%E5%8D%9A%E5%BC%88%E8%
AE%BA.
[12] K. Rohoden, R. Estrada, H. Otrok, and Z. Dziong, “Game theoretical framework for
clustering and resource allocation in macro-femtocell networks,” Computer Networks,
vol. 138, 04 2018.
[13] B. P. Rimal and M. Maier, “Mobile data offloading in fiwi enhanced lte-a heterogeneous
networks,” IEEE/OSA Journal of Optical Communications and Networking,
vol. 9, no. 7, pp. 601–615, 2017.
[14] X. Liu, W. Wang, B. Yang, and Y. Fan, “Incentive mechanism for data uploading in
mobile crowdsensing,” in Proceedings of 2019 International Conference on Networking
and Network Applications (NaNA), 2019, pp. 391–395.
[15] Y. Sun, F. Wang, and Z. Liu, “Coalition formation game for resource allocation in
d2d uplink underlaying cellular networks,” IEEE Communications Letters, vol. 23,
no. 5, pp. 888–891, 2019.
[16] J. Wang, Y. Sun, B. Wang, B. Wang, A. Wang, S. Li, and Z. Sun, “Resource allocation
for d2d video multicast using multi-leader multi-follower stackelberg game with
personalized incentives,” IEEE Access, vol. 7, pp. 117 019–117 028, 2019.
[17] O. Candogan, K. Bimpikis, and A. Ozdaglar, “Optimal pricing in networks with
externalities,” Operations Research, vol. 60, no. 4, pp. 883–905, 2012. [Online].
Available: https://doi.org/10.1287/opre.1120.1066
[18] Z. Xiong, S. Feng, D. Niyato, P. Wang, and Y. Zhang, “Economic analysis of network
effects on sponsored content: A hierarchical game theoretic approach,” in Proceedings of GLOBECOM 2017 - 2017 IEEE Global Communications Conference, 2017, pp.
1–6.
[19] J. Nie, J. Luo, Z. Xiong, D. Niyato, and P. Wang, “A stackelberg game approach
toward socially-aware incentive mechanisms for mobile crowdsensing,” IEEE Transactions
on Wireless Communications, vol. 18, no. 1, pp. 724–738, 2019.
[20] S. Bhattacharjee, N. Ghosh, V. K. Shah, and S. K. Das, “qnqqnq: Quality and
quantity based unified approach for secure and trustworthy mobile crowdsensing,”
IEEE Transactions on Mobile Computing, vol. 19, no. 1, pp. 200–216, 2020.
[21] “Stackelberg game,” http://wiki.mbalib.com/zh-tw/%E6%96%AF%E5%A1%94%
E5%85%8B%E5%B0%94%E4%BC%AF%E6%A0%BC%E6%A8%A1%E5%9E%8B.
[22] A. Keränen, J. Ott, and T. Kärkkäinen, “in proceedings of the one simulator for dtn
protocol evaluation,” 01 2009, p. 55.
[23] E. W. Dijkstra, “A note on two problems in connexion with graphs.”
Numerische Mathematik, vol. 1, pp. 269–271, 1959. [Online]. Available:
http://gdzdoc.sub.uni-goettingen.de/sub/digbib/loader?did=D196313