{"id":"https://openalex.org/W2171968200","doi":"https://doi.org/10.1109/icdcs.2010.50","title":"Towards Power-Sensitive Communication on a Multiple-Access Channel","display_name":"Towards Power-Sensitive Communication on a Multiple-Access Channel","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2171968200","doi":"https://doi.org/10.1109/icdcs.2010.50","mag":"2171968200"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdcs.2010.50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5087104329","display_name":"Gianluca De Marco","orcid":"https://orcid.org/0000-0002-1204-0646"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"funder","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianluca De Marco","raw_affiliation_strings":["Dipt. di Inf. e Applicazioni, Univ. di Salerno, Fisciano, Italy"],"affiliations":[{"raw_affiliation_string":"Dipt. di Inf. e Applicazioni, Univ. di Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101948468","display_name":"Dariusz R. Kowalski","orcid":"https://orcid.org/0000-0002-1316-7788"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"funder","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dariusz Rafal Kowalski","raw_affiliation_strings":["University of Liverpool. Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"University of Liverpool. Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.101,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":12,"citation_normalized_percentile":{"value":0.821949,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":85,"max":86},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9899,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9899,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9831,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9751,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6288084},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6110076},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5644085},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.55541426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.54748416},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.433595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37819242},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35514084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3545686},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35281956},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2321372},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdcs.2010.50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":20,"referenced_works":["https://openalex.org/W1866711215","https://openalex.org/W1992949566","https://openalex.org/W1994593991","https://openalex.org/W2023146810","https://openalex.org/W2028314380","https://openalex.org/W2033487809","https://openalex.org/W2036925455","https://openalex.org/W2056711111","https://openalex.org/W2057399436","https://openalex.org/W2061761364","https://openalex.org/W2095247492","https://openalex.org/W2111368375","https://openalex.org/W2116736083","https://openalex.org/W2157120295","https://openalex.org/W2616174667","https://openalex.org/W2774158340","https://openalex.org/W2899702797","https://openalex.org/W2986902281","https://openalex.org/W4252364404","https://openalex.org/W69369304"],"related_works":["https://openalex.org/W2946992918","https://openalex.org/W2885094885","https://openalex.org/W2531056186","https://openalex.org/W2348187822","https://openalex.org/W2082669437","https://openalex.org/W2068208308","https://openalex.org/W2052275678","https://openalex.org/W1997271576","https://openalex.org/W1978042415","https://openalex.org/W1971753667"],"abstract_inverted_index":{"We":[0,122,168],"are":[1,8,14,97,111,137],"given":[2],"$n$":[3],"stations":[4,18,30,38,47,154,187],"of":[5,28,55,69,85,117,152,161,177,184,198],"which":[6],"$k$":[7],"active,":[9],"while":[10,125],"the":[11,33,42,53,67,83,139,173,182,199],"remaining":[12],"$n-k$":[13],"asleep.":[15],"The":[16,72],"active":[17,29,37,78,87,120,153,186],"communicate":[19],"via":[20],"a":[21,25,115,164,189,196],"multiple-access":[22,190],"channel.":[23],"If":[24],"subset":[26,116,151],"$Q$":[27],"transmits":[31],"in":[32,172],"same":[34],"round,":[35],"all":[36,86,160],"can":[39,192],"recognize":[40],"from":[41],"signal":[43],"strength":[44],"how":[45],"many":[46],"have":[48],"transmitted":[49,70],"(i.e.,":[50],"they":[51,60],"learn":[52,81],"size":[54],"set":[56,84],"$Q$),":[57],"even":[58,99],"though":[59],"may":[61],"not":[62,156],"be":[63,193],"able":[64],"to":[65,75,80,113],"decode":[66],"contents":[68],"messages.":[71],"goal":[73],"is":[74,90,155],"let":[76],"each":[77],"station":[79],"about":[82],"stations.":[88,121],"It":[89],"well":[91],"known":[92],"that":[93,124],"$\\Theta(k\\log_{k+1}":[94,145],"n)$":[95,135,146],"rounds":[96,136],"enough,":[98],"for":[100,126,129],"non-adaptive":[101,140,165],"deterministic":[102,131,141,166],"algorithms.":[103],"A":[104],"natural":[105],"interesting":[106],"generalization":[107],"arises":[108],"when":[109],"we":[110],"required":[112],"identify":[114],"$m\\leq":[118],"k$":[119],"show":[123],"randomized":[127],"or":[128],"adaptive":[130],"algorithms":[132],"$O(m":[133],"\\log_{m+1}":[134],"sufficient,":[138],"counterpart":[142],"still":[143],"requires":[144],"rounds,":[147],"therefore,":[148],"finding":[149,159],"any":[150],"easier":[157],"than":[158],"them":[162],"by":[163],"algorithm.":[167],"prove":[169],"our":[170],"results":[171],"more":[174],"general":[175],"framework":[176],"combinatorial":[178],"search":[179],"theory,":[180],"where":[181],"problem":[183],"identifying":[185],"on":[188],"channel":[191],"viewed":[194],"as":[195],"variant":[197],"well-known":[200],"counterfeit":[201],"coin":[202],"problem.":[203]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2171968200","counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-03-21T07:27:17.959365","created_date":"2016-06-24"}