{"id":"https://openalex.org/W2057098074","doi":"https://doi.org/10.1109/infcom.2012.6195699","title":"A bayesian based incentive-compatible routing mechanism for Dynamic Spectrum Access networks","display_name":"A bayesian based incentive-compatible routing mechanism for Dynamic Spectrum Access networks","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W2057098074","doi":"https://doi.org/10.1109/infcom.2012.6195699","mag":"2057098074"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2012.6195699","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2012.6195699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Proceedings IEEE INFOCOM","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/4217","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, USA","Electrical Engineering and Computer Science, Syracuse University, NY, 13244 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY, USA","institution_ids":["https://openalex.org/I70983195"]},{"raw_affiliation_string":"Electrical Engineering and Computer Science, Syracuse University, NY, 13244 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, USA","Electrical Engineering and Computer Science, University of Central Florida, Orlando, 32816, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science, University of Central Florida, Orlando, FL, USA","institution_ids":["https://openalex.org/I106165777"]},{"raw_affiliation_string":"Electrical Engineering and Computer Science, University of Central Florida, Orlando, 32816, 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":2.6915,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.90774077,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"1","issue":null,"first_page":"2781","last_page":"2785"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9998999834060669,"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":0.9998999834060669,"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.9908999800682068,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9907000064849854,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7416368722915649},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6825745105743408},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5743576884269714},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5538771748542786},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5089409351348877},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4965277314186096},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.47404715418815613},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.46843868494033813},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46303993463516235},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4196491241455078},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3495503067970276},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3412104845046997},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.33776265382766724},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.111239492893219}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7416368722915649},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6825745105743408},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5743576884269714},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5538771748542786},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5089409351348877},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4965277314186096},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.47404715418815613},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.46843868494033813},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46303993463516235},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4196491241455078},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3495503067970276},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3412104845046997},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.33776265382766724},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.111239492893219},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2012.6195699","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2012.6195699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:stars.library.ucf.edu:scopus2010-5216","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus2010/4217","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-5216","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus2010/4217","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"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/W2056497387","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/W4251083239","https://openalex.org/W6664918975"],"related_works":["https://openalex.org/W1997091564","https://openalex.org/W3035942111","https://openalex.org/W2138640781","https://openalex.org/W1563839700","https://openalex.org/W2351097701","https://openalex.org/W2102655743","https://openalex.org/W2740434786","https://openalex.org/W1998255551","https://openalex.org/W2372626604","https://openalex.org/W2154440508"],"abstract_inverted_index":{"In":[0,122],"this":[1],"paper,":[2],"we":[3],"address":[4],"the":[5,41,75,79,84,103,111,126,136],"problem":[6],"of":[7,159],"incentive":[8],"based":[9,48,63,174],"routing":[10,25,49],"in":[11,51,87,146],"Dynamic":[12],"Spectrum":[13],"Access":[14],"(DSA)":[15],"networks,":[16],"where":[17],"each":[18,53,139],"secondary":[19,54],"node":[20,55,140],"incurs":[21],"a":[22,28,33,45,66,88,166],"cost":[23,60,97,161,176],"for":[24,172],"traffic":[26,131],"from":[27],"flow":[29],"and":[30,61,70,83,98,135,162],"also":[31],"has":[32],"certain":[34],"capacity":[35,99,163],"that":[36,90,105,113,138,152,170],"it":[37],"can":[38,91,143,155],"provide":[39],"to":[40,74,94,107,110],"flow.":[42],"We":[43,77],"propose":[44],"path":[46,119,177],"auction":[47,120],"mechanism":[50,82,154],"which":[52,65,130],"announces":[56],"its":[57],"privately":[58],"known":[59],"capacity,":[62],"on":[64],"route":[67,80,128],"is":[68],"chosen":[69],"payments":[71],"are":[72],"made":[73],"nodes.":[76],"design":[78],"selection":[81],"pricing":[85],"function":[86],"manner":[89],"induce":[92],"nodes":[93,112],"reveal":[95],"their":[96],"honestly,":[100],"while":[101,164],"minimizing":[102],"payment":[104,137,167],"needs":[106],"be":[108,133,144],"given":[109],"relay":[114],"traffic,":[115],"thereby":[116],"making":[117,165],"our":[118,123,153],"optimal.":[121],"proposed":[124],"mechanism,":[125],"optimal":[127],"over":[129],"should":[132,141],"routed":[134],"receive":[142],"computed":[145],"polynomial":[147],"time.":[148],"Simulation":[149],"results":[150],"suggest":[151],"ensure":[156],"truthful":[157],"reporting":[158],"both":[160],"less":[168],"than":[169],"required":[171],"VCG":[173],"least":[175],"routing.":[178]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}