{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:57:19Z","timestamp":1729637839186,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/srds.2015.10","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T22:15:07Z","timestamp":1452204907000},"page":"238-245","source":"Crossref","is-referenced-by-count":8,"title":["Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures"],"prefix":"10.1109","author":[{"given":"Alexandre","family":"Maurer","sequence":"first","affiliation":[]},{"given":"Sebastien","family":"Tixeuil","sequence":"additional","affiliation":[]},{"given":"Xavier","family":"Defago","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/11516798_21"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.10.007"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2009.25"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2002.1180170"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/2332432.2332505","article-title":"Lewis Tseng, and Guanfeng Liang. Iterative approximate Byzantine consensus in arbitrary directed graphs. In","author":"vaidya","year":"2012","journal-title":"Proc ACM Symp on Principles of Distributed Computing PODC'12"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35668-1_6"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138036"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2005.42"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_47"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16023-3_10"},{"key":"ref14","article-title":"Bounding the impact of unbounded attacks in stabilization","author":"dubois","year":"2011","journal-title":"IEEE Transactions on Parallel and Distributed Systems (TPDS)"},{"key":"ref15","article-title":"Maximum metric spanning tree made Byzantine tolerant. In David Peleg","author":"dubois","year":"2011","journal-title":"Proceedings of DISC 2011 Lecture Notes in Computer Science (LNCS) Rome Italy"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1829"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011807"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"Pease. The Byzantine generals problem","volume":"4","author":"leslie","year":"1982","journal-title":"ACM Trans Program Lang Syst"},{"year":"0","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0082-4"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1145\/1073814.1073841","article-title":"On reliable broadcast in a radio network. In Marcos Kawazoe Aguilera and James Aspnes, editors","author":"bhandari","year":"2005","journal-title":"PODC"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35668-1_7"},{"key":"ref3","first-page":"1","article-title":"ODSBR: An on-demand secure byzantine resilient routing protocol for wireless ad hoc networks","volume":"11","author":"awerbuch","year":"2007","journal-title":"ACM Transactions on Information and System Security"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2012.668546"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2010.5544268"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.1001"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1060"},{"key":"ref7","first-page":"173","article-title":"Practical Byzantine fault tolerance","author":"castro","year":"1999","journal-title":"OSDI"},{"key":"ref2","article-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"attiya","year":"1998","journal-title":"McGraw-Hill Publishing Company New York"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"year":"0","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2006.302434"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2001.969758"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00325-0"},{"key":"ref24","first-page":"1","article-title":"Stabilizing link-coloration of arbitrary networks with unbounded Byzantine faults","volume":"1","author":"masuzawa","year":"2007","journal-title":"International Journal of Principles and Applications of Information Science and Technology (PAIST)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-49823-0_31"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_18"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2012.15"}],"event":{"name":"2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS)","start":{"date-parts":[[2015,9,28]]},"location":"Montreal, QC, Canada","end":{"date-parts":[[2015,10,1]]}},"container-title":["2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7371402\/7371451\/07371588.pdf?arnumber=7371588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T12:03:52Z","timestamp":1692187432000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7371588\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/srds.2015.10","relation":{},"subject":[],"published":{"date-parts":[[2015,9]]}}}