A Note on the Buffer Overlap Among Nodes Performing Random NetworK Coding in Wireless Ad Hoc Networks

Network coding is a technique which is particularly suitable for the dissemination of data in distributed ad hoc networks. The definition of a mathematical model that describes the interactions among nodes and, in particular, their relationship in terms of buffer subspaces is still an open and challenging problem. The contribution of this paper is an analysis of the relationship between the network topology and the subspace overlap among nodes. This analysis can be used to establish criteria for the design of packet combination policies in diverse networking scenarios. Differently from previous studies, we will explicitly take the overlap among subspaces into account through a framework comprising networks with fixed as well as mobile nodes.