000823512 000__ 05552cam\a2200541Ia\4500
000823512 001__ 823512
000823512 005__ 20230306143930.0
000823512 006__ m\\\\\o\\d\\\\\\\\
000823512 007__ cr\un\nnnunnun
000823512 008__ 170905s2018\\\\sz\\\\\\ob\\\\000\0\eng\d
000823512 019__ $$a1002418578$$a1003117386$$a1005135801$$a1011905590
000823512 020__ $$a9783319652320$$q(electronic book)
000823512 020__ $$a331965232X$$q(electronic book)
000823512 020__ $$z9783319652313
000823512 020__ $$z3319652311
000823512 0247_ $$a10.1007/978-3-319-65232-0$$2doi
000823512 035__ $$aSP(OCoLC)on1002911740
000823512 035__ $$aSP(OCoLC)1002911740$$z(OCoLC)1002418578$$z(OCoLC)1003117386$$z(OCoLC)1005135801$$z(OCoLC)1011905590
000823512 040__ $$aYDX$$beng$$cYDX$$dN$T$$dEBLCP$$dGW5XE$$dN$T$$dNJR$$dAZU$$dOCLCF$$dCOO$$dUAB$$dU3W$$dCAUOI
000823512 049__ $$aISEA
000823512 050_4 $$aTK5103.2
000823512 08204 $$a621.382$$223
000823512 1001_ $$aRiemensberger, Maximilian,$$eauthor.
000823512 24510 $$aSubmodular rate region models for multicast communication in wireless networks /$$cMaximilian Riemensberger.
000823512 260__ $$aCham :$$bSpringer,$$cc2018.
000823512 300__ $$a1 online resource.
000823512 336__ $$atext$$btxt$$2rdacontent
000823512 337__ $$acomputer$$bc$$2rdamedia
000823512 338__ $$aonline resource$$bcr$$2rdacarrier
000823512 347__ $$atext file$$bPDF$$2rda
000823512 4901_ $$aFoundations in signal processing, communications and networking,$$x1863-8538 ;$$vv. 14
000823512 504__ $$aIncludes bibliographical references.
000823512 5050_ $$aPreface; Contents; List of Figures; List of Tables; 1 Introduction; 1.1 Preliminaries and Notation; 1.2 List of Symbols and Operators; References; 2 Submodular Information Flow Models for Multicast Communication; 2.1 Cut Model; 2.2 Graph Model; 2.3 Hypergraph Model; 2.4 Polymatroid Broadcast Model; 2.5 Transformation of Models; 2.6 Generalized Cut Model; 2.7 Penalized Polymatroid Broadcast Model; 2.8 Rate Region Properties and Equivalence; 2.9 Cut Rate Sandwiched Multicast Source Rate Regions; 2.10 Extension to Per-terminal Cut Models; 2.11 Proofs; 2.11.1 Polymatroid Max-Flow Min-Cut Theorem
000823512 5058_ $$a2.11.2 Transformation of Models2.11.3 Rate Region Properties and Equivalence; 2.11.4 Cut Rate Sandwiched Multicast Source Rate Regions; References; 3 Network Utility Maximization via Submodular Dual Decomposition; 3.1 Concave Network Utility Maximization; 3.2 Dual Decomposition Approach for Min-Cut Rate Regions; 3.3 Dual Decomposition Approach for Max-Flow Regions; 3.4 Connections Between the Dual Decomposition Approaches; 3.5 Dual Decomposition Approach for Hyperarc Rate Regions; 3.6 Convexity and Comprehensiveness; 3.7 Upper Bound for Nonsubmodular Cut Rate Regions
000823512 5058_ $$a3.8 Counting Set Function Evaluations3.9 Discussion and Related Dual Decomposition Methods; 3.10 Extension to Per-terminal Cut Models; 3.11 Proofs and Appendices; 3.11.1 Utility Characterization of the Multicast Rate Region; 3.11.2 Network Utility Maximization Problem; 3.11.3 Dual Decomposition Approaches; 3.11.4 Convexity and Comprehensiveness; References; 4 Network Coding Bounds and Submodularity; 4.1 Discrete Memoryless Multicast Networks; 4.1.1 Cut-Set Outer Bound; 4.1.2 Noisy Network Coding Inner Bound; 4.1.3 Elementary Hypergraph Decomposition Inner Bound
000823512 5058_ $$a4.1.4 Weighted Sum Multicast Rate Maximization4.2 Networks of Independent Broadcast Channels; 4.2.1 Cut-Set Outer Bound; 4.2.2 Noisy Network Coding Inner Bound; 4.2.3 Elementary Broadcast Decomposition Inner Bound; 4.2.4 Elementary Broadcast Decomposition for Less Noisy Channels; 4.2.5 Weighted Sum Multicast Rate Maximization; 4.3 Discrete Memoryless Networks with Known State Sequence; 4.3.1 Cut-Set Outer Bound; 4.3.2 Noisy Network Coding Inner Bound; 4.4 Proofs; 4.4.1 Cut-Set Outer Bound; 4.4.2 Noisy Network Coding Inner Bound; 4.4.3 Networks of Independent Broadcast Channels; References
000823512 5058_ $$a5 Deterministic and Linear Finite Field Networks5.1 Deterministic Networks; 5.1.1 Bounds on the Multicast Capacity Region; 5.1.2 Weighted Sum Source Rate Maximization; 5.2 Networks of Independent Deterministic Broadcast Channels; 5.2.1 Broadcast Representation of the Capacity Region; 5.2.2 Insufficiency of the Hyperarc Model; 5.2.3 Weighted Sum Source Rate Maximization; 5.3 Noisy Linear Finite Field Networks; 5.3.1 Cut-Set Outer Bound; 5.3.2 Noisy Network Coding Inner Bound; 5.3.3 Tightness of Inner and Outer Bounds; 5.3.4 Deterministic Linear Finite Field Networks
000823512 506__ $$aAccess limited to authorized users.
000823512 520__ $$aThis book proposes representations of multicast rate regions in wireless networks based on the mathematical concept of submodular functions, e.g., the submodular cut model and the polymatroid broadcast model. These models subsume and generalize the graph and hypergraph models. The submodular structure facilitates a dual decomposition approach to network utility maximization problems, which exploits the greedy algorithm for linear programming on submodular polyhedra. This approach yields computationally efficient characterizations of inner and outer bounds on the multicast capacity regions for various classes of wireless networks.
000823512 588__ $$aDescription based on print version record.
000823512 650_0 $$aWireless communication systems.
000823512 650_0 $$aMulticasting (Computer networks)
000823512 77608 $$iPrint version: $$z9783319652313$$z3319652311$$w(OCoLC)994639262
000823512 830_0 $$aFoundations in signal processing, communications and networking ;$$vv. 14.
000823512 852__ $$bebk
000823512 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-65232-0$$zOnline Access$$91397441.1
000823512 909CO $$ooai:library.usi.edu:823512$$pGLOBAL_SET
000823512 980__ $$aEBOOK
000823512 980__ $$aBIB
000823512 982__ $$aEbook
000823512 983__ $$aOnline
000823512 994__ $$a92$$bISE