Offloading Multiple Mobile Data Contents Through Opportunistic Device-to-Device Communications
- 338 Downloads
Opportunistic device-to-device (D2D) communication is the approach proposed to offload mobile data traffic for cellular networks. In opportunistic D2D communication, the network has to appoint relaying users to distribute content(s) to normal subscribers under a given delay-tolerance threshold. In general, the total number of relaying users is fixed. Identifying proper number of relaying users is one of the key challenges in opportunistic D2D communication. The network has to select proper number of relaying users for each content to minimize the amount of mobile data traffic. This paper presents a popularity-based relaying user selection algorithm to determine the number of relaying users for distributing multiple contents with different popularity. An analytical model is then presented to estimate the amount of reduced mobile data traffic under single-hop and multi-hop opportunistic forwarding scenarios. Results obtained by simulations as well as by our proposed analytical model show that the proposed popularity-based algorithm can find the total number of relaying users to the amount of reduced mobile data traffic. For services which have longer delay-tolerance threshold, the proposed popularity-based algorithm requires less relaying users and can achieve similar amount of reduced mobile data traffic as the state-of-the-art random fully-allocation algorithm does. For services which have shorter delay-tolerance threshold, the proposed popularity-based algorithm provide significant gain comparing with the random fully-allocation algorithm.
KeywordsOffloading Device-to-device communication Opportunistic communication Mobile networks
This work was supported in part by the Ministry of Science and Technology of Taiwan under Contract MOST 102-2221-E-011-003-MY3 and by the “Aiming For the Top University Program” funded by Ministry of Education of Taiwan.
Conflict of interest
The authors declare that they have no competing interests.
- 2.Whitbeck, J., Lopez, Y., Leguay, J., Conan, V., & de Amorim, M. D. (2011). Relieving the wireless infrastructure: When opportunistic networks meet guaranteed delays. In Proceedings of the IEEE international symposium on a WoWMoM, Lucca, Italy.Google Scholar
- 3.Li, Y., Su, G., Hui, P., Jin, D., Su, L., & Zeng, L. (2011). Multiple mobile data offloading through delay tolerant networks. In Proceedings of the 6th ACM workshop on challenged networks (CHANTS) (pp. 43–48).Google Scholar
- 4.Bhatia, R., Narlikar, G., Rimac, I., & Beck, A. (2009). UNAP: User-centric network-aware push for mobile content delivery. In Proceedings of the IEEE INFOCOM (pp. 2034–2042).Google Scholar
- 5.Chen, N. S., Chou, Y. F., Cheng, R. G., & Tsao, S. L. (2013 ). Multiple contents offloading through opportunistic communications. In Proceedings of the 12th international conference on telecommunications (ConTEL) (pp. 65–69), Zagreb, Croatia.Google Scholar
- 7.LeBrun, J., Chuah, C. N., Ghosal, D., & Zhang, M. (2005). Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks. In IEEE 61st vehicular technology conference (VTC 2005-Spring) (vol. 4, pp. 2289–2293).Google Scholar
- 8.Hui, P., Crowcroft, J., & Yoneki, E. (2011). BUBBLE Rap: Social-based forwarding in delay-tolerant networks. IEEE Transactions on Mobile Computing, 10(11), 1576–1589.Google Scholar
- 10.Thilakarathna, K., Viana, A. C., Seneviratne, A., & Petander, H. (2013). Mobile social networking through friend-to-friend opportunistic content dissemination. In Proceedings of the ACM international symposium on mobile ad hoc networking and computing (MobiHoc’13) (pp. 563–266).Google Scholar
- 11.Zhuo, X., Li, Q., Cao, G., Dai, Y., Szymanski, B., & Porta, T. L. (2011). Social-based cooperative caching in DTNs: A contact duration aware approach. In Proceedings of the IEEE mobile adhoc and sensor systems (MASS) (pp. 92–101).Google Scholar
- 12.Content Marketing Tool BuzzSumo, http://buzzsumo.com
- 15.3GPP TS 25.346. (2014). Introduction of the multimedia broadcast/multicast service (MBMS) in the radio access network (RAN): Stage 2.Google Scholar
- 16.Kutscher, D., et al. (2013). ICN research challenges. IETF Internet-Draft, draft-kutscher-icnrg-challenges-01.Google Scholar
- 17.Pentikousis, K., et al. (2013). ICN baseline scenarios and evaluation methodology. IETF Internet-Draft, draft-pentikousis-icn-scenarios-04.txt.Google Scholar