Cooperative Packet Routing using Mutual Information Accumulation

Details Cooperative Packet Routing using Mutual Information Accumulation Cooperative Packet Routing using Mutual Information Accumulation

2011-08-15

arxiv.org/abs/1108.3097v1

Computer Science

Information Theory

Scientific paper

We consider the resource allocation problem in cooperative wireless networks wherein nodes perform mutual information accumulation. We 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. We 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, our algorithm generates a policy that regulates which nodes should participate in transmitting which packets, when and with what resource. By routing different packets through different nodes the policy exploits spatial route diversity, and by sequencing packet transmissions along the same route it exploits temporal route diversity.

Affiliated with

Also associated with

No associations

Rating

Cooperative Packet Routing using Mutual Information Accumulation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cooperative Packet Routing using Mutual Information Accumulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cooperative Packet Routing using Mutual Information Accumulation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-194333