{"id":"https://openalex.org/W2919797992","doi":"https://doi.org/10.1109/glocomw.2018.8644479","title":"Joint Backhaul-Access Optimization in Full-Duplex Heterogeneous Networks","display_name":"Joint Backhaul-Access Optimization in Full-Duplex Heterogeneous Networks","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2919797992","doi":"https://doi.org/10.1109/glocomw.2018.8644479","mag":"2919797992"},"language":"en","primary_location":{"id":"doi:10.1109/glocomw.2018.8644479","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocomw.2018.8644479","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Globecom Workshops (GC Wkshps)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102005895","display_name":"Xiangyue Meng","orcid":"https://orcid.org/0000-0001-5943-6210"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xiangyue Meng","raw_affiliation_strings":["Department of Electrical and Electronic Engineering, The University of Melbourne, Melbourne, VIC, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, The University of Melbourne, Melbourne, VIC, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064721659","display_name":"Phee Lep Yeoh","orcid":"https://orcid.org/0000-0002-2516-4226"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Phee Lep Yeoh","raw_affiliation_strings":["School of Electrical and Information Engineering, The University of Sydney, Sydney, NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Information Engineering, The University of Sydney, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031277560","display_name":"Brian Krongold","orcid":"https://orcid.org/0000-0003-1619-3516"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Brian Krongold","raw_affiliation_strings":["Department of Electrical and Electronic Engineering, The University of Melbourne, Melbourne, VIC, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, The University of Melbourne, Melbourne, VIC, Australia","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12791","display_name":"Full-Duplex Wireless Communications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12791","display_name":"Full-Duplex Wireless Communications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/backhaul","display_name":"Backhaul (telecommunications)","score":0.8524907827377319},{"id":"https://openalex.org/keywords/telecommunications-link","display_name":"Telecommunications link","score":0.7498764991760254},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7280349135398865},{"id":"https://openalex.org/keywords/base-station","display_name":"Base station","score":0.7184975743293762},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5294546484947205},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4667395055294037},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44538748264312744},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.43581828474998474},{"id":"https://openalex.org/keywords/geometric-programming","display_name":"Geometric programming","score":0.43452972173690796},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4320053458213806},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2539565861225128},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.18297776579856873},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17202401161193848}],"concepts":[{"id":"https://openalex.org/C103760667","wikidata":"https://www.wikidata.org/wiki/Q798444","display_name":"Backhaul (telecommunications)","level":3,"score":0.8524907827377319},{"id":"https://openalex.org/C138660444","wikidata":"https://www.wikidata.org/wiki/Q5607897","display_name":"Telecommunications link","level":2,"score":0.7498764991760254},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7280349135398865},{"id":"https://openalex.org/C68649174","wikidata":"https://www.wikidata.org/wiki/Q1379116","display_name":"Base station","level":2,"score":0.7184975743293762},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5294546484947205},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4667395055294037},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44538748264312744},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.43581828474998474},{"id":"https://openalex.org/C20729856","wikidata":"https://www.wikidata.org/wiki/Q2078279","display_name":"Geometric programming","level":2,"score":0.43452972173690796},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4320053458213806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2539565861225128},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.18297776579856873},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17202401161193848},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocomw.2018.8644479","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocomw.2018.8644479","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Globecom Workshops (GC Wkshps)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1994534328","https://openalex.org/W2015454796","https://openalex.org/W2054692642","https://openalex.org/W2096920594","https://openalex.org/W2112820013","https://openalex.org/W2134053781","https://openalex.org/W2169432814","https://openalex.org/W2336500101","https://openalex.org/W2339094490","https://openalex.org/W2616886781","https://openalex.org/W2786102688","https://openalex.org/W4250589301","https://openalex.org/W6748055140"],"related_works":["https://openalex.org/W4297310313","https://openalex.org/W2963149344","https://openalex.org/W4365807906","https://openalex.org/W2157864637","https://openalex.org/W4200445394","https://openalex.org/W2012551222","https://openalex.org/W4223416141","https://openalex.org/W2097644939","https://openalex.org/W4303414366","https://openalex.org/W2041847789"],"abstract_inverted_index":{"In":[0,72,113],"this":[1,37],"paper,":[2],"a":[3,15,20,27,39,117,156],"joint":[4],"downlink":[5,101],"backhaul-access":[6,169],"power":[7,102,139],"and":[8,32,65,99,138,163],"subchannel":[9,137],"allocation":[10,140],"problem":[11],"is":[12,48,103,120],"studied":[13],"for":[14],"two-tier":[16],"heterogeneous":[17],"network":[18],"with":[19,110,159],"full-duplex":[21],"(FD)":[22],"small-cell":[23],"base":[24,29],"station":[25,30],"(SBS),":[26],"macro-cell":[28],"(MBS),":[31],"multiple":[33],"SBS":[34,69,84,98,124],"users.":[35],"To":[36],"end,":[38],"low-complexity":[40],"two-stage":[41],"optimization":[42],"algorithm":[43,77,153],"using":[44,106],"matching":[45,79,133],"theory":[46,80],"framework":[47],"proposed,":[49],"which":[50],"maximizes":[51,142],"the":[52,57,63,68,73,76,83,88,97,114,123,136,143],"minimum":[53,144],"user":[54,145],"rate":[55],"in":[56],"presence":[58],"of":[59,91,131],"inter-tier":[60],"interference":[61],"from":[62],"MBS":[64,100],"self-interference":[66],"at":[67,122],"FD":[70],"transceiver.":[71],"first":[74],"stage,":[75,116],"adopts":[78],"to":[81,87,125,134,155],"allocate":[82],"subchannels":[85],"according":[86],"users'":[89],"preferences":[90],"maximizing":[92],"their":[93],"individual":[94],"rates.":[95],"Then,":[96],"solved":[104],"by":[105],"successive":[107],"convex":[108],"approximation":[109],"geometric":[111],"programming.":[112],"second":[115],"swap-matching":[118],"approach":[119],"employed":[121],"search":[126],"through":[127],"all":[128],"pairwise":[129],"swaps":[130],"user-subchannel":[132],"find":[135],"that":[141,150],"rate.":[146],"Numerical":[147],"simulations":[148],"show":[149],"our":[151],"proposed":[152],"converges":[154],"near-optimal":[157],"solution":[158],"low":[160],"computational":[161],"complexity":[162],"significantly":[164],"outperforms":[165],"conventional":[166],"half-duplex":[167],"(HD)":[168],"schemes.":[170]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}