TR2008-021

Routing in Cooperative Wireless Networks with Mutual-Information Accumulation


    •  Draper, S.C.; Liu, A.; Molisch, A.F.; Yedidia, J.S., "Routing in Cooperative Wireless Networks with Mutual-Information Accumulation", IEEE International Conference on Communications (ICC), ISBN: 978-1-4244-2075-9, May 2008, pp. 4272-4277.
      BibTeX Download PDF
      • @inproceedings{Draper2008may,
      • author = {Draper, S.C. and Liu, A. and Molisch, A.F. and Yedidia, J.S.},
      • title = {Routing in Cooperative Wireless Networks with Mutual-Information Accumulation},
      • booktitle = {IEEE International Conference on Communications (ICC)},
      • year = 2008,
      • pages = {4272--4277},
      • month = may,
      • isbn = {978-1-4244-2075-9},
      • url = {http://www.merl.com/publications/TR2008-021}
      • }
  • Research Areas:

    Algorithms, Electronics & Communications, Wireless Communications


TR Image
Cooperative wireless route discovered
by our algorithm. A conventional wireless route incurs additional
delays and energy expenditures on the order of 70% compared to
the cooperative route.

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, e.g., by using rateless codes. In this paper, we investigate routing problems in such networks. Given a network, a source and a destination, our objective is to minimize end-to-end transmission delay under a sum energy constraint. We provide an algorithm that determines which nodes should participate in forwarding the message and what resources (time, energy, bandwidth) should be allocated to each. Our approach factors into two sub-problems, each of which can be solved efficiently. For any node decoding order we show that solving for the optimum resource allocation can be formulated as a linear problem. We then show that the decoding order can be improved systematically by swapping nodes based on the solution of the linear program. Solving a sequence of linear program leads to a locally optimum solution in a very efficient manner. In comparison to the cooperative routing, it is observed that conventional shortest-path multihop routings incur additional delays and energy expenditures on the order of 70%. Since this initial solution is centralized, requiring full channel stat information, we exploit the insights to design two distributed routing algorithms that require only local channel state information. We provide simulations showing that in the same networks the distributed algorithms find routes that are only about 2-5% less efficient than the centralized solution.