{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:11:23Z","timestamp":1725563483471},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_32","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"344-358","source":"Crossref","is-referenced-by-count":7,"title":["Connectivity Problem in Wireless Networks"],"prefix":"10.1007","author":[{"given":"Dariusz R.","family":"Kowalski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariusz A.","family":"Rokicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_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, 290\u2013298 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"32_CR2","volume-title":"Introduction to Analytic Number Theory","author":"T.M. Apostol","year":"1995","unstructured":"Apostol, T.M.: Introduction to Analytic Number Theory. Springer, New York (1995)"},{"doi-asserted-by":"crossref","unstructured":"Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D., Roditty, L.: Towards Algorithmically Usable SINR Models of Wireless Networks. In: Proc. 28th ACM Symposium on Principles of Distributed Computing (PODC), pp. 200\u2013209 (2009)","key":"32_CR3","DOI":"10.1145\/1582716.1582750"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-05434-1_12","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"C. Avin","year":"2009","unstructured":"Avin, C., Lotker, Z., Pasquale, F., Pignolet, Y.A.: A Note on Uniform Power Connectivity in the SINR Model. In: Dolev, S. (ed.) ALGOSENSORS 2009. LNCS, vol.\u00a05804, pp. 116\u2013127. Springer, Heidelberg (2009)"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1109\/TC.1987.1676861","volume":"36","author":"I. Chlamtac","year":"1987","unstructured":"Chlamtac, I., Kutten, S.: Tree-Based Broadcasting in Multihop Radio Networks. IEEE Transactions on Computers\u00a036, 1209\u20131223 (1987)","journal-title":"IEEE Transactions on Computers"},{"key":"32_CR6","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 Trans. on Communications\u00a039, 426\u2013433 (1991)","journal-title":"IEEE Trans. on Communications"},{"doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective Families, Superimposed Codes, and Broadcasting on Unknown Radio Networks. In: Proc. 12th Annual Symposium on Discrete Algorithms (SODA), pp. 709\u2013718 (2001)","key":"32_CR7","DOI":"10.1145\/383962.384040"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.jda.2006.07.001","volume":"5","author":"A. Dessmark","year":"2007","unstructured":"Dessmark, A., Pelc, A.: Broadcasting in Geometric Radio Networks. J. Discrete Algorithms\u00a05, 187\u2013201 (2007)","journal-title":"J. Discrete Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Fanghanel, A., Kesselheim, T., Racke, H., Voecking, B.: Oblivious Interference Scheduling. In: Proc., 28th ACM Symposium on Principles of Distributed Computing (PODC), pp. 220\u2013229 (2009)","key":"32_CR9","DOI":"10.1145\/1582716.1582752"},{"doi-asserted-by":"crossref","unstructured":"Fussen, M., Wattenhofer, R., Zollinger, A.: Interference Arises at the Receiver. In: Proc. International Conference on Wireless Networks, Communications, and Mobile Computing, WIRELESSCOM (2005)","key":"32_CR10","DOI":"10.1109\/WIRLES.2005.1549447"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-87779-0_19","volume-title":"Distributed Computing","author":"L. Gasieniec","year":"2008","unstructured":"Gasieniec, L., Kowalski, D.R., Lingas, A., Wahlen, M.: Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 274\u2013288. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Peleg, D., Xin, Q.: Faster Communication in Known Topology Radio Networks. In: Proc. 24th ACM Symposium on Principles of Distributed Computing (PODC), pp. 129\u2013137 (2005)","key":"32_CR12","DOI":"10.1145\/1073814.1073840"},{"doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Halldorsson, M., Wattenhofer, R., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: Proc. 28th Ann. IEEE Conference on Computer Communications (INFOCOM), pp. 1872\u20131880 (2009)","key":"32_CR13","DOI":"10.1109\/INFCOM.2009.5062108"},{"doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in Geometric SINR. In: Proc. 8th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 100\u2013109 (2007)","key":"32_CR14","DOI":"10.1145\/1288107.1288122"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P. Gupta","year":"2000","unstructured":"Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Transactions on Information Theory\u00a046, 388\u2013404 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-02927-1_44","volume-title":"Automata, Languages and Programming","author":"M. Halldorsson","year":"2009","unstructured":"Halldorsson, M., Wattenhofer, R.: Wireless Communication is in APX. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 525\u2013536. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Huson, M.L., Sen, A.: Broadcast Scheduling Algorithms for Radio Networks. In: Proc. IEEE Military Communications Conference (MILCOM), pp. 647\u2013651 (1995)","key":"32_CR17","DOI":"10.1109\/MILCOM.1995.483546"},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.jpdc.2005.11.004","volume":"66","author":"A. Kesselman","year":"2006","unstructured":"Kesselman, A., Kowalski, D.R.: Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks. J. Parallel and Distributed Comput.\u00a066, 578\u2013585 (2006)","journal-title":"J. Parallel and Distributed Comput."},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00446-006-0007-8","volume":"19","author":"D.R. Kowalski","year":"2007","unstructured":"Kowalski, D.R., Pelc, A.: Optimal Deterministic Broadcasting in Known Topology Radio Networks. Distributed Computing\u00a019, 185\u2013195 (2007)","journal-title":"Distributed Computing"},{"doi-asserted-by":"crossref","unstructured":"Lebhar, E., Lotker, Z.: Unit Disk Graph and Physical Interference Model: Putting Pieces Together. In: Proc., 23rd IEEE Intl. Parallel and Distributed Processing Symposium (IPDPS), pp. 1\u20138 (2009)","key":"32_CR20","DOI":"10.1109\/IPDPS.2009.5161009"},{"doi-asserted-by":"crossref","unstructured":"Moscibroda, T.: The Worst-case Capacity of Wireless Sensor Networks. In: Proc. 6th Int. Conf. on Information Processing in Sensor Networks (IPSN), pp. 1\u201310 (2007)","key":"32_CR21","DOI":"10.1145\/1236360.1236362"},{"doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How Optimal are Wireless Scheduling Protocols? In: Proc. 26th Ann. IEEE Conference on Computer Communications (INFOCOM), pp. 1433\u20131441 (2007)","key":"32_CR22","DOI":"10.1109\/INFCOM.2007.169"},{"doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The complexity of Connectivity in Wireless Networks. In: Proc. 25th Ann. IEEE Conference on Computer Communications (INFOCOM), pp. 1\u201313 (2006)","key":"32_CR23","DOI":"10.1109\/INFOCOM.2006.23"},{"doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology Control Meets SINR: the Scheduling Complexity of Arbitrary Topologies. In: Proc., 7th ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 310\u2013321 (2006)","key":"32_CR24","DOI":"10.1145\/1132905.1132939"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:47Z","timestamp":1606185587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}