{"id":"https://openalex.org/W3203409823","doi":"https://doi.org/10.23919/wiopt52861.2021.9589952","title":"Average-Case Analysis of Greedy Matching for D2D Resource Sharing","display_name":"Average-Case Analysis of Greedy Matching for D2D Resource Sharing","publication_year":2021,"publication_date":"2021-10-18","ids":{"openalex":"https://openalex.org/W3203409823","doi":"https://doi.org/10.23919/wiopt52861.2021.9589952","mag":"3203409823"},"language":"en","primary_location":{"id":"doi:10.23919/wiopt52861.2021.9589952","is_oa":false,"landing_page_url":"https://doi.org/10.23919/wiopt52861.2021.9589952","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","raw_type":"proceedings-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":"https://openalex.org/A5003167629","display_name":"Gao Shu-qin","orcid":null},"institutions":[{"id":"https://openalex.org/I152815399","display_name":"Singapore University of Technology and Design","ror":"https://ror.org/05j6fvn87","country_code":"SG","type":"education","lineage":["https://openalex.org/I152815399"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Shuqin Gao","raw_affiliation_strings":["Engineering Systems and Design Pillar, Singapore University of Technology and Design","Singapore University of Technology and Design,Engineering Systems and Design Pillar"],"affiliations":[{"raw_affiliation_string":"Engineering Systems and Design Pillar, Singapore University of Technology and Design","institution_ids":["https://openalex.org/I152815399"]},{"raw_affiliation_string":"Singapore University of Technology and Design,Engineering Systems and Design Pillar","institution_ids":["https://openalex.org/I152815399"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005174253","display_name":"Costas Courcoubetis","orcid":"https://orcid.org/0000-0001-9568-0640"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Costas Courcoubetis","raw_affiliation_strings":["School of Data Science, The Chinese University of Hong Kong, Shenzhen","The Chinese University of Hong Kong,School of Data Science,Shenzhen"],"affiliations":[{"raw_affiliation_string":"School of Data Science, The Chinese University of Hong Kong, Shenzhen","institution_ids":["https://openalex.org/I4210116924"]},{"raw_affiliation_string":"The Chinese University of Hong Kong,School of Data Science,Shenzhen","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007119869","display_name":"Lingjie Duan","orcid":"https://orcid.org/0000-0002-0217-6507"},"institutions":[{"id":"https://openalex.org/I152815399","display_name":"Singapore University of Technology and Design","ror":"https://ror.org/05j6fvn87","country_code":"SG","type":"education","lineage":["https://openalex.org/I152815399"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Lingjie Duan","raw_affiliation_strings":["Engineering Systems and Design Pillar, Singapore University of Technology and Design","Singapore University of Technology and Design,Engineering Systems and Design Pillar"],"affiliations":[{"raw_affiliation_string":"Engineering Systems and Design Pillar, Singapore University of Technology and Design","institution_ids":["https://openalex.org/I152815399"]},{"raw_affiliation_string":"Singapore University of Technology and Design,Engineering Systems and Design Pillar","institution_ids":["https://openalex.org/I152815399"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003167629"],"corresponding_institution_ids":["https://openalex.org/I152815399"],"apc_list":null,"apc_paid":null,"fwci":0.3056,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60200706,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9993000030517578,"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/computer-science","display_name":"Computer science","score":0.7259393930435181},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7075254917144775},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6785626411437988},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.528083324432373},{"id":"https://openalex.org/keywords/shared-resource","display_name":"Shared resource","score":0.5089859962463379},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5070102214813232},{"id":"https://openalex.org/keywords/random-access","display_name":"Random access","score":0.5063661336898804},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.42587220668792725},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41837337613105774},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4026591181755066},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3929848074913025},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32023411989212036},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2620615065097809},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19193899631500244},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0972261130809784}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7259393930435181},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7075254917144775},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6785626411437988},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.528083324432373},{"id":"https://openalex.org/C51332947","wikidata":"https://www.wikidata.org/wiki/Q1172305","display_name":"Shared resource","level":2,"score":0.5089859962463379},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5070102214813232},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.5063661336898804},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.42587220668792725},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41837337613105774},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4026591181755066},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3929848074913025},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32023411989212036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2620615065097809},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19193899631500244},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0972261130809784},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/wiopt52861.2021.9589952","is_oa":false,"landing_page_url":"https://doi.org/10.23919/wiopt52861.2021.9589952","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1485041102","https://openalex.org/W1505175849","https://openalex.org/W2022334019","https://openalex.org/W2106387257","https://openalex.org/W2108970223","https://openalex.org/W2122519911","https://openalex.org/W2145417574","https://openalex.org/W2275325805","https://openalex.org/W2411267720","https://openalex.org/W2512166535","https://openalex.org/W2520896966","https://openalex.org/W2604304011","https://openalex.org/W2963273524","https://openalex.org/W2988480584","https://openalex.org/W3142570770","https://openalex.org/W3143219376","https://openalex.org/W3144881883","https://openalex.org/W3185683445","https://openalex.org/W3203409823","https://openalex.org/W6675716505","https://openalex.org/W6678545363"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W3133183159"],"abstract_inverted_index":{"Given":[0],"the":[1,35,79,91,105,118,123,134,149,161,165,204,220],"proximity":[2],"of":[3,102,152,169,173,203,217],"many":[4],"wireless":[5],"users":[6,40],"and":[7,17,45,65],"their":[8],"diversity":[9],"in":[10,98,122,133,155,245],"consuming":[11],"local":[12],"resources":[13],"(e.g.,":[14],"data-plans,":[15],"computation":[16],"even":[18],"energy":[19],"resources),":[20],"device-to-device":[21],"(D2D)":[22],"resource":[23],"sharing":[24,32,242],"is":[25,86,108,128,143,160,222],"a":[26,31,74,99,113,144,180,214],"promising":[27],"approach":[28],"towards":[29,147],"realizing":[30],"economy.":[33],"In":[34],"resulting":[36],"networked":[37],"economy,":[38],"n":[39],"segment":[41],"themselves":[42],"into":[43],"sellers":[44],"buyers":[46],"that":[47,97,195,234],"need":[48],"to":[49,78,90,136,163,232],"be":[50],"efficiently":[51],"matched":[52],"locally.":[53],"This":[54,158],"paper":[55,159],"adopts":[56],"an":[57],"easy-to-implement":[58],"greedy":[59,153,197],"matching":[60,154,190],"algorithm":[61,198],"with":[62,175,188],"distributed":[63],"fashion":[64],"only":[66],"sub-linear":[67],"O(log":[68],"n)":[69],"parallel":[70],"complexity,":[71],"which":[72,142],"offers":[73],"great":[75],"advantage":[76],"compared":[77,89],"optimal":[80,92],"but":[81],"computational-expensive":[82],"centralized":[83],"matching.":[84],"But":[85],"it":[87],"efficient":[88],"matching?":[93],"Extensive":[94],"simulations":[95],"indicate":[96],"large":[100],"number":[101],"practical":[103,150],"cases":[104],"average":[106,167],"loss":[107,120],"no":[109,129],"more":[110],"than":[111,117,201],"10%,":[112],"far":[114],"better":[115,200],"result":[116],"50%":[119],"bound":[121,216],"worst":[124],"case.":[125],"However,":[126],"there":[127],"rigorous":[130,166],"average-case":[131],"analysis":[132,168],"literature":[135],"back":[137],"up":[138],"such":[139],"encouraging":[140],"findings,":[141],"fundamental":[145],"step":[146],"supporting":[148],"use":[151,229],"D2D":[156,241],"sharing.":[157],"first":[162],"present":[164],"certain":[170],"representative":[171],"classes":[172],"graphs":[174,211],"random":[176,189,210,236],"parameters,":[177],"by":[178],"proposing":[179],"new":[181],"asymptotic":[182],"methodology.":[183],"For":[184],"typical":[185,208],"2D":[186],"grids":[187],"weights":[191],"we":[192,212,228],"rigorously":[193],"prove":[194,213],"our":[196,235],"performs":[199],"84.9%":[202],"optimal,":[205],"while":[206],"for":[207],"Erd\u0151s-R\u00e9nyi":[209],"lower":[215],"79%":[218],"when":[219],"graph":[221,237],"neither":[223],"dense":[224],"nor":[225],"sparse.":[226],"Finally,":[227],"realistic":[230],"data":[231],"show":[233],"models":[238],"approximate":[239],"well":[240],"networks":[243],"encountered":[244],"practice.":[246]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}