Open Access

ARTICLE

Seed Selection for Data Offloading Based on Social and Interest Graphs

Ying Li¹, Jianbo Li^1,*, Jianwei Chen¹, Minchao Lu¹, Caoyuan Li^2,3

1 College of Computer Science and Technology, Qingdao University, Qingdao, 266071, China.
2 School of Computer, Beijing Institute of Technology, Beijing, 100081, China.
3 Faculty of Engineering and Information Technology, University of Technology Sydney, NSW 2006, Australia.

* Corresponding Author: Jianbo Li. Email: .

Computers, Materials & Continua 2018, 57(3), 571-587. https://doi.org/10.32604/cmc.2018.02851

Abstract

The explosive growth of mobile data demand is becoming an increasing burden on current cellular network. To address this issue, we propose a solution of opportunistic data offloading for alleviating overloaded cellular traffic. The principle behind it is to select a few important users as seeds for data sharing. The three critical steps are detailed as follows. We first explore individual interests of users by the construction of user profiles, on which an interest graph is built by Gaussian graphical modeling. We then apply the extreme value theory to threshold the encounter duration of user pairs. So, a contact graph is generated to indicate the social relationships of users. Moreover, a contact-interest graph is developed on the basis of the social ties and individual interests of users. Corresponding on different graphs, three strategies are finally proposed for seed selection in an aim to maximize overloaded cellular data. We evaluate the performance of our algorithms by the trace data of real-word mobility. It demonstrates the effectiveness of the strategy of taking social relationships and individual interests into account.

---

Keywords

---

Citations