Wireless Network Simplification: the Gaussian N-Relay Diamond Network

Date

2011-08-05

Author

Nazaroglu, Caner
Oezguer, Ayfer
Fragouli, Christina

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

8
views

0
downloads

We consider the Gaussian N-relay diamond network, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only k out of the N available relays? We show that in every Gaussian N-relay diamond network, there exists a subset of k relays which alone provide approximately k/k+1 of the total capacity. The result holds independent of the number of available relay nodes N, the channel configurations and the operating SNR. The result is tight in the sense that there exists channel configurations for N-relay diamond networks, where every subset of k relays can provide at most k/k+1 of the total capacity. The approximation is within 3 log N + 3k bits/s/Hz to the capacity.

Subject Keywords

Capacity theorems

URI

https://hdl.handle.net/11511/66270

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Relay Selection for Efficient HARQ-IR Protocols in Relay-Assisted Multisource Multicast Networks Quoc-Tuan Vien, Quoc-Tuan Vien; Nguyen, Huan X.; Shah, Purav; Ever, Enver; Duc To, Duc To (2014-05-21) This paper investigates relay selection for reliable data transmission in relay-assisted multisource multicast networks (RMMNs) where multiple source nodes distribute information to a set of destination nodes with the assistance of multiple relay nodes. Hybrid automatic repeat request with incremental redundancy (HARQ-IR) is used and supported by either a physical-layer network coding (PNC) or an analog network coding (ANC) technique employed at the relays. By deriving efficiency metrics of the HARQ-IR prot...
Van Kampen theorem for persistent fundamental group Batan, Mehmet Ali; Pamuk, Mehmetcik; Department of Mathematics (2019) Persistent homotopy is one of the newest algebraic topology methods in order to understand and capture topological features of discrete objects or point data clouds (the set of points with metric defined on it). On the other hand, in algebraic topology, the Van Kampen Theorem is a great tool to determine fundamental group of complicated spaces in terms of simpler subspaces whose fundamental groups are already known. In this thesis, we show that Van Kampen Theorem is still valid for the persistent fundamenta...
WAKE-UP RECEIVERS FOR WIRELESS SENSOR NETWORKS: BENEFITS AND CHALLENGES Demirkol, Ilker; Ersoy, Cem; Onur, Ertan (Institute of Electrical and Electronics Engineers (IEEE), 2009-08-01) For successful data delivery, the destination nodes should be listening to the medium to receive data when the sender node starts data communication. To achieve this synchronization, there are different rendezvous schemes, among which the most energy-efficient is utilizing wake-up receivers. Current hardware technologies of wake-up receivers enable us to evaluate them as a promising solution for wireless sensor networks. In this article the benefits achieved with wake-up receivers are investigated along wit...
Cooperative Multiple-Access in Fading Relay Channels Yılmaz, Ayşen (2006-06-15) Virtual antenna arrays can be constructed via relaying even in the case that there is insufficient physical space or other resources for multiple antennae on wireless nodes. When there is a multiple access scenario, relaying offers a variety of ways to establish communication between source and destination nodes. We will compare a scheme based on space division multiple access to previously studied time division based ones. We observe that space division improves especially the ergodic capacity.
Broadband Multilevel Fast Multipole Algorithm Based on an Approximate Diagonalization of the Green's Function Ergül, Özgür Salih (2015-07-01) We present a broadband multilevel fast multipole algorithm (MLFMA) for fast and efficient solutions of three-dimensional multiscale problems involving large objects with dense discretizations. The proposed solver is based on the approximate diagonalization of the Green's function using scaled spherical and plane waves, leading to stable interaction computations for arbitrarily short distances in terms of wavelength. Despite contradictory requirements on the scaling factor that limit the accuracy of the diag...

Citation Formats

C. Nazaroglu, A. Oezguer, and C. Fragouli, “Wireless Network Simplification: the Gaussian N-Relay Diamond Network,” 2011, p. 0, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66270.