{"id":"https://openalex.org/W2438378132","doi":"https://doi.org/10.1109/wiopt.2016.7492896","title":"A fast and scalable algorithm for calculating the achievable capacity of a wireless mesh network","display_name":"A fast and scalable algorithm for calculating the achievable capacity of a wireless mesh network","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2438378132","doi":"https://doi.org/10.1109/wiopt.2016.7492896","mag":"2438378132"},"language":"en","primary_location":{"id":"doi:10.1109/wiopt.2016.7492896","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wiopt.2016.7492896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 14th 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/A5059240370","display_name":"Greg Kuperman","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Greg Kuperman","raw_affiliation_strings":["MIT Lincoln Laboratory, Lexington, MA, USA"],"affiliations":[{"raw_affiliation_string":"MIT Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071826937","display_name":"Nathaniel M. Jones","orcid":"https://orcid.org/0000-0001-5855-3378"},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathaniel M. Jones","raw_affiliation_strings":["MIT Lincoln Laboratory, Lexington, MA, USA"],"affiliations":[{"raw_affiliation_string":"MIT Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086072476","display_name":"Jun Sun","orcid":"https://orcid.org/0000-0003-0642-7446"},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jun Sun","raw_affiliation_strings":["MIT Lincoln Laboratory, Lexington, MA, USA"],"affiliations":[{"raw_affiliation_string":"MIT Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066084521","display_name":"Aradhana Narula\u2010Tam","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aradhana Narula-Tam","raw_affiliation_strings":["MIT Lincoln Laboratory, Lexington, MA, USA"],"affiliations":[{"raw_affiliation_string":"MIT Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5059240370"],"corresponding_institution_ids":["https://openalex.org/I4210122954"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.05279135,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":"14","issue":null,"first_page":"1","last_page":"7"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9988999962806702,"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.9952999949455261,"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.7492183446884155},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6748917698860168},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6571255326271057},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.6531953811645508},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.5867261290550232},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5672838091850281},{"id":"https://openalex.org/keywords/wireless-mesh-network","display_name":"Wireless mesh network","score":0.559289813041687},{"id":"https://openalex.org/keywords/unicast","display_name":"Unicast","score":0.5168979167938232},{"id":"https://openalex.org/keywords/interference","display_name":"Interference (communication)","score":0.5029718279838562},{"id":"https://openalex.org/keywords/mesh-networking","display_name":"Mesh networking","score":0.48616835474967957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4828248918056488},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.47967100143432617},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4748387932777405},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43957841396331787},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.344829261302948},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.21343547105789185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1556980311870575},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.11593735218048096}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7492183446884155},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6748917698860168},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6571255326271057},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.6531953811645508},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.5867261290550232},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5672838091850281},{"id":"https://openalex.org/C31548570","wikidata":"https://www.wikidata.org/wiki/Q6453712","display_name":"Wireless mesh network","level":4,"score":0.559289813041687},{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.5168979167938232},{"id":"https://openalex.org/C32022120","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference (communication)","level":3,"score":0.5029718279838562},{"id":"https://openalex.org/C123691950","wikidata":"https://www.wikidata.org/wiki/Q25552104","display_name":"Mesh networking","level":3,"score":0.48616835474967957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4828248918056488},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.47967100143432617},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4748387932777405},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43957841396331787},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.344829261302948},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.21343547105789185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1556980311870575},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.11593735218048096},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wiopt.2016.7492896","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wiopt.2016.7492896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 14th 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":[{"display_name":"Industry, innovation and infrastructure","score":0.5099999904632568,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1968959064","https://openalex.org/W1972250166","https://openalex.org/W1973473949","https://openalex.org/W2004430879","https://openalex.org/W2012329067","https://openalex.org/W2035652501","https://openalex.org/W2054754870","https://openalex.org/W2059739072","https://openalex.org/W2076680677","https://openalex.org/W2092511902","https://openalex.org/W2096469168","https://openalex.org/W2098969228","https://openalex.org/W2099953891","https://openalex.org/W2102200576","https://openalex.org/W2103884175","https://openalex.org/W2106242763","https://openalex.org/W2108301529","https://openalex.org/W2117346650","https://openalex.org/W2122205547","https://openalex.org/W2125372369","https://openalex.org/W2126186592","https://openalex.org/W2130061115","https://openalex.org/W2137775453","https://openalex.org/W2143567297","https://openalex.org/W2144509357","https://openalex.org/W2144916624","https://openalex.org/W2145328406","https://openalex.org/W2149737141","https://openalex.org/W2149959815","https://openalex.org/W2150148016","https://openalex.org/W2150480157","https://openalex.org/W2157473028","https://openalex.org/W2164391385","https://openalex.org/W2166640289","https://openalex.org/W2168199950","https://openalex.org/W2170178059","https://openalex.org/W2203785100","https://openalex.org/W2435603672","https://openalex.org/W4253935083","https://openalex.org/W6675374969","https://openalex.org/W6678672141"],"related_works":["https://openalex.org/W1966768284","https://openalex.org/W2141226803","https://openalex.org/W1972955796","https://openalex.org/W2978800595","https://openalex.org/W2219910205","https://openalex.org/W1541857863","https://openalex.org/W207048982","https://openalex.org/W2026651734","https://openalex.org/W2385427787","https://openalex.org/W2028287290"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,8,27,89,133,140],"problem":[4],"of":[5,12,97,132,143],"rapidly":[6,87],"determining":[7,47],"maximum":[9,28,90,134,141],"achievable":[10],"capacity":[11,49],"a":[13,32,83,110],"multi-hop":[14],"wireless":[15,33],"mesh":[16],"network":[17,34,40,48],"subject":[18,102],"to":[19,24,71,86,103,115,150],"interference":[20,73,106,151],"constraints.":[21],"Being":[22],"able":[23],"quickly":[25],"determine":[26,88],"supported":[29],"flow":[30,92],"in":[31],"has":[35],"numerous":[36],"practical":[37],"applications":[38],"for":[39,46,75,93],"planners":[41],"and":[42,62,99,108,113],"researchers.":[43],"Current":[44],"approaches":[45],"either":[50],"provide":[51,109],"asymptotic":[52],"results":[53],"that":[54,145],"are":[55,59,68],"not":[56,69],"necessarily":[57],"achievable,":[58],"computationally":[60],"intractable":[61],"cannot":[63,146],"be":[64,147],"computed":[65],"quickly,":[66],"or":[67],"generalizable":[70],"different":[72],"constraints":[74],"emerging":[76],"technologies.":[77],"In":[78],"this":[79],"paper,":[80],"we":[81],"present":[82],"new":[84],"algorithm":[85,124],"concurrent":[91],"an":[94],"arbitrary":[95,104],"number":[96,142],"unicast":[98],"multicast":[100],"connections":[101],"binary":[105],"constraints,":[107],"feasible":[111],"route":[112],"schedule":[114],"support":[116],"those":[117],"flows.":[118],"The":[119],"solution":[120],"provided":[121],"by":[122],"our":[123],"is":[125,139],"within":[126],"O(\u03b4":[127],"<sup":[128],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[129],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-1</sup>":[130],")":[131],"possible":[135],"flow,":[136],"where":[137],"\u03b4":[138],"links":[144],"activated":[148],"due":[149],"from":[152],"some":[153],"particular":[154],"transmission.":[155]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}