機遇式通訊為一用於卸載移動社交網絡中的行動資料流量的方法。本論文展示了兩個中繼用戶選擇之演算法，根據不同行動資料受使用者歡迎的程度，為多種行動資料選擇適當數量的中繼用戶，進行用戶間資料的傳遞。模擬結果顯示，我們提出的演算法能為每一個行動資料來決定中繼用戶數，進而讓卸載行動資料量達到最大。

Opportunistic communication is one of approaches that can be used to offload mobile data traffic in mobile social networks. This paper presents two relaying subscriber selection algorithms to identify proper number of subscribers for relaying multiple contents with different popularities to mobile users. Simulation results showed that the proposed algorithm can determine the number of relaying subscribers for each of contents based on the popularity of the contents and thus, maximize the amount of reduced mobile data traffic.

[1] B. Han, P. Hui, V. Kumar, M. Marathe, J. Shao, and A. Srinivasan, “Mobile data offloading through opportunistic communications and social participation,” IEEE Trans. Mobile Computing, vol. 11, no. 5. pp. 821-834, May 2011.
[2] D. Niyato, P. Wang, W. Saad, and A. Hjorungnes, “Controlled coalitional games for cooperative mobile social networks,” IEEE Trans. Veh. Technol., vol. 60, no. 4, pp. 1812-1824, May 2011.
[3] J. Whitbeck, Y. Lopez, J. Leguay, V. Conan, and M. D. de Amorim, “Relieving the wireless infrastructure: when opportunistic networks meet guaranteed delays,” in Proc. IEEE International Symposium on a WoWMoM, Lucca, Italy, June 2011.
[4] M. Goemans, L. Li, V.S.Mirrokni, and M. Thottan. “Market sharing games applied to content distribution in ad-hoc networks,” IEEE J. Sel. Areas in Commun., vol. 24, no. 5, pp. 1020-1033, May 2006.
[5] Y. Li, G. Su, P. Hui, D. Jin, L. Su, and L. Zeng. “Multiple mobile data offloading through delay tolerant networks,” in Proc. the 6th ACM Workshop on Challenged Networks (CHANTS), pp. 43-48, 2011.
[6] R. Bhatia, G. Narlikar, I. Rimac, and A. Beck. “UNAP: User-centric network-aware push for mobile content delivery,” in Proc. IEEE INFOCOM, pp.2034-2042, April 2009.
[7] B. Higgins, A. Reda, T. Alperovich, J. Flinn, T. Giuli, and B. Noble, D. “Watson.Intentional networking: opportunistic exploitation of mobile network diversity.” in Proc. ACM MobiCom, Chicago, USA, Sep. 2010.
[8] K. Lee, Y. Yi, J. Lee, I. Rhee, and S. Chong, “Mobile data offloading: How much can wifi deliver?” IEEE/ACM Trans. Netw., vol. 21, no. 2. pp. 536-550, April 2013.
[9] C. Mayer and O. Waldhorst, “Offloading infrastructure using delay tolerant networks and assurance of delivery”, in Proc. IFIP Wireless Days, Ontario, Canada, Oct. 2011.
[10] X. Zhuo, Q. Li, G. Cao, Y. Dai, B. Szymanski, and T. L. Porta, “Social-based cooperative caching in DTNs: A contact duration aware approach,” in Proc. IEEE Mobile Adhoc and Sensor Systems (MASS), pp.92-101, Oct. 2011.
[11] W. Gao and G. Cao. “User-centric data dissemination in disruption tolerant networks,” in Proc. IEEE INFOCOM, pp. 3119-3127, April 2011.
[12] W. Gao, Q. Li, B. Zhao, and G. Cao, “Multicasting in delay tolerant networks: A social network perspective,” in Proc. ACM MobiHoc, pp. 299-308, May 2009.
[13] J. Reich and A. Chaintreau, “The age of impatience: Optimal replication schemes for opportunistic networks,” in Proc. ACM CoNEXT, Rome, Italy, Dec. 2009.
[14] J. Kangasharju, J. W. Roberts, and K. W. Ross. “Object replication strategies in content distribution networks,” Comput. Commun., vol. 25, no. 4, pp. 376-383, Mar. 2002.
[15] Y. Chen and K.J. R. Liu, “Understanding microeconomic behaviors in social networking: An engineering view,” IEEE Signal Proc. Mag., vol. 29, no. 2, pp.53–64, Mar. 2012.
[16] R. T. B. Ma, S. C. Lee, J. C. Lui, and D. K. Yau, “Incentive and service differentiation in P2P networks: A game theoretic approach,” IEEE/ACM Trans. Netw., vol. 14, no. 5, pp. 978–991, Oct. 2006.