{"id":"https://openalex.org/W7166717605","doi":"https://doi.org/10.48550/arxiv.2606.29152","title":"A Gossiping Protocol for Sparse Ad-Hoc Radio Networks","display_name":"A Gossiping Protocol for Sparse Ad-Hoc Radio Networks","publication_year":2026,"publication_date":"2026-06-28","ids":{"openalex":"https://openalex.org/W7166717605","doi":"https://doi.org/10.48550/arxiv.2606.29152"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.29152","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.29152","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.29152","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103489382","display_name":"C E Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Chao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5024529572","display_name":"Marek Chrob\u00e1k","orcid":"https://orcid.org/0000-0002-8673-2709"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chrobak, Marek","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"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":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.7799000144004822,"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.7799000144004822,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.11829999834299088,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.024800000712275505,"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/gossip","display_name":"Gossip","score":0.859000027179718},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6728000044822693},{"id":"https://openalex.org/keywords/gossip-protocol","display_name":"Gossip protocol","score":0.6699000000953674},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.6315000057220459},{"id":"https://openalex.org/keywords/radio-networks","display_name":"Radio networks","score":0.538100004196167},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4016999900341034},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.3393000066280365}],"concepts":[{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.859000027179718},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7105000019073486},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6728000044822693},{"id":"https://openalex.org/C145928361","wikidata":"https://www.wikidata.org/wiki/Q5587504","display_name":"Gossip protocol","level":3,"score":0.6699000000953674},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.6315000057220459},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.61080002784729},{"id":"https://openalex.org/C2989466925","wikidata":"https://www.wikidata.org/wiki/Q1061197","display_name":"Radio networks","level":4,"score":0.538100004196167},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4016999900341034},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.3393000066280365},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32659998536109924},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.31949999928474426},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.314300000667572},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2906999886035919},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C12269588","wikidata":"https://www.wikidata.org/wiki/Q132364","display_name":"Communications protocol","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2671999931335449},{"id":"https://openalex.org/C2778775528","wikidata":"https://www.wikidata.org/wiki/Q5135432","display_name":"Closing (real estate)","level":2,"score":0.2639000117778778}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.29152","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.29152","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.29152","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.29152","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,73,114],"study":[1],"the":[2,32,51,58,63,102],"problem":[3],"of":[4,66],"gossiping":[5,67,79,121],"(all-to-all":[6],"information":[7],"exchange)":[8],"in":[9,80],"ad-hoc":[10,81],"radio":[11,82],"networks.":[12],"Such":[13],"a":[14,19,41,69,75,117],"network":[15],"is":[16,28],"represented":[17],"by":[18],"strongly-connected":[20],"directed":[21,91],"graph":[22],"with":[23,93],"\\(n\\)":[24],"vertices,":[25],"whose":[26],"topology":[27],"initially":[29],"unknown":[30],"to":[31],"protocol.":[33],"In":[34],"2004,":[35],"Gasieniec,":[36],"Radzik,":[37],"and":[38,49,57],"Xin":[39],"gave":[40],"\\(\\tilde":[42,88,103,118],"O(n^{4/3})\\)-time":[43],"deterministic":[44,76],"protocol":[45,77,99,122],"for":[46,78,90,110,123],"this":[47],"problem,":[48],"closing":[50],"gap":[52],"between":[53],"their":[54],"upper":[55],"bound":[56,61,105],"\\(\\tilde\u03a9(n)\\)":[59],"lower":[60],"on":[62,101],"time":[64,87],"complexity":[65],"remains":[68],"central":[70],"open":[71],"problem.":[72],"develop":[74],"networks":[83],"that":[84],"achieves":[85],"running":[86],"O((mn)^{3/5})\\)":[89],"graphs":[92],"at":[94],"most":[95],"\\(m\\)":[96],"edges.":[97],"Our":[98],"improves":[100],"O(n^{4/3})\\)":[104],"when":[106],"\\(m":[107],"=":[108],"O(n^c)\\),":[109],"\\(c":[111],"<":[112],"11/9\\).":[113],"also":[115],"present":[116],"O(\u0394^{1/2}":[119],"n)\\)-time":[120],"\\(\u0394\\)-regular":[124],"graphs.":[125]},"counts_by_year":[],"updated_date":"2026-07-01T06:29:00.853634","created_date":"2026-07-01T00:00:00"}