In B-IDNC (buffered instantly decodable network coding), each receiver can cache the non-instantly decodable network coded packets (NIDPs) which contain two wanted packets of the network layer for subsequent network d...
详细信息
In B-IDNC (buffered instantly decodable network coding), each receiver can cache the non-instantly decodable network coded packets (NIDPs) which contain two wanted packets of the network layer for subsequent network decoding, so that more packets can be recovered at the network layer than the traditional instantly decodable network coding (IDNC). By employing B-IDNC, we consider a radio access network wherein a base station (BS) is required to broadcast a block of packets to a set of receivers. After completing network decoding at the network layer, each receiver can deliver its recovered packets from the network layer to the applicationlayer in order. We consider minimizing the average packet access time of the application layer for B-IDNC. For the optimization problem is intractable, we approximate it to reduce the sum minimum access delay of the applicationlayer across all receivers. The approximate problem is shown to be equivalent to a maximum weight encoding clique problem over the B-IDNC graph. We propose a simple heuristic algorithm based on greedy maximum weight vertex search to solve the approximate problem. Simulation results verify the effectiveness of our proposed algorithm as compared with the existing techniques.
暂无评论