{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:59:23Z","timestamp":1742403563187},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540371892"},{"type":"electronic","value":"9783540371908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11814856_50","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T15:04:00Z","timestamp":1160406240000},"page":"527-538","source":"Crossref","is-referenced-by-count":7,"title":["Low-Latency Broadcast Scheduling in Ad Hoc Networks"],"prefix":"10.1007","author":[{"given":"Scott C. -H.","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng-Jun","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohua","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"50_CR1","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. Journal of Computer and System Sciences\u00a043(2), 290\u2013298 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"50_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/513800.513820","volume-title":"3rd ACM international symposium on Mobile ad hoc networking & computing\u2013MobiHoc 2002","author":"K.M. Alzoubi","year":"2002","unstructured":"Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: 3rd ACM international symposium on Mobile ad hoc networking & computing\u2013MobiHoc 2002, pp. 157\u2013164. ACM Press, New York (2002)"},{"issue":"1","key":"50_CR3","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 multihop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences\u00a045(1), 104\u2013126 (1992)","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"50_CR4","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1109\/90.811446","volume":"7","author":"S. Basagni","year":"1999","unstructured":"Basagni, S., Chlamtac, I., Bruschi, D.: A mobility-transparent deterministic broadcast mechanism for ad hoc networks. IEEE\/ACM Transactions on Networking\u00a07(6), 799\u2013807 (1999)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"3","key":"50_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s004460050030","volume":"10","author":"D. Bruschi","year":"1997","unstructured":"Bruschi, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing\u00a010(3), 129\u2013135 (1997)","journal-title":"Distributed Computing"},{"key":"50_CR6","unstructured":"Cheng, X., Huang, X., Li, D., Du, D.: Polynomial time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Technical Report. To appear in Networks"},{"issue":"1","key":"50_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/90.282605","volume":"2","author":"I. Chlamtac","year":"1994","unstructured":"Chlamtac, I., Farag\u00f3, A.: Making transmission schedules immune to topology changes in multihop packet radio networks. IEEE\/ACM Transactions Networking\u00a02(1), 23\u201329 (1994)","journal-title":"IEEE\/ACM Transactions Networking"},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I. Chlamtac","year":"1985","unstructured":"Chlamtac, I., Kutten, S.: On broadcasting in radio networks\u2013problem analysis and protocol design. IEEE Transactions on Communications\u00a033, 1240\u20131246 (1985)","journal-title":"IEEE Transactions on Communications"},{"key":"50_CR9","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1109\/26.79285","volume":"39","author":"I. Chlamtac","year":"1991","unstructured":"Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Transactions on Communications\u00a039, 426\u2013433 (1991)","journal-title":"IEEE Transactions on Communications"},{"key":"50_CR10","unstructured":"Chlebus, B.S., Ga\u0327sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. In: Symposium on Discrete Algorithms, pp. 861\u2013870 (2000)"},{"issue":"1-3","key":"50_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math.\u00a086(1-3), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: ICC (1), pp. 376\u2013380 (1997)","DOI":"10.1109\/ICC.1997.605303"},{"key":"50_CR13","doi-asserted-by":"crossref","unstructured":"Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: ICC (1), pp. 376\u2013380 (1997)","DOI":"10.1109\/ICC.1997.605303"},{"key":"50_CR14","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.jalgor.2003.11.004","volume":"52","author":"M. Elkin","year":"2004","unstructured":"Elkin, M., Kortsarz, G.: Logarithmic inapproximability of the radio broadcast problem. Journal of Algorithms\u00a052, 8\u201325 (2004)","journal-title":"Journal of Algorithms"},{"key":"50_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-27821-4_10","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Elkin","year":"2004","unstructured":"Elkin, M., Kortsarz, G.: Polylogarithmic Inapproximability of the Radio Broadcast Problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 105\u2013116. Springer, Heidelberg (2004)"},{"key":"50_CR16","unstructured":"Elkin, M., Kortsarz, G.: An improved algorithm for radio networks, 2005. An earlier version appeared in SODA 2005 (2005)"},{"issue":"1","key":"50_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0196-6774(02)00292-4","volume":"46","author":"I. Gaber","year":"2003","unstructured":"Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. Journal of Algorithms\u00a046(1), 1\u201320 (2003)","journal-title":"Journal of Algorithms"},{"key":"50_CR18","doi-asserted-by":"crossref","unstructured":"Gandhi, R., Parthasarathy, S., Mishra, A.: Minimizing broadcast latency and redundancy in ad hoc networks. In: ACM MobiHoc 2003, pp. 222\u2013232 (2003)","DOI":"10.1145\/778415.778442"},{"key":"50_CR19","doi-asserted-by":"crossref","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. In: European Symposium on Algorithms, pp. 179\u2013193 (1996)","DOI":"10.1007\/3-540-61680-2_55"},{"issue":"3","key":"50_CR20","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1109\/90.700893","volume":"6","author":"J.-H. Ju","year":"1998","unstructured":"Ju, J.-H., Li, V.O.K.: An optimal topology-transparent scheduling method in multihop packet radio networks. IEEE\/ACM Transactions on Networking\u00a06(3), 298\u2013306 (1998)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"50_CR21","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Pelc, A.: Centralized deterministic broadcasting in undirected multihop radio networks. In: 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems\u2013APPROX-RANDOM 2004, pp. 171\u2013182 (2004)","DOI":"10.1007\/978-3-540-27821-4_16"},{"key":"50_CR22","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Mansour, Y.: An \u03a9(D log(N\/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing\u00a027, 702\u2013712 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"50_CR23","unstructured":"Linial, N., Saks, M.: Decomposing graphs into regions of small diameter. In: 2nd annual ACM-SIAM symposium on Discreate algorithms-SODA 1991, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp. 320\u2013330 (1991)"},{"key":"50_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks\u00a025, 59\u201368 (1995)","journal-title":"Networks"},{"key":"50_CR25","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/313451.313525","volume-title":"5th annual ACM\/IEEE international conference on Mobile computing and networking\u2013MobiCom 1999","author":"S.-Y. Ni","year":"1999","unstructured":"Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., Sheu, J.-P.: The broadcast storm problem in a mobile ad hoc network. In: 5th annual ACM\/IEEE international conference on Mobile computing and networking\u2013MobiCom 1999, pp. 151\u2013162. ACM Press, New York (1999)"},{"issue":"2","key":"50_CR26","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/90.222924","volume":"1","author":"S. Ramanathan","year":"1993","unstructured":"Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multihop radio networks. IEEE\/ACM Transactions on Networking\u00a01(2), 166\u2013177 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"1","key":"50_CR27","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1019128411323","volume":"3","author":"A. Sen","year":"1997","unstructured":"Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. Wireless Networks\u00a03(1), 71\u201382 (1997)","journal-title":"Wireless Networks"},{"key":"50_CR28","first-page":"483","volume-title":"The handbook of ad hoc wireless networks","author":"J.-P. Sheu","year":"2003","unstructured":"Sheu, J.-P., Hung, P.-K., Hsu, C.-S.: Scheduling of broadcasts in multihop wireless networks. In: The handbook of ad hoc wireless networks, pp. 483\u2013495. CRC Press, Inc., Boca Raton (2003)"},{"issue":"2","key":"50_CR29","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1019045801829","volume":"1","author":"R. Sivakumar","year":"1998","unstructured":"Sivakumar, R., Das, B., Bharghavan, V.: Spine routing in ad hoc networks. Cluster Computing\u00a01(2), 237\u2013248 (1998)","journal-title":"Cluster Computing"},{"issue":"2","key":"50_CR30","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/B:MONE.0000013625.87793.13","volume":"9","author":"P.-J. Wan","year":"2004","unstructured":"Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications\u00a09(2), 141\u2013149 (2004)","journal-title":"Mobile Networks and Applications"},{"key":"50_CR31","first-page":"1","volume":"21","author":"G. Wegner","year":"1986","unstructured":"Wegner, G.: \u00dcber endliche kreispackungen in der ebene. Studia Scientiarium Mathematicarium Hungarica\u00a021, 1\u201328 (1986)","journal-title":"Studia Scientiarium Mathematicarium Hungarica"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11814856_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:52Z","timestamp":1605644092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11814856_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540371892","9783540371908"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11814856_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}