{"id":"https://openalex.org/W2466819299","doi":"https://doi.org/10.1145/2942358.2942388","title":"Throughput characterization of node-based scheduling in multihop wireless networks","display_name":"Throughput characterization of node-based scheduling in multihop wireless networks","publication_year":2016,"publication_date":"2016-07-05","ids":{"openalex":"https://openalex.org/W2466819299","doi":"https://doi.org/10.1145/2942358.2942388","mag":"2466819299"},"language":"en","primary_location":{"id":"doi:10.1145/2942358.2942388","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2942358.2942388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","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/A5040279482","display_name":"Bo Ji","orcid":"https://orcid.org/0000-0003-0149-7509"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bo Ji","raw_affiliation_strings":["Temple University, Philadelphia, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Temple University, Philadelphia, PA","institution_ids":["https://openalex.org/I84392919"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102885818","display_name":"Yu Sang","orcid":"https://orcid.org/0000-0001-9201-6082"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yu Sang","raw_affiliation_strings":["Temple University, Philadelphia, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Temple University, Philadelphia, PA","institution_ids":["https://openalex.org/I84392919"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I84392919"],"apc_list":null,"apc_paid":null,"fwci":1.2625,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77081954,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"41","last_page":"50"},"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.9998999834060669,"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.9998999834060669,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998999834060669,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"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/bipartite-graph","display_name":"Bipartite graph","score":0.6874380111694336},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.6612314581871033},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6368269920349121},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6320421695709229},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6087932586669922},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5648112297058105},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4434603750705719},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.4325689375400543},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3902854323387146},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3759642243385315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3374834656715393},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3327941298484802},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30949532985687256},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28910958766937256},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.286583811044693},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27500593662261963},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22911164164543152},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.18671581149101257},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.11020493507385254}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6874380111694336},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.6612314581871033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6368269920349121},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6320421695709229},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6087932586669922},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5648112297058105},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4434603750705719},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.4325689375400543},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3902854323387146},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3759642243385315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3374834656715393},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3327941298484802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30949532985687256},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28910958766937256},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.286583811044693},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27500593662261963},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22911164164543152},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.18671581149101257},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.11020493507385254},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2942358.2942388","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2942358.2942388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","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":33,"referenced_works":["https://openalex.org/W171369850","https://openalex.org/W369866893","https://openalex.org/W1523988562","https://openalex.org/W1588435862","https://openalex.org/W1973403707","https://openalex.org/W1984382275","https://openalex.org/W2036800848","https://openalex.org/W2059608229","https://openalex.org/W2059739072","https://openalex.org/W2076915000","https://openalex.org/W2077533970","https://openalex.org/W2088693732","https://openalex.org/W2097058227","https://openalex.org/W2105177639","https://openalex.org/W2106717724","https://openalex.org/W2108327442","https://openalex.org/W2119523111","https://openalex.org/W2123893388","https://openalex.org/W2125141803","https://openalex.org/W2133499361","https://openalex.org/W2138993731","https://openalex.org/W2152859483","https://openalex.org/W2153086189","https://openalex.org/W2156214642","https://openalex.org/W2171625164","https://openalex.org/W2189952672","https://openalex.org/W2226362667","https://openalex.org/W2477320853","https://openalex.org/W2747397037","https://openalex.org/W4297972233","https://openalex.org/W4301809784","https://openalex.org/W6612673049","https://openalex.org/W6665293600"],"related_works":["https://openalex.org/W2091476158","https://openalex.org/W3195229121","https://openalex.org/W4309118773","https://openalex.org/W1572212932","https://openalex.org/W2121723384","https://openalex.org/W4210909622","https://openalex.org/W2063980628","https://openalex.org/W4317418931","https://openalex.org/W2955440244","https://openalex.org/W2012293136"],"abstract_inverted_index":{"Maximum":[0],"Vertex-weighted":[1],"Matching":[2],"(MVM)":[3],"is":[4,27,67,168,195,209,222,231],"an":[5,99,189,227],"important":[6],"link":[7,83],"scheduling":[8,84],"algorithm":[9],"for":[10,76,199,226,235],"multihop":[11],"wireless":[12],"networks.":[13],"Under":[14],"certain":[15],"assumptions,":[16],"it":[17,87],"has":[18,108],"been":[19,110],"shown":[20],"that":[21,114,162,183,217],"if":[22,63,184],"the":[23,33,44,52,64,71,77,103,128,137,143,155,163,172,177,185,205,218,241],"underlying":[24],"network":[25,65,101,178],"graph":[26,66,102,194,229],"bipartite,":[28],"MVM":[29,69,107,167,245],"not":[30,109],"only":[31],"maximizes":[32],"throughput":[34,91,104,129,242],"in":[35,55,98,116,192],"settings":[36,56],"with":[37],"continuous":[38],"packet":[39,59],"arrivals,":[40],"but":[41],"also":[42],"minimizes":[43],"evacuation":[45,78],"time":[46,48,79],"(i.e.,":[47],"to":[49,121,211,233],"drain":[50],"all":[51],"initial":[53],"packets)":[54],"without":[57],"future":[58],"arrivals.":[60],"Further,":[61,180],"even":[62],"arbitrary,":[68],"achieves":[70],"best":[72],"known":[73],"performance":[74,92,105,130,243],"guarantee":[75],"among":[80],"existing":[81],"online":[82],"algorithms.":[85],"Also,":[86],"empirically":[88],"exhibits":[89],"close-to-optimal":[90],"and":[93,136,159,230],"good":[94],"delay":[95],"performance.":[96],"However,":[97],"arbitrary":[100,228],"of":[106,127,131,166,176,188,244],"well":[111,248],"understood.":[112],"To":[113],"end,":[115],"this":[117],"paper":[118],"we":[119,148,181],"aim":[120],"carry":[122],"out":[123],"a":[124,150,193,200],"systematic":[125],"study":[126],"MVM,":[132],"assuming":[133],"single-hop":[134],"flows":[135],"node-exclusive":[138],"interference":[139],"model.":[140],"Inspired":[141],"by":[142],"celebrated":[144],"Gallai-Edmonds":[145,156,173,206,219],"structure":[146],"theorem,":[147],"introduce":[149],"novel":[151],"topological":[152],"notion,":[153],"called":[154],"decomposition":[157,174,207,220],"factor,":[158],"rigorously":[160],"prove":[161],"efficiency":[164],"ratio":[165],"no":[169],"smaller":[170],"than":[171],"factor":[175,208,221],"graph.":[179],"show":[182],"smallest":[186],"size":[187],"odd":[190],"cycle":[191],"2m":[196],"+":[197,213],"1":[198,234],"positive":[201],"integer":[202],"m,":[203],"then":[204],"equal":[210,232],"2m/(2m":[212],"1).":[214],"This":[215],"implies":[216],"at":[223],"least":[224],"2/3":[225],"bipartite":[236],"graphs.":[237],"Having":[238],"these":[239],"results,":[240],"can":[246],"be":[247],"characterized.":[249]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}