Filters








333 Hits in 9.2 sec

Simple schedules for half-duplex networks

Siddhartha Brahma, Ayfer Ozgur, Christina Fragouli
2012 2012 IEEE International Symposium on Information Theory Proceedings  
The results are extended to the case of 3 relays for the special class of antisymmetric networks. We also study the structure of (approximately) optimal relaying strategies for such networks.  ...  We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays.  ...  An Approximation to the Capacity For half-duplex relay networks, the capacity depends not only on the strength of the channel coefficients, but crucially also on the L-T scheduling.  ... 
doi:10.1109/isit.2012.6283025 dblp:conf/isit/BrahmaOF12 fatcat:ldzt4isqjjec3mgztefyitih5a

The approximate optimality of simple schedules for half-duplex multi-relay networks

Martina Cardone, Daniela Tuninetti, Raymond Knopp
2015 2015 IEEE Information Theory Workshop (ITW)  
In particular, for any memoryless half-duplex N-relay network with independent noises and for which independent inputs are approximately optimal in the cut-set upper bound, an optimal schedule exists with  ...  In ITW'13 we conjectured that simple relay policies are optimal for any half-duplex Gaussian multi-relay network, that is, simple schedules are not a consequence of the diamond network's sparse topology  ...  in Half-Duplex (HD).  ... 
doi:10.1109/itw.2015.7133090 dblp:conf/itw/CardoneTK15 fatcat:oz5xo6gl3ngk5ekxzlv7qdb4du

Best Relay Selection in Gaussian Half-Duplex Diamond Networks [article]

Sarthak Jain, Soheil Mohajer, Martina Cardone
2020 arXiv   pre-print
This paper considers Gaussian half-duplex diamond n-relay networks, where a source communicates with a destination by hopping information through one layer of n non-communicating relays that operate in  ...  It is also shown that the aforementioned ratio guarantee is tight, i.e., there exist Gaussian half-duplex diamond n-relay networks, where the highest-performing relay has an approximate capacity equal  ...  Properties on the Approximate Capacity Here, we derive some properties on the approximate capacity of a Gaussian half-duplex diamond n-relay network that we will leverage to prove the fractional guarantee  ... 
arXiv:2001.02851v1 fatcat:jjzbjakesfb45akpbuxmjg5asa

Cooperative Relaying at Finite SNR—Role of Quantize-Map-and-Forward

Ayan Sengupta, I-Hsiang Wang, Christina Fragouli
2014 IEEE Transactions on Wireless Communications  
Focusing on vector Gaussian quantizers, we optimize the outage probability for the full-duplex and half-duplex single relay by finding the best quantization level and relay schedule according to the available  ...  Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing trade-off (DMT) for arbitrary slow fading full-duplex networks as well as for the single-relay half-duplex  ...  At finite SNR however, one can sharpen the upper bound on the outage probability by optimizing the quantization distortion level (and the schedule f , for half-duplex networks) at the relay depending on  ... 
doi:10.1109/twc.2014.2339314 fatcat:axlppoyzzffknmkdrcwu27ksbe

Energy Efficiency Performance Evaluation of Back-Pressure Driven Cooperative Relay Selection for WiMAX Systems

Mahmoud Hadef, Apostolos Apostolaras, Alain Mourad, Jim Oreilly, Iordanis Koutsopoulos, Thanasis Korakis, Leandros Tassiulas
2013 Proceedings of the Sixth International Conference on Simulation Tools and Techniques  
Two derivatives of the proposed mechanism for half duplex and full duplex systems are proposed and evaluated.  ...  node on the network to the total supply power of the node equipment is implemented.  ...  For relay assisted transmission, we consider two transmission protocols, the half duplex and full duplex scheduling.  ... 
doi:10.4108/icst.simutools.2013.251720 dblp:conf/simutools/HadefAMOKKT13 fatcat:gfpdjcivj5h6dc6ucla7nrfvo4

Network Simplification in Half-Duplex: Building on Submodularity [article]

Martina Cardone, Yahya H. Ezzeldin, Christina Fragouli, Daniela Tuninetti
2017 arXiv   pre-print
This paper explores the network simplification problem in the context of Gaussian Half-Duplex (HD) diamond networks.  ...  the subnetwork of the remaining k=N-1 relays has an approximate capacity equal to half of the approximate capacity of the full network.  ...  full network, there is no need to compute the optimal schedule for each of the N subnetworks.  ... 
arXiv:1607.01441v3 fatcat:7gyepjg27nbo5bco25hyqdzwgi

On Min-Cut Algorithms for Half-Duplex Relay Networks [article]

Raúl Etkin, Farzad Parvaresh, Ilan Shomorony, A. Salman Avestimehr
2013 arXiv   pre-print
Computing the cut-set bound in half-duplex relay networks is a challenging optimization problem, since it requires finding the cut-set optimal half-duplex schedule.  ...  We present a general technique that takes advantage of specific structures in the topology of a given network and allows us to reduce the complexity of computing the half-duplex schedule that maximizes  ...  optimal half-duplex schedule.  ... 
arXiv:1305.2548v1 fatcat:ow7urqb7nffqdeg4oq3lv3ook4

Gaussian half-duplex relay networks: Improved gap and a connection with the assignment problem

Martina Cardone, Daniela Tuninetti, Raymond Knopp, Umer Salim
2013 2013 IEEE Information Theory Workshop (ITW)  
Known upper (cut-set) and lower (noisy network coding) bounds on the capacity of a memoryless full-duplex relay network are specialized to the half-duplex case and shown to be to within a constant gap  ...  For fairly broad range of relay network sizes, the derived gap is smaller than what is known in the literature, and it can be further reduced for more structured networks such as diamond networks.  ...  For K −2 = 2 relays we can show: Theorem 5 For a general HD relay network with 2 relays, there exists an optimal schedule, i.e., an optimal value of the 2 2 possible listen-receive configurations/states  ... 
doi:10.1109/itw.2013.6691349 dblp:conf/itw/CardoneTKS13 fatcat:qq2mm7np4nhd3gc6tu7ecnrp5a

