Central Library

Normal view MARC view ISBD view

Hypergraph Theory in Wireless Communication Networks [electronic resource] / by Hongliang Zhang, Lingyang Song, Zhu Han, Yingjun Zhang.

By: Zhang, Hongliang [author.].
Contributor(s): Song, Lingyang [author.] | Han, Zhu [author.] | Zhang, Yingjun [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: SpringerBriefs in Electrical and Computer Engineering: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2018Edition: 1st ed. 2018.Description: IX, 62 p. 26 illus., 14 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319604695.Subject(s): Telecommunication | Computer networks  | Graph theory | Communications Engineering, Networks | Computer Communication Networks | Graph TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 621.382 Online resources: Click here to access online
Contents:
Basics in Hypergraph Theory -- Key Algorithms -- Applications of Hypergraph Theory -- Conclusions and Future Works.
In: Springer Nature eBookSummary: This brief focuses on introducing a novel mathematical framework, referred as hypergraph theory, to model and solve the multiple interferer scenarios for future wireless communication networks. First, in Chap. 1, the authors introduce the basic preliminaries of hypergraph theory in general, and develop two hypergraph based polynomial algorithms, i.e., hypergraph coloring and hypergraph clustering. Then, in Chaps. 2 and 3, the authors present two emerging applications of hypergraph coloring and hypergraph clustering in Device-to-Device (D2D) underlay communication networks, respectively, in order to show the advantages of hypergraph theory compared with the traditional graph theory. Finally, in Chap. 4, the authors discuss the limitations of using hypergraph theory in future wireless networks and briefly present some other potential applications. This brief introduces the state-of-the-art research on the hypergraph theory and its applications in wireless communications. An efficient framework is provided for the researchers, professionals and advanced level students who are interested in the radio resource allocation in the heterogeneous networks to solve the resource allocation and interference management problems.
    average rating: 0.0 (0 votes)
No physical items for this record

Basics in Hypergraph Theory -- Key Algorithms -- Applications of Hypergraph Theory -- Conclusions and Future Works.

This brief focuses on introducing a novel mathematical framework, referred as hypergraph theory, to model and solve the multiple interferer scenarios for future wireless communication networks. First, in Chap. 1, the authors introduce the basic preliminaries of hypergraph theory in general, and develop two hypergraph based polynomial algorithms, i.e., hypergraph coloring and hypergraph clustering. Then, in Chaps. 2 and 3, the authors present two emerging applications of hypergraph coloring and hypergraph clustering in Device-to-Device (D2D) underlay communication networks, respectively, in order to show the advantages of hypergraph theory compared with the traditional graph theory. Finally, in Chap. 4, the authors discuss the limitations of using hypergraph theory in future wireless networks and briefly present some other potential applications. This brief introduces the state-of-the-art research on the hypergraph theory and its applications in wireless communications. An efficient framework is provided for the researchers, professionals and advanced level students who are interested in the radio resource allocation in the heterogeneous networks to solve the resource allocation and interference management problems.

There are no comments for this item.

Log in to your account to post a comment.