{"id":"https://openalex.org/W2524980018","doi":"https://doi.org/10.1142/s0129054116500179","title":"Belated Analyses of Three Credit-Based Adaptive Polling Algorithms","display_name":"Belated Analyses of Three Credit-Based Adaptive Polling Algorithms","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2524980018","doi":"https://doi.org/10.1142/s0129054116500179","mag":"2524980018"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054116500179","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054116500179","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5103924050","display_name":"Savio S. H. Tse","orcid":null},"institutions":[{"id":"https://openalex.org/I931681460","display_name":"Universiti Tunku Abdul Rahman","ror":"https://ror.org/050pq4m56","country_code":"MY","type":"education","lineage":["https://openalex.org/I931681460"]}],"countries":["MY"],"is_corresponding":true,"raw_author_name":"Savio S. H. Tse","raw_affiliation_strings":["Department of Computer Science, Faculty of Information and Communication Technology, Universiti Tunku Abdul Rahman, Perak Campus, 31900 Kampar, Perak, Malaysia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Information and Communication Technology, Universiti Tunku Abdul Rahman, Perak Campus, 31900 Kampar, Perak, Malaysia","institution_ids":["https://openalex.org/I931681460"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103924050"],"corresponding_institution_ids":["https://openalex.org/I931681460"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11723154,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":"05","first_page":"579","last_page":"594"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9980999827384949,"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/polling","display_name":"Polling","score":0.9721180200576782},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6953818798065186},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6782234907150269},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5655935406684875},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5210137367248535},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4948503375053406},{"id":"https://openalex.org/keywords/polling-system","display_name":"Polling system","score":0.4931196868419647},{"id":"https://openalex.org/keywords/propagation-delay","display_name":"Propagation delay","score":0.44398555159568787},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4286995530128479},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.418226033449173},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4181550145149231},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3892923593521118},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34966588020324707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27934926748275757},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12195488810539246}],"concepts":[{"id":"https://openalex.org/C204854418","wikidata":"https://www.wikidata.org/wiki/Q1362921","display_name":"Polling","level":2,"score":0.9721180200576782},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6953818798065186},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6782234907150269},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5655935406684875},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5210137367248535},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4948503375053406},{"id":"https://openalex.org/C87190583","wikidata":"https://www.wikidata.org/wiki/Q17097337","display_name":"Polling system","level":3,"score":0.4931196868419647},{"id":"https://openalex.org/C90806461","wikidata":"https://www.wikidata.org/wiki/Q1144416","display_name":"Propagation delay","level":2,"score":0.44398555159568787},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4286995530128479},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.418226033449173},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4181550145149231},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3892923593521118},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34966588020324707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27934926748275757},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12195488810539246},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054116500179","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054116500179","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7900000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2013892304","https://openalex.org/W2030794273","https://openalex.org/W2051138566","https://openalex.org/W2081317651","https://openalex.org/W2126747526","https://openalex.org/W2129821975","https://openalex.org/W2169833393","https://openalex.org/W2170655986"],"related_works":["https://openalex.org/W2013501766","https://openalex.org/W1829880288","https://openalex.org/W1981084347","https://openalex.org/W105848694","https://openalex.org/W2804935743","https://openalex.org/W3120926882","https://openalex.org/W2542051847","https://openalex.org/W2156472335","https://openalex.org/W2359680786","https://openalex.org/W2062739730"],"abstract_inverted_index":{"We":[0,81,110],"study":[1],"the":[2,40,54,62,68,73,78,96,99,107,118,125,128,133],"problem":[3],"of":[4,16,33,75,130],"credit-based":[5],"adaptive":[6,28],"polling":[7,63],"in":[8,67,77,98,132],"undirected":[9],"arbitrary":[10],"point-to-point":[11],"asynchronous":[12],"networks.":[13],"Polling":[14],"consists":[15],"two":[17],"rounds,":[18],"namely":[19],"propagation":[20,41,79,100],"(broadcast)":[21],"and":[22,43,86,102],"feedback":[23,44,69],"(confirmation,":[24],"response)":[25],"rounds.":[26],"By":[27],"polling,":[29],"a":[30,57],"spanning":[31],"tree":[32],"unknown":[34],"topology":[35],"is":[36,135],"built":[37],"dynamically":[38],"during":[39],"round,":[42,101],"messages":[45],"are":[46],"free":[47],"to":[48,53],"choose":[49],"their":[50,88],"paths":[51],"back":[52],"initiator":[55],"\u2014":[56],"specific":[58],"node":[59],"who":[60],"initiates":[61],"algorithm.":[64],"The":[65],"freedom":[66],"round":[70],"relies":[71],"on":[72,117],"use":[74],"credits":[76,97],"round.":[80],"re-visit":[82],"three":[83],"existing":[84],"algorithms":[85],"analyse":[87],"average":[89],"case":[90,120,126],"communication":[91],"bit":[92,121],"complexities":[93],"incurred":[94],"by":[95],"these":[103],"analyses":[104],"match":[105],"with":[106],"numerical":[108],"results.":[109],"also":[111],"give":[112],"an":[113],"optimal":[114],"lower":[115],"bound":[116],"worst":[119],"message":[122],"complexity":[123],"for":[124],"when":[127],"number":[129],"nodes":[131],"network":[134],"unknown.":[136]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}