Social-Aware Incentivized Caching for D2D Communications

Zhu, Konglin; Zhi, Wenting; Zhang, Lin; Chen, Xu; Fu, Xiaoming

doi:10.1109/access.2016.2618940

Cited by 61 publications

(40 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the proposed MRAC is more feasible in the practical scenario with a large number of contents. Next, we compare the caching performance of the proposed MRAC with the social-aware caching game (SAGG) [26] and random caching (RC). The criteria of the caching performance considered in this paper are average content access delay and the BS traffic offloading ratio.…”

Section: B Simulation Resultsmentioning

confidence: 99%

D2D-Enabled Mobile User Edge Caching: A Multi-Winner Auction Approach

Zhang

Fang

Liu

et al. 2019

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

In device-to-device (D2D)-enabled caching cellular networks, the user terminals (UTs) collaboratively store and share a large volume of popular contents from the base station (BS) for traffic offloading and delivery delay reduction. In this article, the multi-winner auction based caching placement in D2D-enabled caching cellular networks is investigated for UT edge caching incentive and content caching redundancy reduction. Firstly, a multi-winner once auction for UT edge caching is modeled which auctions multiple contents for multiple UTs. Then the optimization problem for content caching revenue maximization is formulated. Specifically, the "cache conflict" restriction relationship among UTs is used as one of the constraints in the problem to reduce the content caching redundancy in a UT movement scenario. The problem is solved by semidefinite programming (SDP) relaxation to obtain an approximate optimal caching placement. Moreover, the payment strategy of the auction is developed as a Nash bargaining game for personal profit fairness among the UTs who win the auction for content caching. Subsequently, a multi-winner once auction based caching (MOAC) placement algorithm is proposed. In addition, due to the high complexity of MOAC, we further propose a heuristic multi-winner repeated auction based caching placement (MRAC) algorithm, which can greatly reduce the complexity with only tiny performance loss. Simulation results show that the proposed algorithms can reduce the traffic load and average content access delay effectively compared with the existing caching placement algorithms.

show abstract

Section: B Simulation Resultsmentioning

confidence: 99%

D2D-Enabled Mobile User Edge Caching: A Multi-Winner Auction Approach

Zhang

Fang

Liu

et al. 2019

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…In this regard, the social information, which can be obtained from the social networks, can be adopted to stimulate the CPs to share contents. According to [25], we employ the social tie…”

Section: Social Tiementioning

confidence: 99%

“…by[25], we firstly can obtain the Jaccard coefficient ,, . Here, the social factor can be derived from the friend sets, the locations or the interests of…”

mentioning

confidence: 99%

Social-Aware Collaborative Caching Based on User Preferences for D2D Content Sharing

Zhang¹,

Wu²,

Ao³

et al. 2020

KSII TIIS

View full text Add to dashboard Cite

With rapid growth of content demands, device-to-device (D2D) content sharing is exploited to effectively improve the service quality of users. Considering the limited storage space and various content demands of users, caching schemes are significant. However, most of them ignore the influence of the asynchronous content reuse and the selfishness of users. In this work, the user preferences are defined by exploiting the user-oriented content popularity and the current caching situation, and further, we propose the social-aware rate, which comprehensively reflects the achievable contents download rate affected by the social ties, the caching indicators, and the user preferences. Guided by this, we model the collaborative caching problem by making a trade-off between the redundancy of caching contents and the cache hit ratio, with the goal of maximizing the sum of social-aware rate over the constraint of limited storage space. Due to its intractability, it is computationally reduced to the maximization of a monotone submodular function, subject to a matroid constraint. Subsequently, two social-aware collaborative caching algorithms are designed by leveraging the standard and continuous greedy algorithms respectively, which are proved to achieve different approximation ratios in unequal polynomial-time. We present the simulation results to illustrate the performance of our schemes. Dan Wu received the B.S., M.S., and Ph.D. degrees from PLAUST, Nanjing, China, in 2006, 2009, and 2012, respectively. She is currently a Postdoctoral Researcher in Army Engineering University of PLA. Her research interests include resource allocation and management, game theory, cooperative communications, and wireless sensor networks. Liang Ao recieved the B.S. and M.S. degrees from PLAUST, Nanjing, China, in 2007, and 2010, respectively. He is currently an Instructor in Army Engineering University of PLA. His research interests include signal and information processing, deep learning, and speech processing. Meng Wang received the B.S. and M.S. degrees in instructional technology from the Nanjing Normal University, Nanjing, China, in 2006 and 2009, respectively. His current interests include wireless network security, D2D communications, and game theory. Yueming Cai received his B.S. degree in Physics from Xiamen University, Xiamen, China in 1982, the M.S. degree in Micro-electronics Engineering and the Ph.D. degree in Communications and Information Systems both from Southeast University, Nanjing, China in 1988 and 1996, respectively. His current research interests include MIMO systems, OFDM systems, signal processing in communications, cooperative communications andwireless sensor networks.

show abstract

“…The social relationship has been considered in the various communication systems to develop communication strategies [2][3][4][5][6][7][8][9][10][11]. In [2,3], a social group utility maximization (SGUM) game framework was proposed to proportionally maximize the utilities of socially connected users.…”

Section: Introductionmentioning

confidence: 99%

“…The social relationship aware content caching strategies were also proposed for wireless caching networks [6][7][8][9]. Efficient content caching strategies were developed based on the social distance which considers social closeness as well as physical distance [6,7] and the interest similarity of users [8,9]. For confidential communications, transmission strategies that exploit the trustworthiness of nodes were proposed in [10].…”

Section: Introductionmentioning

confidence: 99%

Trust Degree-Based MISO Cooperative Communications with Two Relay Nodes

Ryu

Lee

2019

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

In this paper, we propose transmission strategies in multiple-input-single-output (MISO) cooperative communications with two relay nodes in cases when the relay nodes have different trust degrees, where the trust degrees represent how much the relay nodes can be trusted for cooperation. For the given trust degrees and channel conditions, we first derive a relay selection strategy that maximizes the expected achievable rate. We then propose a cooperative transmission strategy of relays with an optimal cooperative beamforming vector that maximizes the expected achievable rate, which is a linear combination of weighted channel vectors. Finally, we derive the optimal transmission strategy, which is a mixed strategy between the relay selection and cooperative transmission strategies with respect to the trust degrees. Our analysis and numerical results show that the proposed transmission strategies increase the expected achievable rate by exploiting the trust degrees of the relay nodes, along with the channel conditions.

show abstract

Social-Aware Incentivized Caching for D2D Communications

Cited by 61 publications

References 21 publications

D2D-Enabled Mobile User Edge Caching: A Multi-Winner Auction Approach

D2D-Enabled Mobile User Edge Caching: A Multi-Winner Auction Approach

Social-Aware Collaborative Caching Based on User Preferences for D2D Content Sharing

Trust Degree-Based MISO Cooperative Communications with Two Relay Nodes

Contact Info

Product

Resources

About