LEADER 03842nam 22006255 450 001 9910299902603321 005 20220413181511.0 010 $a3-319-60469-4 024 7 $a10.1007/978-3-319-60469-5 035 $a(CKB)4340000000062763 035 $a(DE-He213)978-3-319-60469-5 035 $a(MiAaPQ)EBC4924462 035 $z(PPN)258862211 035 $a(PPN)203669983 035 $a(EXLCZ)994340000000062763 100 $a20170724d2018 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aHypergraph theory in wireless communication networks /$fby Hongliang Zhang, Lingyang Song, Zhu Han, Yingjun Zhang 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (IX, 62 p. 26 illus., 14 illus. in color.) 225 1 $aSpringerBriefs in Electrical and Computer Engineering,$x2191-8112 311 $a3-319-60467-8 320 $aIncludes bibliographical references at the end of each chapters. 327 $aBasics in Hypergraph Theory -- Key Algorithms -- Applications of Hypergraph Theory -- Conclusions and Future Works. 330 $aThis 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. 410 0$aSpringerBriefs in Electrical and Computer Engineering,$x2191-8112 606 $aElectrical engineering 606 $aComputer communication systems 606 $aGraph theory 606 $aCommunications Engineering, Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/T24035 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aGraph Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M29020 615 0$aElectrical engineering. 615 0$aComputer communication systems. 615 0$aGraph theory. 615 14$aCommunications Engineering, Networks. 615 24$aComputer Communication Networks. 615 24$aGraph Theory. 676 $a511.5 700 $aZhang$b Hongliang$4aut$4http://id.loc.gov/vocabulary/relators/aut$0846440 702 $aSong$b Lingyang$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aHan$b Zhu$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aZhang$b Yingjun$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910299902603321 996 $aHypergraph Theory in Wireless Communication Networks$92501313 997 $aUNINA