Distributed Energy-Efficient Cooperative Routing in Wireless Networks

Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing power-efficient routing algorithms. Most of the existing cooperation-based routing algorithms are implemented by finding a shortest-path route first. As such, these routing algorithms do not fully exploit the merits of cooperative communications at the physical layer. In this paper, we propose a cooperation-based routing algorithm, namely, minimum power cooperative routing (MPCR) algorithm, which makes full use of the cooperative communications while constructing the minimum-power route. The MPCR algorithm constructs the minimum-power route as a cascade of the minimum-power single-relay building blocks from the source to the destination. Hence, any distributed shortest-path algorithm can be utilized to find the optimal route with polynomial complexity, while guaranteeing certain throughput. We show that the MPCR algorithm can achieve power saving of 57.36% compared to the conventional shortest-path routing algorithms. Furthermore, the MPCR algorithm can achieve power saving of 37.64% compared to the existing cooperative routing algorithms, in which the selected routes are constructed based on the noncooperative routes.

[1]  Mohamed F. Younis,et al.  Energy-aware management for cluster-based sensor networks , 2003, Comput. Networks.

[2]  D. G. Brennan,et al.  Linear diversity combining techniques , 2003 .

[3]  Theodore S. Rappaport,et al.  Cross-layer design for wireless networks , 2003, IEEE Commun. Mag..

[4]  Kui Wu,et al.  Energy-efficient cooperative routing in multi-hop wireless ad hoc networks , 2006, 2006 IEEE International Performance Computing and Communications Conference.

[5]  Anders Høst-Madsen,et al.  Cooperative routing and power allocation in ad-hoc networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[6]  K. J. Ray Liu,et al.  SPC12-5: Relay Selection in Multi-Node Cooperative Communications: When to Cooperate and Whom to Cooperate with? , 2006, IEEE Globecom 2006.

[7]  Man Hon Cheung,et al.  Cooperative Routing in UWB Wireless Networks , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[8]  K. J. Ray Liu,et al.  Cooperative communications with partial channel state information: When to cooperate? , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[9]  K. J. Ray Liu,et al.  Multinode Cooperative Communications in Wireless Networks , 2007, IEEE Transactions on Signal Processing.

[10]  H. T. Mouftah,et al.  QoS routing for wireless ad hoc networks: problems, algorithms, and protocols , 2005, IEEE Communications Magazine.

[11]  K. J. Ray Liu,et al.  Distributed cooperative routing algorithms for maximizing network lifetime , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[12]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  L.J. Cimini,et al.  New approaches for cooperative use of multiple antennas in ad hoc wireless networks , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[14]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

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

[16]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[17]  Anders Høst-Madsen,et al.  Routing and Power Allocation in Asynchronous Gaussian Multiple-Relay Channels , 2006, EURASIP J. Wirel. Commun. Netw..

[18]  Martin Nilsson,et al.  Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[19]  Martin Haenggi.  On routing in random Rayleigh fading networks , 2005, IEEE Transactions on Wireless Communications.

[20]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[21]  Gregory W. Wornell,et al.  Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks , 2003, IEEE Trans. Inf. Theory.

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

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

[24]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[25]  Zhu Han,et al.  A Distributed Relay-Assignment Algorithm for Cooperative Communications in Wireless Networks , 2006, 2006 IEEE International Conference on Communications.

[26]  A. Khandani.  Cooperative Routing in Wireless Networks ∗ , 2003 .

[27]  Martin Haenggi,et al.  Bandwidth- and power-efficient routing in linear wireless networks , 2006, IEEE Transactions on Information Theory.

[28]  K.J.R. Liu,et al.  A class of cooperative communication protocols for multi-node wireless networks , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..

[29]  John G. Proakis,et al.  Digital Communications , 1983 .