{"id":"https://openalex.org/W7084887253","doi":"https://doi.org/10.1109/lcomm.2025.3618882","title":"Geometric Weighted Sum Power Minimization for Energy-Efficient D2D Underlay Networks","display_name":"Geometric Weighted Sum Power Minimization for Energy-Efficient D2D Underlay Networks","publication_year":2025,"publication_date":"2025-10-07","ids":{"openalex":"https://openalex.org/W7084887253","doi":"https://doi.org/10.1109/lcomm.2025.3618882"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2025.3618882","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2025.3618882","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-article"},"type":"article","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":null,"display_name":"Yang Yu","orcid":"https://orcid.org/0009-0009-3845-2401"},"institutions":[{"id":"https://openalex.org/I161350542","display_name":"China Three Gorges University","ror":"https://ror.org/0419nfc77","country_code":"CN","type":"education","lineage":["https://openalex.org/I161350542"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yang Yu","raw_affiliation_strings":["Electronic Information School, Hubei Three Gorges Polytechnic, Yichang, China"],"raw_orcid":"https://orcid.org/0009-0009-3845-2401","affiliations":[{"raw_affiliation_string":"Electronic Information School, Hubei Three Gorges Polytechnic, Yichang, China","institution_ids":["https://openalex.org/I161350542"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Xiaoqing Tang","orcid":"https://orcid.org/0000-0001-9704-3282"},"institutions":[{"id":"https://openalex.org/I75900474","display_name":"Hubei University","ror":"https://ror.org/03a60m280","country_code":"CN","type":"education","lineage":["https://openalex.org/I75900474"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoqing Tang","raw_affiliation_strings":["School of Artificial Intelligence, Hubei University, Wuhan, China"],"raw_orcid":"https://orcid.org/0000-0001-9704-3282","affiliations":[{"raw_affiliation_string":"School of Artificial Intelligence, Hubei University, Wuhan, China","institution_ids":["https://openalex.org/I75900474"]}]},{"author_position":"last","author":{"id":null,"display_name":"Guihui Xie","orcid":"https://orcid.org/0000-0002-7288-7080"},"institutions":[{"id":"https://openalex.org/I3124059619","display_name":"China University of Geosciences","ror":"https://ror.org/04gcegc37","country_code":"CN","type":"education","lineage":["https://openalex.org/I3124059619"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guihui Xie","raw_affiliation_strings":["School of Automation, China University of Geosciences (Wuhan), Wuhan, China"],"raw_orcid":"https://orcid.org/0000-0002-7288-7080","affiliations":[{"raw_affiliation_string":"School of Automation, China University of Geosciences (Wuhan), Wuhan, China","institution_ids":["https://openalex.org/I3124059619"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I161350542"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.66736956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"12","first_page":"2909","last_page":"2913"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11578","display_name":"Plant Pathogenic Bacteria Studies","score":0.7477999925613403,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T11578","display_name":"Plant Pathogenic Bacteria Studies","score":0.7477999925613403,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.03359999880194664,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12824","display_name":"Infections and bacterial resistance","score":0.021299999207258224,"subfield":{"id":"https://openalex.org/subfields/1310","display_name":"Endocrinology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.7026000022888184},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6559000015258789},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5152999758720398},{"id":"https://openalex.org/keywords/decoupling","display_name":"Decoupling (probability)","score":0.4821999967098236},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4814999997615814},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.41119998693466187},{"id":"https://openalex.org/keywords/geometric-programming","display_name":"Geometric programming","score":0.40070000290870667},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3772999942302704},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.37619999051094055},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.3747999966144562}],"concepts":[{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.7026000022888184},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6559000015258789},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6367999911308289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5730000138282776},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5152999758720398},{"id":"https://openalex.org/C205606062","wikidata":"https://www.wikidata.org/wiki/Q5249645","display_name":"Decoupling (probability)","level":2,"score":0.4821999967098236},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4814999997615814},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.41119998693466187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4043000042438507},{"id":"https://openalex.org/C20729856","wikidata":"https://www.wikidata.org/wiki/Q2078279","display_name":"Geometric programming","level":2,"score":0.40070000290870667},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3772999942302704},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.37619999051094055},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.3747999966144562},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36059999465942383},{"id":"https://openalex.org/C2777679929","wikidata":"https://www.wikidata.org/wiki/Q7883709","display_name":"Underlay","level":3,"score":0.3549000024795532},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3375000059604645},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.3276999890804291},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.32199999690055847},{"id":"https://openalex.org/C169069869","wikidata":"https://www.wikidata.org/wiki/Q5477546","display_name":"Fractional programming","level":4,"score":0.3208000063896179},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.3019999861717224},{"id":"https://openalex.org/C49777392","wikidata":"https://www.wikidata.org/wiki/Q5535495","display_name":"Geometric networks","level":3,"score":0.28769999742507935},{"id":"https://openalex.org/C14961307","wikidata":"https://www.wikidata.org/wiki/Q5377176","display_name":"Energy minimization","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.2745000123977661},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.27300000190734863},{"id":"https://openalex.org/C168292644","wikidata":"https://www.wikidata.org/wiki/Q10860336","display_name":"Power optimization","level":4,"score":0.2694000005722046},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C114237682","wikidata":"https://www.wikidata.org/wiki/Q5072483","display_name":"Channel allocation schemes","level":3,"score":0.2612999975681305},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.259799987077713},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.2563000023365021},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25360000133514404},{"id":"https://openalex.org/C108755667","wikidata":"https://www.wikidata.org/wiki/Q1930258","display_name":"AC power","level":3,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2025.3618882","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2025.3618882","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.875439465045929}],"awards":[{"id":"https://openalex.org/G6125975441","display_name":null,"funder_award_id":"A25-3-013","funder_id":"https://openalex.org/F4320336623","funder_display_name":"Sichuan Education and Scientific Research Grant Project"},{"id":"https://openalex.org/G6817585368","display_name":null,"funder_award_id":"B2023548","funder_id":"https://openalex.org/F4320335467","funder_display_name":"Natural Science Foundation of Shaanxi Provincial Department of Education"},{"id":"https://openalex.org/G7034712592","display_name":null,"funder_award_id":"2025AFC093","funder_id":"https://openalex.org/F4320322186","funder_display_name":"Natural Science Foundation of Hubei Province"}],"funders":[{"id":"https://openalex.org/F4320322186","display_name":"Natural Science Foundation of Hubei Province","ror":null},{"id":"https://openalex.org/F4320335467","display_name":"Natural Science Foundation of Shaanxi Provincial Department of Education","ror":null},{"id":"https://openalex.org/F4320336623","display_name":"Sichuan Education and Scientific Research Grant Project","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2141461755","https://openalex.org/W2498120850","https://openalex.org/W2788428941","https://openalex.org/W2926851177","https://openalex.org/W3096435781","https://openalex.org/W3108183788","https://openalex.org/W4386533718","https://openalex.org/W4398226105"],"related_works":[],"abstract_inverted_index":{"This":[0],"letter":[1],"presents":[2],"a":[3],"computationally":[4],"efficient":[5],"weighted":[6,33],"sum":[7,34],"power":[8,54],"(WSP)":[9],"minimization":[10],"framework":[11],"for":[12,79],"underlaid":[13],"device-to-device":[14],"(D2D)":[15],"networks.":[16],"Our":[17],"approach":[18],"circumvents":[19],"the":[20,44,70,83],"high":[21],"complexity":[22],"of":[23],"fractional":[24],"programming":[25],"(FP)":[26],"inherent":[27],"in":[28,42],"energy":[29],"efficiency":[30],"(EE)":[31],"and":[32],"EE":[35,95],"(WSEE)":[36],"maximization.":[37],"The":[38],"core":[39],"innovation":[40],"lies":[41],"decoupling":[43],"problem":[45],"into":[46],"two":[47],"tractable":[48],"components:":[49],"(i)":[50],"closed-form":[51],"geometric":[52],"optimal":[53,66],"allocation":[55],"with":[56,75],"<italic":[57],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[58],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O</i>(1)":[59],"time":[60],"complexity,":[61],"eliminating":[62],"iterative":[63],"computations;":[64],"(ii)":[65],"link":[67],"matching":[68],"via":[69],"Kuhn-Munkres":[71],"(KM)":[72],"algorithm.":[73],"Integrated":[74],"an":[76],"energy-aware":[77],"heuristic":[78],"dynamic":[80],"weight":[81],"adaptation,":[82],"proposed":[84],"scheme":[85],"achieves":[86],"\u223c50%":[87],"average":[88],"network":[89],"lifetime":[90],"extension":[91],"compared":[92],"to":[93],"FP-based":[94],"maximization":[96],"while":[97],"maintaining":[98],"real-time":[99],"feasibility.":[100]},"counts_by_year":[],"updated_date":"2025-12-12T23:16:27.785689","created_date":"2025-10-10T00:00:00"}