{"id":"https://openalex.org/W2147395133","doi":"https://doi.org/10.1109/inm.2011.5990517","title":"The node-centric formulation for network utility maximization of multihop wireless networks with elastic and inelastic traffic","display_name":"The node-centric formulation for network utility maximization of multihop wireless networks with elastic and inelastic traffic","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2147395133","doi":"https://doi.org/10.1109/inm.2011.5990517","mag":"2147395133"},"language":"en","primary_location":{"id":"doi:10.1109/inm.2011.5990517","is_oa":false,"landing_page_url":"https://doi.org/10.1109/inm.2011.5990517","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","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/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":["Department of Computer Engineering, Kyung Hee University, South Korea","Department of Computer Engineering Kyung Hee University, Korea#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kyung Hee University, South Korea","institution_ids":["https://openalex.org/I35928602"]},{"raw_affiliation_string":"Department of Computer Engineering Kyung Hee University, Korea#TAB#","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043200528","display_name":"Muhammad Shoaib Siddiqui","orcid":"https://orcid.org/0000-0002-5656-0416"},"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":"Muhammad Shoaib Siddiqui","raw_affiliation_strings":["Department of Computer Engineering, Kyung Hee University, South Korea","Department of Computer Engineering Kyung Hee University, Korea#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kyung Hee University, South Korea","institution_ids":["https://openalex.org/I35928602"]},{"raw_affiliation_string":"Department of Computer Engineering Kyung Hee University, Korea#TAB#","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"last","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":["Department of Computer Engineering, Kyung Hee University, South Korea","Department of Computer Engineering Kyung Hee University, Korea#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kyung Hee University, South Korea","institution_ids":["https://openalex.org/I35928602"]},{"raw_affiliation_string":"Department of Computer Engineering Kyung Hee University, Korea#TAB#","institution_ids":["https://openalex.org/I35928602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"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.16161967,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1029","last_page":"1034"},"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.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.6818562746047974},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.566776692867279},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5449754595756531},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5380716919898987},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.43592894077301025},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4101470708847046},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.389380544424057},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.382460355758667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14893952012062073},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14227983355522156}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6818562746047974},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.566776692867279},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5449754595756531},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5380716919898987},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.43592894077301025},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4101470708847046},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.389380544424057},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.382460355758667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14893952012062073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14227983355522156}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/inm.2011.5990517","is_oa":false,"landing_page_url":"https://doi.org/10.1109/inm.2011.5990517","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1539551064","https://openalex.org/W1540047495","https://openalex.org/W2027919415","https://openalex.org/W2028952005","https://openalex.org/W2098254860","https://openalex.org/W2100609801","https://openalex.org/W2106387257","https://openalex.org/W2111781120","https://openalex.org/W2120344179","https://openalex.org/W2131762580","https://openalex.org/W2138993731","https://openalex.org/W2147524058","https://openalex.org/W2153945693","https://openalex.org/W2163622824","https://openalex.org/W2170178059","https://openalex.org/W3214428327","https://openalex.org/W4297972233","https://openalex.org/W6675716505"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2070119082","https://openalex.org/W2002774445"],"abstract_inverted_index":{"We":[0],"consider":[1],"a":[2],"network":[3,53],"with":[4],"two":[5],"kinds":[6],"of":[7,39,44,59,112],"traffic:":[8],"inelastic":[9,13,40,180],"and":[10,18,32,86],"elastic.":[11],"The":[12,67,96,116,154],"traffic":[14,24,50,61],"requires":[15],"fixed":[16,37],"throughput":[17],"high":[19],"priority,":[20],"while":[21,163],"the":[22,26,36,42,48,52,56,81,94,110,113,121,125,128,136,140,144,146,161,165,178],"elastic":[23,49,60],"has":[25,119],"rate":[27,38],"that":[28],"can":[29],"be":[30],"controlled":[31],"low":[33],"priority.":[34],"Given":[35],"traffic,":[41],"problem":[43],"how":[45],"to":[46,54,102,139,159,175],"inject":[47],"into":[51],"achieve":[55],"maximum":[57],"utility":[58,162],"is":[62,74,100,148,157,172,182],"solved":[63],"in":[64,70],"this":[65],"paper.":[66],"node-centric":[68],"formulation":[69],"cross-layer":[71],"design":[72],"framework":[73],"applied.":[75],"By":[76],"using":[77],"Lagrange":[78],"duality":[79],"method,":[80],"congestion":[82],"control,":[83],"back-pressure":[84],"routing":[85,118],"Max-weight":[87,114],"scheduling":[88,99],"are":[89],"integrated":[90],"naturally":[91],"when":[92],"decomposing":[93],"Larangian.":[95],"Greedy":[97],"Distributed":[98],"introduced":[101,174],"not":[103],"only":[104],"decentralize":[105],"scheduling,":[106],"but":[107],"also":[108,173],"decrease":[109],"complexity":[111],"scheduling.":[115],"Back-pressure":[117],"presented":[120],"poor":[122],"performance":[123],"at":[124,151],"light":[126,152],"load,":[127],"packets":[129],"take":[130],"an":[131],"unnecessary":[132],"long":[133],"route":[134],"from":[135],"source":[137],"node":[138],"destination":[141],"node.":[142],"As":[143],"result,":[145],"delay":[147],"excessively":[149],"large":[150],"load.":[153],"enhancement":[155],"algorithm":[156],"implemented":[158],"maximize":[160],"minimizing":[164],"resource":[166],"usage.":[167],"An":[168],"admission":[169],"control":[170],"scheme":[171],"check":[176],"if":[177],"new":[179],"flow":[181],"admissible.":[183]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}