Hypergraph based three-dimensional matching in wireless distributed storage over D2D links

This work investigates content sharing in cellular device-to-device underlay based wireless distributed storage systems by exploiting an (n, k, d) distributed content coding scheme. To guarantee that content requesters (CRs) can rely on enough eligible content helpers (CHs) for content download, the selection of CH5 and the determination of the coding parameter k are optimized by evaluating the physical conditions of mobile users and analyzing the outage probability of data transmission. Targeting the minimization of the overall transmission cost, the assignment of CHs for each CR and spectrum allocation for each CH-CR link, are jointly formulated as a three-dimensional matching problem, and are optimized by using a hierarchical bipartite matching algorithm. Numerical results demonstrate clear performance advantages of our proposed scheme.