Exploiting wireless broadcast advantage as a network-wide cache

Existing literature has looked to exploit wireless broadcast advantage (WBA) in order to optimize the performance of a wide variety of network operations. In this paper, we obtain a measure of WBA in a multihop scenario. We consider that all nodes in the network store and propagate implicitly received information from neighbourhood transmissions, resulting in the creation of a distributed cache, which we term broadcast cache. We obtain a lower bound on the growth of the broadcast cache in terms of the fewest set of transmissions in the network, which we define as the minimum set of non-altruistic transmissions. Subsequently, we use our results to obtain feasibility conditions that determine whether WBA can be effectively utilized depending on flow requirements.