Throughput, Delay, and Complexity Tradeoffs in Interference Channels

We investigate the duality of the stable throughput and the capacity regions in the context of networks with distributed transmitters. In particular, we focus on a network with two transmitter-receiver pairs, intermittent connectivity, and delayed feedback. For this problem, we show the equivalence of stable throughput and capacity regions by devising a queue-based dynamic communication protocol that achieves the information-theoretic outer-bounds. This new strategy includes several new ingredients and coding strategies compared to prior results. We assume packets arrive through stochastic processes and explain how our procedure determines packet movement rules between queues in different cases. We also investigate the average lifetime packets spend in the queues under this capacity achieving protocol and observe that the lifetime scales the square root function of the communication window.

[1]  Hao Pan,et al.  On Stability Region of Two-User Interference Network With Permission to Utilize Past Receptions , 2017, IEEE Access.

[2]  Lang Tong,et al.  Stability and capacity of regular wireless networks , 2005, IEEE Transactions on Information Theory.

[3]  Daniela Tuninetti,et al.  On The Stability Region of the Layered Packet Erasure Broadcast Channel with Output Feedback , 2019, 2019 IEEE Information Theory Workshop (ITW).

[4]  Amir Salman Avestimehr,et al.  Capacity Results for Binary Fading Interference Channels With Delayed CSIT , 2013, IEEE Transactions on Information Theory.

[5]  Mohammad Ali Maddah-Ali,et al.  Communication through collisions: Opportunistic utilization of past receptions , 2013, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[6]  Chih-Chun Wang.  On the Capacity of 1-to-K Broadcast Packet Erasure Channels With Channel Output Feedback , 2012, IEEE Trans. Inf. Theory.

[7]  Syed Ali Jafar,et al.  Duality and stability regions of multi-rate broadcast and multiple access networks , 2008, 2008 IEEE International Symposium on Information Theory.

[8]  Leandros Tassiulas,et al.  Minimal Evacuation Times and Stability , 2015, IEEE/ACM Transactions on Networking.

[9]  Anthony Ephremides,et al.  On Broadcast Stability of Queue-Based Dynamic Network Coding Over Erasure Channels , 2009, IEEE Transactions on Information Theory.

[10]  Anthony Ephremides,et al.  On the throughput, capacity, and stability regions of random multiple access , 2005, IEEE Transactions on Information Theory.

[11]  Mohammad Ali Maddah-Ali,et al.  Approximate Capacity Region of the MISO Broadcast Channels With Delayed CSIT , 2016, IEEE Transactions on Communications.

[12]  Anthony Ephremides,et al.  Stable Throughput Region of the Two-User Broadcast Channel , 2016, IEEE Transactions on Communications.

[13]  Leandros Tassiulas,et al.  Scheduling with pairwise XORing of packets under statistical overhearing information and feedback , 2012, Queueing Syst. Theory Appl..

[14]  Mohammad Ali Maddah-Ali,et al.  Interference channel with binary fading: Effect of delayed network state information , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[15]  Leandros Tassiulas,et al.  Stable XOR-Based Policies for the Broadcast Erasure Channel With Feedback , 2012, IEEE/ACM Transactions on Networking.

[16]  Chih-Chun Wang,et al.  On the Capacity of 1-to- $K$ Broadcast Packet Erasure Channels With Channel Output Feedback , 2010, IEEE Transactions on Information Theory.

[17]  Sophia Athanasiadou,et al.  Low overhead XOR algorithms for the Broadcast Erasure Channel with Feedback , 2019, IEEE EUROCON 2019 -18th International Conference on Smart Technologies.

[18]  Leandros Tassiulas,et al.  Capacity and Stable Throughput Regions for the Broadcast Erasure Channel With Feedback: An Unusual Union , 2013, IEEE Transactions on Information Theory.