TY - GEN
T1 - Incentive-driven data offloading and caching replacement scheme in opportunistic mobile networks
AU - Wu, Tong
AU - Liu, Xuxun
AU - Zeng, Deze
AU - Zhou, Huan
AU - Xu, Shouzhi
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/12
Y1 - 2020/12
N2 - Offloading cellular traffic through Opportunistic Mobile Networks (OMNs) is an effective way to relieve the burden of cellular networks. Providing data offloading services requires a lot of resources, and nodes in OMNs are selfish and rational, they are not willing to provide data offloading services for others without any compensation. Therefore, it is urgent to design an incentive mechanism to stimulate mobile nodes to participate in data offloading process. In this paper, we propose a Reverse Auction-based Incentive Mechanism to stimulate mobile nodes in OMNs to provide data offloading services, and take the cache management into consideration. We model the incentive-driven data offloading process as a non-linear integer programming problem, then a Greedy Helper Selection Method (GHSM) and a Caching Replacement Scheme (CRS) are proposed to solve the problem. In addition, we also propose an innovative payment rule based on the Vickrey-Clarke-groves (VCG) model to ensure the individual rationality and authenticity of the proposed algorithm. Trace-driven simulation results show that the proposed algorithm can reduce the cost of Content Service Provider (CSP) significantly in different scenarios.
AB - Offloading cellular traffic through Opportunistic Mobile Networks (OMNs) is an effective way to relieve the burden of cellular networks. Providing data offloading services requires a lot of resources, and nodes in OMNs are selfish and rational, they are not willing to provide data offloading services for others without any compensation. Therefore, it is urgent to design an incentive mechanism to stimulate mobile nodes to participate in data offloading process. In this paper, we propose a Reverse Auction-based Incentive Mechanism to stimulate mobile nodes in OMNs to provide data offloading services, and take the cache management into consideration. We model the incentive-driven data offloading process as a non-linear integer programming problem, then a Greedy Helper Selection Method (GHSM) and a Caching Replacement Scheme (CRS) are proposed to solve the problem. In addition, we also propose an innovative payment rule based on the Vickrey-Clarke-groves (VCG) model to ensure the individual rationality and authenticity of the proposed algorithm. Trace-driven simulation results show that the proposed algorithm can reduce the cost of Content Service Provider (CSP) significantly in different scenarios.
KW - Data Offloading
KW - Incentive Mechanism
KW - Opportunistic Mobile Network
KW - Real Mobility Trace
KW - Reverse Auction
UR - https://www.scopus.com/pages/publications/85102373720
U2 - 10.1109/ICPADS51040.2020.00096
DO - 10.1109/ICPADS51040.2020.00096
M3 - 会议稿件
AN - SCOPUS:85102373720
T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
SP - 679
EP - 684
BT - Proceedings - 2020 IEEE 26th International Conference on Parallel and Distributed Systems, ICPADS 2020
PB - IEEE Computer Society
T2 - 26th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2020
Y2 - 2 December 2020 through 4 December 2020
ER -