Hypergraph theory in wireless communication networks
- 作者： Zhang, Hongliang, author.
- 其他作者：
- 其他題名：
- SpringerBriefs in electrical and computer engineering.
- 出版： Cham : Springer International Publishing :Imprint: Springer
- 叢書名： SpringerBriefs in electrical and computer engineering,
- 主題： Hypergraphs. , Wireless communication systems--Mathematics. , Engineering. , Communications Engineering, Networks. , Computer Communication Networks. , Graph Theory.
- ISBN： 9783319604695 (electronic bk.) 、 9783319604671 (paper)
-
FIND@SFXID:
CGU
- 資料類型: 電子書
- 內容註: 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.
-
讀者標籤：
- 系統號： 005419143 | 機讀編目格式
館藏資訊
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.