{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T23:15:54Z","timestamp":1783638954561,"version":"3.55.0"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T00:00:00Z","timestamp":1585612800000},"content-version":"vor","delay-in-days":1491,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-13-1-0042"],"award-info":[{"award-number":["FA9550-13-1-0042"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0939370"],"award-info":[{"award-number":["CCF-0939370"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1217506"],"award-info":[{"award-number":["CCF-1217506"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-AF-0937274"],"award-info":[{"award-number":["CCF-AF-0937274"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1016\/j.dam.2015.08.021","type":"journal-article","created":{"date-parts":[[2015,11,10]],"date-time":"2015-11-10T07:21:01Z","timestamp":1447140061000},"page":"79-94","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Efficient k-shot broadcasting in radio networks"],"prefix":"10.1016","volume":"202","author":[{"given":"Erez","family":"Kantor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-1590-0506","authenticated-orcid":false,"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2015.08.021_br000005","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","article-title":"A lower bound for radio broadcast","volume":"43","author":"Alon","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.dam.2015.08.021_br000010","series-title":"Proc. 32nd Int. Colloq. on Automata, Languages and Programming, ICALP","first-page":"1139","article-title":"An optimal bound for the mst algorithm to compute energy efficient broadcast trees in wireless networks","author":"Amb\u00fchl","year":"2005"},{"key":"10.1016\/j.dam.2015.08.021_br000015","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","article-title":"On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization","volume":"45","author":"Bar-Yehuda","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.dam.2015.08.021_br000020","series-title":"Proc. 19th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA","first-page":"250","article-title":"Energy efficient randomised communication in unknown adhoc networks","author":"Berenbrink","year":"2007"},{"key":"10.1016\/j.dam.2015.08.021_br000025","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","article-title":"On broadcasting in radio networks\u2014problem analysis and protocol design","volume":"33","author":"Chlamtac","year":"1985","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.dam.2015.08.021_br000030","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/26.79285","article-title":"The wave expansion approach to broadcasting in multihop radio networks","volume":"39","author":"Chlamtac","year":"1991","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.dam.2015.08.021_br000035","series-title":"Proc. 41st Symp. on Foundations of Computer Science, FOCS","first-page":"575","article-title":"Fast broadcasting and gossiping in radio networks","author":"Chrobak","year":"2000"},{"key":"10.1016\/j.dam.2015.08.021_br000040","series-title":"Proc. 18th Symp. on Theoretical Aspects of Computer Science, STACS","first-page":"12","article-title":"On the complexity of computing minimum energy consumption broadcast subgraphs","author":"Clementi","year":"2001"},{"key":"10.1016\/j.dam.2015.08.021_br000045","series-title":"Proc. 22nd ACM-SIAM Symp. on Discrete Algorithms, SODA","first-page":"709","article-title":"Selective families, superimposed codes, and broadcasting on unknown radio networks","author":"Clementi","year":"2001"},{"key":"10.1016\/j.dam.2015.08.021_br000050","series-title":"Proc. 44rd IEEE Symp. on Foundations of Computer Science, FOCS","first-page":"492","article-title":"Broadcasting algorithms in radio networks with unkown topology","author":"Czumaj","year":"2003"},{"key":"10.1016\/j.dam.2015.08.021_br000055","series-title":"Proc. 26th ACM-SIAM Symp. on Discrete Algorithms, SODA","first-page":"222","article-title":"Improved schedule for radio broadcast","author":"Elkin","year":"2005"},{"issue":"1","key":"10.1016\/j.dam.2015.08.021_br000060","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0196-6774(02)00292-4","article-title":"Centralized broadcast in multihop radio networks","volume":"46","author":"Gaber","year":"2003","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/j.dam.2015.08.021_br000065","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00446-008-0058-0","article-title":"Time efficient k-shot broadcasting in known topology radio networks","volume":"21","author":"Ga\u0327sieniec","year":"2008","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.dam.2015.08.021_br000070","series-title":"Proc. 24th ACM Symp. on Principles of Distributed Computing, PODC","first-page":"129","article-title":"Faster communication in known topology radio networks","author":"Ga\u0327sieniec","year":"2005"},{"key":"10.1016\/j.dam.2015.08.021_br000075","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/inco.1998.2754","article-title":"Improved methods for approximating node-weighted steiner trees and connected dominating sets","volume":"150","author":"Guha","year":"1999","journal-title":"Inform. Comput."},{"key":"10.1016\/j.dam.2015.08.021_br000080","first-page":"866","article-title":"Adaptive broadcast consumption (abc), a new heuristic and new bounds for the minimum energy broadcast routing problem","author":"Klasing","year":"2004","journal-title":"Networking"},{"key":"10.1016\/j.dam.2015.08.021_br000085","series-title":"Proc. 24th ACM Symp. on Principles of Distributed Computing, PODC","first-page":"158","article-title":"On selection problem in radio networks","author":"Kowalski","year":"2005"},{"key":"10.1016\/j.dam.2015.08.021_br000090","series-title":"Proc. 22nd ACM Symp. on Principles of Distributed Computing, PODC","first-page":"73","article-title":"Broadcasting in undirected ad hoc radio networks","author":"Kowalski","year":"2003"},{"key":"10.1016\/j.dam.2015.08.021_br000095","series-title":"Proc. 20th Symp. on Theoretical Aspects of Computer Science, STACS","first-page":"109","article-title":"Faster deterministic broadcasting in ad hoc radio networks","author":"Kowalski","year":"2003"},{"key":"10.1016\/j.dam.2015.08.021_br000100","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s00446-006-0007-8","article-title":"Optimal deterministic broadcasting in known topology radio networks","volume":"19","author":"Kowalski","year":"2007","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.dam.2015.08.021_br000105","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S0097539794279109","article-title":"An \u03c9(dlog(n\/d)) lower bound for broadcast in radio networks","volume":"27","author":"Kushilevitz","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2015.08.021_br000110","series-title":"Proc. 29th ACM-SIAM Symp. on Discrete Algorithms, SODA","first-page":"208","article-title":"Distributed broadcast in unknown radio networks","author":"De~Marco","year":"2008"},{"key":"10.1016\/j.dam.2015.08.021_br000115","series-title":"Probability and Computing","author":"Mitzenmacher","year":"2005"},{"key":"10.1016\/j.dam.2015.08.021_br000120","series-title":"Proc. 20th Joint Conf. of the IEEE Computer and Communications Societies, INFOCOM","first-page":"1162","article-title":"Minimum-energy broadcast routing in static ad hoc wireless networks","author":"Wan","year":"2001"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X1500428X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X1500428X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T22:40:07Z","timestamp":1783636807000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X1500428X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":24,"alternative-id":["S0166218X1500428X"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2015.08.021","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2016,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient -shot broadcasting in radio networks","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2015.08.021","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}