Offloading Content with Self-organizing Mobile Fogs
Junaid Ahmed Khan, Cedric Westphal, Yacine Ghamri-Doudane

TL;DR
This paper introduces a self-organizing mobile fog system for urban content caching, leveraging coalition game theory to enhance cache availability and hit ratios in mobile networks.
Contribution
It proposes a novel relation between content popularity and network availability, and a coalition game approach for nodes to form mobile fogs with virtual caches.
Findings
Achieves 60-85% cache hit ratio, outperforming existing schemes.
Demonstrates effective self-organization of mobile fogs in urban environments.
Validates approach using realistic urban mobility traces.
Abstract
Mobile users in an urban environment access content on the internet from different locations. It is challenging for the current service providers to cope with the increasing content demand from a large number of collocated mobile users. In-network caching to offload content at nodes closer to users alleviate the issue, though efficient cache management is required to find out who should cache what, when and where in an urban environment, given nodes limited computing, communication and caching resources. To address this, we first define a novel relation between content popularity and availability in the network and investigate a node's eligibility to cache content based on its urban reachability. We then allow nodes to self-organize into mobile fogs to increase the distributed cache and maximize content availability in a cost-effective manner. However, to cater rational nodes, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
