Lower bounding models for wireless networks

Motivated by the framework of network equivalence theory [1], [2], we present capacity lower bounding models for wireless networks by construction of noiseless networks which can be used to calculate an inner bound for the corresponding wireless network. We first extend the “one-shot” lower bounding model [6] to many-user scenarios, and then propose a two-step update of the one-shot models to incorporate the broadcast nature of wireless transmission. The main advantage of the proposed lower bounding method is its simplicity and the fact that it can be easily extended to larger networks. We demonstrate by examples that the resulting lower bounds can even approach the capacity in some setups.

[1]  Muriel Médard,et al.  On a theory of network equivalence , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

[2]  April Rasala Lehman,et al.  Complexity classification of network information flow problems , 2004, SODA '04.

[3]  Ming Xiao,et al.  Short-message noisy network coding with partial source cooperation , 2012, 2012 IEEE Information Theory Workshop.

[4]  Muriel Médard,et al.  A converse for the wideband relay channel with physically degraded broadcast , 2011, 2011 IEEE Information Theory Workshop.

[5]  Michelle Effros.  On capacity outer bounds for a simple family of wireless networks , 2010, 2010 Information Theory and Applications Workshop (ITA).

[6]  Michelle Effros.  Capacity bounds for networks of broadcast channels , 2010, 2010 IEEE International Symposium on Information Theory.

[7]  Muriel Médard,et al.  Scheduling for Network-Coded Multicast , 2012, IEEE/ACM Transactions on Networking.

[8]  Sreeram Kannan,et al.  Local phy + global flow: A layering principle for wireless networks , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[9]  Ming Xiao,et al.  Wireless Multicast Relay Networks with Limited-Rate Source-Conferencing , 2013, IEEE Journal on Selected Areas in Communications.

[10]  Muriel Médard,et al.  A Theory of Network Equivalence— Part I: Point-to-Point Channels , 2011, IEEE Transactions on Information Theory.

[11]  Alex J. Grant,et al.  Dualities Between Entropy Functions and Network Codes , 2008, IEEE Transactions on Information Theory.

[12]  KoetterR.,et al.  A Theory of Network Equivalence— Part I , 2011 .