{"id":"https://openalex.org/W2144069301","doi":"https://doi.org/10.1109/icnp.2009.5339668","title":"A Unified theory of scheduling, routing, and flow control in wireless networks","display_name":"A Unified theory of scheduling, routing, and flow control in wireless networks","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2144069301","doi":"https://doi.org/10.1109/icnp.2009.5339668","mag":"2144069301"},"language":"en","primary_location":{"id":"doi:10.1109/icnp.2009.5339668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnp.2009.5339668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 17th IEEE International Conference on Network Protocols","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/A5008850154","display_name":"Naghmeh Sadat Moayedian","orcid":"https://orcid.org/0000-0002-2358-039X"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Naghm Moayedian","raw_affiliation_strings":["Electrical and Computer Engineering Department, Isfahan University of Technology, Isfahan, Iran","Electrical and Computer Eng. Dept Isfahan University of Technology, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]},{"raw_affiliation_string":"Electrical and Computer Eng. Dept Isfahan University of Technology, Iran","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004045939","display_name":"S. Jamaloddin Golestani","orcid":"https://orcid.org/0000-0001-9797-0748"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"S. Jamaloddin Golestani","raw_affiliation_strings":["Electrical and Computer Engineering Department, Isfahan University of Technology, Isfahan, Iran","Electrical and Computer Eng. Dept Isfahan University of Technology, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]},{"raw_affiliation_string":"Electrical and Computer Eng. Dept Isfahan University of Technology, Iran","institution_ids":["https://openalex.org/I170013655"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1597646,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"344","last_page":"353"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":1.0,"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.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8198515176773071},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5956205129623413},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5673762559890747},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.539045512676239},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5277343988418579},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5254834294319153},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5026726722717285},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4735102951526642},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4206709563732147},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29879963397979736},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.29829949140548706},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.24755996465682983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09826108813285828}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8198515176773071},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5956205129623413},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5673762559890747},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.539045512676239},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5277343988418579},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5254834294319153},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5026726722717285},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4735102951526642},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4206709563732147},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29879963397979736},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.29829949140548706},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.24755996465682983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09826108813285828}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnp.2009.5339668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnp.2009.5339668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 17th IEEE International Conference on Network Protocols","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":25,"referenced_works":["https://openalex.org/W1562554988","https://openalex.org/W1997996213","https://openalex.org/W2000167291","https://openalex.org/W2018994370","https://openalex.org/W2025782359","https://openalex.org/W2037710455","https://openalex.org/W2070317877","https://openalex.org/W2086783464","https://openalex.org/W2092511902","https://openalex.org/W2101641515","https://openalex.org/W2105177639","https://openalex.org/W2108572311","https://openalex.org/W2125859743","https://openalex.org/W2144916624","https://openalex.org/W2152964475","https://openalex.org/W2169156893","https://openalex.org/W2170178059","https://openalex.org/W2171824654","https://openalex.org/W2266946488","https://openalex.org/W2613173048","https://openalex.org/W4253990512","https://openalex.org/W4291236916","https://openalex.org/W6650828556","https://openalex.org/W6673643931","https://openalex.org/W6679186306"],"related_works":["https://openalex.org/W1997091564","https://openalex.org/W3035942111","https://openalex.org/W2138640781","https://openalex.org/W2555559350","https://openalex.org/W2105937634","https://openalex.org/W2102655743","https://openalex.org/W2740434786","https://openalex.org/W2081964190","https://openalex.org/W2607223747","https://openalex.org/W2361465121"],"abstract_inverted_index":{"A":[0],"new":[1],"approach":[2,24],"to":[3,89],"joint":[4],"scheduling,":[5],"flow":[6,34],"control":[7,35],"and":[8,33,65,69,95,119,135],"routing":[9,97,118],"in":[10,27,45,80],"wireless":[11],"networks,":[12],"based":[13,98],"on":[14,99],"formulation":[15],"as":[16],"a":[17,37,56,109],"convex":[18],"optimization":[19],"problem":[20],"is":[21,25],"presented.":[22],"This":[23],"novel":[26],"that":[28,71,92,138],"it":[29,131],"integrates":[30],"optimal":[31],"scheduling":[32,94],"with":[36,55,82],"modified":[38],"version":[39],"of":[40,61,113,124],"minimum":[41,125],"delay":[42,126],"routing,":[43],"resulting":[44],"significant":[46],"performance":[47],"advantage":[48],"over":[49],"alternative":[50,90],"approaches.":[51],"We":[52],"come":[53],"up":[54],"distributed":[57],"algorithm":[58,73,107],"for":[59,116],"implementation":[60],"the":[62,72,121,129,145],"proposed":[63],"scheme":[64],"show,":[66],"by":[67],"analysis":[68],"simulation,":[70],"achieves":[74,132],"fairness":[75],"and/or":[76],"priorities":[77],"among":[78],"users":[79],"accordance":[81],"pre-assigned":[83],"user":[84],"parameters.":[85],"In":[86],"sharp":[87],"contrast":[88],"algorithms":[91],"perform":[93],"packet":[96,117],"per-session":[100],"queue":[101,133],"differential":[102],"between":[103],"adjacent":[104],"nodes,":[105],"our":[106],"uses":[108],"complete":[110],"multi-hop":[111],"view":[112],"network":[114],"conditions":[115],"retains":[120],"desirable":[122],"properties":[123],"routing.":[127],"As":[128],"result,":[130],"sizes":[134],"end-to-end":[136],"delays":[137],"are":[139],"several":[140],"times":[141],"smaller,":[142],"without":[143],"compromising":[144],"throughput.":[146]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}