Caching in wireless multihop device-to-device networks

We consider a wireless device-to-device (D2D) network in which the nodes are uniformly distributed at random over the network area and can cache information from a library of possible messages (files). Each node requests a file in the library independently at random, according to a given popularity...

Full description

Saved in:
Bibliographic Details
Main Authors: Sang-Woon Jeon, Song-Nam Hong, Mingyue Ji, Caire, Giuseppe
Format: Conference Proceeding
Language:English
Subjects:
Ad hoc networks
caching
Libraries
multihop D2D networks
Protocols
scaling laws
Spread spectrum communication
Throughput
Wireless communication
Wireless sensor networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider a wireless device-to-device (D2D) network in which the nodes are uniformly distributed at random over the network area and can cache information from a library of possible messages (files). Each node requests a file in the library independently at random, according to a given popularity distribution, and downloads from other nodes having the requested file in their local cache via multihop transmission. Under the classical "protocol model" of wireless ad hoc networks, we characterize the optimal throughput scaling law by presenting a feasible scheme formed by a decentralized caching policy for the parameter regimes of interest and a local multihop transmission protocol. The scaling law optimality of the proposed strategy is shown by deriving a new throughput upper bound. Surprisingly, we show that decentralized uniform random caching yields optimal scaling in most of the system interesting regimes. We also observe that caching improves the throughput scaling law of classical ad hoc networks, and that multihop improves the previously derived scaling law of caching wireless networks under one-hop transmission.
ISSN:1550-3607
1938-1883
DOI:10.1109/ICC.2015.7249398