{"id":"https://openalex.org/W4250136615","doi":"https://doi.org/10.1109/ipdps.2006.1639356","title":"Comparative study of price-based resource allocation algorithms for ad hoc networks","display_name":"Comparative study of price-based resource allocation algorithms for ad hoc networks","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W4250136615","doi":"https://doi.org/10.1109/ipdps.2006.1639356"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2006.1639356","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639356","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","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/A5084929661","display_name":"M. Luthi","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"M. Luthi","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6ping University, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068181564","display_name":"Simin Nadjm\u2010Tehrani","orcid":"https://orcid.org/0000-0002-1485-0802"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"S. Nadjm-Tehrani","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6ping University, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011528328","display_name":"Calin Curescu","orcid":"https://orcid.org/0000-0001-5129-2718"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"C. Curescu","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6ping University, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084929661"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":0.9053,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79980768,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"5","issue":null,"first_page":"10 pp.","last_page":"10 pp."},"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.9998999834060669,"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.9998000264167786,"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.8242426514625549},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.7646268606185913},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.5596418976783752},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5534270405769348},{"id":"https://openalex.org/keywords/mobile-ad-hoc-network","display_name":"Mobile ad hoc network","score":0.552770733833313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5520777702331543},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5458940863609314},{"id":"https://openalex.org/keywords/vehicular-ad-hoc-network","display_name":"Vehicular ad hoc network","score":0.47523215413093567},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45979923009872437},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.44337987899780273},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4362125098705292},{"id":"https://openalex.org/keywords/resource-management","display_name":"Resource management (computing)","score":0.4174688458442688},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3312087059020996},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.31304416060447693},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.1181994378566742},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07613813877105713}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8242426514625549},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.7646268606185913},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5596418976783752},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5534270405769348},{"id":"https://openalex.org/C91280400","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Mobile ad hoc network","level":3,"score":0.552770733833313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5520777702331543},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5458940863609314},{"id":"https://openalex.org/C192448918","wikidata":"https://www.wikidata.org/wiki/Q682677","display_name":"Vehicular ad hoc network","level":4,"score":0.47523215413093567},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45979923009872437},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.44337987899780273},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4362125098705292},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.4174688458442688},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3312087059020996},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.31304416060447693},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.1181994378566742},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07613813877105713},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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":1,"locations":[{"id":"doi:10.1109/ipdps.2006.1639356","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639356","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322225","display_name":"Link\u00f6pings Universitet","ror":"https://ror.org/05ynxx418"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W63734200","https://openalex.org/W1895962892","https://openalex.org/W2094553360","https://openalex.org/W2109164986","https://openalex.org/W2109389153","https://openalex.org/W2110947311","https://openalex.org/W2132932625","https://openalex.org/W2155348805","https://openalex.org/W2161457646","https://openalex.org/W2167169755","https://openalex.org/W4240896209","https://openalex.org/W6639637509","https://openalex.org/W6676393014"],"related_works":["https://openalex.org/W1123412569","https://openalex.org/W3013627169","https://openalex.org/W26370491","https://openalex.org/W2923452570","https://openalex.org/W206598027","https://openalex.org/W2027592263","https://openalex.org/W2037283301","https://openalex.org/W2978610750","https://openalex.org/W2022931285","https://openalex.org/W1589966275"],"abstract_inverted_index":{"As":[0],"mobile":[1],"ad":[2,58,74,133,181],"hoc":[3,75,182],"networks":[4,76,183],"provide":[5],"a":[6,25,172],"wide":[7],"range":[8],"of":[9,15,28,32,91,143,160,180],"possibly":[10],"critical":[11],"services,":[12],"providing":[13],"quality":[14],"service":[16],"guarantees":[17],"becomes":[18],"an":[19,61,105,167,190],"essential":[20],"element.":[21],"Yet":[22],"there":[23,39],"is":[24,40,82],"limited":[26],"understanding":[27],"the":[29,49,65,99,119,125,130,141,144,158,161,176],"performance":[30,87,159],"characteristics":[31],"different":[33,46,154],"resource":[34],"allocation":[35,72,169,187],"algorithms.":[36,162],"In":[37,128],"particular,":[38],"little":[41],"work":[42],"that":[43,98,114,165,185],"comparatively":[44],"studies":[45],"algorithms":[47],"in":[48,73,89,109,115,140,175],"same":[50],"traffic":[51],"environment.":[52],"Therefore":[53],"we":[54,151],"study":[55],"two":[56],"algorithms,":[57],"hoc-TARA":[59],"and":[60,86,184],"algorithm":[62,102,132],"based":[63],"on":[64,83],"gradient":[66,100],"projection":[67,101],"method,":[68],"for":[69],"optimised":[70],"bandwidth":[71],"under":[77],"overload":[78],"situations.":[79],"The":[80,94],"focus":[81],"convergence":[84,120],"properties":[85],"measured":[88],"terms":[90],"accumulated":[92],"utility.":[93],"simulation":[95],"results":[96],"show":[97],"converges":[103],"to":[104,138],"optimal":[106,168],"solution":[107],"even":[108],"large,":[110],"dynamic":[111,117],"networks,":[112],"but":[113],"such":[116],"environments":[118,179],"time":[121],"can":[122,146,188],"significantly":[123],"influence":[124,157],"overall":[126],"performance.":[127,149],"comparison,":[129],"near-optimal":[131,186],"hoc-TARA,":[134],"which":[135],"quickly":[136],"adapts":[137],"changes":[139],"state":[142],"network,":[145],"exhibit":[147],"superior":[148],"Further":[150],"illustrate":[152],"how":[153],"parameter":[155],"settings":[156],"We":[163],"conclude":[164],"finding":[166],"comes":[170],"at":[171],"high":[173],"price":[174],"rapidly":[177],"changing":[178],"be":[189],"ample":[191],"alternative.":[192]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}