{"id":"https://openalex.org/W2112414714","doi":"https://doi.org/10.1109/icoin.2011.5723125","title":"A joint congestion control, routing, and scheduling algorithm in multihop wireless networks with heterogeneous flows","display_name":"A joint congestion control, routing, and scheduling algorithm in multihop wireless networks with heterogeneous flows","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2112414714","doi":"https://doi.org/10.1109/icoin.2011.5723125","mag":"2112414714"},"language":"en","primary_location":{"id":"doi:10.1109/icoin.2011.5723125","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icoin.2011.5723125","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Conference on Information Networking 2011 (ICOIN2011)","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/A5008946371","display_name":"Phuong Luu Vo","orcid":"https://orcid.org/0000-0003-3909-4385"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Phuong Luu Vo","raw_affiliation_strings":["Kyung Hee University, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyung Hee University, South Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027558961","display_name":"Nguyen H. Tran","orcid":"https://orcid.org/0000-0001-7323-9213"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Nguyen H. Tran","raw_affiliation_strings":["Kyung Hee University, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyung Hee University, South Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034052371","display_name":"Choong Seon Hong","orcid":"https://orcid.org/0000-0003-3484-7333"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Choong Seon Hong","raw_affiliation_strings":["Kyung Hee University, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyung Hee University, South Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030248227","display_name":"Kijoon Chae","orcid":"https://orcid.org/0000-0002-6045-5192"},"institutions":[{"id":"https://openalex.org/I138925566","display_name":"Ewha Womans University","ror":"https://ror.org/053fp5c05","country_code":"KR","type":"education","lineage":["https://openalex.org/I138925566"]},{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"KiJoon Chae","raw_affiliation_strings":["Ewha Womans University, South Korea","Kyung Hee University, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ewha Womans University, South Korea","institution_ids":["https://openalex.org/I138925566"]},{"raw_affiliation_string":"Kyung Hee University, South Korea","institution_ids":["https://openalex.org/I35928602"]}]}],"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.20527028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"347","last_page":"351"},"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.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.9991000294685364,"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.690148115158081},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.5599619746208191},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5285478830337524},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4696986675262451},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.45115670561790466},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44991421699523926},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.42647671699523926},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.42566049098968506},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.41162052750587463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21016710996627808},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.10172638297080994}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.690148115158081},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.5599619746208191},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5285478830337524},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4696986675262451},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.45115670561790466},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44991421699523926},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.42647671699523926},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.42566049098968506},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.41162052750587463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21016710996627808},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.10172638297080994}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icoin.2011.5723125","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icoin.2011.5723125","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Conference on Information Networking 2011 (ICOIN2011)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1485041102","https://openalex.org/W2028952005","https://openalex.org/W2058677708","https://openalex.org/W2098254860","https://openalex.org/W2111781120","https://openalex.org/W2120344179","https://openalex.org/W2131762580","https://openalex.org/W2154968665","https://openalex.org/W2163622824","https://openalex.org/W2170178059","https://openalex.org/W2296319761","https://openalex.org/W4250589301","https://openalex.org/W6629004930","https://openalex.org/W6683112175","https://openalex.org/W6685013691"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2978148977","https://openalex.org/W3003077338","https://openalex.org/W2225350526","https://openalex.org/W1545991362","https://openalex.org/W2060984508"],"abstract_inverted_index":{"We":[0,71],"consider":[1],"the":[2,22,32,41,45,49,68,73,87,91,107,133],"network":[3,46],"with":[4,81],"two":[5],"kinds":[6],"of":[7,35,52,86],"traffic:":[8],"inelastic":[9,14,36],"and":[10,28,77,96,128,138],"elastic":[11,23,42,53],"traffic.":[12],"The":[13,60,84,101,121,142],"traffic":[15,24,43,54],"requires":[16],"fixed":[17,33],"throughput,":[18],"high":[19],"priority":[20],"while":[21],"has":[25],"controllable":[26],"rate":[27,34,125],"low":[29],"priority.":[30],"Giving":[31],"traffic,":[37],"how":[38],"to":[39,47,66,118,148],"inject":[40],"into":[44,75],"achieve":[48],"maximum":[50],"utility":[51],"is":[55,64,99,130,135,146],"solved":[56],"in":[57,151],"this":[58],"paper.":[59],"Lagrangian":[61,74],"Duality":[62],"method":[63],"applied":[65],"solve":[67],"optimization":[69],"problem.":[70],"decompose":[72],"subproblems,":[76],"each":[78,82],"sub-problem":[79],"associates":[80],"layer.":[83],"convexity":[85],"primal":[88,95],"problem":[89],"guarantees":[90],"duality":[92],"gap":[93],"between":[94],"dual":[97],"solutions":[98],"zero.":[100],"Lagrange":[102],"multipliers,":[103],"which":[104],"are":[105],"indeed":[106],"queue":[108],"length":[109],"on":[110],"nodes":[111],"for":[112,124],"every":[113],"destinations,":[114],"implicitly":[115],"update":[116],"according":[117],"subgradient":[119],"algorithm.":[120],"joint":[122],"algorithm":[123,140],"control,":[126],"routing,":[127],"scheduling":[129,134,137,145,150],"proposed.":[131],"However,":[132],"Max-weight":[136],"centralized":[139],"actually.":[141],"Greedy":[143],"distributed":[144,153],"introduced":[147],"implement":[149],"a":[152],"sense.":[154]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}