{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T15:53:06Z","timestamp":1677772386229},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,1,21]],"date-time":"2015-01-21T00:00:00Z","timestamp":1421798400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s11227-015-1379-y","type":"journal-article","created":{"date-parts":[[2015,1,20]],"date-time":"2015-01-20T06:55:14Z","timestamp":1421736914000},"page":"1587-1603","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Byzantine consensus for unknown dynamic networks"],"prefix":"10.1007","volume":"71","author":[{"given":"Erfan","family":"Taheri","sequence":"first","affiliation":[]},{"given":"Mohammad","family":"Izadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,21]]},"reference":[{"issue":"2","key":"1379_CR1","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease M, Shostak R, Lamport L (1980) Reaching agreement in the presence of faults. J ACM (JACM) 27(2):228\u2013234","journal-title":"J ACM (JACM)"},{"issue":"3","key":"1379_CR2","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"M Pease","year":"1982","unstructured":"Pease M, Shostak R, Lamport L (1982) The Byzantine generals problem. ACM Trans Program Lang Syst 4(3):382\u2013401","journal-title":"ACM Trans Program Lang Syst"},{"issue":"2","key":"1379_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1504\/IJCCBS.2011.041257","volume":"2","author":"M Correia","year":"2011","unstructured":"Correia M, Veronese GS, Neves NF, Verissimo P (2011) Byzantine consensus in asynchronous message-passing systems: a survey. Int J Crit Comput Based Syst 2(2):141\u2013161","journal-title":"Int J Crit Comput Based Syst"},{"issue":"1","key":"1379_CR4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.compeleceng.2009.06.002","volume":"36","author":"SS Wang","year":"2010","unstructured":"Wang SS, Yan K-Q, Wang S-C (2010) An optimal solution for Byzantine agreement under a hierarchical. Comput Electric Eng (Elsevier) 36(1):100\u2013113","journal-title":"Comput Electric Eng (Elsevier)"},{"issue":"3","key":"1379_CR5","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/j.adhoc.2011.07.005","volume":"10","author":"M-L Chiang","year":"2012","unstructured":"Chiang M-L (2012) Eventually Byzantine agreement on CDS-based mobile ad hoc network. Ad Hoc Netw 10(3):388\u2013400","journal-title":"Ad Hoc Netw"},{"key":"1379_CR6","unstructured":"Krings A, Feyer T (1999) The Byzantine agreement problem: optimal early stopping. In: Proceedings of the 32nd annual Hawaii international conference on systems sciences, 1999, HICSS-32, Maui"},{"issue":"9","key":"1379_CR7","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1109\/TPDS.2002.1036062","volume":"13","author":"J Wu","year":"2002","unstructured":"Wu J (2002) Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links. IEEE Trans Parallel Distrib Syst 13(9):866\u2013881","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1379_CR8","doi-asserted-by":"crossref","unstructured":"Borran F, Prakash R, Schiper A (2008) Extending Paxos\/LastVoting with an adequate communication layer for wireless ad hoc networks. In: Proceedings of the symposium on reliable distributed systems, SRDS, pp 227\u2013236","DOI":"10.1109\/SRDS.2008.21"},{"issue":"1","key":"1379_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s00446-009-0084-6","volume":"22","author":"B Charron-Bost","year":"2009","unstructured":"Charron-Bost B, Schiper A (2009) The heard-of model: computing in distributed systems with benign faults. Distribut Comput DC 22(1):49\u201371","journal-title":"Distribut Comput DC"},{"issue":"3","key":"1379_CR10","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00130109","volume":"10","author":"HR Arabnia","year":"1996","unstructured":"Arabnia HR, Bhandarkar SM (1996) Parallel stereocorrelation on a reconfigurable multi-ring network. J Supercomput 10(3):243\u2013269","journal-title":"J Supercomput"},{"issue":"11","key":"1379_CR11","doi-asserted-by":"crossref","first-page":"1783","DOI":"10.1016\/0167-8191(95)00032-9","volume":"21","author":"SM Bhandarkar","year":"1995","unstructured":"Bhandarkar SM, Arabnia HR (1995) The REFINE multiprocessor: theoretical properties and algorithms. J Parallel Comput 21(11):1783\u20131805","journal-title":"J Parallel Comput"},{"key":"1379_CR12","unstructured":"Cavin D, Sasson Y, Schiper A (2004) Consensus with unknown participants or fundamental self-organization, ad-hoc networks and wireless. In: Proceedings of the third international conference, ADHOC-NOW 2004, Vancouver, 22\u201324 July 2004, pp 135\u2013148"},{"key":"1379_CR13","doi-asserted-by":"crossref","unstructured":"Cavin D, Sasson Y, Schiper A (2005) Reaching agreement with unknown participants in mobile self-organized networks in spite of process crashes. In: EPFL\u2014LSR research report","DOI":"10.1007\/978-3-540-28634-9_11"},{"key":"1379_CR14","unstructured":"Greve F, Tixeuil S (2007) Knowledge connectivity vs. synchrony requirements for fault- tolerant agreement in unknown networks. In: 37th annual iEEE\/IFIP international conference on dependable systems and networks, 2007, DSN \u201907, pp 82\u201391, 25\u201328 June 2007"},{"key":"1379_CR15","doi-asserted-by":"crossref","unstructured":"Greve F, Tixeuil S (2010) Conditions for the solvability of fault-tolerant consensus in asynchronous unknown networks. In: Proceedings of the third international workshop on reliability, availability, and security, WRAS \u201910","DOI":"10.1145\/1953563.1953564"},{"key":"1379_CR16","unstructured":"Alchieri EAP, Bessani AN, Fraga JdS, Greve F (2008) Byzantine consensus with unknown participants, principles of distributed systems. In: Proceedings of the 12th international conference, OPODIS 2008, vol 5401, pp 22\u201340, Luxor, 15\u201318 December 2008"},{"key":"1379_CR17","doi-asserted-by":"crossref","unstructured":"Tsai J, Chang C-C (2010) A weaker knowledge connectivity condition sufficient for fault-tolerant consensus with unknown participants. In: Proceeding of the international computer software and applications conference, COMPSAC, pp 273\u2013278","DOI":"10.1109\/COMPSAC.2010.34"},{"issue":"2","key":"1379_CR18","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M Fisher","year":"1985","unstructured":"Fisher M, Lynch N, Paterson M (1985) Impossibility of distributed consensus with one faulty process. J ACM 32(2):374\u2013382","journal-title":"J ACM"},{"key":"1379_CR19","unstructured":"Costa V, Greve F (2008) Implementing fault-tolerant consensus over unknown networks. In: 7th international information and telecommunication technologies symposium"},{"key":"1379_CR20","doi-asserted-by":"crossref","unstructured":"Moniz H, Neves NF, Correia M, Ver\u00edssimo P (2006) Experimental comparison of local and shared coin randomized consensus protocols. In: Proceeding, reliable distributed systems, 2006. 25th IEEE symposium on SRDS \u201906, pp 235\u2013244","DOI":"10.1109\/SRDS.2006.19"},{"key":"1379_CR21","doi-asserted-by":"crossref","unstructured":"Bracha G (1984) An asynchronous (n-1)\/3-resilient consensus protocol. In: Proceedings of the third annual ACM symposium on principles of distributed computing, pp 154\u2013162","DOI":"10.1145\/800222.806743"},{"key":"1379_CR22","doi-asserted-by":"crossref","unstructured":"Cachin C, Kursawe K, Shoup V (2000) Random oracles in constantinople: practical asynchronous Byzantine agreement using cryptography. In: 19th ACM symposium on principles of distributed computing (PODC)","DOI":"10.1145\/343477.343531"},{"key":"1379_CR23","doi-asserted-by":"crossref","unstructured":"Mostefaoui A, Mourgaya E, Raynal M (2003) Asynchronous implementation of failure detectors. In: Proceedings of the international IEEE conference on dependable systems and networks (DSN\u201903), pp 351\u2013360","DOI":"10.1109\/DSN.2003.1209946"},{"issue":"12","key":"1379_CR24","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1093\/comjnl\/bxs084","volume":"55","author":"F Greve","year":"2012","unstructured":"Greve F, Sens P, Arantes L, Simon V (2012) Eventually strong failure detector with unknown membership. Comput J 55(12):1507\u20131524","journal-title":"Comput J"},{"key":"1379_CR25","unstructured":"Lynch, N.: Distributed algorithms. Morgan Kaufmann, San Francisco (1997)"},{"issue":"4","key":"1379_CR26","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.csi.2005.03.004","volume":"28","author":"S-C Wanga","year":"2006","unstructured":"Wanga S-C, Yanb K-Q (2006) Byzantine agreement under dual failure mobile network. Comput Stand Interfaces (Elsevier) 28(4):475\u2013492","journal-title":"Comput Stand Interfaces (Elsevier)"},{"key":"1379_CR27","doi-asserted-by":"crossref","unstructured":"Cornejo A, Lynch N, Viqar S, Welch JL (2009) Neighbor discovery in mobile ad hoc networks using an abstract MAC layer. In: Annual Allerton conference on communication, control, and computing, Allerton, Monticello","DOI":"10.1109\/ALLERTON.2009.5394502"},{"key":"1379_CR28","doi-asserted-by":"crossref","unstructured":"Cornejo A, Viqar S, Welch JL (2010) Reliable neighbor discovery for mobile ad hoc networks. In: Proceeding DIALM-POMC \u201910, Proceedings of the 6th international workshop on foundations of mobile computing, pp 259\u2013277","DOI":"10.1145\/1860684.1860699"},{"issue":"4","key":"1379_CR29","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra TD, Hadzilacos V, Toueg S (1996) The weakest failure detector for solving consensus. J ACM 43(4):685\u2013722","journal-title":"J ACM"},{"issue":"2","key":"1379_CR30","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra TD, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225\u2013267","journal-title":"J ACM"},{"issue":"7","key":"1379_CR31","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport L (1978) Time, clocks, and the ordering of events in a distributed system. Commun ACM 21(7):558\u2013565","journal-title":"Commun ACM"},{"key":"1379_CR32","doi-asserted-by":"crossref","unstructured":"Moniz H, Neves NF, Correia aM (2010) Turquois: Byzantine consensus in wireless ad hoc networks. In: Dependable systems and networks\u2014DSN, pp 537\u2013546","DOI":"10.1109\/DSN.2010.5544268"},{"key":"1379_CR33","doi-asserted-by":"crossref","unstructured":"Awerbuch B, Holmer D, Nita-Rotaru C, Rubens H (2002) An on-demand secure routing protocol resilient to byzantine failures. In: Proceedings of the 1st ACM workshop on wireless security, WiSE \u201902, pp 21\u201330","DOI":"10.1145\/570681.570684"},{"key":"1379_CR34","doi-asserted-by":"crossref","unstructured":"Casteigts A, Flocchini P, Quattrociocchi W, Santoro N (2011) Time-varying graphs and dynamic networks. In: Proceeding of the 10th international conference on ad hoc networks and wireless (ADHOC-NOW\u201911), pp 346\u2013359","DOI":"10.1007\/978-3-642-22450-8_27"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1379-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-015-1379-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1379-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T21:50:43Z","timestamp":1566251443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-015-1379-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,21]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["1379"],"URL":"https:\/\/doi.org\/10.1007\/s11227-015-1379-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,21]]}}}