Journal
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
Volume 68, Issue 10, Pages 10066-10080Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2019.2933667
Keywords
Servers; Network coding; Relays; Topology; Network topology; Throughput; Game theory; Caching; edge; network coding; coalition game; D2D
Categories
Funding
- National Key Research and Development Program of China [SQ2018YFB180012]
- National Nature Science Foundation of China [61971267, 61972223, 61861136003, 61621091]
- Beijing Natural Science Foundation [L182038]
- Beijing National Research Center for Information Science and Technology [20031887521]
- Tsinghua University - Tencent Joint Laboratory for Internet Innovation Technology
Ask authors/readers for more resources
To deal with the explosive traffic demand, caching at the edge of mobile networks has been proposed to improve the quality of user experience. Presently, the edge caching systems are based on the direct and simple relay transmission, which is hard to achieve high system throughput and good content service. In such situations, network coding can effectively solve these problems. One problem arises in the application of network coding: how to form X topology network. We formulate the X topology formation problem as a function of system throughput and content service satisfaction degree. Then we propose a coalition game theory based algorithm to solve this NP-hard problem and prove the Nash stability of our coalition formation game. We evaluate our proposed algorithm through extensive simulations in different network environments. The experiment results demonstrate that our algorithm achieves nearly optimal performance and significantly outperforms the four widely-accepted baseline algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available