Date Added: Jul 2011
The authors consider cooperative communication in a given network using rateless codes. Given a network, a source and a destination, they investigate routing and resource allocation for delivering multiple packets through the network. They propose and design a centralized algorithm which minimizes a given objective under different network resource constraints. The solution to the algorithm is a policy that determines which nodes should participate in transmitting which packets, when and with how much resource. Their algorithm efficiently exploits route diversity for packets transmission in both spatial and temporal aspects. Packets may take different routes to reach the destination to exploit the spatial route diversity or they may reuse the same route, one followed by another, to exploit the temporal route diversity.