Abstract
This chapter presents some numerical results for Gaussian networks. The goal is to provide some numerical evidence on the essential role played by submodularity for efficient computation of bounds and approximations on the multicast capacity region.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The latter bound holds only if both source-terminal nodes are assigned sufficient rate by the loosened outer bound, see Sect. 7.1.5, which holds except for some unusual special cases.
- 2.
The gap for bidirectional communication in single-antenna Gaussian networks with regular channel matrices can be derived from the results in [3] as \(\log _2e+2\log _2(1+|N|)\) by choosing the quantization noise variance parameter \(Q=|N|\), which corresponds to our parameter \(\rho =(1+Q)^{-1}=(1+|N|^{-1})\).
References
Lim S, Kim YH, El Gamal A, Chung SY (2011) Noisy network coding. IEEE Trans Inf Theory 57(5):3132–3152
El Gamal A, Kim YH (2011) Network information theory. Cambridge University Press, Cambridge
Kolte R, Özgür A, El Gamal A (2014) Optimized noisy network coding for Gaussian relay networks. In: International Zurich seminar on communications (IZS), pp 1–4
Riemensberger M, Gerdes L, Utschick W (2014) Submodular structure and optimal quantization in Gaussian multiple access relay networks. In: IEEE workshop on signal processing advances in wireless communications (SPAWC), pp 319–323
Goldsmith A (2005) Wireless communications. Cambridge University Press, Cambridge
Kelley JE Jr (1960) The cutting-plane method for solving convex programs. J Soc Ind Appl Math 8(4):703–712
Hiriart-Urruty JB, Lemaréchal C (1993) Convex analysis and minimization algorithms II: advanced theory and bundle methods. In: Grundlehren der mathematischen Wissenschaften, vol 306. Springer, Berlin
Bazaraa M, Sherali H, Shetty C (2006) Nonlinear programming: theory and algorithms, 3rd edn. Wiley, New York
Avestimehr A, Diggavi S, Tse D (2011) Wireless network information flow: a deterministic approach. IEEE Trans Inf Theory 57(4):1872–1905
Bertsekas DP (1982) Projected newton methods for optimization problems with simple constraints. SIAM J Control Optim 20(2):221–246
Shannon C (1961) Two-way communication channels. In: Proceedings of the fourth Berkeley symposium on mathematical statistics and probability. Contributions to the Theory of Statistics, vol 1. University of California Press, pp 611–644
Wyner A (1974) Recent results in the Shannon theory. IEEE Trans Inf Theory 20(1):2–10
Cover TM, Thomas JA (2006) Elements of information theory, 2nd edn. Wiley, New York
Parvaresh F, Etkin R (2014) Efficient capacity computation and power optimization for relay networks. IEEE Trans Inf Theory 60(3):1782–1792
Nemhauser G, Wolsey L, Fisher M (1978) An analysis of approximations for maximizing submodular set functions–I. Math Program 14(1):265–294
Grötschel M, Lovász L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2):169–197
Grötschel M, Lovász L, Schrijver A (1984) Corrigendum to our paper “The ellipsoid method and its consequences in combinatorial optimization”. Combinatorica 4(4):291–295
Goemans M, Ramakrishnan V (1995) Minimizing submodular functions over families of sets. Combinatorica 15:499–513
McCormick ST (2006) Submodular Function Minimization. In: Handbook on discrete optimization. Elsevier, pp 321–391
Iwata S (2008) Submodular function minimization. Math Program 112:45–64
Bertsimas D, Orlin J (1994) A technique for speeding up the solution of the lagrangean dual. Math Program 63:23–45
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Riemensberger, M. (2018). Numerical Results for Gaussian Networks. In: Submodular Rate Region Models for Multicast Communication in Wireless Networks. Foundations in Signal Processing, Communications and Networking, vol 14. Springer, Cham. https://doi.org/10.1007/978-3-319-65232-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-65232-0_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-65231-3
Online ISBN: 978-3-319-65232-0
eBook Packages: EngineeringEngineering (R0)