{"id":"https://openalex.org/W2015070147","doi":"https://doi.org/10.1109/icccn.2013.6614126","title":"DORA: Distributed Cognitive Random Access of Unslotted Markovian Channels under Tight Collision Constraints","display_name":"DORA: Distributed Cognitive Random Access of Unslotted Markovian Channels under Tight Collision Constraints","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2015070147","doi":"https://doi.org/10.1109/icccn.2013.6614126","mag":"2015070147"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2013.6614126","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2013.6614126","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","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/A5100459445","display_name":"Liqiang Zhang","orcid":"https://orcid.org/0000-0002-4175-7590"},"institutions":[{"id":"https://openalex.org/I4210134870","display_name":"Indiana University South Bend","ror":"https://ror.org/02s1hvj37","country_code":"US","type":"education","lineage":["https://openalex.org/I4210134870","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Liqiang Zhang","raw_affiliation_strings":["Department of Computer and Information Sciences, Indiana University South Bend, South Bend, USA","Dept. of Comput. & Inf. Sci., Indiana Univ. South Bend, South Bend, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Indiana University South Bend, South Bend, USA","institution_ids":["https://openalex.org/I4210134870"]},{"raw_affiliation_string":"Dept. of Comput. & Inf. Sci., Indiana Univ. South Bend, South Bend, IN, USA","institution_ids":["https://openalex.org/I4210134870"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100459445"],"corresponding_institution_ids":["https://openalex.org/I4210134870"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"39","issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10579","display_name":"Cognitive Radio Networks and Spectrum Sensing","score":0.9991999864578247,"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/T10579","display_name":"Cognitive Radio Networks and Spectrum Sensing","score":0.9991999864578247,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9973999857902527,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9966999888420105,"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.772838830947876},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.6736947894096375},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5775530338287354},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5571971535682678},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5300419330596924},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.460463285446167},{"id":"https://openalex.org/keywords/random-access","display_name":"Random access","score":0.44326290488243103},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4350410997867584},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4248078465461731},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20654422044754028},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.18357503414154053},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.152385413646698},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11828973889350891}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.772838830947876},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6736947894096375},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5775530338287354},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5571971535682678},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5300419330596924},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.460463285446167},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.44326290488243103},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4350410997867584},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4248078465461731},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20654422044754028},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.18357503414154053},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.152385413646698},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11828973889350891},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2013.6614126","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2013.6614126","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","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":32,"referenced_works":["https://openalex.org/W1666230842","https://openalex.org/W1972707086","https://openalex.org/W1980829002","https://openalex.org/W2015056750","https://openalex.org/W2020129240","https://openalex.org/W2020254732","https://openalex.org/W2044758663","https://openalex.org/W2049633694","https://openalex.org/W2089321851","https://openalex.org/W2089719995","https://openalex.org/W2089834667","https://openalex.org/W2093562354","https://openalex.org/W2118314698","https://openalex.org/W2120015434","https://openalex.org/W2120125372","https://openalex.org/W2121863487","https://openalex.org/W2125142879","https://openalex.org/W2140571193","https://openalex.org/W2141040648","https://openalex.org/W2142819538","https://openalex.org/W2146025745","https://openalex.org/W2150328967","https://openalex.org/W2162598825","https://openalex.org/W2165511051","https://openalex.org/W2480680997","https://openalex.org/W2949446396","https://openalex.org/W2963007414","https://openalex.org/W4214717370","https://openalex.org/W6637310442","https://openalex.org/W6654532046","https://openalex.org/W6681805987","https://openalex.org/W7048738093"],"related_works":["https://openalex.org/W4400868993","https://openalex.org/W3096874164","https://openalex.org/W1985560493","https://openalex.org/W2386410636","https://openalex.org/W2357975469","https://openalex.org/W2145363145","https://openalex.org/W1626977535","https://openalex.org/W2341346307","https://openalex.org/W3168977894","https://openalex.org/W2379651310"],"abstract_inverted_index":{"We":[0,106,137,168],"consider":[1],"the":[2,53,57,66,87,139,180,213,218],"design":[3],"of":[4,98,150,212],"distributed":[5],"strategies":[6],"that":[7,30,76,129,175,195],"allow":[8],"multiple":[9,15],"secondary":[10],"users":[11,81],"to":[12,50,55,63,78,84,94,101,178],"opportunistically":[13],"access":[14,134],"unslotted":[16],"Markovian":[17],"channels":[18,54],"with":[19,156,162,191],"unknown":[20],"parameters":[21,111],"and":[22,74,112,159,189,200],"tight":[23],"collision":[24,96],"constraints,":[25],"a":[26,44,91,114,148,192],"challenging":[27],"problem":[28,143,149],"setting":[29],"has":[31,93],"not":[32],"been":[33],"well":[34],"addressed":[35],"by":[36,144],"existing":[37],"work.":[38],"An":[39],"optimal":[40,132],"strategy":[41,92],"would":[42],"strike":[43],"balance":[45],"among":[46],"exploration,":[47],"which":[48,61,120],"is":[49,62,77],"measure":[51],"all":[52],"identify":[56],"best":[58,68,88],"one(s),":[59],"exploitation,":[60],"stay":[64],"on":[65],"currently":[67],"channel(s)":[69],"as":[70,72],"much":[71],"possible,":[73],"competition,":[75],"spread":[79],"out":[80],"in":[82],"order":[83],"avoid":[85],"overcrowding":[86],"channel(s).":[89],"Moreover,":[90],"abide":[95],"constraint":[97],"each":[99],"channel":[100,110,182,198],"become":[102],"an":[103,124,131,163,171],"acceptable":[104],"one.":[105],"first":[107],"assume":[108],"known":[109,197],"formulate":[113],"CNLP":[115],"(constrained":[116],"nonlinear":[117],"programming)":[118],"problem,":[119],"we":[121,126],"solved":[122],"through":[123],"algorithm":[125,172],"called":[127,173],"DORA-Known":[128,177],"computes":[130],"randomized":[133],"strategy.":[135],"Next,":[136],"address":[138],"online":[140,181],"channel-parameter":[141],"learning":[142,203],"transforming":[145],"it":[146,161],"into":[147],"DTMC":[151],"(discrete-time":[152],"Markov":[153],"chain)":[154],"estimation":[155],"incomplete":[157],"data,":[158],"solving":[160],"EM":[164],"(expectation-maximization)":[165],"based":[166,204],"algorithm.":[167],"then":[169],"propose":[170],"DORA-Learning":[174],"extends":[176],"incorporate":[179],"learning.":[183],"The":[184],"proposed":[185],"algorithms":[186,216],"are":[187],"evaluated":[188],"compared":[190],"state-of-art":[193],"approach":[194],"assumes":[196],"parameters,":[199],"two":[201,214],"reinforcement":[202],"schemes.":[205],"Experimental":[206],"results":[207],"illustrate":[208],"significant":[209],"performance":[210],"gain":[211],"DORA":[215],"over":[217],"other":[219],"three":[220],"approaches.":[221]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}