{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:47Z","timestamp":1763468087318},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,11,27]],"date-time":"2012-11-27T00:00:00Z","timestamp":1353974400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s11276-012-0522-4","type":"journal-article","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T13:22:04Z","timestamp":1353936124000},"page":"1121-1133","source":"Crossref","is-referenced-by-count":16,"title":["Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes"],"prefix":"10.1007","volume":"19","author":[{"given":"Wei","family":"Ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ram","family":"Ramanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ananthram","family":"Swami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amotz","family":"Bar-Noy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew P.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prithwish","family":"Basu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,27]]},"reference":[{"issue":"8","key":"522_CR1","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/S0305-0548(00)00007-1","volume":"28","author":"C. F. Bazlamacci","year":"2001","unstructured":"Bazlamacci, C. F., & Hindi, K. S. (2001). Minimum-weight spanning tree algorithms: A survey and empirical study. Computers & Operations Research, 28(8), 767\u2013785.","journal-title":"Computers & Operations Research"},{"key":"522_CR2","doi-asserted-by":"crossref","unstructured":"\u010cagalj, M., Hubaux, J., Enz, C. (2002). Minimum-energy broadcast in all-wireless networks: Np-completeness and distribution issues. In Proceedings of the ACM MobiCom, pp. 172\u2013182.","DOI":"10.1145\/570645.570667"},{"key":"522_CR3","doi-asserted-by":"crossref","unstructured":"Chiu, H. S., Wu, B., Yeung, K. L., & Lui, K. S. (2008). Widest spanning tree for multi-channel multi-interface wireless mesh networks. In Proceedings of the IEEE WCNC, pp. 2194\u20132199.","DOI":"10.1109\/WCNC.2008.388"},{"issue":"11","key":"522_CR4","doi-asserted-by":"crossref","first-page":"2081","DOI":"10.1109\/JSAC.2006.881621","volume":"24","author":"C. T. Chou","year":"2006","unstructured":"Chou, C. T., Misra, A., & Qadir, J. (2006). Low-latency broadcast in multirate wireless mesh networks. IEEE Journal on Selected Areas in Communications (JSAC), 24(11), 2081\u20132091.","journal-title":"IEEE Journal on Selected Areas in Communications (JSAC)"},{"key":"522_CR5","unstructured":"Erd\u0151s, P., & R\u00e9nyi, A. (1960). On the evolution of random graphs. In Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp. 17\u201361."},{"issue":"4","key":"522_CR6","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U. (1998). A threshold of ln n for approximating set cover. Journal of the ACM, 45(4), 634\u2013652.","journal-title":"Journal of the ACM"},{"issue":"4","key":"522_CR7","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"Guha, S., & Khuller, S. (1998). Approximation algorithms for connected dominating sets. Algorithmica, 20(4), 374\u2013387.","journal-title":"Algorithmica"},{"issue":"1","key":"522_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S. Guha","year":"1999","unstructured":"Guha, S., & Khuller, S. (1999). Improved methods for approximating node weighted steiner trees and connected dominating sets. Information and Computation, 150(1), 57\u201374.","journal-title":"Information and Computation"},{"issue":"1","key":"522_CR9","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P. N. Klein","year":"1995","unstructured":"Klein, P. N. & Ravi, R. (1995). A nearly best-possible approximation algorithm for node-weighted steiner trees. Journal of Algorithms, 19(1), 104\u2013115.","journal-title":"Journal of Algorithms"},{"key":"522_CR10","volume-title":"Algorithm design","author":"J. Kleinberg","year":"2005","unstructured":"Kleinberg, J. & Tardos, E. (2005). Algorithm design. Boston, MA: Addison Wesley."},{"issue":"1","key":"522_CR11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1119759.1119762","volume":"10","author":"P. Kyasanur","year":"2006","unstructured":"Kyasanur, P., & Vaidya, N. H. (2006). Routing and link-layer protocols for multi-channel multi-interface ad hoc wireless networks. ACM SIGMOBILE Mobile Computing and Communications Review, 10(1), 31\u201343.","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"issue":"2","key":"522_CR12","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MWC.2006.1632478","volume":"13","author":"P. Kyasanur","year":"2006","unstructured":"Kyasanur, P., So, J., Chereddi, C., Vaidya, N. H. (2006). Multichannel mesh networks: Challenges and protocols. IEEE Wireless Communications, 13(2), 30\u201336.","journal-title":"IEEE Wireless Communications"},{"key":"522_CR13","doi-asserted-by":"crossref","unstructured":"Li, L., Qin, B., Zhang, C., & Li, H. (2007). Efficient broadcasting in multi-radio multi-channel and multi-hop wireless networks based on self-pruning. In Proceedings of the HPCC, pp. 484\u2013495.","DOI":"10.1007\/978-3-540-75444-2_47"},{"issue":"4","key":"522_CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/TMC.2006.1599406","volume":"5","author":"W. F. Liang","year":"2006","unstructured":"Liang, W. F. (2006). Approximate minimum-energy multicasting in wireless ad hoc networks. IEEE Transactions on Mobile Computing 5(4), 377\u2013387.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"522_CR15","unstructured":"Mannucci, M. A., Sparks, L., & Struppa, D. C. (2006). Simplicial models of social aggregation I. URL: http:\/\/arxiv.org\/abs\/cs\/0604090 ."},{"key":"522_CR16","volume-title":"Elements of algebraic topology","author":"J. R. Munkres","year":"1984","unstructured":"Munkres, J. R. (1984). Elements of algebraic topology. Menlo Park, CA: Addison-Wesley."},{"issue":"4","key":"522_CR17","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1002\/wcm.701","volume":"9","author":"H. L. Nguyen","year":"2009","unstructured":"Nguyen, H. L., & Nguyen, U. T. (2009). Channel assignment for multicast in multi-channel multi-radio wireless mesh networks. Wireless Communications and Mobile Computing, 9(4), 557\u2013571.","journal-title":"Wireless Communications and Mobile Computing"},{"key":"522_CR18","doi-asserted-by":"crossref","unstructured":"Ramanathan, R., Bar-Noy, A., Basu, P., Johnson, M., Ren, W., Swami, A., et\u00a0al. (2011). Beyond graphs: Capturing groups in networks. In Proceedings of the IEEE NetSciCom.","DOI":"10.1109\/INFCOMW.2011.5928935"},{"key":"522_CR19","unstructured":"Raniwala, A., & Chiueh, T. (2005). Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network. In Proceedings of the IEEE INFOCOM, pp. 2223\u20132234."},{"key":"522_CR20","doi-asserted-by":"crossref","unstructured":"Redi, J., & Ramanathan, R. (2011). The DARPA WNaN network architecture. In Proceedings of the IEEE MILCOM, Baltimore.","DOI":"10.1109\/MILCOM.2011.6127657"},{"issue":"45","key":"522_CR21","doi-asserted-by":"crossref","first-page":"6451","DOI":"10.1016\/j.tcs.2011.07.008","volume":"412","author":"W. Ren","year":"2011","unstructured":"Ren, W., & Zhao, Q. (2011). A note on: \u2018Algorithms for connected set cover problem and fault-tolerant connected set cover problem\u2019. Theoretical Computer Science, 412(45), 6451\u20136454.","journal-title":"Theoretical Computer Science"},{"key":"522_CR22","doi-asserted-by":"crossref","unstructured":"Tang, J., Xue, G., & Zhang, W. (2005). Interference-aware topology control and QoS routing in multi-channel wireless mesh networks. In Proceedings of the ACM MobiHoc, pp. 68\u201377.","DOI":"10.1145\/1062689.1062700"},{"issue":"6","key":"522_CR23","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1023\/A:1020716919751","volume":"7","author":"J. E. Wieselthier","year":"2002","unstructured":"Wieselthier, J. E., Nguyen, G. D., & Ephremides, A. (2002). Energy-efficient broadcast and multicast trees in wireless networks. Mobile Networks and Applications, 7(6), 481\u2013492.","journal-title":"Mobile Networks and Applications"},{"issue":"8-10","key":"522_CR24","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1016\/j.tcs.2008.11.005","volume":"410","author":"Z. Zhang","year":"2009","unstructured":"Zhang, Z., Gao, X. F., & Wu, W. L. (2009). Algorithms for connected set cover problem and fault-tolerant connected set cover problem. Theoretical Computer Science, 410(8\u201310), 812\u2013817.","journal-title":"Theoretical Computer Science"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-012-0522-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-012-0522-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-012-0522-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T03:38:51Z","timestamp":1687837131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-012-0522-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,27]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["522"],"URL":"https:\/\/doi.org\/10.1007\/s11276-012-0522-4","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,27]]}}}