Abstract | ||
---|---|---|
Together with an explosive growth of the mobile devices with various applications and great demand for bandwidth, Device-to-Device (D2D) communication has been introduced to be a potential technology for mobile services mainly due to its particular advantages to offload cellular traffic effectively via content sharing. A device can directly retrieve its desired message from one of its neighboring devices if the message is available in the vicinity of the device. The main challenge becomes how to select messages to cache in order to maximize traffic offloading and improve system performance via D2D communication. In this paper, we describe the caching problem as a maximum weighted matching problem and put forward a caching strategy in which the weights of various contents are defined to determine the order of caching messages leveraging Kuhn-Munkres (KM) algorithm. Based on theoretical and experimental analysis, we identify the reliability and feasibility of the above mechanism. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1145/3028842.3028880 | ICIIP |
Keywords | Field | DocType |
Device-to-Device(D2D), Caching Policy, Kuhn-MunkresAlgorithm | Device to device,Computer science,Cache,Explosive material,Cellular traffic,False sharing,Mobile device,Bandwidth (signal processing),Cellular network,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Xinying Yu | 1 | 0 | 0.34 |
Chong Tan | 2 | 1 | 0.69 |
Lin Ma | 3 | 31 | 9.41 |
Kai Yu | 4 | 246 | 22.28 |
Zhiyong Bu | 5 | 0 | 0.34 |