{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:48:43Z","timestamp":1648846123393},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T00:00:00Z","timestamp":1191888000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2007,12,6]]},"DOI":"10.1007\/s00453-007-9078-6","type":"journal-article","created":{"date-parts":[[2007,10,8]],"date-time":"2007-10-08T12:35:55Z","timestamp":1191846955000},"page":"337-356","source":"Crossref","is-referenced-by-count":10,"title":["On the Fundamental Limits of Topology Control in\u00a0Ad\u00a0Hoc Networks"],"prefix":"10.1007","volume":"49","author":[{"given":"Andr\u00e1s","family":"Farag\u00f3","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,9]]},"reference":[{"key":"9078_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1002\/wcm.217","volume":"4","author":"A. Agarwal","year":"2004","unstructured":"Agarwal, A., Kumar, P.R.: Improved capacity bounds for wireless networks. Wirel. Commun. Mob. Comput. 4, 251\u2013261 (2004)","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"9078_CR2","doi-asserted-by":"crossref","first-page":"582","DOI":"10.2307\/1428077","volume":"29","author":"M.J.B. Appel","year":"1997","unstructured":"Appel, M.J.B., Russo, R.P.: The minimum vertex degree of a graph on uniform points in [01] d . Adv. Appl. Probab. 29, 582\u2013594 (1997)","journal-title":"Adv. Appl. Probab."},{"key":"9078_CR3","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1979","unstructured":"Billingsley, P.: Probability and Measure. Wiley, New York (1979)"},{"key":"9078_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"9078_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.2307\/3214317","volume":"26","author":"H. Dette","year":"1989","unstructured":"Dette, H., Henze, N.: The limit distribution of the largest nearest neighbour link in the unit d-cube. J.\u00a0Appl. Probab. 26, 67\u201380 (1989)","journal-title":"J.\u00a0Appl. Probab."},{"issue":"9","key":"9078_CR6","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1109\/34.232083","volume":"15","author":"A. Farag\u00f3","year":"1993","unstructured":"Farag\u00f3, A., Linder, T., Lugosi, G.: Fast nearest neighbor search in dissimilarity spaces. IEEE Trans. Pattern Anal. Mach. Intell. 15(9), 957\u2013962 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9078_CR7","doi-asserted-by":"crossref","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 Trans. Inf. Theory 46, 388\u2013404 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9078_CR8","first-page":"547","volume-title":"Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor W.H. Fleming","author":"P. Gupta","year":"1998","unstructured":"Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: McEneany, W.M., Yin, G., Zhang, Q. (eds.) Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor W.H. Fleming, pp. 547\u2013566. Birkhauser, Boston (1998)"},{"key":"9078_CR9","volume-title":"Theory and Application of Infinite Series","author":"K. Knopp","year":"1990","unstructured":"Knopp, K.: Theory and Application of Infinite Series. Dover, New York (1990)"},{"key":"9078_CR10","doi-asserted-by":"crossref","unstructured":"Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic aspects of topology control problems for ad hoc networks. In: MobiHoc\u201902, Lausanne, Switzerland, June 2002","DOI":"10.1145\/513800.513816"},{"key":"9078_CR11","volume-title":"Principles of Wireless Networks","author":"K. Pahlavan","year":"2002","unstructured":"Pahlavan, K., Krishnamurty, P.: Principles of Wireless Networks. Prentice Hall, New York (2002)"},{"key":"9078_CR12","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1214\/aoap\/1034625335","volume":"7","author":"M.D. Penrose","year":"1997","unstructured":"Penrose, M.D.: The longest edge of the random minimal spanning tree. Ann. Appl. Probab. 7, 340\u2013361 (1997)","journal-title":"Ann. Appl. Probab."},{"key":"9078_CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/(SICI)1098-2418(199909)15:2<145::AID-RSA2>3.0.CO;2-G","volume":"15","author":"M.D. Penrose","year":"1999","unstructured":"Penrose, M.D.: On k-connectivity for a geometric random graph. Random Struct. Algorithms 15, 145\u2013164 (1999)","journal-title":"Random Struct. Algorithms"},{"key":"9078_CR14","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1214\/aop\/1022677261","volume":"27","author":"M.D. Penrose","year":"1999","unstructured":"Penrose, M.D.: A strong law for the longest edge of the minimal spanning tree. Ann. Appl. Probab. 27, 246\u2013260 (1999)","journal-title":"Ann. Appl. Probab."},{"key":"9078_CR15","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1109\/18.42219","volume":"35","author":"T.K. Philips","year":"1989","unstructured":"Philips, T.K., Panwar, S.S., Tantawi, A.N.: Connectivity properties of a packet radio network model. IEEE Trans. Inf. Theory 35, 1044\u20131047 (1989)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9078_CR16","doi-asserted-by":"crossref","unstructured":"Ramanathan, R., Rosales-Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: IEEE INFOCOM\u20192000, Tel Aviv, Israel, March 2000, pp. 404\u2013413 (2000)","DOI":"10.1109\/INFCOM.2000.832213"},{"key":"9078_CR17","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Yi, C.-W.: Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks. In: MobiHoc\u201904, Roppongi, Japan, May 2004","DOI":"10.1145\/989459.989461"},{"key":"9078_CR18","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1023\/B:WINE.0000013081.09837.c0","volume":"10","author":"F. Xue","year":"2004","unstructured":"Xue, F., Kumar, P.R.: The number of neighbors needed for connectivity of wireless networks. Wirel. Netw. 10, 169\u2013181 (2004)","journal-title":"Wirel. Netw."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9078-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9078-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9078-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:00Z","timestamp":1559123100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9078-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,9]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,12,6]]}},"alternative-id":["9078"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9078-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,9]]}}}