Secure Coded Caching in Wireless Ad Hoc Networks

A decentralized coded caching technique is introduced for wireless ad hoc networks in which all the existing contents are randomly combined and cached. The scaling behavior of the network is studied in terms of both capacity and security. Proactive and reactive routing techniques for coded caching are presented and the scaling capacity of the network for each case is derived. It has been shown that by using reactive routing, any content can be retrieved by selecting a random path while providing asymptotic optimum solution. The proposed coded caching significantly simplifies the routing protocol in cached networks. We further prove that asymptotic perfect secrecy can be achieved using proposed coded caching scheme.