Energy aware buffer aided cooperative relay selection

Mahmoud Hadef, Apostolos Apostolaras, Jim O'Reillys, Alain Mourad, Belkacem Mouhouche, Iordanis Koutsopoulos, Thanasis Korakis, Leandros Tassiulas
2014 2014 IEEE Wireless Communications and Networking Conference (WCNC)  
Two derivatives of the proposed mechanism, half-duplex and fullduplex are proposed and evaluated.  ...  The model maps the RF output power radiated at the antenna elements of each node including relays on the network to the total supply power of the node equipment.  ...  A two hop diamond network topology is considered for evaluation purposes, where multiple relays act as intermediary nodes for forwarding the traffic for a particular sourcedestination pair, and a half-duplex  ... 
doi:10.1109/wcnc.2014.6952866 dblp:conf/wcnc/HadefAOMMKKT14 fatcat:37o64lyebfekrpy3ulq7dmyqv4

On the Optimality of Simple Schedules for Networks With Multiple Half-Duplex Relays

Martina Cardone, Daniela Tuninetti, Raymond Knopp
2016 IEEE Transactions on Information Theory  
In ITW'13 we conjectured that simple approximately optimal relay scheduling policies exist for any Gaussian half-duplex multi-relay network irrespectively of the topology.  ...  In particular, for any memoryless half-duplex N-relay network with independent noises and for which independent inputs are approximately optimal in the cut-set upper bound, an approximately optimal simple  ...  CONCLUSIONS In this work we studied networks with N half-duplex relays. For such networks, the capacity must be optimized over the 2 N possible listen-transmit relay configurations.  ... 
doi:10.1109/tit.2016.2568918 fatcat:tsrlon3udzgj5mwqf3j5uotany

Gaussian Half-Duplex Relay Networks: Improved Constant Gap and Connections With the Assignment Problem

Martina Cardone, Daniela Tuninetti, Raymond Knopp, Umer Salim
2014 IEEE Transactions on Information Theory  
The optimal schedule, that is, the optimal value of the 2^N possible transmit-receive configurations/states for the relays, is investigated and known results for diamond networks are extended to general  ...  Further improved gap results are presented for more structured networks like diamond networks.  ...  For the example in Fig. 4 the optimal schedule has λ 00 = λ 11 = 0 without loss of optimality, from Theorem 4.  ... 
doi:10.1109/tit.2014.2314636 fatcat:zmcwykefmjfsle4nonb5m5ufka

Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications

Yahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Giuseppe Caire
2018 2018 IEEE International Symposium on Information Theory (ISIT)  
The main result in this paper is that the 1-2-1 network capacity can be approximated by routing information along at most 2N+2 paths, where N is the number of relays connecting a source and a destination  ...  of beamforming gain the signal is received well below the thermal noise floor.  ...  We consider two modes of operation at the relays, namely Full-Duplex (FD) and Half-Duplex (HD).  ... 
doi:10.1109/isit.2018.8437568 dblp:conf/isit/EzzeldinCFC18 fatcat:c4pbu5emyne3pmt545qskjzto4

On the capacity of the half-duplex diamond channel

Hossein Bagheri, Abolfazl S. Motahari, Amir K. Khandani
2010 2010 IEEE International Symposium on Information Theory  
In this paper, a dual-hop communication system composed of a source S and a destination D connected through two non-interfering half-duplex relays, R1 and R2, is considered.  ...  In the literature of Information Theory, this configuration is known as the diamond channel.  ...  We take one further step by providing an achievable scheme that ensures a small gap from the upper bounds for the half-duplex diamond channel.  ... 
doi:10.1109/isit.2010.5513566 dblp:conf/isit/BagheriMK10a fatcat:kbi5x3wfyjbhtbmbiwhkpl354q

Achieving predictable performance through better memory controller placement in many-core CMPs

Dennis Abts, Natalie D. Enright Jerger, John Kim, Dan Gibson, Mikko H. Lipasti
2009 Proceedings of the 36th annual international symposium on Computer architecture - ISCA '09  
performance of memory-intensive applications regardless of the processing core on which a thread is scheduled.  ...  In this paper, we show how the location of the memory controllers can reduce contention (hot spots) in the on-chip fabric, as well as lower the variance in reference latency which provides for predictable  ...  This work on fair memory controllers compliments our work on optimizing the on-chip network for memory traffic.  ... 
doi:10.1145/1555754.1555810 dblp:conf/isca/AbtsJKGL09 fatcat:5mpmstkpkjcd3pyqupobqcnx3a

Achieving predictable performance through better memory controller placement in many-core CMPs

Dennis Abts, Natalie D. Enright Jerger, John Kim, Dan Gibson, Mikko H. Lipasti
2009 SIGARCH Computer Architecture News  
performance of memory-intensive applications regardless of the processing core on which a thread is scheduled.  ...  In this paper, we show how the location of the memory controllers can reduce contention (hot spots) in the on-chip fabric, as well as lower the variance in reference latency which provides for predictable  ...  This work on fair memory controllers compliments our work on optimizing the on-chip network for memory traffic.  ... 
doi:10.1145/1555815.1555810 fatcat:zwagwcxsdnhd3mnks6f7vibaqe
« Previous Showing results 1 — 15 out of 333 results