Cooperative Packet Routing Using Mutual Information Accumulation
The authors consider the resource allocation problem in cooperative wireless networks wherein nodes perform mutual information accumulation. They consider a unicast setting and arbitrary arrival processes at the source node. Source arrivals can be broken down into numerous packets to better exploit the spatial and temporal diversity of the routes available in the network. They devise a linear-program-based algorithm which allocates network resource to meet a certain transmission objective. Given a network, a source with multiple arriving packets and a destination, their algorithm generates a policy that regulates which nodes should participate in transmitting which packets, when and with what resource.