Networking

Cooperative Routing for Wireless Networks Using Mutual-Information Accumulation

Download Now Free registration required

Executive Summary

Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are even greater when nodes perform mutual information accumulation using rateless codes. In this paper, the authors investigate routing problems in such networks. Given a network, a source, and a destination, the objective is to minimize end-to-end transmission delay under energy and bandwidth constraints. They provide an algorithm that determines which nodes should participate in forwarding the message and what resources (time, energy, and bandwidth) should be allocated to each. The approach factors into two sub-problems, each of which can be solved efficiently. For any transmission order they show that solving for the optimum resource allocation can be formulated as a linear programming problem.

  • Format: PDF
  • Size: 240.32 KB