{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:12:24Z","timestamp":1725466344710},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311031"},{"type":"electronic","value":"9783642311048"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31104-8_11","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T12:59:54Z","timestamp":1340629194000},"page":"123-134","source":"Crossref","is-referenced-by-count":1,"title":["Wireless Network Stability in the SINR Model"],"prefix":"10.1007","author":[{"given":"Eyj\u00f3lfur Ingi","family":"\u00c1sgeirsson","sequence":"first","affiliation":[]},{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[]},{"given":"Pradipta","family":"Mitra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Andrews, M., Dinitz, M.: Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In: INFOCOM, pp. 1332\u20131340 (2009)","DOI":"10.1109\/INFCOM.2009.5062048"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"\u00c1sgeirsson, E.I., Halld\u00f3rsson, M.M., Mitra, P.: A Fully Distributed Algorithm for Throughput Performance in Wireless Networks. In: CISS (2012)","DOI":"10.1109\/CISS.2012.6310846"},{"key":"11_CR3","unstructured":"Asmussen, S.: Applied Probability and Queues, 2nd edn. Springer (2003)"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1239\/aap\/1151337082","volume":"38","author":"A. Dimakis","year":"2006","unstructured":"Dimakis, A., Walrand, J.: Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits. Advances in Applied Probabability\u00a038(2), 505\u2013521 (2006)","journal-title":"Advances in Applied Probabability"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511581274"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Halld\u00f3rsson, M.M., Wattenhofer, R., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: INFOCOM, pp. 1872\u20131880 (April 2009)","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-04128-0_33","volume-title":"Algorithms - ESA 2009","author":"M.M. Halld\u00f3rsson","year":"2009","unstructured":"Halld\u00f3rsson, M.M.: Wireless Scheduling with Power Control. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 361\u2013372. Springer, Heidelberg (2009)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-642-22012-8_50","volume-title":"Automata, Languages and Programming","author":"M.M. Halld\u00f3rsson","year":"2011","unstructured":"Halld\u00f3rsson, M.M., Mitra, P.: Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 625\u2013636. Springer, Heidelberg (2011)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Mitra, P.: Wireless Capacity with Oblivious Power in General Metrics. In: SODA (2011)","DOI":"10.1137\/1.9781611973082.119"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Halldorsson, M.M., Mitra, P.: Wireless capacity and admission control in cognitive radio. In: INFOCOM (2012)","DOI":"10.1109\/INFCOM.2012.6195834"},{"key":"11_CR11","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.M. Halld\u00f3rsson","year":"2009","unstructured":"Halld\u00f3rsson, M.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.\u00a05555, pp. 525\u2013536. Springer, Heidelberg (2009)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Joo, C., Lin, X., Shroff, N.: Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks. In: INFOCOM (2008)","DOI":"10.1109\/INFOCOM.2008.165"},{"key":"11_CR13","unstructured":"Kesselheim, T.: Dynamic packet scheduling in wireless networks, \n                  \n                    http:\/\/arxiv.org\/abs\/1203.1226"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Kesselheim, T.: A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model. In: SODA (2011)","DOI":"10.1137\/1.9781611973082.120"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-15763-9_16","volume-title":"Distributed Computing","author":"T. Kesselheim","year":"2010","unstructured":"Kesselheim, T., V\u00f6cking, B.: Distributed Contention Resolution in Wireless Networks. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 163\u2013178. Springer, Heidelberg (2010)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Le, L.B., Modiano, E., Joo, C., Shroff, N.B.: Longest-queue-first scheduling under SINR interference model. In: MobiHoc (2010)","DOI":"10.1145\/1860093.1860100"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Maheshwari, R., Jain, S., Das, S.R.: A measurement study of interference modeling and scheduling in low-power wireless networks. In: SenSys, pp. 141\u2013154 (2008)","DOI":"10.1145\/1460412.1460427"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Modiano, E., Shah, D., Zussman, G.: Maximizing throughput in wireless networks via gossiping. In: SIGMETRICS\/Performance, pp. 27\u201338 (2006)","DOI":"10.1145\/1140103.1140283"},{"key":"11_CR19","unstructured":"Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol Design Beyond Graph-Based Models. In: Hotnets (November 2006)"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology control meets SINR: The scheduling complexity of arbitrary topologies. In: MobiHoc, pp. 310\u2013321 (2006)","DOI":"10.1145\/1132905.1132939"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Scheideler, C., Richa, A.W., Santi, P.: An O(logn) dominating set protocol for wireless ad-hoc networks under the physical interference model. In: MobiHoc, pp. 91\u2013100 (2008)","DOI":"10.1145\/1374618.1374632"},{"issue":"12","key":"11_CR22","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1109\/9.182479","volume":"37","author":"L. Tassiulas","year":"1992","unstructured":"Tassiulas, L., Ephremides, A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automat. Contr.\u00a037(12), 1936\u20131948 (1992)","journal-title":"IEEE Trans. Automat. Contr."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31104-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:44:52Z","timestamp":1620128692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31104-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311031","9783642311048"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31104-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}