Normal view MARC view ISBD view

Submodular Rate Region Models for Multicast Communication in Wireless Networks [electronic resource] /

By: Riemensberger, Maximilian [author.].
Contributor(s): SpringerLink (Online service).
Series: Foundations in Signal Processing, Communications and Networking: 14Publisher: Cham : Springer International Publishing : Imprint: Springer, 2018Edition: 1st ed. 2018.Description: XXIII, 281 p. 52 illus. | Binding - Card Paper |.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319652320.Subject(s): EXTC Engineering | Communications Engineering, Networks | Graph Theory | Information Systems Applications (incl. Internet) | Functional AnalysisDDC classification: 621.382 Online resources: Click here to access eBook in Springer Nature platform. (Within Campus only.) In: Springer Nature eBookSummary: This 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.
List(s) this item appears in: Springer Nature eBooks
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

This 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.

There are no comments for this item.

Log in to your account to post a comment.
Unique Visitors hit counter Total Page Views free counter
Implemented and Maintained by AIKTC-KRRC (Central Library).
For any Suggestions/Query Contact to library or Email: librarian@aiktc.ac.in | Ph:+91 22 27481247
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha