{"id":"https://openalex.org/W7123341944","doi":"https://doi.org/10.1109/tcomm.2026.3653127","title":"CoRA: A Constrained Random Algorithm for Efficient Directional Neighbor Discovery in Ad Hoc Networks","display_name":"CoRA: A Constrained Random Algorithm for Efficient Directional Neighbor Discovery in Ad Hoc Networks","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7123341944","doi":"https://doi.org/10.1109/tcomm.2026.3653127"},"language":null,"primary_location":{"id":"doi:10.1109/tcomm.2026.3653127","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2026.3653127","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-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/A5122871116","display_name":"Yunhao Xiao","orcid":null},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yunhao Xiao","raw_affiliation_strings":["College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China"],"raw_orcid":"https://orcid.org/0009-0007-6878-3880","affiliations":[{"raw_affiliation_string":"College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"middle","author":{"id":null,"display_name":"An Liu","orcid":"https://orcid.org/0000-0002-3943-5234"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"An Liu","raw_affiliation_strings":["College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China"],"raw_orcid":"https://orcid.org/0000-0002-3943-5234","affiliations":[{"raw_affiliation_string":"College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5122886488","display_name":"Hang Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I162868743","display_name":"Tianjin University","ror":"https://ror.org/012tb2g32","country_code":"CN","type":"education","lineage":["https://openalex.org/I162868743"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hang Zhang","raw_affiliation_strings":["Tianjin University, Tianjin, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tianjin University, Tianjin, China","institution_ids":["https://openalex.org/I162868743"]}]}],"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.03500407,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"74","issue":null,"first_page":"3370","last_page":"3386"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10936","display_name":"Millimeter-Wave Propagation and Modeling","score":0.8708999752998352,"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/T10936","display_name":"Millimeter-Wave Propagation and Modeling","score":0.8708999752998352,"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/T10326","display_name":"Indoor and Outdoor Localization Technologies","score":0.04859999939799309,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.01510000042617321,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6216999888420105},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.57669997215271},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.4406000077724457},{"id":"https://openalex.org/keywords/adaptability","display_name":"Adaptability","score":0.43309998512268066},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.41359999775886536},{"id":"https://openalex.org/keywords/boosting","display_name":"Boosting (machine learning)","score":0.40540000796318054},{"id":"https://openalex.org/keywords/neighbor-discovery-protocol","display_name":"Neighbor Discovery Protocol","score":0.39250001311302185},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.37540000677108765}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7444999814033508},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6216999888420105},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.57669997215271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4684000015258789},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.4406000077724457},{"id":"https://openalex.org/C177606310","wikidata":"https://www.wikidata.org/wiki/Q5674297","display_name":"Adaptability","level":2,"score":0.43309998512268066},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.41359999775886536},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.40540000796318054},{"id":"https://openalex.org/C165932591","wikidata":"https://www.wikidata.org/wiki/Q1547947","display_name":"Neighbor Discovery Protocol","level":4,"score":0.39250001311302185},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.37540000677108765},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.373199999332428},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.35580000281333923},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.32919999957084656},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.32690000534057617},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.30649998784065247},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.3034999966621399},{"id":"https://openalex.org/C2777036070","wikidata":"https://www.wikidata.org/wiki/Q18393452","display_name":"Random projection","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C2778915421","wikidata":"https://www.wikidata.org/wiki/Q3643177","display_name":"Performance improvement","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.25380000472068787}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcomm.2026.3653127","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2026.3653127","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5858730876","display_name":null,"funder_award_id":"62571482","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320332588","display_name":"Shanghai Key Laboratory of Intelligent Information Processing","ror":"https://ror.org/013q1eq08"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W32403112","https://openalex.org/W1542274759","https://openalex.org/W1991056455","https://openalex.org/W1992261446","https://openalex.org/W1996016589","https://openalex.org/W2000935031","https://openalex.org/W2011501918","https://openalex.org/W2071983464","https://openalex.org/W2074011868","https://openalex.org/W2156924549","https://openalex.org/W2164561129","https://openalex.org/W2164769148","https://openalex.org/W2290228478","https://openalex.org/W2327622231","https://openalex.org/W2743626299","https://openalex.org/W2790475903","https://openalex.org/W2809551708","https://openalex.org/W2862033148","https://openalex.org/W3013548656","https://openalex.org/W3166067649","https://openalex.org/W3211189031","https://openalex.org/W3211728358","https://openalex.org/W4243772471","https://openalex.org/W4250352094","https://openalex.org/W4285286138","https://openalex.org/W4293057748","https://openalex.org/W4312085412","https://openalex.org/W4386276174","https://openalex.org/W4386699351","https://openalex.org/W4390331420","https://openalex.org/W4401746948","https://openalex.org/W4402742350"],"related_works":[],"abstract_inverted_index":{"In":[0],"millimeter-wave":[1],"ad":[2],"hoc":[3],"networks,":[4,138],"the":[5,14,37,219,224],"challenges":[6],"of":[7,17,223],"directional":[8,44],"neighbor":[9,160],"discovery":[10,49,214],"(ND),":[11],"combined":[12],"with":[13,58,88,139,165],"emerging":[15],"integration":[16],"reinforcement":[18],"learning":[19],"(RL),":[20],"necessitate":[21],"algorithms":[22],"that":[23,97,104],"are":[24],"both":[25,170],"efficient":[26],"and":[27,61,95,110,129,146,163,182,194,221],"RL-compatible":[28],"under":[29,143],"practical":[30],"constraints.":[31],"To":[32,150],"address":[33],"this,":[34],"we":[35,153,176,198],"propose":[36,154,177],"Constrained":[38],"Random":[39,107],"Algorithm":[40,108,112],"(CoRA),":[41],"a":[42,100,166],"novel":[43],"ND":[45,82],"scheme":[46],"achieving":[47,117],"high":[48],"efficiency,":[50],"robustness":[51],"to":[52,119,131,201,211],"node":[53],"density":[54],"variations,":[55],"broad":[56],"compatibility":[57],"enhancement":[59,148],"techniques,":[60],"strong":[62,140],"support":[63],"for":[64],"RL-based":[65],"optimization.":[66],"Specifically,":[67],"CoRA":[68,94,226],"constructs":[69],"constrained":[70],"beam":[71,90],"direction":[72,79],"sets":[73,87],"using":[74],"minimal":[75,144],"constraint":[76],"units\u2014spatially":[77],"symmetric":[78],"pairs\u2014and":[80],"executes":[81],"by":[83,179,204],"sequentially":[84],"scanning":[85],"these":[86],"randomized":[89],"selection.":[91],"We":[92],"analyze":[93],"show":[96],"it":[98,184],"provides":[99],"unified":[101],"analytical":[102],"formulation":[103],"includes":[105],"Pure":[106],"(PRA)":[109],"Scan-Based":[111],"(SBA)":[113],"as":[114],"limiting":[115],"cases,":[116],"up":[118,130],"80%":[120],"lower":[121,133],"time-slot":[122],"overhead":[123],"than":[124,134],"PRA":[125],"in":[126,136],"sparse":[127],"networks":[128],"60%":[132],"SBA":[135],"dense":[137],"performance":[141,173],"even":[142],"hardware":[145],"without":[147],"techniques.":[149],"illustrate":[151],"compatibility,":[152],"two":[155],"variants:":[156],"GCoRA":[157],"employing":[158],"gossip-based":[159],"information":[161],"exchange":[162],"SCoRA":[164],"selective":[167],"reply":[168],"mechanism,":[169],"showing":[171],"additional":[172],"gains.":[174],"Furthermore,":[175],"QCoRA":[178,187,200],"integrating":[180],"Q-learning":[181],"benchmarking":[183],"against":[185],"QPRA.":[186],"achieves":[188],"faster":[189],"convergence,":[190],"higher":[191],"cumulative":[192],"rewards,":[193],"enhanced":[195],"exploration.":[196],"Finally,":[197],"extend":[199],"deep":[202],"RL":[203],"proposing":[205],"DDQCoRA,":[206],"which":[207],"leverages":[208],"Double":[209],"DQN":[210],"further":[212],"reduce":[213],"latency.":[215],"Extensive":[216],"simulations":[217],"confirm":[218],"effectiveness":[220],"adaptability":[222],"proposed":[225],"family.":[227]},"counts_by_year":[],"updated_date":"2026-01-25T23:04:38.658462","created_date":"2026-01-14T00:00:00"}