Routing with Mutual Information Accumulation in Wireless Networks

We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual information with every packet transmission. This enables a significant performance gain over conventional shortest path routing. Further, it also outperforms cooperative communication techniques that are based on energy accumulation. However, it creates complex and combinatorial networking decisions concerning which nodes participate in transmission, and which decode ordering to use. We formulate three problems of interest in this setting: (i) minimum delay routing, (ii) minimum energy routing subject to delay constraint, and (iii) minimum delay broadcast. All of these are hard combinatorial optimization problems and we make use of several structural properties of their optimal solutions to simplify the problems and derive optimal greedy algorithms. Although the reduced problems still have exponential complexit...

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Rahul Urgaonkar, Michael J. Neely
• Keywords: CORR 2010, Education, Greedy Algorithms, Optimal Solution, Problems