| US 7,593,342 B2 | ||
| Route selection in cooperative relay networks | ||
| Andreas F. Molisch, Arlington, Mass. (US); Neelesh B. Mehta, Needham, Mass. (US); Jonathan S. Yedidia, Cambridge, Mass. (US); Zhifeng Tao, Allston, Mass. (US); Zafer Sahinoglu, Watertown, Mass. (US); Philip V. Orlik, Cambridge, Mass. (US); and Jin Zhang, Cambridge, Mass. (US) | ||
| Assigned to Mitsubishi Electric Research Laboraties, Inc., Cambridge, Mass. (US) | ||
| Filed on Dec. 05, 2006, as Appl. No. 11/566,846. | ||
| Application 11/566846 is a continuation in part of application No. 11/377711, filed on Mar. 16, 2006. | ||
| Prior Publication US 2008/0144512 A1, Jun. 19, 2008 | ||
| Int. Cl. G01R 31/08 (2006.01) | ||
| U.S. Cl. 370—238 | 22 Claims |
| 1. A method for selecting a route in a wireless cooperative relay network of nodes, the nodes including a source, a set of
relays, and a destination, comprising the steps of:
encoding a codeword as a data stream;
transmitting the data stream from a source to a destination via a set of relays;
accumulating mutual information at a particular node to decode the data stream and recover the codeword; and
selecting a route from the source to the destination based on channel state information between the nodes while transmitting
and accumulating, wherein the selecting uses an optimization process and optimization criterion, and wherein the optimization
process minimizing a penalty function, and wherein the optimization process iteratively subtracts nodes from a suboptimum
route that lead to a largest improvement of the penalty function, and wherein the optimization method is to iteratively subtract
the nodes from a predetermined route that do not substantially increase an amount of the accumulated mutual information.
|