Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks

We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source single-destination network with many relay nodes. Given the myriad of ways in which nodes can cooperate, there is a natural routing problem, i.e., determining an ordered set of nodes to relay the data from the source to the destination. We find that for a given route, the decode- and-forward strategy, which is an information theoretic cooperative coding strategy, achieves rates significantly higher than that achievable by the usual multi-hop coding strategy, which is a point-to-point non-cooperative coding strategy. We construct an algorithm to find an optimal route (in terms of rate maximizing) for the decode-and- forward strategy. Since the algorithm runs in factorial time in the worst case, we propose a heuristic algorithm that runs in polynomial time. The heuristic algorithm outputs an optimal route when the nodes transmit independent codewords. We implement these coding strategies using practical low density parity check codes to compare the performance of the strategies on different routes.

[1]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[2]  Rene L. Cruz,et al.  Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  M. Motani,et al.  Cross-layer design: a survey and the road ahead , 2005, IEEE Communications Magazine.

[4]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[5]  M.A. Khojastepour,et al.  Code design for the relay channel and factor graph decoding , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[6]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[7]  Elza Erkip,et al.  User cooperation diversity. Part II. Implementation aspects and performance analysis , 2003, IEEE Trans. Commun..

[8]  Matthew C. Valenti,et al.  Distributed turbo coded diversity for relay channel , 2003 .

[9]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[10]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[11]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[12]  Anthony Ephremides,et al.  Joint Scheduling, Power Control, and Routing Algorithm for Ad-Hoc Wireless Networks , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[13]  Mehul Motani,et al.  Selective cooperation based on link distance estimations in wireless ad-hoc networks , 2006, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06).

[14]  Michael Gastpar,et al.  On the Performance of Independently Designed LDPC Codes for the Relay Channel , 2006, 2006 IEEE International Symposium on Information Theory.

[15]  Mehul Motani,et al.  Myopic Coding in Wireless Networks , 2006, ArXiv.

[16]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[17]  Bo Li,et al.  Joint routing and scheduling in multi-radio multi-channel multi-hop wireless networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[18]  Wei Yu,et al.  Bilayer LDPC Codes for the Relay Channel , 2006, 2006 IEEE International Conference on Communications.

[19]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[20]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[21]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[22]  Robert Tappan Morris,et al.  Opportunistic routing in multi-hop wireless networks , 2004, Comput. Commun. Rev..

[23]  Ashutosh Sabharwal,et al.  Low density parity check codes for the relay channel , 2007, IEEE Journal on Selected Areas in Communications.

[24]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

[25]  Zheng Zhang,et al.  Capacity approaching codes for relay channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[26]  Mehul Motani,et al.  Myopic coding in multiple relay channels , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[27]  Panganamala Ramana Kumar,et al.  An achievable rate for the multiple-level relay channel , 2005, IEEE Transactions on Information Theory.

[28]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[29]  Bhaskar Krishnamachari,et al.  Energy efficient joint scheduling and power control for wireless sensor networks , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..