{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:58:26Z","timestamp":1725519506833},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540885818"},{"type":"electronic","value":"9783540885825"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88582-5_28","type":"book-chapter","created":{"date-parts":[[2008,10,14]],"date-time":"2008-10-14T21:28:50Z","timestamp":1224019730000},"page":"286-297","source":"Crossref","is-referenced-by-count":5,"title":["Relay Nodes in Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Gruia","family":"C\u0103linescu","sequence":"first","affiliation":[]},{"given":"Sutep","family":"Tongngam","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/TC.2007.250629","volume":"56","author":"E.L. Lloyd","year":"2007","unstructured":"Lloyd, E.L., Xue, G.: Relay node placement in wireless sensor networks. IEEE Transactions on Computers\u00a056(1), 134\u2013138 (2007)","journal-title":"IEEE Transactions on Computers"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Cheng, X., Du, D.Z., Wang, L., Xu, B.: Relay sensor placement in wireless sensor networks. ACM Wireless Networks (January 2007)","DOI":"10.1007\/s11276-006-0724-8"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0020-0190(98)00201-4","volume":"69","author":"G. Lin","year":"1999","unstructured":"Lin, G., Xue, G.: Steiner tree problem with minimum number of steiner points and bounded edge-length. Information Processing Letters\u00a069, 53\u201357 (1999)","journal-title":"Information Processing Letters"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1008384012064","volume":"18","author":"D. Chen","year":"2000","unstructured":"Chen, D., Du, D.Z., Hu, X., Lin, G., Wang, L., Xu, G.: Approximation for steiner trees with minimum number of steiner points. Journal of Global Optimization\u00a018, 17\u201333 (2000)","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(00)00095-8","volume":"75","author":"I.I. M\u0103ndoiu","year":"2000","unstructured":"M\u0103ndoiu, I.I., Zelikovsky, A.Z.: A note on the mst heuristic for bounded edge-length steiner trees with minimum number of steiner points. Inf. Process. Lett.\u00a075(4), 165\u2013167 (2000)","journal-title":"Inf. Process. Lett."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/j.comcom.2004.12.032","volume":"29","author":"J. Tang","year":"2006","unstructured":"Tang, J., Hao, B., Sen, A.: Relay node placement in large scale wireless sensor networks. Computer Communications\u00a029, 490\u2013501 (2006)","journal-title":"Computer Communications"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Computing and Combinatorics","author":"H. Liu","year":"2005","unstructured":"Liu, H., Wan, P.J., Jia, X.: Fault tolerant relay node placement in wireless sensor networks. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, Springer, Heidelberg (2005)"},{"key":"28_CR8","unstructured":"Wang, Q., Takahara, G., Hassanein, H., Xu, K.: On relay node placement and locally optimal traffic allocation in heterogeneous wireless sensor networks. In: IEEE Conference on Local Computer Networks (LCN 2005) (2005)"},{"key":"28_CR9","unstructured":"Wang, Q., Xu, K., Takahara, G., Hassanein, H.: Locally optimally relay node placement in heterogeneous wireless sensor networks. IEEE GlobeCom, 3549\u20133553 (2005)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Kashyap, A., Khuller, S., Shayman, M.: Relay placement for higher order connectivity in wireless sensor networks. In: INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, pp. 1\u201312 (April 2006)","DOI":"10.1109\/INFOCOM.2006.273"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1006\/jagm.1996.0052","volume":"21","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B.: Improved approximation algorithms for uniform connectivity problems. Journal of Algorithms\u00a021, 433\u2013450 (1996)","journal-title":"Journal of Algorithms"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Zhang, W., Xue, G., Misra, S.: Fault-tolerant relay node placement in wireless sensor networks: Problems and algorithms. In: INFOCOM 2007. 26th IEEE International Conference on Computer Communications. Proceedings, pp. 1649\u20131657 (May 2007)","DOI":"10.1109\/INFCOM.2007.193"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Han, X., Cao, X., Lloyd, E., Shen, C.C.: Fault-tolerant relay node placement in heterogeneous wireless sensor networks. In: INFOCOM 2007. 26th IEEE International Conference on Computer Communications. Proceedings, pp. 1667\u20131675 (May 2007)","DOI":"10.1109\/INFCOM.2007.195"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A. Zelikovsky","year":"1993","unstructured":"Zelikovsky, A.: An 11\/6-approximation algorithm for the network Steiner problem. Algorithmica\u00a09, 463\u2013470 (1993)","journal-title":"Algorithmica"},{"issue":"3","key":"28_CR15","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1137\/S0097539795281086","volume":"26","author":"A. Borchers","year":"1997","unstructured":"Borchers, A., Du, D.Z.: The k-steiner ratio in graphs. SIAM Journal on Computing\u00a026(3), 857\u2013869 (1997)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88582-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T13:08:01Z","timestamp":1557839281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88582-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540885818","9783540885825"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88582-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}