{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:09:47Z","timestamp":1725563387165},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642147845"},{"type":"electronic","value":"9783642147852"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14785-2_4","type":"book-chapter","created":{"date-parts":[[2010,8,23]],"date-time":"2010-08-23T19:09:21Z","timestamp":1282590561000},"page":"43-52","source":"Crossref","is-referenced-by-count":2,"title":["On Alarm Protocol in Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Jacek","family":"Cicho\u0144","sequence":"first","affiliation":[]},{"given":"Rafa\u0142","family":"Kapelko","sequence":"additional","affiliation":[]},{"given":"Jakub","family":"Lemiesz","sequence":"additional","affiliation":[]},{"given":"Marcin","family":"Zawada","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1111\/j.1475-3995.1999.tb00176.x","volume":"6","author":"L. Alfandari","year":"1999","unstructured":"Alfandari, L., Paschos, V.: Approximating minimum spanning tree of depth 2. International Transactions in Operational Research\u00a06, 607\u2013622 (1999)","journal-title":"International Transactions in Operational Research"},{"key":"4_CR2","unstructured":"Clementi, A.E.F., Ianni, M.D., Monti, A., Rossi, G., SilvestriL, R.: Divide and conquer is almost optimal for the bounded-hop accumulation in ad hoc wireless networks. In: The Proceedings of SIROCCO (2005)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Penna, M.D., Silvestri, R.: On the power assignment problem in radio networks. In: Mobile Networks and Applications, MONET (2004)","DOI":"10.1023\/B:MONE.0000013624.32948.87"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Ianni, M.D., Lauria, M., Monti, A., Rossi, G., Silvestri, R.: A distributed protocol for the bounded-hops converge-cast in ad-hoc networks. In: The Proceedings of the 5th International Conference on AD-HOC Networks & Wireless (2006)","DOI":"10.1007\/11814764_7"},{"key":"4_CR5","unstructured":"Zawada, M.: Analysis of the bounded-hops converge-cast distributed protocol in ad-hoc networks. In: The Proceedings of the 3nd International Workshop on Algorithmic Aspect of Wireless Sensor Networks (2007)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Nakano, K., Olariu, S.: Randomized leader election protocols in radio networks with no collision detection. In: ISAAC, pp. 362\u2013373 (2000)","DOI":"10.1007\/3-540-40996-3_31"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Nakano, K., Olariu, S.: Uniform leader election protocols in radio networks. In: ICPP, pp. 240\u2013250 (2001)","DOI":"10.1109\/ICPP.2001.952068"},{"key":"4_CR8","first-page":"71","volume-title":"ISPAN 2002: Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks, Washington, DC, USA","author":"K. Nakano","year":"2002","unstructured":"Nakano, K., Olariu, S.: A survey on leader election protocols for radio networks. In: ISPAN 2002: Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks, Washington, DC, USA, p. 71. IEEE Computer Society, Los Alamitos (2002)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0895480100376022","volume":"14","author":"L. Gasieniec","year":"2001","unstructured":"Gasieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM J. Discrete Math.\u00a014, 207\u2013222 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: ISAAC, pp. 535\u2013549 (2002)","DOI":"10.1007\/3-540-36136-7_47"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Klonowski, M., Kutylowski, M., Zatopianski, J.: Energy efficient alert in single-hop networks of extremely weak devices. In: Algosensors (2009)","DOI":"10.1007\/978-3-642-05434-1_14"},{"key":"4_CR12","unstructured":"Hoorfar, A., Hassiani, M.: Inequalities on the lambert w function and hyperpower function. Journal of Inequalities in Pure and Applied Mathematisc\u00a09(51) (2008)"}],"container-title":["Lecture Notes in Computer Science","Ad-Hoc, Mobile and Wireless Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14785-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T15:24:10Z","timestamp":1552922650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14785-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642147845","9783642147852"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14785-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}