Matching-Coalition Based Cluster Formation for D2D Multicast Content Sharing

被引:16
作者
Wu, Yan [1 ]
Wu, Dan [1 ]
Yang, Lianxin [1 ]
Shi, Xin [1 ]
Ao, Liang [1 ]
Fu, Qinxue [1 ]
机构
[1] Army Engn Univ PLA, Coll Commun Engn, Nanjing 210007, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
CH selection; coalition formation; D2D multicast content sharing; many-to-one matching; user grouping; AWARE RESOURCE-ALLOCATION; GAME-THEORY; NETWORKS;
D O I
10.1109/ACCESS.2019.2918942
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Device-to-device (D2D) multicast content sharing has become a promising technology to improve the services within a local area. This paper investigates the problem of cluster formation (i.e., cluster head (CH) selection and user grouping) for D2D multicast content sharing in cellular networks. Each cluster consists of one CH and multiple content requesters (CRs). First, the selected CHs should be able to serve as many CRs as possible. To achieve this, they should have higher physical-social centrality and should not stay physically close to each other. Second, the issue of user grouping is modeled as a social-aware rate maximization problem, where the social-aware rate is introduced to ensure the physical link quality and to stimulate an efficient cooperation between the CHs and CRs. In order to solve the optimization problem in a decentralized and low-complexity way, we propose a matching and coalition approach. Specifically, the optimization problem is transformed into a two-sided many-to-one matching game with externality, and a distributed user grouping algorithm is proposed to obtain a stable matching result. Considering the performance gap resulted from the externality, the problem is then transformed into a coalition formation game. Without loss of generality, a user grouping optimization algorithm with user transfer and merging is proposed. Moreover, some properties, e.g., the convergence, stability, and complexity, of the proposed algorithms are discussed. Finally, the performance of our proposed scheme is evaluated by the extensive simulations based on the comparisons with other schemes.
引用
收藏
页码:73913 / 73928
页数:16
相关论文
共 32 条
[11]   Social-Aware D2D Communications: Qualitative Insights and Quantitative Analysis [J].
Li, Yong ;
Wu, Ting ;
Hui, Pan ;
Jin, Depeng ;
Chen, Sheng .
IEEE COMMUNICATIONS MAGAZINE, 2014, 52 (06) :150-158
[12]   Clarifying Trust in Social Internet of Things [J].
Lin, Zhiting ;
Dong, Liang .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (02) :234-248
[13]   Trust Evaluation via Large-Scale Complex Service-Oriented Online Social Networks [J].
Liu, Lianggui ;
Jia, Huiling .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2015, 45 (11) :1402-1412
[14]  
Peng B., 2013, PROC 78 IEEE VEH TEC, P1
[15]   Deferred acceptance algorithms: history, theory, practice, and open questions [J].
Roth, Alvin E. .
INTERNATIONAL JOURNAL OF GAME THEORY, 2008, 36 (3-4) :537-569
[16]   Coalitional Game Theory for Communication Networks [J].
Saad, Walid ;
Han, Zhu ;
Debbah, Merouane ;
Hjorungnes, Are ;
Basar, Tamer .
IEEE SIGNAL PROCESSING MAGAZINE, 2009, 26 (05) :77-97
[17]  
Sandvine, GLOB INT PHEN REP
[18]   Device-to-Device-Assisted Communications in Cellular Networks: An Energy Efficient Approach in Downlink Video Sharing Scenario [J].
Shen, Yanyao ;
Jiang, Chunxiao ;
Quek, Tony Q. S. ;
Ren, Yong .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2016, 15 (02) :1575-1587
[19]   Hierarchical Matching With Peer Effect for Low-Latency and High-Reliable Caching in Social IoT [J].
Wang, Bowen ;
Sun, Yanjing ;
Li, Song ;
Cao, Qi .
IEEE INTERNET OF THINGS JOURNAL, 2019, 6 (01) :1193-1209
[20]   Physical-Social-Aware D2D Content Sharing Networks: A Provider-Demander Matching Game [J].
Wu, Dan ;
Zhou, Liang ;
Cai, Yueming ;
Chao, Han-Chieh ;
Qian, Yi .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (08) :7538-7549