{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T06:39:33Z","timestamp":1778654373385,"version":"3.51.4"},"publisher-location":"Dordrecht","reference-count":15,"publisher":"Springer Netherlands","isbn-type":[{"value":"9789400706378","type":"print"},{"value":"9789400706385","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-94-007-0638-5_1","type":"book-chapter","created":{"date-parts":[[2011,4,11]],"date-time":"2011-04-11T13:13:46Z","timestamp":1302527626000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Performance of Gossip Algorithms in Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Marco","family":"Baldi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Chiaraluce","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elma","family":"Zanaj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,12]]},"reference":[{"key":"1_CR1","unstructured":"Barrenetxea G et al (2007) DemoAbstract: SensorScope, an urban environmental monitoring network. In: 4th European conference on wireless sensor networks (EWSN 2007), Delft, Netherlands, Jan 2007"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(72)90001-5","volume":"2","author":"B Baker","year":"1972","unstructured":"Baker B, Shostak R (1972) Gossips and telephones. Discrete Math 2(3):191\u2013193","journal-title":"Discrete Math"},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0012-365X(73)90121-0","volume":"4","author":"G Berman","year":"1973","unstructured":"Berman G (1973) The gossip problem. Discrete Math 4(1):91","journal-title":"Discrete Math"},{"issue":"6","key":"1_CR4","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S Boyd","year":"2006","unstructured":"Boyd S, Ghosh A, Prabhakar B, Shah D (2006) Randomized gossip algorithms. IEEE Trans Inf Theory 52(6):2508\u20132530","journal-title":"IEEE Trans Inf Theory"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Kempe D, Dobra A, Gehrke J (2003) Gossip based computation of aggregate information. In: IEEE conference on foundation of computer science, Cambridge, MA, Oct 2003, pp 482\u2013491","DOI":"10.1109\/SFCS.2003.1238221"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.24138\/jcomss.v5i1.210","volume":"5","author":"E Zanaj","year":"2009","unstructured":"Zanaj E, Baldi M, Chiaraluce F (2009) Optimal share factors in the push-sum algorithm for ring and random geometric graph sensor networks. J Commun Softw Syst 5(1):9\u201318","journal-title":"J Commun Softw Syst"},{"key":"1_CR7","unstructured":"Baldi M, Chiaraluce F, Zanaj E (2009) Fault tolerance in sensor networks: performance comparison of some gossip algorithms. In: 7th international workshop on intelligent solutions in embedded systems (WISES 2009), Ancona, Italy, June 2009, pp 11\u201320"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/MSP.2005.1458287","volume":"22","author":"N Patwari","year":"2005","unstructured":"Patwari N, Ash JN, Kyperountas S, Hero AO III, Moses RL, Correal NS (2005) Locating the nodes: cooperative localization in wireless sensor networks. IEEE Signal Process Mag 22(4):54\u201369","journal-title":"IEEE Signal Process Mag"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1109\/TSP.2007.908946","volume":"56","author":"AG Dimakis","year":"2008","unstructured":"Dimakis AG, Sarwate AD, Wainwright MJ (2008) Geographic gossip: efficient averaging for sensor networks. IEEE Trans Signal Process 56(3):1205\u20131216","journal-title":"IEEE Trans Signal Process"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Zanaj E, Baldi M, Chiaraluce F (2007) Efficiency of the gossip algorithm for wireless sensor networks. In: 2007 international conference on software, telecommunications and computer networks (SoftCOM 2007), Split, Dubrovnik, Croatia, Sept 2007, Paper 7072","DOI":"10.1109\/SOFTCOM.2007.4446065"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.24138\/jcomss.v4i2.223","volume":"4","author":"E Zanaj","year":"2008","unstructured":"Zanaj E, Baldi M, Chiaraluce F (2008) Efficiency of unicast and broadcast gossip algorithms for wireless sensor networks. J Commun Softw Syst 4(2):105\u2013112","journal-title":"J Commun Softw Syst"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Baldi M, Chiaraluce F, Zanaj E (2008) Comparison of averaging algorithms for wireless sensor networks. In: International conference on information and communication technologies (ICTTA\u201908), Damascus, Syria, Apr 2008, Paper TEL05_7","DOI":"10.1109\/ICTTA.2008.4530166"},{"issue":"1 and 2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1080\/03081089508818377","volume":"39","author":"R Merris","year":"1995","unstructured":"Merris R (1995) A survey of graph Laplacians. Linear Multilinear Algebra 39(1 and 2):19\u201331","journal-title":"Linear Multilinear Algebra"},{"key":"1_CR14","first-page":"871","volume-title":"Graph theory, combinatorics, and applications","author":"B Mohar","year":"1991","unstructured":"Mohar B (1991) The Laplacian spectrum of graphs. In: Alavi Y, Chartrand G, Oellermann OR, Schwenk AJ (eds) Graph theory, combinatorics, and applications, vol 2. Wiley, New York, pp 871\u2013898"},{"key":"1_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel methods for pattern analysis","author":"J Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor J, Cristianini N (2004) Kernel methods for pattern analysis. Cambridge University Press, London"}],"container-title":["Lecture Notes in Electrical Engineering","Solutions on Embedded Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-94-007-0638-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T06:02:29Z","timestamp":1714716149000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-94-007-0638-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9789400706378","9789400706385"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-94-007-0638-5_1","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"value":"1876-1100","type":"print"},{"value":"1876-1119","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"12 April 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}