{"id":"https://openalex.org/W1990404362","doi":"https://doi.org/10.1109/icc.2013.6654983","title":"Multi-path routing in dynamic spectrum access networks: A mechanism design approach","display_name":"Multi-path routing in dynamic spectrum access networks: A mechanism design approach","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W1990404362","doi":"https://doi.org/10.1109/icc.2013.6654983","mag":"1990404362"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2013.6654983","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2013.6654983","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://stars.library.ucf.edu/scopus2010/7671","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086959874","display_name":"Swastik Brahma","orcid":"https://orcid.org/0000-0002-7235-7856"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Swastik Brahma","raw_affiliation_strings":["Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY","Electr. Eng. & Comput. Sci., Syracuse Univ., Syracuse, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY","institution_ids":["https://openalex.org/I70983195"]},{"raw_affiliation_string":"Electr. Eng. & Comput. Sci., Syracuse Univ., Syracuse, NY, USA","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101887349","display_name":"Mainak Chatterjee","orcid":"https://orcid.org/0000-0001-5957-7478"},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mainak Chatterjee","raw_affiliation_strings":["Electrical Engineering and Computer Science, University of Central Florida, Orlando, FL","Electr. Eng. & Comput. Sci., Univ. of Central Florida, Orlando, FL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science, University of Central Florida, Orlando, FL","institution_ids":["https://openalex.org/I106165777"]},{"raw_affiliation_string":"Electr. Eng. & Comput. Sci., Univ. of Central Florida, Orlando, FL, USA","institution_ids":["https://openalex.org/I106165777"]}]}],"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.1189011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"2905","last_page":"2909"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.991100013256073,"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.7383222579956055},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6766157150268555},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6671783924102783},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6337233185768127},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.6184449195861816},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5621621608734131},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.5350343585014343},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4997687339782715},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.47442716360092163},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4721486568450928},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.46912240982055664},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4452058672904968},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4420025050640106},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.41547220945358276},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4113103747367859},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.30656394362449646},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10202503204345703}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7383222579956055},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6766157150268555},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6671783924102783},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6337233185768127},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.6184449195861816},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5621621608734131},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.5350343585014343},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4997687339782715},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.47442716360092163},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4721486568450928},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.46912240982055664},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4452058672904968},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4420025050640106},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.41547220945358276},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4113103747367859},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.30656394362449646},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10202503204345703},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icc.2013.6654983","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2013.6654983","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},{"id":"pmh:oai:stars.library.ucf.edu:scopus2010-8670","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus2010/7671","pdf_url":null,"source":{"id":"https://openalex.org/S4210172555","display_name":"Journal of International Crisis and Risk Communication Research","issn_l":"2576-0017","issn":["2576-0017","2576-0025"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus Export 2010-2014","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:stars.library.ucf.edu:scopus2010-8670","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus2010/7671","pdf_url":null,"source":{"id":"https://openalex.org/S4210172555","display_name":"Journal of International Crisis and Risk Communication Research","issn_l":"2576-0017","issn":["2576-0017","2576-0025"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus Export 2010-2014","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1588018133","https://openalex.org/W1964761515","https://openalex.org/W1965268603","https://openalex.org/W2012634103","https://openalex.org/W2015007620","https://openalex.org/W2023771496","https://openalex.org/W2029050771","https://openalex.org/W2035350896","https://openalex.org/W2056497387","https://openalex.org/W2057098074","https://openalex.org/W2078040677","https://openalex.org/W2087734489","https://openalex.org/W2120100612","https://openalex.org/W2129791350","https://openalex.org/W2134729426","https://openalex.org/W2171090088","https://openalex.org/W2657767539","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4251083239","https://openalex.org/W6664918975"],"related_works":["https://openalex.org/W1655019438","https://openalex.org/W2351097701","https://openalex.org/W2162880363","https://openalex.org/W1511174345","https://openalex.org/W106527558","https://openalex.org/W142214912","https://openalex.org/W2154440508","https://openalex.org/W2188773866","https://openalex.org/W1973373960","https://openalex.org/W2077927962"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,129,146],"address":[4],"the":[5,37,42,61,75,104,113,127],"problem":[6],"of":[7,65,126],"incentive":[8],"based":[9,140],"routing":[10,25,62,141],"in":[11,50,143],"Dynamic":[12],"Spectrum":[13],"Access":[14],"(DSA)":[15],"networks,":[16,145],"where":[17],"each":[18,52],"secondary":[19,53],"node":[20,38,54],"incurs":[21],"a":[22,28,33,46,79,84],"cost":[23,57,94],"for":[24],"traffic":[26,117],"from":[27],"flow":[29],"and":[30,58,83,95],"also":[31],"has":[32],"certain":[34],"capacity":[35,59,96,124],"that":[36,87,107,115],"can":[39,88],"provide":[40,147],"to":[41,60,74,91,109,112],"flow.":[43],"We":[44,77],"propose":[45],"path":[47,133,138],"auction":[48,100,120,139],"scheme":[49],"which":[51,66],"announces":[55],"its":[56],"mechanism,":[63],"both":[64],"are":[67],"considered":[68],"as":[69],"private":[70],"information":[71],"known":[72],"only":[73],"node.":[76],"design":[78],"route":[80],"selection":[81],"mechanism":[82,142],"pricing":[85],"function":[86],"induce":[89],"nodes":[90,114],"reveal":[92],"their":[93],"honestly":[97],"(making":[98,118],"our":[99,119,137],"truthful),":[101],"while":[102],"minimizing":[103],"expected":[105],"payment":[106],"needs":[108],"be":[110],"given":[111],"relay":[116],"optimal).":[121],"By":[122],"considering":[123],"constraint":[125],"nodes,":[128],"explicitly":[130],"support":[131],"multiple":[132],"routing.":[134],"For":[135],"deploying":[136],"DSA":[144],"polynomial":[148],"time":[149],"algorithms.":[150]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}