The Capacity of the Single Source Multiple Relay Single Destination Mesh Network

In this paper, we derive the capacity of a special class of mesh networks. A mesh network is defined as a heterogeneous wireless network in which the transmission among power limited nodes is assisted by powerful relays, which use the same wireless medium. We find the capacity of the mesh network when there is one source, one destination, and multiple relays. We call this channel the single source multiple relay single destination (SSMRSD) mesh network. Our approach is as follows. We first look at an upper bound on the information theoretic capacity of these networks in the Gaussian setting. We then show that the bound is achievable asymptotically using the compress-forward strategy for the multiple relay channel. Theoretically, the results indicate the value of cooperation and the utility of carefully deployed relays in wireless ad-hoc and sensor networks. The capacity characterization quantifies how the relays can be used to either conserve node energy or to increase transmission rate

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

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

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

[4]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[5]  Michael Gastpar,et al.  On the capacity of large Gaussian relay networks , 2005, IEEE Transactions on Information Theory.

[6]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2003, IEEE Trans. Wirel. Commun..

[7]  R. Ahlswede The Capacity Region of a Channel with Two Senders and Two Receivers , 1974 .

[8]  Hamed M. K. Alazemi,et al.  Capacity Scaling with Multiple Radios and Multiple Channels in Wireless Mesh Networks , 2005 .

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

[10]  Mehul Motani,et al.  New coding strategies for the relay channel , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[11]  Patrick P. Bergmans,et al.  Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[12]  Michael Gastpar,et al.  The multiple-relay channel: coding and antenna-clustering capacity , 2002, Proceedings IEEE International Symposium on Information Theory,.

[13]  Jing Li,et al.  Practical Compress-Forward in User Cooperation: Wyner-Ziv Cooperation , 2006, 2006 IEEE International Symposium on Information Theory.

[14]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

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

[16]  Öznur Özkasap,et al.  Ad-Hoc Networks , 2008, Encyclopedia of Algorithms.

[17]  Jangeun Jun,et al.  The nominal capacity of wireless mesh networks , 2003, IEEE Wirel. Commun..

[18]  Jacob Wolfowitz,et al.  Multiple Access Channels , 1978 .

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

[20]  A. D. Sarma,et al.  Modelling path loss in the near field region for cm and mm wave mobile communication , 1999, Proceedings of the International Conference on Electromagnetic Interference and Compatibility.

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

[22]  Toby Berger,et al.  The CEO problem [multiterminal source coding] , 1996, IEEE Trans. Inf. Theory.

[23]  Murali S. Kodialam,et al.  Characterizing the capacity region in multi-radio multi-channel wireless mesh networks , 2005, MobiCom '05.

[24]  Stephen Rayment Emerging Technologies in Wireless LANs: Capacity of Wireless Mesh Networks , 2007 .

[25]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .