{"id":"https://openalex.org/W2342921374","doi":"https://doi.org/10.1109/lcomm.2016.2539940","title":"Near-Optimal BFS-Tree Construction in Radio Networks","display_name":"Near-Optimal BFS-Tree Construction in Radio Networks","publication_year":2016,"publication_date":"2016-03-09","ids":{"openalex":"https://openalex.org/W2342921374","doi":"https://doi.org/10.1109/lcomm.2016.2539940","mag":"2342921374"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2016.2539940","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2016.2539940","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"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 Communications Letters","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/A5088284921","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0002-1939-9053"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088284921"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.03116128,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"20","issue":"6","first_page":"1172","last_page":"1174"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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/T10246","display_name":"Mobile Ad Hoc Networks","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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991000294685364,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9987000226974487,"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/computer-science","display_name":"Computer science","score":0.5921980142593384},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5309745073318481},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.46775150299072266},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3761608898639679},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.3313424289226532},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24926412105560303},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14044097065925598}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5921980142593384},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5309745073318481},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.46775150299072266},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3761608898639679},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.3313424289226532},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24926412105560303},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14044097065925598}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2016.2539940","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2016.2539940","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"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 Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W78769","https://openalex.org/W1486578977","https://openalex.org/W1785976806","https://openalex.org/W2048113794","https://openalex.org/W2048454711","https://openalex.org/W2059156304","https://openalex.org/W2067936666","https://openalex.org/W2072976381","https://openalex.org/W2095713941","https://openalex.org/W2142458954","https://openalex.org/W2148190105","https://openalex.org/W2249998429","https://openalex.org/W3099058004"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857"],"abstract_inverted_index":{"This":[0,181],"letter":[1],"presents":[2],"the":[3,14,22,30,35,90,99,143],"first":[4,10,31],"improved":[5],"construction":[6,115],"of":[7,29,66,109,126,195],"a":[8,19,25,52,80,103,135,157,164],"breadth":[9],"search-tree":[11],"(BFS-tree)":[12],"in":[13,34,54,62,107,134,166,197],"radio":[15,36],"network":[16,37,65],"model.":[17,38],"Computing":[18],"BFS-tree,":[20],"or":[21],"hop-distance":[23],"to":[24,50,120,187],"source,":[26],"was":[27,116],"one":[28],"problems":[32],"solved":[33],"Particularly,":[39],"more":[40],"than":[41],"20":[42],"years":[43],"ago,":[44],"Bar-Yehuda":[45],"et":[46],"al.":[47],"showed":[48],"how":[49],"compute":[51],"BFS-tree":[53,72,147,165],"O(D":[55,91,167],"log":[56,92,168,170,171],"<sup":[57,93,204,209],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[58,94,205,210],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[59,95,206],"n)":[60,96,176],"rounds":[61],"any":[63,214],"n-node":[64],"diameter":[67,100],"D.":[68],"Since":[69],"then":[70],"this":[71,122],"algorithm":[73,161],"has":[74,101],"been":[75],"used":[76,133],"extensively":[77],"for":[78,192,199,213],"constructing":[79],"substrate":[81],"over":[82],"which":[83,130],"communications":[84],"can":[85,131],"be":[86,132,139,149],"coordinated":[87],"efficiently.":[88],"However,":[89],"dependence":[97],"on":[98],"become":[102],"running":[104,182],"time":[105,183],"bottleneck":[106],"many":[108],"these":[110],"applications,":[111],"and":[112],"no":[113],"faster":[114,151],"found.":[117],"Recently,":[118],"trying":[119],"circumvent":[121],"barrier,":[123],"approximate":[124],"variants":[125],"BFS-trees":[127],"were":[128],"introduced":[129],"similar":[136],"manner":[137],"but":[138],"computed":[140,150],"faster.":[141],"Still,":[142],"question":[144],"whether":[145],"exact":[146],"could":[148],"remained":[152],"open.":[153],"Here,":[154],"we":[155],"present":[156],"simple":[158],"randomized":[159],"distributed":[160],"that":[162],"computes":[163],"n":[169,172,208],"+":[173],"log3":[174],"n/loglog":[175],"rounds,":[177],"with":[178],"high":[179],"probability.":[180],"is":[184],"optimal":[185],"up":[186],"an":[188],"O(log":[189],"logn)":[190],"factor":[191],"most":[193],"values":[194],"D,":[196],"particular":[198],"all":[200],"D":[201],"\u2208":[202,216],"[log":[203],"n,":[207],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1-\u2208</sup>":[211],"]":[212],"constant":[215],">":[217],"0.":[218]},"counts_by_year":[{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}