Anchor Vertex Selection for Enhanced Reliability of Traffic Offloading Service in Edge-Enabled Mobile P2P Social Networks

Zhang, Hengda, Wang, Xiaofei, Fan, Hao, Cai, Taotao, Li, Jianxin, Li, Xiuhua and Leung, Victor C. M. 2020, Anchor Vertex Selection for Enhanced Reliability of Traffic Offloading Service in Edge-Enabled Mobile P2P Social Networks, Journal of Communications and Information Networks, vol. 5, pp. 217-224, doi: 10.23919/JCIN.2020.9130437.

Attached Files
Name Description MIMEType Size Downloads

Title Anchor Vertex Selection for Enhanced Reliability of Traffic Offloading Service in Edge-Enabled Mobile P2P Social Networks
Author(s) Zhang, Hengda
Wang, Xiaofei
Fan, Hao
Cai, Taotao
Li, JianxinORCID iD for Li, Jianxin orcid.org/0000-0001-7953-8230
Li, Xiuhua
Leung, Victor C. M.
Journal name Journal of Communications and Information Networks
Volume number 5
Article ID 2
Start page 217
End page 224
Total pages 8
Publisher Posts & Telecom Press
Place of publication Beijing, China
Publication date 2020-06-30
ISSN 2096-1081
2509-3312
Keyword(s) traffic offloading service
mobile P2P communications
mobile edge computing
anchored k-core problem
adaptive allocation
Summary As the rapid growth of mobile social networks, mobile peer-to-peer (P2P) communications and mobile edge computing (MEC) have been developed to reduce the traffic load and improve the computation capacity of cellular networks. However, the stability of social network is largely ignored in the advances of P2P and MEC, which is related to the social relations between users. It plays a vital role in improving the efficiency and reliability of traffic offloading service. In this paper, we integrate an edge node and the nearby P2P users as a mobile P2P social network and introduce the problem of adaptive anchored (k,r)-core to maintain the stability of multiple mobile P2P networks. It aims to adaptively select and retain a set of critical users for each network, whose participation is critical to overall stability of the network, and allocate certain resource for them so that the maximum number of users of all networks will remain engaged and the traffic of cellular network can be minimized. We called the retained users as anchor vertices. To address it, we devise a peer-edge-cloud framework to achieve the adaptive allocation of resources. We also develop a similarity based onion layers anchored (k,r)-core (S-OLAK) algorithm to explore the anchor vertices. Experimental results based on a real large-scale mobile P2P data set demonstrate the effectiveness of our method.
Language eng
DOI 10.23919/JCIN.2020.9130437
Indigenous content off
HERDC Research category C1 Refereed article in a scholarly journal
Persistent URL http://hdl.handle.net/10536/DRO/DU:30140917

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 11 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Tue, 18 Aug 2020, 10:27:56 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.