{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:59:46Z","timestamp":1743116386450,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031673207"},{"type":"electronic","value":"9783031673214"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-67321-4_17","type":"book-chapter","created":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T16:02:07Z","timestamp":1724515327000},"page":"247-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["BeRGeR: Byzantine-Robust Geometric Routing"],"prefix":"10.1007","author":[{"given":"Brown","family":"Zaz","sequence":"first","affiliation":[]},{"given":"Mikhail","family":"Nesterenko","sequence":"additional","affiliation":[]},{"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,25]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Imieli\u0144ski, T., Navas, J.C.: Gps-based geographic addressing, routing, and resource discovery. Commun. ACM. 42(4), 86\u201392 (1999)","key":"17_CR1","DOI":"10.1145\/299157.299176"},{"doi-asserted-by":"crossref","unstructured":"Ko, Y.B., Vaidya, N.H.: Geocasting in mobile ad hoc networks: Location-based multicast algorithms. In: Proceedings WMCSA 1999 Second IEEE Workshop on Mobile Computing Systems and Applications, pp. 101\u2013110. IEEE (1999)","key":"17_CR2","DOI":"10.1109\/MCSA.1999.749282"},{"doi-asserted-by":"crossref","unstructured":"Ko, Y.B., Vaidya, N.H.: Location-aided routing (lar) in mobile ad hoc networks. Wirel. Networks 6(4), 307\u2013321 (2000)","key":"17_CR3","DOI":"10.1023\/A:1019106118419"},{"unstructured":"Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proceedings of 11th Canadian Conference on Computational Geometry, Citeseer (1999)","key":"17_CR4"},{"doi-asserted-by":"publisher","unstructured":"Johnson, D.B., Maltz, D.A.: Dynamic source routing in Ad Hoc wireless networks. In: Imielinski, T., Korth, H.F. (eds.) Mobile Computing. The Kluwer International Series in Engineering and Computer Science, vol. 353, pp. 153\u2013181. Springer, Boston, MA (1996). https:\/\/doi.org\/10.1007\/978-0-585-29603-6_5","key":"17_CR5","DOI":"10.1007\/978-0-585-29603-6_5"},{"doi-asserted-by":"crossref","unstructured":"Perkins, C., Royer, E.: Ad-hoc on-demand distance vector routing. In: Proceedings WMCSA\u201999. Second IEEE Workshop on Mobile Computing Systems and Applications, pp. 90\u2013100 (1999)","key":"17_CR6","DOI":"10.1109\/MCSA.1999.749281"},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1109\/SURV.2011.061411.00019","volume":"13","author":"G Karagiannis","year":"2011","unstructured":"Karagiannis, G., et al.: Vehicular networking: a survey and tutorial on requirements, architectures, challenges, standards and solutions. IEEE Commun. Surv. Tutorials 13(4), 584\u2013616 (2011)","journal-title":"IEEE Commun. Surv. Tutorials"},{"issue":"5","key":"17_CR8","first-page":"605","volume":"46","author":"A Arora","year":"2004","unstructured":"Arora, A., et al.: A line in the sand: a wireless sensor networking for target detection, classification, and tracking. Comput. Netw. Special Issue Future Adv. Mil. Commun. Technol. 46(5), 605\u2013634 (2004)","journal-title":"Comput. Netw. Special Issue Future Adv. Mil. Commun. Technol."},{"issue":"6","key":"17_CR9","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovi\u0107, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Netw. 7(6), 609\u2013616 (2001)","journal-title":"Wireless Netw."},{"unstructured":"Liu, P.C., Geldmacher, R.C.: On the deletion of nonplanar edges of a graph. In: Proceedings of the 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp. 727\u2013738 (1979)","key":"17_CR10"},{"issue":"6","key":"17_CR11","first-page":"48","volume":"7","author":"P Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. J. Mobile Commun. Comput. Inf. 7(6), 48\u201355 (2001)","journal-title":"J. Mobile Commun. Comput. Inf."},{"doi-asserted-by":"crossref","unstructured":"Ruben Gabriel, K., Sokal, R.R.: A new statistical approach to geographic variation analysis. Syst. Biol. 18(3), 259\u2013278 (1969)","key":"17_CR12","DOI":"10.2307\/2412323"},{"doi-asserted-by":"crossref","unstructured":"Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of the Sixth Annual ACM\/IEEE International Conference on Mobille Computing and Networking (MobiCom), pp. 243\u2013254. ACM Press, August 2000","key":"17_CR13","DOI":"10.1145\/345910.345953"},{"doi-asserted-by":"crossref","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recogn. 12(4), 261\u2013268 (1980)","key":"17_CR14","DOI":"10.1016\/0031-3203(80)90066-7"},{"doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, pp. 63\u201372 (2003)","key":"17_CR15","DOI":"10.1145\/872035.872044"},{"issue":"5","key":"17_CR16","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.jpdc.2012.01.009","volume":"72","author":"T Clouser","year":"2012","unstructured":"Clouser, T., Miyashita, M., Nesterenko, M.: Concurrent face traversal for efficient geometric routing. J. Parall. Distrib. Comput. 72(5), 627\u2013636 (2012)","journal-title":"J. Parall. Distrib. Comput."},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM (JACM) 27(2), 228\u2013234 (1980)","journal-title":"J. ACM (JACM)"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.comcom.2015.10.002","volume":"78","author":"A S\u00e1nchez-Carmona","year":"2016","unstructured":"S\u00e1nchez-Carmona, A., Robles, S., Borrego, C.: Privhab+: a secure geographic routing protocol for DTN. Comput. Commun. 78, 56\u201373 (2016)","journal-title":"Comput. Commun."},{"doi-asserted-by":"crossref","unstructured":"Pathak, V., Yao, D., Iftode, L.: Securing location aware services over VANET using geographical secure path routing. In: 2008 IEEE International Conference on Vehicular Electronics and Safety, pp. 346\u2013353. IEEE (2008)","key":"17_CR20","DOI":"10.1109\/ICVES.2008.4640905"},{"doi-asserted-by":"crossref","unstructured":"Dolev, D., Raymond Strong, H.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","key":"17_CR21","DOI":"10.1137\/0212045"},{"issue":"2","key":"17_CR22","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2008.08.001","volume":"75","author":"J Katz","year":"2009","unstructured":"Katz, J., Koo, C.-Y.: On expected constant-round protocols for byzantine agreement. J. Comput. Syst. Sci. 75(2), 91\u2013112 (2009)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice (extended abstract) completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, pp. 27\u201330 (1983)","key":"17_CR23","DOI":"10.1145\/800221.806707"},{"issue":"4","key":"17_CR24","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P Feldman","year":"1997","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J. Comput. 26(4), 873\u2013933 (1997)","journal-title":"SIAM J. Comput."},{"unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, OSDI 1999, pp. 173\u2013186. USENIX Association, USA (1999)","key":"17_CR25"},{"issue":"1","key":"17_CR26","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D Dolev","year":"1982","unstructured":"Dolev, D.: The byzantine generals strike again. J. Algorithms 3(1), 14\u201330 (1982)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 1, 26\u201339 (1986)","key":"17_CR27","DOI":"10.1007\/BF01843568"},{"doi-asserted-by":"crossref","unstructured":"Adnan, A.I., Hanapi, Z.M., Othman, M., Zukarnain, Z.A.: A secure region-based geographic routing protocol (SRBGR) for wireless sensor networks. PloS ONE 12(1), e0170273 (2017)","key":"17_CR28","DOI":"10.1371\/journal.pone.0170273"},{"key":"17_CR29","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jnca.2016.12.028","volume":"80","author":"M Boulaiche","year":"2017","unstructured":"Boulaiche, M., Bouallouche-Medjkoune, L.: HSecGR: highly secure geographic routing. J. Netw. Comput. Appl. 80, 189\u2013199 (2017)","journal-title":"J. Netw. Comput. Appl."},{"issue":"2","key":"17_CR30","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TPDS.2014.2308190","volume":"26","author":"A Maurer","year":"2014","unstructured":"Maurer, A., Tixeuil, S.: Containing byzantine failures with control zones. IEEE Trans. Parallel Distrib. Syst. 26(2), 362\u2013370 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"doi-asserted-by":"crossref","unstructured":"Zahariadis, T., Trakadas, P., Leligou, H.C., Maniatis, S., Karkazis, P.: A novel trust-aware geographical routing scheme for wireless sensor networks. Wirel. Personal Commun. 69, 805\u2013826 (2013)","key":"17_CR31","DOI":"10.1007\/s11277-012-0613-7"},{"key":"17_CR32","first-page":"1","volume":"2010","author":"M Garc\u00eda-Otero","year":"2010","unstructured":"Garc\u00eda-Otero, M., et al.: Secure geographic routing in ad hoc and wireless sensor networks. EURASIP J. Wirel. Commun. Networking 2010, 1\u201312 (2010)","journal-title":"EURASIP J. Wirel. Commun. Networking"},{"doi-asserted-by":"crossref","unstructured":"Leinm\u00fcller, T., Maih\u00f6fer, C., Schoch, E., Kargl, F.: Improved security in geographic ad hoc routing through autonomous position verification. In: Proceedings of the 3rd International workshop on Vehicular Ad Hoc Networks, pp. 57\u201366 (2006)","key":"17_CR33","DOI":"10.1145\/1161064.1161075"},{"issue":"4","key":"17_CR34","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/TDSC.2006.57","volume":"3","author":"A Vora","year":"2006","unstructured":"Vora, A., Nesterenko, M.: Secure location verification using radio broadcast. IEEE Trans. Dependable Secure Comput. 3(4), 377\u2013385 (2006)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"doi-asserted-by":"publisher","unstructured":"Oglio, J., Hood, K., Sharma, G., Nesterenko, M.: Byzantine heoconsensus. In: Echihabi, K., Meyer, R. (eds.) Networked Systems, NETYS 2021, LNCS, vol. 12754, pp 19\u201335. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91014-3_2","key":"17_CR35","DOI":"10.1007\/978-3-030-91014-3_2"},{"key":"17_CR36","volume-title":"Using Braids for Byzantine Resistant Geographic Routing on Polyhedral Networks","author":"B Zaz","year":"2024","unstructured":"Zaz, B., Nesterenko, M.: Using Braids for Byzantine Resistant Geographic Routing on Polyhedral Networks. In Joint Mathematics Meet, San Francisco, USA (2024)"},{"doi-asserted-by":"crossref","unstructured":"Sanchez, J.A., Ruiz, P.M., Stojmenovic, I.: GMR: geographic multicast routing for wireless sensor networks. In: 3d IEEE Communication Society Conference on Sensors and Ad Hoc Communications and Networks (SeCon), pp. 20\u201329. IEEE, September 2006","key":"17_CR37","DOI":"10.1109\/SAHCN.2006.288405"},{"issue":"3","key":"17_CR38","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/961268.961288","volume":"7","author":"M Mauve","year":"2003","unstructured":"Mauve, M., F\u00fc\u00dfler, H., Widmer, J., Lang, T.: Position-based multicast routing for mobile ad-hoc networks. Mobile Comput. Commun. Rev. 7(3), 53\u201355 (2003)","journal-title":"Mobile Comput. Commun. Rev."},{"unstructured":"Wu, S., Candan, K.S.: GMP: distributed geographic multicast routing in wireless sensor networks. In: 26th IEEE International Conference on Distributed Computing Systems (26th ICDCS\u201906), p.\u00a049, Lisboa, Portugal, IEEE Computer Society, July 2006","key":"17_CR39"},{"doi-asserted-by":"crossref","unstructured":"Chen, K., Nahrstedt, K.: Effective location-guided tree construction algorithms for small group multicast in MANET. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM-02), volume\u00a03 of Proceedings IEEE INFOCOM 2002, pp. 1180\u20131189, Piscataway, NJ, USA, IEEE Computer Society, 23\u201327 June 2002","key":"17_CR40","DOI":"10.1109\/INFCOM.2002.1019368"},{"doi-asserted-by":"crossref","unstructured":"Adamek, J., Nesterenko, M., Robinson, J.S., Tixeuil, S.: Concurrent geometric multicasting. In: Proceedings of the 19th International Conference on Distributed Computing and Networking, pp. 1\u201310 (2018)","key":"17_CR41","DOI":"10.1145\/3154273.3154314"},{"doi-asserted-by":"crossref","unstructured":"Lian, J., Naik, K., Liu, Y., Chen, L.: Virtual surrounding face geocasting with guaranteed message delivery for ad hoc and sensor networks. In: Proceedings of the 2006 14th IEEE International Conference on Network Protocols, ICNP 2006, pp. 198\u2013207. IEEE (2006)","key":"17_CR42","DOI":"10.1109\/ICNP.2006.320213"},{"doi-asserted-by":"crossref","unstructured":"Adamek, J., Nesterenko, M., Robinson, J.S., Tixeuil, S.: Stateless reliable geocasting. In: 2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS), pp. 44\u201353. IEEE (2017)","key":"17_CR43","DOI":"10.1109\/SRDS.2017.13"},{"issue":"8","key":"17_CR44","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1016\/j.adhoc.2013.05.013","volume":"11","author":"T Clouser","year":"2013","unstructured":"Clouser, T., Vora, A., Fox, T., Nesterenko, M.: Void traversal for efficient non-planar geometric routing. Ad Hoc Netw. 11(8), 2345\u20132355 (2013)","journal-title":"Ad Hoc Netw."},{"doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad-hoc networks beyond unit disk graphs. In: Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing, pp. 69\u201378 (2003)","key":"17_CR45","DOI":"10.1145\/941079.941089"},{"unstructured":"Kim, Y.J., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: Proceedings of the 2nd Conference on Symposium on Networked Systems Design and Implementation, vol. 2, pp. 217\u2013230 (2005)","key":"17_CR46"},{"doi-asserted-by":"publisher","unstructured":"Driscoll, K., Hall, B., Sivencrona, H., Zumsteg, P.: Byzantine fault tolerance, from theory to reality. In: Anderson, S., Felici, M., Littlewood, B. (eds.) SAFECOMP 2003. LNCS, vol. 2788, pp. 235\u2013248. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39878-3_19","key":"17_CR47","DOI":"10.1007\/978-3-540-39878-3_19"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-67321-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T16:04:38Z","timestamp":1724515478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-67321-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031673207","9783031673214"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-67321-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/netys.net\/committees\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}