{"id":"https://openalex.org/W2117065758","doi":"https://doi.org/10.1145/1064212.1064228","title":"Algorithmic aspects of capacity in wireless networks","display_name":"Algorithmic aspects of capacity in wireless networks","publication_year":2005,"publication_date":"2005-06-06","ids":{"openalex":"https://openalex.org/W2117065758","doi":"https://doi.org/10.1145/1064212.1064228","mag":"2117065758"},"language":"en","primary_location":{"id":"doi:10.1145/1064212.1064228","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1064212.1064228","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems","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/A5109218533","display_name":"V. S. Anil Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"V. S. Anil Kumar","raw_affiliation_strings":["Los Alamos National Laboratory, Los Alamos, NM"],"affiliations":[{"raw_affiliation_string":"Los Alamos National Laboratory, Los Alamos, NM","institution_ids":["https://openalex.org/I1343871089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020293284","display_name":"Madhav Marathe","orcid":"https://orcid.org/0000-0003-1653-0658"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Madhav V. Marathe","raw_affiliation_strings":["Virginia Tech, Blacksburg, VA","Virginia Tech , Blacksburg, VA"],"affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, VA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"Virginia Tech , Blacksburg, VA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100755351","display_name":"Srinivasan Parthasarathy","orcid":"https://orcid.org/0000-0002-6062-6449"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Srinivasan Parthasarathy","raw_affiliation_strings":["University of Maryland, College Park, MD"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["University of Maryland, College Park, MD"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5109218533"],"corresponding_institution_ids":["https://openalex.org/I1343871089"],"apc_list":null,"apc_paid":null,"fwci":17.6492,"has_fulltext":false,"cited_by_count":198,"citation_normalized_percentile":{"value":0.99281559,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":1.0,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":1.0,"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/T11158","display_name":"Wireless Networks and Protocols","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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994000196456909,"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.8261533975601196},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6277702450752258},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.5972544550895691},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.576560378074646},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.5586881637573242},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.5380204916000366},{"id":"https://openalex.org/keywords/ad-hoc-on-demand-distance-vector-routing","display_name":"Ad hoc On-Demand Distance Vector Routing","score":0.5213250517845154},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.502732515335083},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4900039732456207},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.48803940415382385},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.45215392112731934},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4312134087085724},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.34127628803253174},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.33869481086730957},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17911621928215027},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1587962806224823},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.10219880938529968},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.09544357657432556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0936063826084137},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.09262979030609131}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8261533975601196},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6277702450752258},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.5972544550895691},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.576560378074646},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.5586881637573242},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.5380204916000366},{"id":"https://openalex.org/C104503742","wikidata":"https://www.wikidata.org/wiki/Q345335","display_name":"Ad hoc On-Demand Distance Vector Routing","level":5,"score":0.5213250517845154},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.502732515335083},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4900039732456207},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.48803940415382385},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.45215392112731934},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4312134087085724},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.34127628803253174},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.33869481086730957},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17911621928215027},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1587962806224823},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.10219880938529968},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.09544357657432556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0936063826084137},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.09262979030609131},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1064212.1064228","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1064212.1064228","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.115.6824","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.6824","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.wisc.edu/~suman/courses/838/papers/kumar05sigmetrics.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.152.3271","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.3271","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~srin/PDF/2005/capacity-conf.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.7699999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W142438517","https://openalex.org/W1971916396","https://openalex.org/W1977545325","https://openalex.org/W2036717389","https://openalex.org/W2041248965","https://openalex.org/W2042796613","https://openalex.org/W2059493311","https://openalex.org/W2061990624","https://openalex.org/W2101771805","https://openalex.org/W2113134966","https://openalex.org/W2113966777","https://openalex.org/W2122205547","https://openalex.org/W2123665351","https://openalex.org/W2125478497","https://openalex.org/W2126866049","https://openalex.org/W2131992719","https://openalex.org/W2137775453","https://openalex.org/W2141109021","https://openalex.org/W2144509357","https://openalex.org/W2145519285","https://openalex.org/W2149959815","https://openalex.org/W2153086189","https://openalex.org/W2154502311","https://openalex.org/W2155685934","https://openalex.org/W2158322819","https://openalex.org/W2163565176","https://openalex.org/W2164391385","https://openalex.org/W2165956524","https://openalex.org/W2166640289","https://openalex.org/W2435603672","https://openalex.org/W4205241946","https://openalex.org/W4230665353","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W2534426475","https://openalex.org/W2498610847","https://openalex.org/W2995307897","https://openalex.org/W4381803840","https://openalex.org/W2110623369","https://openalex.org/W3135686529","https://openalex.org/W2153465785","https://openalex.org/W2617010542","https://openalex.org/W2348856842","https://openalex.org/W2060613440"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"two":[3],"inter-related":[4],"questions:":[5,107],"(i)":[6],"Given":[7],"a":[8,13,142],"wireless":[9,96,158],"ad-hoc":[10],"network":[11,49,148,174],"and":[12,58,78,82,125,130,136,140],"collection":[14],"of":[15,25,70,104,184],"source-destination":[16],"pairs":[17],"{(si,ti)},":[18],"what":[19],"is":[20,110],"the":[21,26,29,35,45,56,65,71,86,101,105,108,147,173,206],"maximum":[22,66,87,152],"throughput":[23,67,88,153,227],"capacity":[24],"network,":[27],"i.e.":[28],"rate":[30],"at":[31,61],"which":[32,132,171,189],"data":[33],"from":[34],"sources":[36],"to":[37,64,111,150],"their":[38],"corresponding":[39],"destinations":[40],"can":[41,190],"be":[42,51,191],"transferred":[43],"in":[44,91,161],"network?":[46],"(ii)":[47],"Can":[48],"protocols":[50,159,198],"designed":[52],"that":[53,215],"jointly":[54],"route":[55],"packets":[57],"schedule":[59],"transmissions":[60],"rates":[62],"close":[63,149],"capacity?":[68],"Much":[69],"earlier":[72],"work":[73],"focused":[74],"on":[75,85],"random":[76],"instances":[77],"proved":[79],"analytical":[80,121],"lower":[81],"upper":[83],"bounds":[84],"capacity.":[89],"Here,":[90],"contrast,":[92],"we":[93,99,163],"consider":[94],"arbitrary":[95,117],"networks.":[97],"Further,":[98],"study":[100],"algorithmic":[102],"aspects":[103],"above":[106],"goal":[109],"design":[112],"provably":[113],"good":[114],"algorithms":[115,127],"for":[116,128,145],"instances.":[118],"We":[119,204],"develop":[120],"performance":[122],"evaluation":[123],"models":[124],"distributed":[126],"routing":[129,197],"scheduling":[131],"incorporate":[133],"fairness,":[134],"energy":[135],"dilation":[137],"(path-length)":[138],"requirements":[139],"provide":[141],"unified":[143],"framework":[144],"utilizing":[146],"its":[151],"capacity.Motivated":[154],"by":[155],"certain":[156],"popular":[157],"used":[160],"practice,":[162],"also":[164],"explore":[165],"\"shortest-path":[166],"like\"":[167],"path":[168,232],"selection":[169],"strategies":[170],"maximize":[172],"throughput.":[175],"The":[176,212],"theoretical":[177,207],"results":[178,213],"naturally":[179],"suggest":[180],"an":[181],"interesting":[182],"class":[183],"congestion":[185,220],"aware":[186,221],"link":[187,222],"metrics":[188,223],"directly":[192],"plugged":[193],"into":[194],"several":[195],"existing":[196],"such":[199],"as":[200],"AODV,":[201],"DSR,":[202],"etc.":[203],"complement":[205],"analysis":[208],"with":[209],"extensive":[210],"simulations.":[211],"indicate":[214],"routes":[216],"obtained":[217],"using":[218],"our":[219],"consistently":[224],"yield":[225],"higher":[226],"than":[228],"hop-count":[229],"based":[230],"shortest":[231],"metrics.":[233]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":12}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}