{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:40:07Z","timestamp":1748738407218,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319284712"},{"type":"electronic","value":"9783319284729"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-28472-9_13","type":"book-chapter","created":{"date-parts":[[2015,12,31]],"date-time":"2015-12-31T11:22:47Z","timestamp":1451560967000},"page":"169-182","source":"Crossref","is-referenced-by-count":2,"title":["Radio Aggregation Scheduling"],"prefix":"10.1007","author":[{"given":"Rajiv","family":"Gandhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Konrad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Kortsarz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoon","family":"Oh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,1]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/1030194.1015482","volume":"34","author":"D Aguayo","year":"2004","unstructured":"Aguayo, D., Bicket, J., Biswas, S., Judd, G., Morris, R.: Link-level measurements from an 802.11 b mesh network. ACM SIGCOMM Comput. Commun. Rev. 34(4), 121\u2013132 (2004)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","volume":"43","author":"N Alon","year":"1991","unstructured":"Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 290\u2013298 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"13_CR3","first-page":"254","volume":"18","author":"MK An","year":"2011","unstructured":"An, M.K., Lam, N.X., Huynh, D.T., Nguyen, T.N.: Minimum data aggregation schedule in wireless sensor networks. I. J. Comput. Appl. 18(4), 254\u2013262 (2011)","journal-title":"I. J. Comput. Appl."},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1137\/S0097539798347906","volume":"30","author":"A Bar-Noy","year":"2000","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Message multicasting in heterogeneous networks. SIAM J. Comput. 30(2), 347\u2013358 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45(1), 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Laekhanukit, B., Nanongkai, D.: Graph products revisited: tight approximation hardness of induced matching, poset dimension and more. In: SODA, pp. 1557\u20131576. SIAM (2013)","key":"13_CR6","DOI":"10.1137\/1.9781611973105.112"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/11599463_14","volume-title":"Mobile Ad-hoc and Sensor Networks","author":"X Chen","year":"2005","unstructured":"Chen, X., Hu, X., Zhu, J.: Minimum data aggregation time problem in wireless sensor networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol. 3794, pp. 133\u2013142. Springer, Heidelberg (2005)"},{"unstructured":"Chlamtac, I., Weinstein, O.: Distributed \u201cwave\u201d broadcasting in mobil multi-hop radio networks. In: ICDCS, pp. 82\u201389 (1987)","key":"13_CR8"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1137\/S0097539704440740","volume":"35","author":"M Elkin","year":"2005","unstructured":"Elkin, M., Kortsarz, G.: A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem. SIAM J. Comput. 35(3), 672\u2013689 (2005)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1137\/S0895480104445319","volume":"19","author":"M Elkin","year":"2005","unstructured":"Elkin, M., Kortsarz, G.: Polylogarithmic additive inapproximability of the radio broadcast problem. SIAM J. Discrete Math. 19(4), 881\u2013899 (2005)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1016\/j.jcss.2005.12.002","volume":"72","author":"M Elkin","year":"2006","unstructured":"Elkin, M., Kortsarz, G.: Sublogarithmic approximation for telephone multicast. J. Comput. Syst. Sci. 72(4), 648\u2013659 (2006)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/MWC.2007.358967","volume":"14","author":"E Fasolo","year":"2007","unstructured":"Fasolo, E., Rossi, M., Widmer, J., Zorzi, M.: In-network aggregation techniques for wireless sensor networks: a survey. IEEE Wirel. Commun. 14(2), 70\u201387 (2007)","journal-title":"IEEE Wirel. Commun."},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U Feige","year":"1998","unstructured":"Feige, U., Kilian, J.: Zero knowledge and the chromatic number. J. Comput. Syst. Sci. 57(2), 187\u2013199 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/978-3-662-46018-4_10","volume-title":"Algorithms for Sensor Systems","author":"J Gagnon","year":"2015","unstructured":"Gagnon, J., Narayanan, L.: Minimum latency aggregation scheduling in wireless sensor networks. In: Gao, J., Efrat, A., Fekete, S.P., Zhang, Y. (eds.) ALGOSENSORS 2014, LNCS 8847. LNCS, vol. 8847, pp. 152\u2013168. Springer, Heidelberg (2015)"},{"doi-asserted-by":"crossref","unstructured":"Guo, L., Li, Y., Cai, Z.: Minimum-latency aggregation scheduling in wireless sensor network. J. Comb. Optim., 1\u201332 (2014)","key":"13_CR15","DOI":"10.1007\/s10878-014-9748-7"},{"doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Mitra, P.: Wireless connectivity and capacity. In: SODA (2012)","key":"13_CR16","DOI":"10.1137\/1.9781611973099.44"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-14849-1_14","volume-title":"Theoretical Aspects of Distributed Computing in Sensor Networks","author":"OD Incel","year":"2011","unstructured":"Incel, O.D., Ghosh, A., Krishnamachari, B.: Scheduling algorithms for tree-based data collection in wireless sensor networks. In: Nikoletseas, S., Rolim, J.D.P. (eds.) Theoretical Aspects of Distributed Computing in Sensor Networks, pp. 407\u2013445. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Kesselman, A., Kowalski, D.: Fast distributed algorithm for convergecast in ad hoc geometric radio networks. In: WONS, pp. 119\u2013124. IEEE (2005)","key":"13_CR18","DOI":"10.1109\/WONS.2005.17"},{"key":"13_CR19","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2006","unstructured":"Kleinberg, J., Tardos, \u00c9.: Algorithm Design. Pearson Education, Boston (2006)"},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0895480193245923","volume":"8","author":"G Kortsarz","year":"1995","unstructured":"Kortsarz, G., Peleg, D.: Approximation algorithms for minimum-time broadcast. SIAM J. Discrete Math. 8(3), 401\u2013427 (1995)","journal-title":"SIAM J. Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Kotz, D., Newport, C., Gray, R.S., Liu, J., Yuan, Y., Elliott, C.: Experimental evaluation of wireless simulation assumptions. In: MSWiM, pp. 78\u201382 (2004)","key":"13_CR21","DOI":"10.1145\/1023663.1023679"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00446-006-0007-8","volume":"19","author":"DR Kowalski","year":"2007","unstructured":"Kowalski, D.R., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distrib. Comput. 19(3), 185\u2013195 (2007)","journal-title":"Distrib. Comput."},{"doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: INFOCOM (2006)","key":"13_CR23","DOI":"10.1109\/INFOCOM.2006.23"},{"doi-asserted-by":"crossref","unstructured":"Ravi, R.: Rapid rumor ramification: approximating the minimum broadcast time (extended abstract). In: FOCS, pp. 202\u2013213 (1994)","key":"13_CR24","DOI":"10.1109\/SFCS.1994.365693"},{"doi-asserted-by":"crossref","unstructured":"Wan, P.J., Huang, S.C.H., Wang, L., Wan, Z., Jia, X.: Minimum-latency aggregation scheduling in multihop wireless networks. In: MOBIHOC, pp. 185\u2013194. ACM (2009)","key":"13_CR25","DOI":"10.1145\/1530748.1530773"},{"doi-asserted-by":"crossref","unstructured":"Xu, X., Wang, S., Mao, X., Tang, S., Li, X.Y.: An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks. In: FOWANC, pp. 47\u201356. ACM (2009)","key":"13_CR26","DOI":"10.1145\/1540343.1540352"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28472-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T23:59:14Z","timestamp":1748735954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28472-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319284712","9783319284729"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28472-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}